Benjamin_Loison/Proof_of_Space-Time_prototype
1
0
Fork 0
Code Issues 6 Pull Requests Packages Projects Releases 1 Wiki Activity

How do we treat Merkle tree not having 2^n leafs? #6

New Issue
Open
opened 2023-05-05 00:06:26 +02:00 by Benjamin_Loison · 0 comments
Benjamin_Loison commented 2023-05-05 00:06:26 +02:00
Owner
Copy Link
Copy Source

Maybe just add blank nodes like '0' * m.

Or maybe work with MMRs, as described in FlyClient: Super-Light Clients for Cryptocurrencies, by Benedikt B ̈unz1, Lucianna Kiffer and al.

Can just use Merkle tree up to the moment the nodes don't have two but a single child.

Maybe just add blank nodes like '0' * m. Or maybe work with MMRs, as described in [FlyClient: Super-Light Clients for Cryptocurrencies](https://eprint.iacr.org/2019/226.pdf), by Benedikt B ̈unz1, Lucianna Kiffer and al. Can just use Merkle tree up to the moment the nodes don't have two but a single child.
Benjamin_Loison added the left for future work label 2023-05-05 00:06:26 +02:00
Benjamin_Loison changed title from How do we treat Merkle tree no having 2^n leafs? to How do we treat Merkle tree not having 2^n leafs? 2023-05-12 01:10:35 +02:00
Sign in to join this conversation.
No Branch/Tag Specified
Branches Tags
Labels
Clear labels
left for future work
Could be interesting for the prototype but it's secondary.
No labels left for future work
Milestone
No items
No Milestone
Projects
Clear projects
No projects
Assignees
Clear assignees
Benjamin_Loison (Benjamin Loison)
No Assignees
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: Benjamin_Loison/Proof_of_Space-Time_prototype#6