Skip to content

Fix bug in inclusion proof tests #255

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

Merged
phbnf merged 1 commit into from
Jul 23, 2026
Merged

Fix bug in inclusion proof tests #255

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
12 changes: 6 additions & 6 deletions proof/proof_test.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -600,16 +600,16 @@ func TestSubtreeConsistency(t *testing.T) {

func TestInclusionSucceedsUpToTreeSize(t *testing.T) {
const maxSize = uint64(555)
for ts := uint64(1); ts <= maxSize; ts++ {
for i := ts; i < ts; i++ {
for ts := range maxSize + 1 {
for i := range ts {
if _, err := Inclusion(i, ts); err != nil {
t.Errorf("Inclusion(ts:%d, i:%d) = %v", ts, i, err)
}
}
}
}

func TestInclusionSubtreeSucceedsUpToTreeSize(t *testing.T) {
func TestSubtreeInclusionSucceedsUpToTreeSize(t *testing.T) {
const maxSize = uint64(555)
for sbe := uint64(1); sbe <= maxSize; sbe++ {
for sbs := range sbe {
Expand Down Expand Up @@ -824,9 +824,9 @@ func inclusion(t *testing.T, index, size uint64) Nodes {

func TestFindSubtrees(t *testing.T) {
for _, tc := range []struct {
start, end uint64
wantStart, wantMid, wantEnd uint64
wantErr bool
start, end uint64
wantStart, wantMid, wantEnd uint64
wantErr bool
}{
// Single entry subtrees:
{start: 0, end: 1, wantStart: 0, wantMid: 1, wantEnd: 1},
Expand Down
Loading