vacp2p
/
research
mirror of https://github.com/vacp2p/research.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

adds the formal definition

This commit is contained in:
Sanaz 2021-01-12 18:04:21 -08:00
parent b131589a6c
commit 9b1de5931e
No known key found for this signature in database
GPG Key ID: 0B5ACFC518E67998
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
rln-research/merkle-tree-update.md
View File

@ -18,6 +18,13 @@ For the sake of privacy and anonymity, peers need to update their authentication
An immediate solution for this is to store the entire tree at each peer, which is not storage efficient and does not fit for the resource constrained peers. An immediate solution for this is to store the entire tree at each peer, which is not storage efficient and does not fit for the resource constrained peers.
# Formal Problem Definition
We are seeking a solution in which a peer can perform the following operations by keeping the minimum number of tree nodes
- recalculate the root after a member insertion
- recalculate the root after a member deletion
- recalculcate an aithentication path for a given leaf index after an insertion
- recalculcate an aithentication path for a given leaf index after a deletion
# Solution Overview # Solution Overview