-
-
Notifications
You must be signed in to change notification settings - Fork 18
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.
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
extend key length from 64 to 160 bit in sparse merkle tree implementation #194
Comments
Issue Status: 1. Open 2. Started 3. Submitted 4. Done This issue now has a funding of 150.0 DAI (150.0 USD @ $1.0/DAI) attached to it as part of the leapdao fund.
|
Issue Status: 1. Open 2. Started 3. Submitted 4. Done Workers have applied to start work. These users each claimed they can complete the work by 1 week, 6 days from now. 1) roleengineer has applied to start work (Funders only: approve worker | reject worker). I'm actively dive into Solidity, so think it would be good experience to me to solve this issue. I'm familiar with such data structure as binary tree, but implemented it with Python. I need one day to understand if I can do it. So, I will add a comment, and if more suitable candidates wouldn't express interest, you can approve me. Learn more on the Gitcoin Issue Details page. |
Issue Status: 1. Open 2. Started 3. Submitted 4. Done Work has been started. These users each claimed they can complete the work by 2 years, 9 months ago. 1) roleengineer has been approved to start work. I'm actively dive into Solidity, so think it would be good experience to me to solve this issue. I'm familiar with such data structure as binary tree, but implemented it with Python. I need one day to understand if I can do it. So, I will add a comment, and if more suitable candidates wouldn't express interest, you can approve me. Learn more on the Gitcoin Issue Details page. |
@roleengineer 👋 |
@johannbarbie I want to work on this if this gets available in the future. Please tag me if the bounty status becomes Thanks. |
I'm ending researching stage and starting to code. I will add WIP PR within 2-3days. |
@pbteja1998 thanks for the interest. will do. also will tag in in similar bonties |
@roleengineer Hello from Gitcoin Core - are you still working on this issue? Please submit a WIP PR or comment back within the next 3 days or you will be removed from this ticket and it will be returned to an ‘Open’ status. Please let us know if you have questions!
Funders only: Snooze warnings for 1 day | 3 days | 5 days | 10 days | 100 days |
hi @roleengineer - frank from gitcoin here - any progress on that WIP PR? |
Issue Status: 1. Open 2. Started 3. Submitted 4. Done @roleengineer due to inactivity, we have escalated this issue to Gitcoin's moderation team. Let us know if you believe this has been done in error!
Funders only: Snooze warnings for 1 day | 3 days | 5 days | 10 days | 100 days |
Hi @frankchen07 Yes, I'll add this WIP PR today. I had unexpectable problem, my laptop broke and it's on repaire now (I wrote Johann about this situation via Slack). I took another laptop today and after setting up necessary environment, I'll make it. |
@roleengineer any way i can help? |
@roleengineer good job with adding additional unit tests here: the idea is that we can review it, and then merge into master. |
Issue Status: 1. Open 2. Started 3. Submitted 4. Done Work for 150.0 DAI (150.0 USD @ $1.0/DAI) has been submitted by: @johannbarbie please take a look at the submitted work:
|
⚡️ A tip worth 60.00000 DAI (60.0 USD @ $1.0/DAI) has been granted to @roleengineer for this issue from @johannbarbie. ⚡️ Nice work @roleengineer! Your tip has automatically been deposited in the ETH address we have on file.
|
Issue Status: 1. Open 2. Started 3. Submitted 4. Done The funding of 150.0 DAI (150.0 USD @ $1.0/DAI) attached to this issue has been approved & issued to @roleengineer. Additional Tips for this Bounty:
|
resolved in #201 |
Bounty
A sparse Merkle tree (SMT) is a data structure useful for storing a key/value map which works as follows. An empty SMT is simply a Merkle tree with 2^256 leaves, where every leaf is a zero value. Because every element at the second level of the tree is the same z2=hash(0, 0), and every element at the third level is the same z3=hash(z2, z2) and so forth this can be trivially computed in 256 hashes. From there, we can add or remove values by modifying values in place in the sparse Merkle tree, eg. to add the value 42 at position 3, we modify the second value the second level to v2=hash(0, 42), the first value at the third level to v3=hash(0, v2), the first value at the fourth level to v2=hash(v3, z3) (since at this point, the left subtree represents keys 0…3 and the right subtree represents keys 4…7 which are still all empty), and so forth up to the top. source
Scope
Deliverables
Gain for the project
Roles
bounty gardener: @johannbarbie / 10%
bounty worker: @roleengineer / 75%
bounty reviewer: @johannbarbie / 15%
The text was updated successfully, but these errors were encountered: