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

WIP: Swapless transform #349

Draft
wants to merge 14 commits into
base: master
Choose a base branch
from
Draft

WIP: Swapless transform #349

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
14 commits
Select commit Hold shift + click to select a range
9ae57ca
Saving what I have so I can push to github
kcalvinalvin Mar 18, 2022
d1bf58c
Little better transform
kcalvinalvin Mar 18, 2022
e17b7ca
I think it's working but need to write more tests
kcalvinalvin Mar 23, 2022
5c5109b
Save more work. Wow I'm gonna have fun splitting these up into separate
kcalvinalvin Mar 24, 2022
1229f81
Add forest swapless modify test
kcalvinalvin Mar 27, 2022
a412b40
ModifySwapless seems to be working now. Test on testnet
kcalvinalvin Apr 1, 2022
3e161b3
Save the new rise calculation algo
kcalvinalvin Apr 1, 2022
37512fb
add comment
kcalvinalvin Apr 1, 2022
6aa72a6
add even more comments
kcalvinalvin Apr 1, 2022
024b2cb
Actual hashing still needs work but the calcDirtyPos is actually working
kcalvinalvin Apr 2, 2022
b693068
Add test to check that the hashes are correct. Everything seems to be
kcalvinalvin Apr 4, 2022
fddc0fe
Pollard swapless
kcalvinalvin Apr 10, 2022
ab0c5a5
swapless pollard
kcalvinalvin Apr 11, 2022
9baa410
More swapless
kcalvinalvin Apr 18, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
791 changes: 791 additions & 0 deletions accumulator/forest.go
View file
Open in desktop

Large diffs are not rendered by default.

1,278 changes: 1,277 additions & 1 deletion accumulator/forest_test.go
View file
Open in desktop

Large diffs are not rendered by default.

23 changes: 14 additions & 9 deletions accumulator/forestproofs.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -160,15 +160,15 @@ func (f *Forest) ProveBatch(hs []Hash) (BatchProof, error) {
return bp, fmt.Errorf("hash %x not found", wanted)
}

// should never happen
if pos > f.numLeaves {
for m, p := range f.positionMap {
fmt.Printf("%x @%d\t", m[:4], p)
}
return bp, fmt.Errorf(
"ProveBatch: got leaf position %d but only %d leaves exist",
pos, f.numLeaves)
}
//// should never happen
//if pos > f.numLeaves {
// for m, p := range f.positionMap {
// fmt.Printf("%x @%d\t", m[:4], p)
// }
// return bp, fmt.Errorf(
// "ProveBatch: got leaf position %d but only %d leaves exist",
// pos, f.numLeaves)
//}
bp.Targets[i] = pos
}
// targets need to be sorted because the proof hashes are sorted
Expand All @@ -188,6 +188,11 @@ func (f *Forest) ProveBatch(hs []Hash) (BatchProof, error) {
bp.Proof = make([]Hash, len(proofPositions.list))
for i, proofPos := range proofPositions.list {
bp.Proof[i] = f.data.read(proofPos)

if bp.Proof[i] == empty {
return bp, fmt.Errorf("Read empty for position %d",
proofPos)
}
}

if verbose {
Expand Down
Loading