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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
// Copyright (c) Tailscale Inc & contributors
// SPDX-License-Identifier: BSD-3-Clause
package key
import (
"bufio"
"bytes"
"encoding/json"
"io"
"strings"
"testing"
)
func TestNodeKey(t *testing.T) {
k := NewNode()
if k.IsZero() {
t.Fatal("NodePrivate should not be zero")
}
p := k.Public()
if p.IsZero() {
t.Fatal("NodePublic should not be zero")
}
bs, err := p.MarshalText()
if err != nil {
t.Fatal(err)
}
if full, got := string(bs), ":"+p.UntypedHexString(); !strings.HasSuffix(full, got) {
t.Fatalf("NodePublic.UntypedHexString is not a suffix of the typed serialization, got %q want suffix of %q", got, full)
}
bs, err = p.MarshalBinary()
if err != nil {
t.Fatal(err)
}
if got, want := bs, append([]byte(nodePublicBinaryPrefix), p.k[:]...); !bytes.Equal(got, want) {
t.Fatalf("Binary-encoded NodePublic = %x, want %x", got, want)
}
var decoded NodePublic
if err := decoded.UnmarshalBinary(bs); err != nil {
t.Fatalf("NodePublic.UnmarshalBinary(%x) failed: %v", bs, err)
}
if decoded != p {
t.Errorf("unmarshaled and original NodePublic differ:\noriginal = %v\ndecoded = %v", p, decoded)
}
z := NodePublic{}
if !z.IsZero() {
t.Fatal("IsZero(NodePublic{}) is false")
}
if s := z.ShortString(); s != "" {
t.Fatalf("NodePublic{}.ShortString() is %q, want \"\"", s)
}
}
func TestNodeSerialization(t *testing.T) {
serialized := `{
"Priv": "privkey:40ab1b58e9076c7a4d9d07291f5edf9d1aa017eb949624ba683317f48a640369",
"Pub":"nodekey:50d20b455ecf12bc453f83c2cfdb2a24925d06cf2598dcaa54e91af82ce9f765"
}`
// Carefully check that the expected serialized data decodes and
// re-encodes to the expected keys. These types are serialized to
// disk all over the place and need to be stable.
priv := NodePrivate{
k: [32]uint8{
0x40, 0xab, 0x1b, 0x58, 0xe9, 0x7, 0x6c, 0x7a, 0x4d, 0x9d, 0x7,
0x29, 0x1f, 0x5e, 0xdf, 0x9d, 0x1a, 0xa0, 0x17, 0xeb, 0x94,
0x96, 0x24, 0xba, 0x68, 0x33, 0x17, 0xf4, 0x8a, 0x64, 0x3, 0x69,
},
}
pub := NodePublic{
k: [32]uint8{
0x50, 0xd2, 0xb, 0x45, 0x5e, 0xcf, 0x12, 0xbc, 0x45, 0x3f, 0x83,
0xc2, 0xcf, 0xdb, 0x2a, 0x24, 0x92, 0x5d, 0x6, 0xcf, 0x25, 0x98,
0xdc, 0xaa, 0x54, 0xe9, 0x1a, 0xf8, 0x2c, 0xe9, 0xf7, 0x65,
},
}
type keypair struct {
Priv NodePrivate
Pub NodePublic
}
var a keypair
if err := json.Unmarshal([]byte(serialized), &a); err != nil {
t.Fatal(err)
}
if !a.Priv.Equal(priv) {
t.Errorf("wrong deserialization of private key, got %#v want %#v", a.Priv, priv)
}
if a.Pub != pub {
t.Errorf("wrong deserialization of public key, got %#v want %#v", a.Pub, pub)
}
bs, err := json.MarshalIndent(a, "", " ")
if err != nil {
t.Fatal(err)
}
var b bytes.Buffer
json.Indent(&b, []byte(serialized), "", " ")
if got, want := string(bs), b.String(); got != want {
t.Error("json serialization doesn't roundtrip")
}
}
func TestNodeReadRawWithoutAllocating(t *testing.T) {
buf := make([]byte, 32)
for i := range buf {
buf[i] = 0x42
}
r := bytes.NewReader(buf)
br := bufio.NewReader(r)
got := testing.AllocsPerRun(1000, func() {
r.Reset(buf)
br.Reset(r)
var k NodePublic
if err := k.ReadRawWithoutAllocating(br); err != nil {
t.Fatalf("ReadRawWithoutAllocating: %v", err)
}
})
if want := 0.0; got != want {
t.Fatalf("ReadRawWithoutAllocating got %f allocs, want %f", got, want)
}
}
func BenchmarkNodeReadRawWithoutAllocating(b *testing.B) {
buf := make([]byte, 32)
for i := range buf {
buf[i] = 0x42
}
r := bytes.NewReader(buf)
br := bufio.NewReader(r)
b.ReportAllocs()
for b.Loop() {
r.Reset(buf)
br.Reset(r)
var k NodePublic
if err := k.ReadRawWithoutAllocating(br); err != nil {
b.Fatal(err)
}
}
}
func TestNodeWriteRawWithoutAllocating(t *testing.T) {
var k NodePublic
for i := range k.k {
k.k[i] = byte(i)
}
// Test fast path (empty buffer, plenty of space).
t.Run("fast", func(t *testing.T) {
var buf bytes.Buffer
bw := bufio.NewWriter(&buf)
if err := k.WriteRawWithoutAllocating(bw); err != nil {
t.Fatalf("WriteRawWithoutAllocating: %v", err)
}
bw.Flush()
if got := buf.Bytes(); !bytes.Equal(got, k.k[:]) {
t.Errorf("wrote % 02x, want % 02x", got, k.k)
}
})
// Test slow path (buffer nearly full, less than 32 bytes available).
t.Run("slow", func(t *testing.T) {
var buf bytes.Buffer
const smallBuf = 40
bw := bufio.NewWriterSize(&buf, smallBuf)
// Fill buffer to leave less than 32 bytes available.
padding := make([]byte, smallBuf-len(k.k)+1)
if _, err := bw.Write(padding); err != nil {
t.Fatalf("Write padding: %v", err)
}
if err := k.WriteRawWithoutAllocating(bw); err != nil {
t.Fatalf("WriteRawWithoutAllocating: %v", err)
}
bw.Flush()
got := buf.Bytes()[len(padding):]
if !bytes.Equal(got, k.k[:]) {
t.Errorf("wrote % 02x, want % 02x", got, k.k)
}
})
// Verify zero allocations on fast path.
t.Run("allocs", func(t *testing.T) {
w := bytes.NewBuffer(make([]byte, 0, 32))
bw := bufio.NewWriter(w)
got := testing.AllocsPerRun(1000, func() {
w.Reset()
bw.Reset(w)
if err := k.WriteRawWithoutAllocating(bw); err != nil {
t.Fatalf("WriteRawWithoutAllocating: %v", err)
}
})
if got != 0 {
t.Fatalf("WriteRawWithoutAllocating allocs = %f, want 0", got)
}
})
}
func BenchmarkNodeWriteRawWithoutAllocating(b *testing.B) {
bw := bufio.NewWriter(io.Discard)
var k NodePublic
for i := range k.k {
k.k[i] = 0x42
}
b.ReportAllocs()
for b.Loop() {
if err := k.WriteRawWithoutAllocating(bw); err != nil {
b.Fatal(err)
}
}
}
func TestChallenge(t *testing.T) {
priv := NewChallenge()
pub := priv.Public()
txt, err := pub.MarshalText()
if err != nil {
t.Fatal(err)
}
var back ChallengePublic
if err := back.UnmarshalText(txt); err != nil {
t.Fatal(err)
}
if back != pub {
t.Errorf("didn't round trip: %v != %v", back, pub)
}
}
// Test that NodePublic.Shard is uniformly distributed.
func TestShard(t *testing.T) {
const N = 1_000
var shardCount [256]int
for range N {
shardCount[NewNode().Public().Shard()]++
}
e := float64(N) / 256 // expected
var x2 float64 // chi-squared
for _, c := range shardCount {
r := float64(c) - e // residual
x2 += r * r / e
}
t.Logf("x^2 = %v", x2)
if x2 > 512 { // really want x^2 =~ (256 - 1), but leave slop
t.Errorf("too much variation in shard distribution")
for i, c := range shardCount {
rj := float64(c) - e
t.Logf("shard[%v] = %v (off by %v)", i, c, rj)
}
}
}
|
