PApaouvrard·Oct 30, 2018Submission
Optimized Sparse Merkle Tree for blockchain state authentication
2 points · Open discussionaergoio
aergo
Go2018–2018
aergoio / aergo
aergo
aergo blockchain kernel
2Distinct people
2Mentions
0Explicit recommenders
217GitHub stars
What to know before exploring
What it is
aergo blockchain kernel
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by week2 dated mentions
Observed mentions: 2018-08-29 12:49:07 UTC to 2018-10-30 06:29:13 UTC. Weeks start Monday, UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Aug 27 | 2018-08-27 00:00:00 UTC | 2018-09-03 00:00:00 UTC | 1 | 0 | 1 |
| Sep 3 | 2018-09-03 00:00:00 UTC | 2018-09-10 00:00:00 UTC | 0 | 0 | 0 |
| Sep 10 | 2018-09-10 00:00:00 UTC | 2018-09-17 00:00:00 UTC | 0 | 0 | 0 |
| Sep 17 | 2018-09-17 00:00:00 UTC | 2018-09-24 00:00:00 UTC | 0 | 0 | 0 |
| Sep 24 | 2018-09-24 00:00:00 UTC | 2018-10-01 00:00:00 UTC | 0 | 0 | 0 |
| Oct 1 | 2018-10-01 00:00:00 UTC | 2018-10-08 00:00:00 UTC | 0 | 0 | 0 |
| Oct 8 | 2018-10-08 00:00:00 UTC | 2018-10-15 00:00:00 UTC | 0 | 0 | 0 |
| Oct 15 | 2018-10-15 00:00:00 UTC | 2018-10-22 00:00:00 UTC | 0 | 0 | 0 |
| Oct 22 | 2018-10-22 00:00:00 UTC | 2018-10-29 00:00:00 UTC | 0 | 0 | 0 |
| Oct 29 | 2018-10-29 00:00:00 UTC | 2018-11-05 00:00:00 UTC | 1 | 1 | 0 |
What Hacker News says
2 sourcesThis is apparently intended to be used for a blockchain that contains SQL transactions in the blocks [1]. As there can be multiple 'heads' of a blockchain (before the network settles on a longest chain), there is a chance the head you picked as being the currently 'longest chain' eventually will not be on the longest chain at all. Hence you'd need the ability to go back to a point in time and execute the queries for another head, should it become the longest one.
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-ex
Read the rest
ecute 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