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
|
package state
import (
"context"
"crypto"
"crypto/ed25519"
"fmt"
"sync"
"time"
"git.sigsum.org/log-go/pkg/client"
"git.sigsum.org/log-go/pkg/db"
"git.sigsum.org/sigsum-go/pkg/log"
//"git.sigsum.org/sigsum-go/pkg/requests"
"git.sigsum.org/sigsum-go/pkg/types"
)
// StateManagerSingle implements a single-instance StateManager for primary nodes
type StateManagerSingle struct {
client db.Client
signer crypto.Signer
namespace types.Hash
interval time.Duration
deadline time.Duration
secondary *client.Client
// Lock-protected access to pointers. A write lock is only obtained once
// per interval when doing pointer rotation. All endpoints are readers.
sync.RWMutex
signedTreeHead *types.SignedTreeHead
cosignedTreeHead *types.CosignedTreeHead
// Syncronized and deduplicated witness cosignatures for signedTreeHead
events chan *event
cosignatures map[types.Hash]*types.Signature
}
func NewStateManagerSingle(dbcli db.Client, signer crypto.Signer, interval, deadline time.Duration, securl string, secpk types.PublicKey) (*StateManagerSingle, error) {
sm := &StateManagerSingle{
client: dbcli,
signer: signer,
namespace: *types.HashFn(signer.Public().(ed25519.PublicKey)),
interval: interval,
deadline: deadline,
secondary: client.NewClient(securl, secpk),
}
sth, err := sm.latestSTH(context.Background())
sm.setCosignedTreeHead()
sm.setToCosignTreeHead(sth)
return sm, err
}
func (sm *StateManagerSingle) Run(ctx context.Context) {
rotation := func() {
nextSTH, err := sm.latestSTH(ctx)
if err != nil {
log.Warning("cannot rotate without tree head: %v", err)
return
}
sm.rotate(nextSTH)
}
sm.events = make(chan *event, 4096)
defer close(sm.events)
ticker := time.NewTicker(sm.interval)
defer ticker.Stop()
rotation()
for {
select {
case <-ticker.C:
rotation()
case ev := <-sm.events:
sm.handleEvent(ev)
case <-ctx.Done():
return
}
}
}
func (sm *StateManagerSingle) ToCosignTreeHead(_ context.Context) (*types.SignedTreeHead, error) {
sm.RLock()
defer sm.RUnlock()
return sm.signedTreeHead, nil
}
func (sm *StateManagerSingle) CosignedTreeHead(_ context.Context) (*types.CosignedTreeHead, error) {
sm.RLock()
defer sm.RUnlock()
if sm.cosignedTreeHead == nil {
return nil, fmt.Errorf("no cosignatures available")
}
return sm.cosignedTreeHead, nil
}
func (sm *StateManagerSingle) AddCosignature(ctx context.Context, pub *types.PublicKey, sig *types.Signature) error {
sm.RLock()
defer sm.RUnlock()
msg := sm.signedTreeHead.TreeHead.ToBinary(&sm.namespace)
if !ed25519.Verify(ed25519.PublicKey(pub[:]), msg, sig[:]) {
return fmt.Errorf("invalid cosignature")
}
select {
case sm.events <- &event{types.HashFn(pub[:]), sig}:
return nil
case <-ctx.Done():
return fmt.Errorf("request timeout")
}
}
func (sm *StateManagerSingle) rotate(nextSTH *types.SignedTreeHead) {
sm.Lock()
defer sm.Unlock()
log.Debug("rotating tree heads")
sm.handleEvents()
sm.setCosignedTreeHead()
sm.setToCosignTreeHead(nextSTH)
}
func (sm *StateManagerSingle) handleEvents() {
log.Debug("handling any outstanding events")
for i, n := 0, len(sm.events); i < n; i++ {
sm.handleEvent(<-sm.events)
}
}
func (sm *StateManagerSingle) handleEvent(ev *event) {
log.Debug("handling event from witness %x", ev.keyHash[:])
sm.cosignatures[*ev.keyHash] = ev.cosignature
}
func (sm *StateManagerSingle) setCosignedTreeHead() {
n := len(sm.cosignatures)
if n == 0 {
sm.cosignedTreeHead = nil
return
}
var cth types.CosignedTreeHead
cth.SignedTreeHead = *sm.signedTreeHead
cth.Cosignature = make([]types.Signature, 0, n)
cth.KeyHash = make([]types.Hash, 0, n)
for keyHash, cosignature := range sm.cosignatures {
cth.KeyHash = append(cth.KeyHash, keyHash)
cth.Cosignature = append(cth.Cosignature, *cosignature)
}
sm.cosignedTreeHead = &cth
}
func (sm *StateManagerSingle) setToCosignTreeHead(nextSTH *types.SignedTreeHead) {
sm.cosignatures = make(map[types.Hash]*types.Signature)
sm.signedTreeHead = nextSTH
}
func (sm *StateManagerSingle) latestSTH(ctx context.Context) (*types.SignedTreeHead, error) {
ictx, cancel := context.WithTimeout(ctx, sm.deadline)
defer cancel()
th, err := sm.client.GetTreeHead(ictx)
if err != nil {
return nil, fmt.Errorf("failed fetching tree head: %v", err)
}
//pth, err := choseTree(ctx, sm.deadline, sm.secondary, th)
pth, err := th, nil // DEBUG
if err != nil {
return nil, fmt.Errorf("failed chosing tree head: %v", err)
}
sth, err := pth.Sign(sm.signer, &sm.namespace)
if err != nil {
return nil, fmt.Errorf("failed signing tree head: %v", err)
}
return sth, nil
}
func choseTree(ctx context.Context, deadline time.Duration, secondary *client.Client, th *types.TreeHead) (*types.TreeHead, error) {
// TODO: handle multiple secondaries and not just one
if !secondary.Configured {
return th, nil
}
sctx, cancel := context.WithTimeout(ctx, deadline) // FIXME: use a separate timeout value for secondaries?
defer cancel()
secsth, err := secondary.GetCurrentTreeHead(sctx)
if err != nil {
return nil, fmt.Errorf("failed getting the latest tree head from all secondaries: %v", err)
}
if secsth.TreeSize < th.TreeSize {
// We're stuck at secsth.size so let's verify
// consistency since secsth and sign that
// TODO: get and verify consinstency proof
// req := &requests.ConsistencyProof{
// OldSize: secsth.TreeSize,
// NewSize: th.TreeSize,
// }
// proof, err := sm.client.GetConsistencyProof(ctx, req)
// if err != nil {
// return nil, fmt.Errorf("unable to get consistency proof from %d to %d: %v", req.OldSize, req.NewSize, err)
// }
// if !proof.Verify() {
// return nil, fmt.Errorf("invalid consistency proof from %d to %d", req.OldSize, req.NewSize)
// }
th = &secsth.TreeHead // FIXME: need to copy?
}
return th, nil
}
|
