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
181
182
183
184
185
186
|
// Copyright (C) 2019-2024 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 (
"fmt"
"os"
"reflect"
"strings"
"testing"
"github.com/stretchr/testify/require"
"github.com/algorand/go-algorand/crypto"
"github.com/algorand/go-algorand/test/partitiontest"
)
// make sure that ToBeHashed function returns a specific length
// If this test breaks we need to make sure to update the SNARK prover and verifier as well.
func TestCoinFixedLengthHash(t *testing.T) {
partitiontest.PartitionTest(t)
a := require.New(t)
var sigcom = make(crypto.GenericDigest, HashSize)
var partcom = make(crypto.GenericDigest, HashSize)
var data MessageHash
crypto.RandBytes(sigcom[:])
crypto.RandBytes(partcom[:])
crypto.RandBytes(data[:])
choice := coinChoiceSeed{
partCommitment: partcom,
lnProvenWeight: 454197,
sigCommitment: sigcom,
signedWeight: 1 << 10,
data: data,
}
e := reflect.ValueOf(choice)
a.Equal(6, e.NumField())
rep := crypto.HashRep(&choice)
a.Equal(180, len(rep))
}
func TestHashCoin(t *testing.T) {
partitiontest.PartitionTest(t)
var slots [32]uint64
var sigcom = make(crypto.GenericDigest, HashSize)
var partcom = make(crypto.GenericDigest, HashSize)
var msgHash MessageHash
crypto.RandBytes(sigcom[:])
crypto.RandBytes(partcom[:])
crypto.RandBytes(msgHash[:])
choice := coinChoiceSeed{
signedWeight: uint64(len(slots)),
sigCommitment: sigcom,
partCommitment: partcom,
data: msgHash,
}
coinHash := makeCoinGenerator(&choice)
for j := uint64(0); j < 1000; j++ {
coin := coinHash.getNextCoin()
if coin >= uint64(len(slots)) {
t.Errorf("hashCoin out of bounds")
}
slots[coin]++
}
for i, count := range slots {
if count < 3 {
t.Errorf("slot %d too low: %d", i, count)
}
if count > 100 {
t.Errorf("slot %d too high: %d", i, count)
}
}
}
func BenchmarkHashCoin(b *testing.B) {
var sigcom = make(crypto.GenericDigest, HashSize)
var partcom = make(crypto.GenericDigest, HashSize)
var msgHash MessageHash
crypto.RandBytes(sigcom[:])
crypto.RandBytes(partcom[:])
crypto.RandBytes(msgHash[:])
choice := coinChoiceSeed{
signedWeight: 1025,
sigCommitment: sigcom,
partCommitment: partcom,
data: msgHash,
}
coinHash := makeCoinGenerator(&choice)
for i := 0; i < b.N; i++ {
coinHash.getNextCoin()
}
}
func BenchmarkHashCoinGenerate(b *testing.B) {
var sigcom = make(crypto.GenericDigest, HashSize)
var partcom = make(crypto.GenericDigest, HashSize)
var msgHash MessageHash
crypto.RandBytes(sigcom[:])
crypto.RandBytes(partcom[:])
crypto.RandBytes(msgHash[:])
choice := coinChoiceSeed{
signedWeight: 1025,
sigCommitment: sigcom,
partCommitment: partcom,
data: msgHash,
}
for i := 0; i < b.N; i++ {
makeCoinGenerator(&choice)
}
}
func TestGenerateCoinHashKATs(t *testing.T) {
partitiontest.PartitionTest(t)
// This test produces MSS samples for the SNARK verifier.
// it will only run explicitly by:
//
// GEN_KATS=x go test -v . -run=GenerateKat -count=1
if os.Getenv("GEN_KATS") == "" {
t.Skip("Skipping; GEN_KATS not set")
}
const numReveals = 1000
const signedWt = 1 << 10
var coinslots [numReveals]uint64
var sigcom = make(crypto.GenericDigest, HashSize)
var partcom = make(crypto.GenericDigest, HashSize)
var data MessageHash
crypto.RandBytes(sigcom[:])
crypto.RandBytes(partcom[:])
crypto.RandBytes(data[:])
choice := coinChoiceSeed{
partCommitment: partcom,
lnProvenWeight: 454197,
sigCommitment: sigcom,
signedWeight: signedWt,
data: data,
}
coinHash := makeCoinGenerator(&choice)
for j := uint64(0); j < numReveals; j++ {
coinslots[j] = coinHash.getNextCoin()
}
fmt.Printf("signedWeight: %v \n", signedWt)
fmt.Printf("number of reveals: %v \n", numReveals)
concatString := fmt.Sprint(coinslots)
toPrint := strings.Join(strings.Split(concatString, " "), ", ")
fmt.Printf("coinvalues: %v \n", toPrint)
concatString = fmt.Sprint(crypto.HashRep(&choice))
toPrint = strings.Join(strings.Split(concatString, " "), ", ")
fmt.Printf("seed: %v \n", toPrint)
}
|
