1,231 karma · joined May 27, 2013
[ my public key: https://keybase.io/tommyv; my proof: https://keybase.io/tommyv/sigs/5iSpz18mhGRCuuY9rj_F8cBvIJwchhZmJ-GJuiaJKt8 ]
This also explains why merging is not included (it is simply not needed for this application).
I did an SQL-on-blockchain a while ago [2][3] and ran into this problem as well. I solved it by not committing the last N transactions, and re-executing them for each read query in a transaction. This obviously is not a very efficient solution (and still runs the risk of having to re-execute the whole chain of queries in case a chain split occurs further than N blocks before the current head).
[1] https://github.com/aergoio/aergo [2] https://catena.one [3] https://github.com/pixelspark/catena
* Mentour Pilot (explains the job of a pilot) https://www.youtube.com/channel/UCwpHKudUkP5tNgmMdexB3ow
* Wendover Productions (shows interesting facts in a simple way, aviation/geopolitics related mostly) https://www.youtube.com/user/Wendoverproductions
Well you can always choose to roll your own layout algorithm and position everything in the DOM using absolute coordinates - e.g. https://diasli.de implements an 'auto layout' mechanism disregarding DOM layout.
/usr/libexec/firmwarecheckers/ethcheck/ethcheck:
usage: ethcheck: [ --save -b <eth nvram bin output file> ] [ --integrity-check [ -b <eth nvram bin input file> ] ] [ --show-hashes [ -b <eth nvram bin input file> ] ] [ --cleanup -b <eth nvram bin input/output file> [ --send-change-in-firmware enable/disable] [ --version]