Properly handle left/rightBranchesAreEmpty with custom ordering

cosmos · Feb 27, 2022 · 143288f · 143288f
1 parent fb04c7f
commit 143288f
Showing 1 changed file with 4 additions and 2 deletions.
diff --git a/go/proof.go b/go/proof.go
@@ -348,7 +348,8 @@ func leftBranchesAreEmpty(spec *InnerSpec, op *InnerOp) bool {
 		return false
 	}
 	for i := 0; i < leftBranches; i++ {
-		from := actualPrefix + i*int(spec.ChildSize)
+		idx := getPosition(spec.ChildOrder, int32(i))
+		from := actualPrefix + idx*int(spec.ChildSize)
 		if !bytes.Equal(spec.EmptyChild, op.Prefix[from:from+int(spec.ChildSize)]) {
 			return false
 		}
@@ -373,7 +374,8 @@ func rightBranchesAreEmpty(spec *InnerSpec, op *InnerOp) bool {
 		return false // sanity check
 	}
 	for i := 0; i < rightBranches; i++ {
-		from := i * int(spec.ChildSize)
+		idx := getPosition(spec.ChildOrder, int32(i))
+		from := idx * int(spec.ChildSize)
 		if !bytes.Equal(spec.EmptyChild, op.Suffix[from:from+int(spec.ChildSize)]) {
 			return false
 		}