2023-09-09 23:45:47 +00:00
|
|
|
|
package store
|
|
|
|
|
|
|
|
|
|
import (
|
2023-10-09 04:52:19 +00:00
|
|
|
|
"bytes"
|
2023-09-09 23:45:47 +00:00
|
|
|
|
"encoding/binary"
|
2023-09-27 09:05:39 +00:00
|
|
|
|
"fmt"
|
2023-09-09 23:45:47 +00:00
|
|
|
|
|
|
|
|
|
"github.com/cockroachdb/pebble"
|
2023-09-10 23:29:17 +00:00
|
|
|
|
"github.com/iden3/go-iden3-crypto/poseidon"
|
2023-09-09 23:45:47 +00:00
|
|
|
|
"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)
|
|
|
|
|
GetEarliestDataClockFrame(filter []byte) (*protobufs.ClockFrame, error)
|
|
|
|
|
GetDataClockFrame(
|
|
|
|
|
filter []byte,
|
|
|
|
|
frameNumber uint64,
|
2023-09-25 02:43:35 +00:00
|
|
|
|
) (*protobufs.ClockFrame, *tries.RollingFrecencyCritbitTrie, error)
|
2023-09-09 23:45:47 +00:00
|
|
|
|
RangeDataClockFrames(
|
|
|
|
|
filter []byte,
|
|
|
|
|
startFrameNumber uint64,
|
|
|
|
|
endFrameNumber uint64,
|
|
|
|
|
) (*PebbleClockIterator, error)
|
|
|
|
|
PutDataClockFrame(
|
|
|
|
|
frame *protobufs.ClockFrame,
|
|
|
|
|
proverTrie *tries.RollingFrecencyCritbitTrie,
|
|
|
|
|
txn Transaction,
|
|
|
|
|
) error
|
|
|
|
|
PutCandidateDataClockFrame(
|
|
|
|
|
parentSelector []byte,
|
|
|
|
|
distance []byte,
|
|
|
|
|
selector []byte,
|
|
|
|
|
frame *protobufs.ClockFrame,
|
|
|
|
|
txn Transaction,
|
|
|
|
|
) error
|
2023-09-25 02:43:35 +00:00
|
|
|
|
GetCandidateDataClockFrames(
|
|
|
|
|
filter []byte,
|
|
|
|
|
frameNumber uint64,
|
|
|
|
|
) ([]*protobufs.ClockFrame, error)
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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)
|
2023-09-27 09:05:39 +00:00
|
|
|
|
Deduplicate(filter []byte) error
|
2023-10-05 07:05:02 +00:00
|
|
|
|
GetCompressedDataClockFrames(
|
|
|
|
|
filter []byte,
|
|
|
|
|
fromFrameNumber uint64,
|
|
|
|
|
toFrameNumber uint64,
|
|
|
|
|
) (*protobufs.CeremonyCompressedSync, error)
|
|
|
|
|
SetLatestDataClockFrameNumber(
|
|
|
|
|
filter []byte,
|
|
|
|
|
frameNumber uint64,
|
|
|
|
|
) error
|
|
|
|
|
DeleteCandidateDataClockFrameRange(
|
|
|
|
|
filter []byte,
|
|
|
|
|
fromFrameNumber uint64,
|
|
|
|
|
toFrameNumber uint64,
|
|
|
|
|
) error
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
type PebbleClockStore struct {
|
|
|
|
|
db *pebble.DB
|
|
|
|
|
logger *zap.Logger
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
var _ ClockStore = (*PebbleClockStore)(nil)
|
|
|
|
|
|
|
|
|
|
type PebbleMasterClockIterator struct {
|
|
|
|
|
i *pebble.Iterator
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
type PebbleClockIterator struct {
|
2023-09-27 09:05:39 +00:00
|
|
|
|
i *pebble.Iterator
|
|
|
|
|
db *PebbleClockStore
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
type PebbleCandidateClockIterator struct {
|
2023-09-27 09:05:39 +00:00
|
|
|
|
i *pebble.Iterator
|
|
|
|
|
db *PebbleClockStore
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
var _ Iterator[*protobufs.ClockFrame] = (*PebbleMasterClockIterator)(nil)
|
|
|
|
|
var _ Iterator[*protobufs.ClockFrame] = (*PebbleClockIterator)(nil)
|
|
|
|
|
var _ Iterator[*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
|
2023-09-26 06:14:26 +00:00
|
|
|
|
frame.Filter = make([]byte, len(filter))
|
|
|
|
|
copy(frame.Filter, filter)
|
2023-09-09 23:45:47 +00:00
|
|
|
|
|
|
|
|
|
if len(value) < 521 {
|
|
|
|
|
return nil, errors.Wrap(
|
|
|
|
|
ErrInvalidData,
|
|
|
|
|
"get master clock frame iterator value",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-26 06:14:26 +00:00
|
|
|
|
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:]
|
2023-09-09 23:45:47 +00:00
|
|
|
|
|
2023-09-10 23:29:17 +00:00
|
|
|
|
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.Bytes()
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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) Valid() bool {
|
|
|
|
|
return p.i.Valid()
|
|
|
|
|
}
|
|
|
|
|
|
2023-10-09 04:52:19 +00:00
|
|
|
|
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
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if err := p.db.fillAggregateProofs(frame); err != nil {
|
|
|
|
|
return nil, errors.Wrap(
|
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"get clock frame iterator value",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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()
|
|
|
|
|
}
|
|
|
|
|
|
2023-10-09 04:52:19 +00:00
|
|
|
|
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
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if err := p.db.fillAggregateProofs(frame); err != nil {
|
|
|
|
|
return nil, errors.Wrap(
|
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"get clock frame iterator value",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
return frame, nil
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func (p *PebbleCandidateClockIterator) Close() error {
|
|
|
|
|
return errors.Wrap(p.i.Close(), "closing candidate clock frame iterator")
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func NewPebbleClockStore(db *pebble.DB, 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
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// DB Keys
|
|
|
|
|
//
|
|
|
|
|
// Keys are structured as:
|
|
|
|
|
// <core type><sub type | index>[<non-index increment>]<segment>
|
|
|
|
|
// 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",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-26 06:25:16 +00:00
|
|
|
|
copied := make([]byte, len(key))
|
|
|
|
|
copy(copied, key)
|
|
|
|
|
return binary.BigEndian.Uint64(copied[2:10]), copied[10:], nil
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
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 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,
|
2023-10-05 07:05:02 +00:00
|
|
|
|
rightAlign(selector, 32),
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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 &PebbleTransaction{
|
|
|
|
|
b: 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")
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-25 10:00:35 +00:00
|
|
|
|
copied := make([]byte, len(value))
|
|
|
|
|
copy(copied[:], value[:])
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
defer closer.Close()
|
|
|
|
|
frame := &protobufs.ClockFrame{}
|
|
|
|
|
frame.FrameNumber = frameNumber
|
|
|
|
|
frame.Filter = filter
|
2023-09-25 10:00:35 +00:00
|
|
|
|
frame.Difficulty = binary.BigEndian.Uint32(copied[:4])
|
|
|
|
|
frame.Input = copied[4 : len(copied)-516]
|
|
|
|
|
frame.Output = copied[len(copied)-516:]
|
2023-09-09 23:45:47 +00:00
|
|
|
|
|
2023-09-10 23:29:17 +00:00
|
|
|
|
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.Bytes()
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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 := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: clockMasterFrameKey(filter, startFrameNumber),
|
|
|
|
|
UpperBound: clockMasterFrameKey(filter, endFrameNumber),
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
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,
|
2023-09-25 02:43:35 +00:00
|
|
|
|
) (*protobufs.ClockFrame, *tries.RollingFrecencyCritbitTrie, error) {
|
2023-09-09 23:45:47 +00:00
|
|
|
|
value, closer, err := p.db.Get(clockDataFrameKey(filter, frameNumber))
|
|
|
|
|
if err != nil {
|
|
|
|
|
if errors.Is(err, pebble.ErrNotFound) {
|
2023-09-25 02:43:35 +00:00
|
|
|
|
return nil, nil, ErrNotFound
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
2023-09-25 02:43:35 +00:00
|
|
|
|
return nil, nil, errors.Wrap(err, "get data clock frame")
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
defer closer.Close()
|
|
|
|
|
frame := &protobufs.ClockFrame{}
|
|
|
|
|
if err := proto.Unmarshal(value, frame); err != nil {
|
2023-09-25 02:43:35 +00:00
|
|
|
|
return nil, nil, errors.Wrap(
|
2023-09-09 23:45:47 +00:00
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"get data clock frame",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if err = p.fillAggregateProofs(frame); err != nil {
|
|
|
|
|
return nil, nil, errors.Wrap(
|
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"get data clock frame",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-25 02:43:35 +00:00
|
|
|
|
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
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
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
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
// 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)
|
2023-09-25 02:43:35 +00:00
|
|
|
|
frame, _, err := p.GetDataClockFrame(filter, frameNumber)
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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)
|
2023-09-25 02:43:35 +00:00
|
|
|
|
frame, _, err := p.GetDataClockFrame(filter, frameNumber)
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 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")
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if err := p.fillAggregateProofs(parent); err != nil {
|
|
|
|
|
return nil, errors.Wrap(
|
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"get clock frame iterator value",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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 {
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if err := p.saveAggregateProofs(nil, 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{}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
data, err := proto.Marshal(frame)
|
|
|
|
|
if err != nil {
|
|
|
|
|
return errors.Wrap(
|
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"put candidate data clock frame",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
frame.AggregateProofs = temp
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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")
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// PutDataClockFrame implements ClockStore.
|
|
|
|
|
func (p *PebbleClockStore) PutDataClockFrame(
|
|
|
|
|
frame *protobufs.ClockFrame,
|
|
|
|
|
proverTrie *tries.RollingFrecencyCritbitTrie,
|
|
|
|
|
txn Transaction,
|
|
|
|
|
) error {
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if frame.FrameNumber != 0 {
|
|
|
|
|
if err := p.saveAggregateProofs(nil, 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{}
|
|
|
|
|
}
|
2023-09-09 23:45:47 +00:00
|
|
|
|
data, err := proto.Marshal(frame)
|
|
|
|
|
if err != nil {
|
|
|
|
|
return errors.Wrap(
|
|
|
|
|
errors.Wrap(err, ErrInvalidData.Error()),
|
|
|
|
|
"put data clock frame",
|
|
|
|
|
)
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
if frame.FrameNumber != 0 {
|
|
|
|
|
frame.AggregateProofs = temp
|
|
|
|
|
}
|
2023-09-09 23:45:47 +00:00
|
|
|
|
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 err = txn.Set(
|
|
|
|
|
clockDataLatestIndex(frame.Filter),
|
|
|
|
|
frameNumberBytes,
|
|
|
|
|
); err != nil {
|
|
|
|
|
return errors.Wrap(err, "put data clock frame")
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-25 02:43:35 +00:00
|
|
|
|
// 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 := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: 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,
|
|
|
|
|
},
|
|
|
|
|
),
|
|
|
|
|
UpperBound: 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,
|
|
|
|
|
},
|
|
|
|
|
),
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
frames := []*protobufs.ClockFrame{}
|
2023-09-27 09:05:39 +00:00
|
|
|
|
i := &PebbleCandidateClockIterator{i: iter, db: p}
|
2023-09-25 02:43:35 +00:00
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-09 23:45:47 +00:00
|
|
|
|
// 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) {
|
2023-10-09 04:52:19 +00:00
|
|
|
|
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,
|
|
|
|
|
}
|
|
|
|
|
}
|
2023-09-09 23:45:47 +00:00
|
|
|
|
iter := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: clockDataCandidateFrameKey(
|
|
|
|
|
filter,
|
|
|
|
|
frameNumber,
|
2023-10-09 04:52:19 +00:00
|
|
|
|
fromParent,
|
2023-09-09 23:45:47 +00:00
|
|
|
|
[]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,
|
|
|
|
|
},
|
|
|
|
|
),
|
|
|
|
|
UpperBound: clockDataCandidateFrameKey(
|
|
|
|
|
filter,
|
|
|
|
|
frameNumber,
|
2023-10-09 04:52:19 +00:00
|
|
|
|
toParent,
|
2023-09-09 23:45:47 +00:00
|
|
|
|
[]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,
|
|
|
|
|
},
|
|
|
|
|
),
|
|
|
|
|
})
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
return &PebbleCandidateClockIterator{i: iter, db: p}, nil
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 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 := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: clockDataFrameKey(filter, startFrameNumber),
|
|
|
|
|
UpperBound: clockDataFrameKey(filter, endFrameNumber),
|
|
|
|
|
})
|
|
|
|
|
|
2023-09-27 09:05:39 +00:00
|
|
|
|
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 := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: from,
|
|
|
|
|
UpperBound: to,
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
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, &pebble.WriteOptions{Sync: true})
|
|
|
|
|
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 = p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: from,
|
|
|
|
|
UpperBound: to,
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
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, &pebble.WriteOptions{Sync: true})
|
|
|
|
|
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 = p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: from,
|
|
|
|
|
UpperBound: to,
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
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, &pebble.WriteOptions{Sync: true})
|
|
|
|
|
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
|
2023-09-09 23:45:47 +00:00
|
|
|
|
}
|
2023-10-05 07:05:02 +00:00
|
|
|
|
|
|
|
|
|
func (p *PebbleClockStore) GetCompressedDataClockFrames(
|
|
|
|
|
filter []byte,
|
|
|
|
|
fromFrameNumber uint64,
|
|
|
|
|
toFrameNumber uint64,
|
|
|
|
|
) (*protobufs.CeremonyCompressedSync, error) {
|
|
|
|
|
from := clockDataFrameKey(filter, fromFrameNumber)
|
|
|
|
|
to := clockDataFrameKey(filter, toFrameNumber+1)
|
|
|
|
|
|
|
|
|
|
iter := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: from,
|
|
|
|
|
UpperBound: to,
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
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")
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for k, v := range proofs {
|
2023-10-14 04:05:44 +00:00
|
|
|
|
k := k
|
|
|
|
|
v := v
|
2023-10-05 07:05:02 +00:00
|
|
|
|
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 := p.db.NewIter(&pebble.IterOptions{
|
|
|
|
|
LowerBound: dataProofInclusionKey(filter, []byte(k), 0),
|
|
|
|
|
UpperBound: dataProofInclusionKey(filter, []byte(k), limit+1),
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
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),
|
|
|
|
|
&pebble.WriteOptions{
|
|
|
|
|
Sync: true,
|
|
|
|
|
},
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
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,
|
|
|
|
|
},
|
|
|
|
|
),
|
|
|
|
|
&pebble.WriteOptions{
|
|
|
|
|
Sync: true,
|
|
|
|
|
},
|
|
|
|
|
)
|
|
|
|
|
return errors.Wrap(err, "delete candidate data clock frame range")
|
|
|
|
|
}
|