package store import ( "bytes" "encoding/binary" "fmt" "math/big" "sort" "github.com/cockroachdb/pebble" "github.com/iden3/go-iden3-crypto/poseidon" "github.com/pkg/errors" "go.uber.org/zap" "google.golang.org/protobuf/proto" "source.quilibrium.com/quilibrium/monorepo/node/protobufs" "source.quilibrium.com/quilibrium/monorepo/node/tries" ) type ClockStore interface { NewTransaction() (Transaction, error) GetLatestMasterClockFrame(filter []byte) (*protobufs.ClockFrame, error) GetEarliestMasterClockFrame(filter []byte) (*protobufs.ClockFrame, error) GetMasterClockFrame( filter []byte, frameNumber uint64, ) (*protobufs.ClockFrame, error) RangeMasterClockFrames( filter []byte, startFrameNumber uint64, endFrameNumber uint64, ) (*PebbleMasterClockIterator, error) PutMasterClockFrame(frame *protobufs.ClockFrame, txn Transaction) error GetLatestDataClockFrame( filter []byte, proverTrie *tries.RollingFrecencyCritbitTrie, ) (*protobufs.ClockFrame, error) GetLatestCandidateDataClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) GetEarliestDataClockFrame(filter []byte) (*protobufs.ClockFrame, error) GetDataClockFrame( filter []byte, frameNumber uint64, ) (*protobufs.ClockFrame, *tries.RollingFrecencyCritbitTrie, error) RangeDataClockFrames( filter []byte, startFrameNumber uint64, endFrameNumber uint64, ) (*PebbleClockIterator, error) PutDataClockFrame( frame *protobufs.ClockFrame, proverTrie *tries.RollingFrecencyCritbitTrie, txn Transaction, backfill bool, ) error PutCandidateDataClockFrame( parentSelector []byte, distance []byte, selector []byte, frame *protobufs.ClockFrame, txn Transaction, ) error GetCandidateDataClockFrames( filter []byte, frameNumber uint64, ) ([]*protobufs.ClockFrame, error) GetParentDataClockFrame( filter []byte, frameNumber uint64, parentSelector []byte, ) (*protobufs.ClockFrame, error) RangeCandidateDataClockFrames( filter []byte, parent []byte, frameNumber uint64, ) (*PebbleCandidateClockIterator, error) GetLeadingCandidateDataClockFrame( filter []byte, parent []byte, frameNumber uint64, ) (*protobufs.ClockFrame, error) Deduplicate(filter []byte) error GetCompressedDataClockFrames( filter []byte, fromFrameNumber uint64, toFrameNumber uint64, ) (*protobufs.CeremonyCompressedSync, error) SetLatestDataClockFrameNumber( filter []byte, frameNumber uint64, ) error DeleteCandidateDataClockFrameRange( filter []byte, fromFrameNumber uint64, toFrameNumber uint64, ) error GetHighestCandidateDataClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) } type PebbleClockStore struct { db KVDB logger *zap.Logger } var _ ClockStore = (*PebbleClockStore)(nil) type PebbleMasterClockIterator struct { i Iterator } type PebbleClockIterator struct { i Iterator db *PebbleClockStore } type PebbleCandidateClockIterator struct { i Iterator db *PebbleClockStore } var _ TypedIterator[*protobufs.ClockFrame] = (*PebbleMasterClockIterator)(nil) var _ TypedIterator[*protobufs.ClockFrame] = (*PebbleClockIterator)(nil) var _ TypedIterator[*protobufs.ClockFrame] = (*PebbleCandidateClockIterator)(nil) func (p *PebbleMasterClockIterator) First() bool { return p.i.First() } func (p *PebbleMasterClockIterator) Next() bool { return p.i.Next() } func (p *PebbleMasterClockIterator) Valid() bool { return p.i.Valid() } func (p *PebbleMasterClockIterator) Value() (*protobufs.ClockFrame, error) { if !p.i.Valid() { return nil, ErrNotFound } key := p.i.Key() value := p.i.Value() frame := &protobufs.ClockFrame{} frameNumber, filter, err := extractFrameNumberAndFilterFromMasterFrameKey(key) if err != nil { return nil, errors.Wrap(err, "get master clock frame iterator value") } frame.FrameNumber = frameNumber frame.Filter = make([]byte, len(filter)) copy(frame.Filter, filter) if len(value) < 521 { return nil, errors.Wrap( ErrInvalidData, "get master clock frame iterator value", ) } copied := make([]byte, len(value)) copy(copied, value) frame.Difficulty = binary.BigEndian.Uint32(copied[:4]) frame.Input = copied[4 : len(copied)-516] frame.Output = copied[len(copied)-516:] previousSelectorBytes := [516]byte{} copy(previousSelectorBytes[:], frame.Input[:516]) parent, err := poseidon.HashBytes(previousSelectorBytes[:]) if err != nil { return nil, errors.Wrap(err, "get master clock frame iterator value") } frame.ParentSelector = parent.FillBytes(make([]byte, 32)) return frame, nil } func (p *PebbleMasterClockIterator) Close() error { return errors.Wrap(p.i.Close(), "closing master clock iterator") } func (p *PebbleClockIterator) First() bool { return p.i.First() } func (p *PebbleClockIterator) Next() bool { return p.i.Next() } func (p *PebbleClockIterator) Prev() bool { return p.i.Prev() } func (p *PebbleClockIterator) Valid() bool { return p.i.Valid() } func (p *PebbleClockIterator) TruncatedValue() ( *protobufs.ClockFrame, error, ) { if !p.i.Valid() { return nil, ErrNotFound } value := p.i.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get candidate clock frame iterator value", ) } return frame, nil } func (p *PebbleClockIterator) Value() (*protobufs.ClockFrame, error) { if !p.i.Valid() { return nil, ErrNotFound } value := p.i.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get clock frame iterator value", ) } if err := p.db.fillAggregateProofs(frame); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get clock frame iterator value", ) } return frame, nil } func (p *PebbleClockIterator) Close() error { return errors.Wrap(p.i.Close(), "closing clock frame iterator") } func (p *PebbleCandidateClockIterator) First() bool { return p.i.First() } func (p *PebbleCandidateClockIterator) Next() bool { return p.i.Next() } func (p *PebbleCandidateClockIterator) Valid() bool { return p.i.Valid() } func (p *PebbleCandidateClockIterator) TruncatedValue() ( *protobufs.ClockFrame, error, ) { if !p.i.Valid() { return nil, ErrNotFound } value := p.i.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get candidate clock frame iterator value", ) } return frame, nil } func (p *PebbleCandidateClockIterator) Value() (*protobufs.ClockFrame, error) { if !p.i.Valid() { return nil, ErrNotFound } value := p.i.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get candidate clock frame iterator value", ) } if err := p.db.fillAggregateProofs(frame); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get clock frame iterator value", ) } return frame, nil } func (p *PebbleCandidateClockIterator) Close() error { return errors.Wrap(p.i.Close(), "closing candidate clock frame iterator") } func NewPebbleClockStore(db KVDB, logger *zap.Logger) *PebbleClockStore { return &PebbleClockStore{ db, logger, } } const CLOCK_FRAME = 0x00 const CLOCK_MASTER_FRAME_DATA = 0x00 const CLOCK_DATA_FRAME_DATA = 0x01 const CLOCK_DATA_FRAME_CANDIDATE_DATA = 0x02 const CLOCK_DATA_FRAME_FRECENCY_DATA = 0x03 const CLOCK_MASTER_FRAME_INDEX_EARLIEST = 0x10 | CLOCK_MASTER_FRAME_DATA const CLOCK_MASTER_FRAME_INDEX_LATEST = 0x20 | CLOCK_MASTER_FRAME_DATA const CLOCK_MASTER_FRAME_INDEX_PARENT = 0x30 | CLOCK_MASTER_FRAME_DATA const CLOCK_DATA_FRAME_INDEX_EARLIEST = 0x10 | CLOCK_DATA_FRAME_DATA const CLOCK_DATA_FRAME_INDEX_LATEST = 0x20 | CLOCK_DATA_FRAME_DATA const CLOCK_DATA_FRAME_INDEX_PARENT = 0x30 | CLOCK_DATA_FRAME_DATA const CLOCK_DATA_FRAME_CANDIDATE_INDEX_LATEST = 0x20 | CLOCK_DATA_FRAME_CANDIDATE_DATA // // DB Keys // // Keys are structured as: // [] // Increment necessarily must be full width – elsewise the frame number would // easily produce conflicts if filters are stepped by byte: // 0x01 || 0xffff == 0x01ff || 0xff // // Master frames are serialized as output data only, Data frames are raw // protobufs for fast disk-to-network output. func clockFrameKey(filter []byte, frameNumber uint64, frameType byte) []byte { key := []byte{CLOCK_FRAME, frameType} key = binary.BigEndian.AppendUint64(key, frameNumber) key = append(key, filter...) return key } func clockMasterFrameKey(filter []byte, frameNumber uint64) []byte { return clockFrameKey(filter, frameNumber, CLOCK_MASTER_FRAME_DATA) } func extractFrameNumberAndFilterFromMasterFrameKey( key []byte, ) (uint64, []byte, error) { if len(key) < 11 { return 0, nil, errors.Wrap( ErrInvalidData, "extract frame number and filter from master frame key", ) } copied := make([]byte, len(key)) copy(copied, key) return binary.BigEndian.Uint64(copied[2:10]), copied[10:], nil } func clockDataFrameKey( filter []byte, frameNumber uint64, ) []byte { return clockFrameKey(filter, frameNumber, CLOCK_DATA_FRAME_DATA) } func clockLatestIndex(filter []byte, frameType byte) []byte { key := []byte{CLOCK_FRAME, frameType} key = append(key, filter...) return key } func clockMasterLatestIndex(filter []byte) []byte { return clockLatestIndex(filter, CLOCK_MASTER_FRAME_INDEX_LATEST) } func clockDataLatestIndex(filter []byte) []byte { return clockLatestIndex(filter, CLOCK_DATA_FRAME_INDEX_LATEST) } func clockDataCandidateLatestIndex(filter []byte) []byte { return clockLatestIndex(filter, CLOCK_DATA_FRAME_CANDIDATE_INDEX_LATEST) } func clockEarliestIndex(filter []byte, frameType byte) []byte { key := []byte{CLOCK_FRAME, frameType} key = append(key, filter...) return key } func clockMasterEarliestIndex(filter []byte) []byte { return clockEarliestIndex(filter, CLOCK_MASTER_FRAME_INDEX_EARLIEST) } func clockDataEarliestIndex(filter []byte) []byte { return clockEarliestIndex(filter, CLOCK_DATA_FRAME_INDEX_EARLIEST) } func clockParentIndexKey( filter []byte, frameNumber uint64, selector []byte, frameType byte, ) []byte { key := []byte{CLOCK_FRAME, frameType} key = binary.BigEndian.AppendUint64(key, frameNumber) key = append(key, filter...) key = append(key, rightAlign(selector, 32)...) return key } func clockDataParentIndexKey( filter []byte, frameNumber uint64, selector []byte, ) []byte { return clockParentIndexKey( filter, frameNumber, rightAlign(selector, 32), CLOCK_DATA_FRAME_INDEX_PARENT, ) } func clockDataCandidateFrameKey( filter []byte, frameNumber uint64, parent []byte, distance []byte, ) []byte { key := []byte{CLOCK_FRAME, CLOCK_DATA_FRAME_CANDIDATE_DATA} key = binary.BigEndian.AppendUint64(key, frameNumber) key = append(key, filter...) key = append(key, rightAlign(parent, 32)...) key = append(key, rightAlign(distance, 32)...) return key } func clockProverTrieKey(filter []byte, frameNumber uint64) []byte { key := []byte{CLOCK_FRAME, CLOCK_DATA_FRAME_FRECENCY_DATA} key = binary.BigEndian.AppendUint64(key, frameNumber) key = append(key, filter...) return key } func (p *PebbleClockStore) NewTransaction() (Transaction, error) { return p.db.NewBatch(), nil } // GetEarliestMasterClockFrame implements ClockStore. func (p *PebbleClockStore) GetEarliestMasterClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) { idxValue, closer, err := p.db.Get(clockMasterEarliestIndex(filter)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get earliest master clock frame") } defer closer.Close() frameNumber := binary.BigEndian.Uint64(idxValue) frame, err := p.GetMasterClockFrame(filter, frameNumber) if err != nil { return nil, errors.Wrap(err, "get earliest master clock frame") } return frame, nil } // GetLatestMasterClockFrame implements ClockStore. func (p *PebbleClockStore) GetLatestMasterClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) { idxValue, closer, err := p.db.Get(clockMasterLatestIndex(filter)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get latest master clock frame") } defer closer.Close() frameNumber := binary.BigEndian.Uint64(idxValue) frame, err := p.GetMasterClockFrame(filter, frameNumber) if err != nil { return nil, errors.Wrap(err, "get latest master clock frame") } return frame, nil } // GetMasterClockFrame implements ClockStore. func (p *PebbleClockStore) GetMasterClockFrame( filter []byte, frameNumber uint64, ) (*protobufs.ClockFrame, error) { value, closer, err := p.db.Get(clockMasterFrameKey(filter, frameNumber)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get master clock frame") } copied := make([]byte, len(value)) copy(copied[:], value[:]) defer closer.Close() frame := &protobufs.ClockFrame{} frame.FrameNumber = frameNumber frame.Filter = filter frame.Difficulty = binary.BigEndian.Uint32(copied[:4]) frame.Input = copied[4 : len(copied)-516] frame.Output = copied[len(copied)-516:] previousSelectorBytes := [516]byte{} copy(previousSelectorBytes[:], frame.Input[:516]) parent, err := poseidon.HashBytes(previousSelectorBytes[:]) if err != nil { return nil, errors.Wrap(err, "get master clock frame") } frame.ParentSelector = parent.FillBytes(make([]byte, 32)) return frame, nil } // RangeMasterClockFrames implements ClockStore. func (p *PebbleClockStore) RangeMasterClockFrames( filter []byte, startFrameNumber uint64, endFrameNumber uint64, ) (*PebbleMasterClockIterator, error) { if startFrameNumber > endFrameNumber { temp := endFrameNumber endFrameNumber = startFrameNumber startFrameNumber = temp } iter, err := p.db.NewIter( clockMasterFrameKey(filter, startFrameNumber), clockMasterFrameKey(filter, endFrameNumber), ) if err != nil { return nil, errors.Wrap(err, "range master clock frames") } return &PebbleMasterClockIterator{i: iter}, nil } // PutMasterClockFrame implements ClockStore. func (p *PebbleClockStore) PutMasterClockFrame( frame *protobufs.ClockFrame, txn Transaction, ) error { data := binary.BigEndian.AppendUint32([]byte{}, frame.Difficulty) data = append(data, frame.Input...) data = append(data, frame.Output...) frameNumberBytes := make([]byte, 8) binary.BigEndian.PutUint64(frameNumberBytes, frame.FrameNumber) if err := txn.Set( clockMasterFrameKey(frame.Filter, frame.FrameNumber), data, ); err != nil { return errors.Wrap(err, "put master clock frame") } _, closer, err := p.db.Get(clockMasterEarliestIndex(frame.Filter)) if err != nil { if !errors.Is(err, pebble.ErrNotFound) { return errors.Wrap(err, "put master clock frame") } if err = txn.Set( clockMasterEarliestIndex(frame.Filter), frameNumberBytes, ); err != nil { return errors.Wrap(err, "put master clock frame") } } if err == nil && closer != nil { closer.Close() } if err = txn.Set( clockMasterLatestIndex(frame.Filter), frameNumberBytes, ); err != nil { return errors.Wrap(err, "put master clock frame") } return nil } // GetDataClockFrame implements ClockStore. func (p *PebbleClockStore) GetDataClockFrame( filter []byte, frameNumber uint64, ) (*protobufs.ClockFrame, *tries.RollingFrecencyCritbitTrie, error) { value, closer, err := p.db.Get(clockDataFrameKey(filter, frameNumber)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, nil, ErrNotFound } return nil, nil, errors.Wrap(err, "get data clock frame") } defer closer.Close() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get data clock frame", ) } if err = p.fillAggregateProofs(frame); err != nil { return nil, nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get data clock frame", ) } proverTrie := &tries.RollingFrecencyCritbitTrie{} trieData, closer, err := p.db.Get(clockProverTrieKey(filter, frameNumber)) if err != nil { return nil, nil, errors.Wrap(err, "get latest data clock frame") } defer closer.Close() if err := proverTrie.Deserialize(trieData); err != nil { return nil, nil, errors.Wrap(err, "get latest data clock frame") } return frame, proverTrie, nil } func (p *PebbleClockStore) fillAggregateProofs( frame *protobufs.ClockFrame, ) error { if frame.FrameNumber == 0 { return nil } for i := 0; i < len(frame.Input[516:])/74; i++ { commit := frame.Input[516+(i*74) : 516+((i+1)*74)] ap, err := internalGetAggregateProof( p.db, frame.Filter, commit, frame.FrameNumber, func(typeUrl string, data [][]byte) ([]byte, error) { if typeUrl == protobufs.IntrinsicExecutionOutputType { o := &protobufs.IntrinsicExecutionOutput{} copiedLeft := make([]byte, len(data[0])) copiedRight := make([]byte, len(data[1])) copy(copiedLeft, data[0]) copy(copiedRight, data[1]) o.Address = copiedLeft[:32] o.Output = copiedLeft[32:] o.Proof = copiedRight return proto.Marshal(o) } copied := make([]byte, len(data[0])) copy(copied, data[0]) return copied, nil }, ) if err != nil { return err } frame.AggregateProofs = append(frame.AggregateProofs, ap) } return nil } func (p *PebbleClockStore) saveAggregateProofs( txn Transaction, frame *protobufs.ClockFrame, ) error { shouldClose := false if txn == nil { var err error txn, err = p.NewTransaction() if err != nil { return err } shouldClose = true } for i := 0; i < len(frame.Input[516:])/74; i++ { commit := frame.Input[516+(i*74) : 516+((i+1)*74)] err := internalPutAggregateProof( p.db, txn, frame.AggregateProofs[i], commit, func(typeUrl string, data []byte) ([][]byte, error) { if typeUrl == protobufs.IntrinsicExecutionOutputType { o := &protobufs.IntrinsicExecutionOutput{} if err := proto.Unmarshal(data, o); err != nil { return nil, err } leftBits := append([]byte{}, o.Address...) leftBits = append(leftBits, o.Output...) rightBits := o.Proof return [][]byte{leftBits, rightBits}, nil } return [][]byte{data}, nil }) if err != nil { if err = txn.Abort(); err != nil { return err } } } if shouldClose { txn.Commit() } return nil } // GetEarliestDataClockFrame implements ClockStore. func (p *PebbleClockStore) GetEarliestDataClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) { idxValue, closer, err := p.db.Get(clockDataEarliestIndex(filter)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get earliest data clock frame") } defer closer.Close() frameNumber := binary.BigEndian.Uint64(idxValue) frame, _, err := p.GetDataClockFrame(filter, frameNumber) if err != nil { return nil, errors.Wrap(err, "get earliest data clock frame") } return frame, nil } // GetLatestDataClockFrame implements ClockStore. func (p *PebbleClockStore) GetLatestDataClockFrame( filter []byte, proverTrie *tries.RollingFrecencyCritbitTrie, ) (*protobufs.ClockFrame, error) { idxValue, closer, err := p.db.Get(clockDataLatestIndex(filter)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get latest data clock frame") } frameNumber := binary.BigEndian.Uint64(idxValue) frame, _, err := p.GetDataClockFrame(filter, frameNumber) if err != nil { return nil, errors.Wrap(err, "get latest data clock frame") } closer.Close() if proverTrie != nil { trieData, closer, err := p.db.Get(clockProverTrieKey(filter, frameNumber)) if err != nil { return nil, errors.Wrap(err, "get latest data clock frame") } defer closer.Close() if err := proverTrie.Deserialize(trieData); err != nil { return nil, errors.Wrap(err, "get latest data clock frame") } } return frame, nil } func (p *PebbleClockStore) GetLatestCandidateDataClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) { idxValue, closer, err := p.db.Get(clockDataCandidateLatestIndex(filter)) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get latest candidate data clock frame") } frameNumber := binary.BigEndian.Uint64(idxValue) frames, err := p.GetCandidateDataClockFrames(filter, frameNumber) if err != nil { return nil, errors.Wrap(err, "get latest candidate data clock frame") } closer.Close() if len(frames) == 0 { return nil, ErrNotFound } return frames[0], nil } // GetLeadingCandidateDataClockFrame implements ClockStore. func (p *PebbleClockStore) GetLeadingCandidateDataClockFrame( filter []byte, parent []byte, frameNumber uint64, ) (*protobufs.ClockFrame, error) { iter, err := p.RangeCandidateDataClockFrames(filter, parent, frameNumber) if err != nil { return nil, errors.Wrap(err, "get leading candidate data clock frame") } if !iter.First() { return nil, ErrNotFound } defer iter.Close() frame, err := iter.Value() return frame, errors.Wrap(err, "get leading candidate data clock frame") } // GetParentDataClockFrame implements ClockStore. func (p *PebbleClockStore) GetParentDataClockFrame( filter []byte, frameNumber uint64, parentSelector []byte, ) (*protobufs.ClockFrame, error) { data, closer, err := p.db.Get( clockDataParentIndexKey(filter, frameNumber, parentSelector), ) if err != nil { return nil, errors.Wrap(err, "get parent data clock frame") } parent := &protobufs.ClockFrame{} if err := proto.Unmarshal(data, parent); err != nil { return nil, errors.Wrap(err, "get parent data clock frame") } if err := p.fillAggregateProofs(parent); err != nil { return nil, errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "get clock frame iterator value", ) } if closer != nil { closer.Close() } return parent, nil } // PutCandidateDataClockFrame implements ClockStore. func (p *PebbleClockStore) PutCandidateDataClockFrame( parentSelector []byte, distance []byte, selector []byte, frame *protobufs.ClockFrame, txn Transaction, ) error { if err := p.saveAggregateProofs(txn, frame); err != nil { return errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "put candidate data clock frame", ) } temp := append( []*protobufs.InclusionAggregateProof{}, frame.AggregateProofs..., ) frame.AggregateProofs = []*protobufs.InclusionAggregateProof{} data, err := proto.Marshal(frame) if err != nil { return errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "put candidate data clock frame", ) } frame.AggregateProofs = temp if err = txn.Set( clockDataCandidateFrameKey( frame.Filter, frame.FrameNumber, frame.ParentSelector, distance, ), data, ); err != nil { return errors.Wrap(err, "put candidate data clock frame") } if err = txn.Set( clockDataParentIndexKey( frame.Filter, frame.FrameNumber, selector, ), data, ); err != nil { return errors.Wrap(err, "put candidate data clock frame") } numberBytes, closer, err := p.db.Get(clockDataCandidateLatestIndex(frame.Filter)) if err != nil && !errors.Is(err, pebble.ErrNotFound) { return errors.Wrap(err, "put candidate data clock frame") } existingNumber := uint64(0) if numberBytes != nil { existingNumber = binary.BigEndian.Uint64(numberBytes) closer.Close() } if frame.FrameNumber > existingNumber { frameNumberBytes := make([]byte, 8) binary.BigEndian.PutUint64(frameNumberBytes, frame.FrameNumber) if err = txn.Set( clockDataCandidateLatestIndex(frame.Filter), frameNumberBytes, ); err != nil { return errors.Wrap(err, "put candidate data clock frame") } } return nil } // PutDataClockFrame implements ClockStore. func (p *PebbleClockStore) PutDataClockFrame( frame *protobufs.ClockFrame, proverTrie *tries.RollingFrecencyCritbitTrie, txn Transaction, backfill bool, ) error { if frame.FrameNumber != 0 { if err := p.saveAggregateProofs(txn, frame); err != nil { return errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "put candidate data clock frame", ) } } temp := append( []*protobufs.InclusionAggregateProof{}, frame.AggregateProofs..., ) if frame.FrameNumber != 0 { frame.AggregateProofs = []*protobufs.InclusionAggregateProof{} } data, err := proto.Marshal(frame) if err != nil { return errors.Wrap( errors.Wrap(err, ErrInvalidData.Error()), "put data clock frame", ) } if frame.FrameNumber != 0 { frame.AggregateProofs = temp } frameNumberBytes := make([]byte, 8) binary.BigEndian.PutUint64(frameNumberBytes, frame.FrameNumber) if err = txn.Set( clockDataFrameKey(frame.Filter, frame.FrameNumber), data, ); err != nil { return errors.Wrap(err, "put data clock frame") } proverData, err := proverTrie.Serialize() if err != nil { return errors.Wrap(err, "put data clock frame") } if err = txn.Set( clockProverTrieKey(frame.Filter, frame.FrameNumber), proverData, ); err != nil { return errors.Wrap(err, "put data clock frame") } _, closer, err := p.db.Get(clockDataEarliestIndex(frame.Filter)) if err != nil { if !errors.Is(err, pebble.ErrNotFound) { return errors.Wrap(err, "put data clock frame") } if err = txn.Set( clockDataEarliestIndex(frame.Filter), frameNumberBytes, ); err != nil { return errors.Wrap(err, "put data clock frame") } } if err == nil && closer != nil { closer.Close() } if !backfill { if err = txn.Set( clockDataLatestIndex(frame.Filter), frameNumberBytes, ); err != nil { return errors.Wrap(err, "put data clock frame") } } return nil } // GetCandidateDataClockFrames implements ClockStore. // Distance is 32-byte aligned, so we just use a 0x00 * 32 -> 0xff * 32 range func (p *PebbleClockStore) GetCandidateDataClockFrames( filter []byte, frameNumber uint64, ) ([]*protobufs.ClockFrame, error) { iter, err := p.db.NewIter( clockDataCandidateFrameKey( filter, frameNumber, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, ), clockDataCandidateFrameKey( filter, frameNumber, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, ), ) if err != nil { return nil, errors.Wrap(err, "get candidate data clock frames") } frames := []*protobufs.ClockFrame{} i := &PebbleCandidateClockIterator{i: iter, db: p} for i.First(); i.Valid(); i.Next() { value, err := i.Value() if err != nil { return nil, errors.Wrap(err, "get candidate data clock frames") } frames = append(frames, value) } if err := i.Close(); err != nil { return nil, errors.Wrap(err, "get candidate data clock frames") } return frames, nil } // RangeCandidateDataClockFrames implements ClockStore. // Distance is 32-byte aligned, so we just use a 0x00 * 32 -> 0xff * 32 range func (p *PebbleClockStore) RangeCandidateDataClockFrames( filter []byte, parent []byte, frameNumber uint64, ) (*PebbleCandidateClockIterator, error) { fromParent := rightAlign(parent, 32) toParent := rightAlign(parent, 32) if bytes.Equal(parent, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }) { toParent = []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, } } iter, err := p.db.NewIter( clockDataCandidateFrameKey( filter, frameNumber, fromParent, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, ), clockDataCandidateFrameKey( filter, frameNumber, toParent, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, ), ) if err != nil { return nil, errors.Wrap(err, "range candidate data clock frames") } return &PebbleCandidateClockIterator{i: iter, db: p}, nil } // RangeDataClockFrames implements ClockStore. func (p *PebbleClockStore) RangeDataClockFrames( filter []byte, startFrameNumber uint64, endFrameNumber uint64, ) (*PebbleClockIterator, error) { if startFrameNumber > endFrameNumber { temp := endFrameNumber endFrameNumber = startFrameNumber startFrameNumber = temp } iter, err := p.db.NewIter( clockDataFrameKey(filter, startFrameNumber), clockDataFrameKey(filter, endFrameNumber), ) if err != nil { return nil, errors.Wrap(err, "get data clock frames") } return &PebbleClockIterator{i: iter, db: p}, nil } // Should only need be run once, before starting func (p *PebbleClockStore) Deduplicate(filter []byte) error { from := clockDataParentIndexKey( filter, 1, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, ) to := clockDataParentIndexKey( filter, 20000, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, ) iter, err := p.db.NewIter(from, to) if err != nil { return errors.Wrap(err, "deduplicate") } i := 0 for iter.First(); iter.Valid(); iter.Next() { value := iter.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return err } if err := p.saveAggregateProofs(nil, frame); err != nil { return err } frame.AggregateProofs = []*protobufs.InclusionAggregateProof{} newValue, err := proto.Marshal(frame) if err != nil { return err } err = p.db.Set(iter.Key(), newValue) if err != nil { return err } i++ if i%100 == 0 { fmt.Println("Deduplicated 100 parent frames") } } iter.Close() if err := p.db.Compact(from, to, true); err != nil { return err } from = clockDataFrameKey(filter, 1) to = clockDataFrameKey(filter, 20000) iter, err = p.db.NewIter(from, to) if err != nil { return errors.Wrap(err, "deduplicate") } i = 0 for iter.First(); iter.Valid(); iter.Next() { value := iter.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return err } if err := p.saveAggregateProofs(nil, frame); err != nil { return err } frame.AggregateProofs = []*protobufs.InclusionAggregateProof{} newValue, err := proto.Marshal(frame) if err != nil { return err } err = p.db.Set(iter.Key(), newValue) if err != nil { return err } i++ if i%100 == 0 { fmt.Println("Deduplicated 100 data frames") } } iter.Close() if err := p.db.Compact(from, to, true); err != nil { return err } from = clockDataCandidateFrameKey( filter, 1, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, ) to = clockDataCandidateFrameKey( filter, 20000, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, ) iter, err = p.db.NewIter(from, to) if err != nil { return errors.Wrap(err, "deduplicate") } i = 0 for iter.First(); iter.Valid(); iter.Next() { value := iter.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return err } if err := p.saveAggregateProofs(nil, frame); err != nil { return err } frame.AggregateProofs = []*protobufs.InclusionAggregateProof{} newValue, err := proto.Marshal(frame) if err != nil { return err } err = p.db.Set(iter.Key(), newValue) if err != nil { return err } i++ if i%100 == 0 { fmt.Println("Deduplicated 100 candidate frames") } } iter.Close() if err := p.db.Compact(from, to, true); err != nil { return err } p.db.Close() return nil } func (p *PebbleClockStore) GetCompressedDataClockFrames( filter []byte, fromFrameNumber uint64, toFrameNumber uint64, ) (*protobufs.CeremonyCompressedSync, error) { from := clockDataFrameKey(filter, fromFrameNumber) to := clockDataFrameKey(filter, toFrameNumber+1) iter, err := p.db.NewIter(from, to) if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } syncMessage := &protobufs.CeremonyCompressedSync{} proofs := map[string]*protobufs.InclusionProofsMap{} commits := map[string]*protobufs.InclusionCommitmentsMap{} segments := map[string]*protobufs.InclusionSegmentsMap{} for iter.First(); iter.Valid(); iter.Next() { value := iter.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } syncMessage.TruncatedClockFrames = append( syncMessage.TruncatedClockFrames, frame, ) if frame.FrameNumber == 0 { continue } for i := 0; i < len(frame.Input[516:])/74; i++ { aggregateCommit := frame.Input[516+(i*74) : 516+((i+1)*74)] if _, ok := proofs[string(aggregateCommit)]; !ok { proofs[string(aggregateCommit)] = &protobufs.InclusionProofsMap{ FrameCommit: aggregateCommit, } } } } if err := iter.Close(); err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } if len(syncMessage.TruncatedClockFrames) < int( toFrameNumber-fromFrameNumber+1, ) { newFrom := fromFrameNumber if len(syncMessage.TruncatedClockFrames) > 0 { newFrom = syncMessage.TruncatedClockFrames[len( syncMessage.TruncatedClockFrames, )-1].FrameNumber + 1 } from := clockDataCandidateFrameKey( filter, newFrom, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, ) to := clockDataCandidateFrameKey( filter, toFrameNumber+1, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, ) iter, err := p.db.NewIter(from, to) if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } candidates := []*protobufs.ClockFrame{} for iter.First(); iter.Valid(); iter.Next() { value := iter.Value() frame := &protobufs.ClockFrame{} if err := proto.Unmarshal(value, frame); err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } candidates = append(candidates, frame) } if err := iter.Close(); err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } sort.Slice(candidates, func(i, j int) bool { return candidates[i].FrameNumber < candidates[j].FrameNumber }) if len(candidates) > 0 { cursorStart := candidates[0].FrameNumber paths := [][]*protobufs.ClockFrame{} for _, frame := range candidates { frame := frame if frame.FrameNumber == cursorStart { paths = append(paths, []*protobufs.ClockFrame{frame}) } if frame.FrameNumber > cursorStart { for i, path := range paths { s, err := path[len(path)-1].GetSelector() if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } parentSelector, _, _, err := frame.GetParentSelectorAndDistance(nil) if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } if s.Cmp(parentSelector) == 0 { paths[i] = append(paths[i], frame) } } } } sort.Slice(paths, func(i, j int) bool { return len(paths[i]) > len(paths[j]) }) leadingIndex := 0 var leadingScore *big.Int length := len(paths[0]) for i := 0; i < len(paths); i++ { if len(paths[i]) < length { break } score := new(big.Int) for _, path := range paths[i] { master, err := p.GetMasterClockFrame( []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, path.FrameNumber, ) if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } discriminator, err := master.GetSelector() if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } _, distance, _, err := path.GetParentSelectorAndDistance( discriminator, ) if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } score = score.Add(score, distance) } if leadingScore == nil || leadingScore.Cmp(score) > 0 { leadingIndex = i leadingScore = score } } for _, frame := range paths[leadingIndex] { frame := frame syncMessage.TruncatedClockFrames = append( syncMessage.TruncatedClockFrames, frame, ) if frame.FrameNumber == 0 { continue } for i := 0; i < len(frame.Input[516:])/74; i++ { aggregateCommit := frame.Input[516+(i*74) : 516+((i+1)*74)] if _, ok := proofs[string(aggregateCommit)]; !ok { proofs[string(aggregateCommit)] = &protobufs.InclusionProofsMap{ FrameCommit: aggregateCommit, } } } } } } for k, v := range proofs { k := k v := v value, closer, err := p.db.Get(dataProofMetadataKey(filter, []byte(k))) if err != nil { if errors.Is(err, pebble.ErrNotFound) { return nil, ErrNotFound } return nil, errors.Wrap(err, "get compressed data clock frames") } copied := make([]byte, len(value[8:])) limit := binary.BigEndian.Uint64(value[0:8]) copy(copied, value[8:]) v.Proof = copied if err = closer.Close(); err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } iter, err := p.db.NewIter( dataProofInclusionKey(filter, []byte(k), 0), dataProofInclusionKey(filter, []byte(k), limit+1), ) if err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } for iter.First(); iter.Valid(); iter.Next() { incCommit := iter.Value() urlLength := binary.BigEndian.Uint16(incCommit[:2]) commitLength := binary.BigEndian.Uint16(incCommit[2:4]) url := make([]byte, urlLength) copy(url, incCommit[4:urlLength+4]) commit := make([]byte, commitLength) copy(commit, incCommit[urlLength+4:urlLength+4+commitLength]) remainder := int(urlLength + 4 + commitLength) if _, ok := commits[string(commit)]; !ok { commits[string(commit)] = &protobufs.InclusionCommitmentsMap{ Commitment: commit, TypeUrl: string(url), } for j := 0; j < (len(incCommit)-remainder)/32; j++ { start := remainder + (j * 32) end := remainder + ((j + 1) * 32) hash := make([]byte, len(incCommit[start:end])) copy(hash, incCommit[start:end]) commits[string(commit)].SegmentHashes = append( commits[string(commit)].SegmentHashes, hash, ) if _, ok := segments[string(hash)]; !ok { segValue, dataCloser, err := p.db.Get( dataProofSegmentKey(filter, incCommit[start:end]), ) if err != nil { if errors.Is(err, pebble.ErrNotFound) { // If we've lost this key it means we're in a corrupted state return nil, ErrInvalidData } return nil, errors.Wrap(err, "get compressed data clock frames") } segCopy := make([]byte, len(segValue)) copy(segCopy, segValue) segments[string(hash)] = &protobufs.InclusionSegmentsMap{ Hash: hash, Data: segCopy, } syncMessage.Segments = append( syncMessage.Segments, segments[string(hash)], ) if err = dataCloser.Close(); err != nil { return nil, errors.Wrap(err, "get compressed data clock frames") } } } } v.Commitments = append(v.Commitments, commits[string(commit)]) } syncMessage.Proofs = append( syncMessage.Proofs, v, ) if len(syncMessage.TruncatedClockFrames) > 0 { frames := syncMessage.TruncatedClockFrames syncMessage.FromFrameNumber = frames[0].FrameNumber syncMessage.ToFrameNumber = frames[len(frames)-1].FrameNumber } if err = iter.Close(); err != nil { return nil, errors.Wrap(err, "get aggregate proof") } } return syncMessage, nil } func (p *PebbleClockStore) SetLatestDataClockFrameNumber( filter []byte, frameNumber uint64, ) error { err := p.db.Set( clockDataLatestIndex(filter), binary.BigEndian.AppendUint64(nil, frameNumber), ) return errors.Wrap(err, "set latest data clock frame number") } func (p *PebbleClockStore) DeleteCandidateDataClockFrameRange( filter []byte, fromFrameNumber uint64, toFrameNumber uint64, ) error { err := p.db.DeleteRange( clockDataCandidateFrameKey( filter, fromFrameNumber, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, []byte{ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }, ), clockDataCandidateFrameKey( filter, toFrameNumber, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, []byte{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, }, ), ) return errors.Wrap(err, "delete candidate data clock frame range") } func (p *PebbleClockStore) DeleteDataClockFrameRange( filter []byte, fromFrameNumber uint64, toFrameNumber uint64, ) error { err := p.db.DeleteRange( clockDataFrameKey( filter, fromFrameNumber, ), clockDataFrameKey( filter, toFrameNumber, ), ) return errors.Wrap(err, "delete data clock frame range") } func (p *PebbleClockStore) GetHighestCandidateDataClockFrame( filter []byte, ) (*protobufs.ClockFrame, error) { frame, err := p.GetLatestCandidateDataClockFrame(filter) if err != nil { return nil, errors.Wrap(err, "get highest candidate data clock frame") } return frame, nil }