-
Notifications
You must be signed in to change notification settings - Fork 151
/
test_vector_utils.go
196 lines (164 loc) · 4.83 KB
/
test_vector_utils.go
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
187
188
189
190
191
192
193
194
195
196
// Copyright 2020 Consensys Software Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Code generated by consensys/gnark-crypto DO NOT EDIT
package test_vector_utils
import (
"fmt"
"github.com/consensys/gnark-crypto/internal/generator/test_vector_utils/small_rational"
"github.com/consensys/gnark-crypto/internal/generator/test_vector_utils/small_rational/polynomial"
"hash"
"reflect"
)
func ToElement(i int64) *small_rational.SmallRational {
var res small_rational.SmallRational
res.SetInt64(i)
return &res
}
type HashDescription map[string]interface{}
func HashFromDescription(d HashDescription) (hash.Hash, error) {
if _type, ok := d["type"]; ok {
switch _type {
case "const":
startState := int64(d["val"].(float64))
return &MessageCounter{startState: startState, step: 0, state: startState}, nil
default:
return nil, fmt.Errorf("unknown fake hash type \"%s\"", _type)
}
}
return nil, fmt.Errorf("hash description missing type")
}
type MessageCounter struct {
startState int64
state int64
step int64
}
func (m *MessageCounter) Write(p []byte) (n int, err error) {
inputBlockSize := (len(p)-1)/small_rational.Bytes + 1
m.state += int64(inputBlockSize) * m.step
return len(p), nil
}
func (m *MessageCounter) Sum(b []byte) []byte {
inputBlockSize := (len(b)-1)/small_rational.Bytes + 1
resI := m.state + int64(inputBlockSize)*m.step
var res small_rational.SmallRational
res.SetInt64(int64(resI))
resBytes := res.Bytes()
return resBytes[:]
}
func (m *MessageCounter) Reset() {
m.state = m.startState
}
func (m *MessageCounter) Size() int {
return small_rational.Bytes
}
func (m *MessageCounter) BlockSize() int {
return small_rational.Bytes
}
func NewMessageCounter(startState, step int) hash.Hash {
transcript := &MessageCounter{startState: int64(startState), state: int64(startState), step: int64(step)}
return transcript
}
func NewMessageCounterGenerator(startState, step int) func() hash.Hash {
return func() hash.Hash {
return NewMessageCounter(startState, step)
}
}
type ListHash []small_rational.SmallRational
func (h *ListHash) Write(p []byte) (n int, err error) {
return len(p), nil
}
func (h *ListHash) Sum(b []byte) []byte {
res := (*h)[0].Bytes()
*h = (*h)[1:]
return res[:]
}
func (h *ListHash) Reset() {
}
func (h *ListHash) Size() int {
return small_rational.Bytes
}
func (h *ListHash) BlockSize() int {
return small_rational.Bytes
}
func SliceToElementSlice[T any](slice []T) ([]small_rational.SmallRational, error) {
elementSlice := make([]small_rational.SmallRational, len(slice))
for i, v := range slice {
if _, err := elementSlice[i].SetInterface(v); err != nil {
return nil, err
}
}
return elementSlice, nil
}
func SliceEquals(a []small_rational.SmallRational, b []small_rational.SmallRational) error {
if len(a) != len(b) {
return fmt.Errorf("length mismatch %d≠%d", len(a), len(b))
}
for i := range a {
if !a[i].Equal(&b[i]) {
return fmt.Errorf("at index %d: %s ≠ %s", i, a[i].String(), b[i].String())
}
}
return nil
}
func SliceSliceEquals(a [][]small_rational.SmallRational, b [][]small_rational.SmallRational) error {
if len(a) != len(b) {
return fmt.Errorf("length mismatch %d≠%d", len(a), len(b))
}
for i := range a {
if err := SliceEquals(a[i], b[i]); err != nil {
return fmt.Errorf("at index %d: %w", i, err)
}
}
return nil
}
func PolynomialSliceEquals(a []polynomial.Polynomial, b []polynomial.Polynomial) error {
if len(a) != len(b) {
return fmt.Errorf("length mismatch %d≠%d", len(a), len(b))
}
for i := range a {
if err := SliceEquals(a[i], b[i]); err != nil {
return fmt.Errorf("at index %d: %w", i, err)
}
}
return nil
}
func ElementToInterface(x *small_rational.SmallRational) interface{} {
if i := x.BigInt(nil); i != nil {
return i
}
return x.Text(10)
}
func ElementSliceToInterfaceSlice(x interface{}) []interface{} {
if x == nil {
return nil
}
X := reflect.ValueOf(x)
res := make([]interface{}, X.Len())
for i := range res {
xI := X.Index(i).Interface().(small_rational.SmallRational)
res[i] = ElementToInterface(&xI)
}
return res
}
func ElementSliceSliceToInterfaceSliceSlice(x interface{}) [][]interface{} {
if x == nil {
return nil
}
X := reflect.ValueOf(x)
res := make([][]interface{}, X.Len())
for i := range res {
res[i] = ElementSliceToInterfaceSlice(X.Index(i).Interface())
}
return res
}