Skip to content

Instantly share code, notes, and snippets.

View njam's full-sized avatar

Reto Kaiser njam

View GitHub Profile
Q: How big is the blockchain today?
A: 415'000 blocks, 70 Gigabytes.
Q: Where is the blockchain stored?
A: On all the nodes participating in the Bitcoin p2p network.
Implicit consensus is achieved by all nodes following the same rules (and incentives).
Q: What kind of encryption is Bitcoin using?
A: none (rather hashing and signing).
<?xml version="1.0" encoding="utf-8"?>
<CityModel xmlns="http://www.opengis.net/citygml/2.0"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xmlns:xAL="urn:oasis:names:tc:ciq:xsdschema:xAL:2.0"
xmlns:xlink="http://www.w3.org/1999/xlink"
xmlns:gml="http://www.opengis.net/gml"
xmlns:bldg="http://www.opengis.net/citygml/building/2.0"
xmlns:wtr="http://www.opengis.net/citygml/waterbody/2.0"
xmlns:veg="http://www.opengis.net/citygml/vegetation/2.0"
xmlns:dem="http://www.opengis.net/citygml/relief/2.0"
package main
func printDiff(suppressedKinds []string, kind string, context int, before, after string, to io.Writer) {
diffs := difflib.Diff(strings.Split(before, "\n"), strings.Split(after, "\n"))
for _, ckind := range suppressedKinds {
if ckind == kind {
str := fmt.Sprintf("+ Changes suppressed on sensitive content of type %s\n", kind)
fmt.Fprintf(to, ansi.Color(str, "yellow"))
return

Keybase proof

I hereby claim:

  • I am njam on github.
  • I am njam (https://keybase.io/njam) on keybase.
  • I have a public key ASC-YBOm7q4wL-uRQU9id9E7Z4dRkDiF8Dqn1q5gL6341Ao

To claim this, I am signing this object: