Skip to content

Conversation

@gballet
Copy link
Member

@gballet gballet commented Dec 16, 2021

In the case of a stateless sync, a client must be able to work on a stateless verkle tree, and calculate its root commitment. It remains an open question whether there is a use case for building a proof from a stateless tree. It is possible, because in order to be usable, the tree needs to contain enough information to be updatable. This PR is a first attempt at implementing this.

Currently, GetCommitmentAlongPath does not return enough information to be able to provide a proof - siblings that are not in the map, are not returned. This is not currently possible, because StatelessNode does not support "collapsed" or "hashed" nodes.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants