Oh,yes thank you
This is on the same track I'm thinking of, and it is still work under progress so it is seems fruitful to work on it.
.
& It is built on Utreexo ( written that you have to install Utreexo first) ; I was thinking of replacing Utreexo forest with something like a Verkle Tree, but I mean it is for stateless clients as they depend on the Utreexo stateless server
Topic: Are there newer Stateless Bitcoin designs than Utreexo? (Read 53 times)
There's the STARK based ZeroSync [1] which allows you to verify the entire bitcoin history upto some point in a single proof [2]. Still in a somewhat experimental state...
[1] https://zerosync.org/
[2] https://github.com/ZeroSync/ZeroSync
[1] https://zerosync.org/
[2] https://github.com/ZeroSync/ZeroSync
Stateless clients in general are something between Full nodes and SPVs or light nodes
They do not store the full system status, but still they verify every TX in the block with the help of a stateless server that sends them proofs.
Utreexo, and other previous designs like Red-black trees by Andrew Miller originally introduced in this group back in 2012 I think, they all send proofs O(log n) by storing some form of a Merkle Tree
.
Now, when I started learning Zero Knowledge Proofs, I'm wondering if there's something like Ethereum Verkle Trees have been implemented on Bitcoin
(a stateless design that gets Constant size proofs { instead of O(log n)} using a Zero Knowledge scheme called KZG that treats data as polynomial coefficients)
.
I'm just exploring what's new in the area before seriously working on the idea
.
Thanks
They do not store the full system status, but still they verify every TX in the block with the help of a stateless server that sends them proofs.
Utreexo, and other previous designs like Red-black trees by Andrew Miller originally introduced in this group back in 2012 I think, they all send proofs O(log n) by storing some form of a Merkle Tree
.
Now, when I started learning Zero Knowledge Proofs, I'm wondering if there's something like Ethereum Verkle Trees have been implemented on Bitcoin
(a stateless design that gets Constant size proofs { instead of O(log n)} using a Zero Knowledge scheme called KZG that treats data as polynomial coefficients)
.
I'm just exploring what's new in the area before seriously working on the idea
.
Thanks
Jump to: