Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Use specific sparse tree? #168

Open
liamsi opened this issue Mar 1, 2017 · 1 comment
Open

Use specific sparse tree? #168

liamsi opened this issue Mar 1, 2017 · 1 comment
Labels
question tree

Comments

@liamsi
Copy link
Member

liamsi commented Mar 1, 2017 •
edited
Loading

See for instance Efficient Sparse Merkle Trees: Caching Strategies and Secure (Non-)Membership Proofs (code) and also https://github.com/google/keytransparency/blob/572241795a0fb58d0ff595c67406152f9f67c8de/core/tree/tree.go#L25

Discuss potential redesign of current tree.
@liamsi liamsi added the tree label Mar 1, 2017
@liamsi liamsi changed the title Use a sparse tree instead? Use specific sparse tree? Mar 1, 2017
@vqhuy vqhuy added the question label Mar 2, 2017
@vqhuy vqhuy modified the milestone: Backlog Apr 12, 2017
@vqhuy
Copy link
Member

vqhuy commented May 22, 2017 •
edited
Loading

One issue with our current tree design is we cannot support concurrency tree's insertions, which decreases our server scalability.
(see https://github.com/coniks-sys/coniks-go/blob/master/keyserver/listener.go#L130-L142)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
question tree
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@vqhuy @liamsi