microsoft / microsoft/merklecpp
Iterative rather than recursive traversal
Open
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 91
- Forks
- 24
- Avg merge
- 2d 20h
- Merged PRs (30d)
- 9
Description
Back of the napkin math says that we might overflow the stack on reasonable inputs (albeit bigger than anything we've seen in practise).
So it is reasonable that we should transform traversal operations from the recursive style to an iterative style.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by locating the recursive traversal operations in the C++ Merkle tree library and determine which inputs could exhaust the stack. Map the traversal behavior before changing it; done means the relevant operations use iterative traversal while preserving existing tree creation and manipulation behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- cryptography
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100