liftedinit / liftedinit/many-rs

Merk: Proof Tree Algebra to Simplify Code

Open
#310 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
Rust
Stars
6
Forks
11
PR merge metrics
No merged PRs in 30d

Description

Right now, in the merk module, there is no algebra for Merkle tree proofs. Having an algebra that would allow for proofs to be algebraically combined would be convenient and simplify how we collect keys and generate proofs throughout the various endpoints in many-rs.

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reading the merk module and tracing the many-rs endpoints that collect keys and generate proofs. Define the proof algebra's intended combinations and verify that those endpoints can use it consistently; done means proofs can be algebraically combined and proof generation is simplified across the affected endpoints.

Written by the indexing model from the issue text.

Assessment

Tech stack
rust
Domain
cryptography
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.