[HN Gopher] Halo and more: exploring incremental verification an...
___________________________________________________________________
Halo and more: exploring incremental verification and SNARKs
without pairings
Author : abecedarius
Score : 33 points
Date : 2021-11-05 15:20 UTC (7 hours ago)
(HTM) web link (vitalik.ca)
(TXT) w3m dump (vitalik.ca)
| chc4 wrote:
| All of the math goes over my head, frankly, but one of the
| cryptocurrencies I'm interested in is implementing something
| similar to this afaik (https://minaprotocol.com/). They have a
| recursive zkSNARK scheme for constant sized proofs of their
| entire blockchain, so you only ever need to store around 22kb(!)
| to verify transactions. It sounds like very useful technology,
| instead of blockchain ledgers only ever increasing in size over
| time and making full nodes harder to run.
| dane-pgp wrote:
| I see that their article[1] about the size of their blockchain
| uses "kb" and "kB" almost interchangeably, but, for the record,
| they mean "kilobytes" (i.e. 22000 bytes).
|
| That's still an impressively small number, of course, and it is
| below what I'll call the Watson-Gates Limit of 3200 kB, which
| is the amount of data apocryphally needed by all the computers
| in the world.
|
| [1] https://minaprotocol.com/blog/22kb-sized-blockchain-a-
| techni...
| syzygyhack wrote:
| Think all this does is push the problem to the edge. Someone
| still has to run archival nodes to store all the state so that
| the nice fancy zk proofs actually have real data for
| verification. Supporting light or stateless clients isn't a
| problem for pretty much any reasonable blockchain network.
___________________________________________________________________
(page generated 2021-11-05 23:02 UTC)