Iterative rather than recursive traversal
Nobody has claimed this yet.
Assessment
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Newbie friendliness
- 35/100
- Issue type
- Refactor
- Clarity
- Needs clarification
- Activity status
- Quiet
- Tech stack
- cpp
- Domain
- cryptography
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.
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.
- Dominant language
- C++
- Stars
- 91
- Forks
- 24
- Avg merge
- 2d 20h
- Merged PRs (30d)
- 9
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.
Similar issues
-
enhancement
Difficulty 1/5 Under an hour Newbie friendliness 88/100
QuantStack/git2cpp#187 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 86/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 84/100
mlcommons/mobile_app_open#1182 ·
-
Needs-Triage
Difficulty 2/5 1-3 hours Newbie friendliness 78/100
microsoft/winget-cli#6547 ·
-
Difficulty 1/5 Under an hour Newbie friendliness 90/100
AXERA-TECH/ax-llm#77 ·