Hacker News Reader

Comment by ntoshev | Hacker News Reader

Every user might verify just a random sample of all calculations and the system would still work.

Three approaches to blockchain scalability were discussed:

    1. jury selection
    2. multichains
    3. hypercube

1. Jury Selection means that tx-s validated first by a small jury and only if there no consensus, theie entire network become involved.

2. Multichains is like sharding. And just like in sharding you need to decided on criteria for sharding (i.e. you shard by asset ID, geography of the sender or receiver, by the amount transferred, etc.)

3. Hypercube - you see every tx as an edge in the hypercube. Then this edges randomly assigned to the jury? I'm not fully understand this one.

It would be convenient if there was a data structure that could store the set of unspent transactions as a sparse tree, and easily add/remove transactions without knowing the full tree. Perhaps as a merkle tree. There might be something more efficient.

I think that if this has was included in each block, then a user of bitcoin could download the block headers starting from their last known-good block. Then download the structure containing the transaction set from a recent block (6-10 blocks back, perhaps) to prevent having invalid blocks with good proof of work at the end, as those wouldn't be built upon by other miners. Then download the transactions from the blocks after the one you have the transaction set from and only verify those blocks.

Reply on news.ycombinator.com