1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
// Copyright (C) 2019-2023 Algorand, Inc.
// This file is part of go-algorand
//
// go-algorand is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// go-algorand is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with go-algorand. If not, see <https://www.gnu.org/licenses/>.
package stateproof
import (
"testing"
"github.com/stretchr/testify/require"
"github.com/algorand/go-algorand/crypto"
"github.com/algorand/go-algorand/crypto/merklesignature"
"github.com/algorand/go-algorand/test/partitiontest"
)
func TestVerifyRevelForEachPosition(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
p := generateProofForTesting(a, false)
sProof := p.sp
verifier, err := MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.NoError(err)
for i := uint64(0); i < p.numberOfParticipnets; i++ {
_, ok := sProof.Reveals[i]
if !ok {
sProof.PositionsToReveal[0] = i
break
}
}
verifier, err = MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.ErrorIs(err, ErrNoRevealInPos)
}
// TestVerifyWrongCoinSlot this test makes sure that the verifier uses PositionsToReveal array, and opens reveals in a specific order
// In order to and trick the verifier we need to swap two positions in the PositionsToReveal so the coins will not match.
func TestVerifyWrongCoinSlot(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
p := generateProofForTesting(a, false)
sProof := p.sp
verifier, err := MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.NoError(err)
// we need to find a reveal that will not match the first coin.
// In order to accomplish that we will extract the first coin and find a reveals ( > 1, since index 0 will satisfy the verifier)
// that doesn't match
coinAt0 := sProof.PositionsToReveal[0]
choice := coinChoiceSeed{
partCommitment: verifier.participantsCommitment,
lnProvenWeight: verifier.lnProvenWeight,
sigCommitment: sProof.SigCommit,
signedWeight: sProof.SignedWeight,
data: p.data,
}
coinHash := makeCoinGenerator(&choice)
coin := coinHash.getNextCoin()
j := 1
for ; j < len(sProof.PositionsToReveal); j++ {
reveal := sProof.Reveals[sProof.PositionsToReveal[j]]
if !(reveal.SigSlot.L <= coin && coin < reveal.SigSlot.L+reveal.Part.Weight) {
break
}
}
sProof.PositionsToReveal[0] = sProof.PositionsToReveal[j]
sProof.PositionsToReveal[j] = coinAt0
verifier, err = MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.ErrorIs(err, ErrCoinNotInRange)
}
func TestVerifyBadSignature(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
p := generateProofForTesting(a, false)
sProof := p.sp
verifier, err := MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.NoError(err)
key := generateTestSigner(0, uint64(stateProofIntervalForTests)*20+1, stateProofIntervalForTests, a)
signerInRound := key.GetSigner(stateProofIntervalForTests)
newSig, err := signerInRound.SignBytes([]byte{0x1, 0x2})
a.NoError(err)
rev := sProof.Reveals[0]
rev.SigSlot.Sig = newSig
sProof.Reveals[0] = rev
verifier, err = MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.ErrorIs(err, merklesignature.ErrSignatureSchemeVerificationFailed)
}
func TestVerifyZeroProvenWeight(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
partcommit := crypto.GenericDigest{}
_, err := MkVerifier(partcommit, 0, stateProofStrengthTargetForTests)
a.ErrorIs(err, ErrIllegalInputForLnApprox)
}
func TestEqualVerifiers(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
p := generateProofForTesting(a, false)
sProof := p.sp
verifier, err := MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
err = verifier.Verify(stateProofIntervalForTests, p.data, &sProof)
a.NoError(err)
lnProvenWeight, err := LnIntApproximation(p.provenWeight)
verifierLnP := MkVerifierWithLnProvenWeight(p.partCommitment, lnProvenWeight, stateProofStrengthTargetForTests)
a.Equal(verifierLnP, verifier)
}
func TestTreeDepth(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
p := generateProofForTesting(a, false)
sProof := p.sp
verifier, err := MkVerifier(p.partCommitment, p.provenWeight, stateProofStrengthTargetForTests)
a.NoError(err)
tmp := sProof.PartProofs.TreeDepth
sProof.PartProofs.TreeDepth = MaxTreeDepth + 1
a.ErrorIs(verifier.Verify(stateProofIntervalForTests, p.data, &sProof), ErrTreeDepthTooLarge)
sProof.PartProofs.TreeDepth = tmp
tmp = sProof.SigProofs.TreeDepth
sProof.SigProofs.TreeDepth = MaxTreeDepth + 1
a.ErrorIs(verifier.Verify(stateProofIntervalForTests, p.data, &sProof), ErrTreeDepthTooLarge)
sProof.SigProofs.TreeDepth = tmp
a.NoError(verifier.Verify(stateProofIntervalForTests, p.data, &sProof))
}
|
