mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-21 10:27:26 +08:00
* v2.1.0.2 * restore tweaks to simlibp2p * fix: nil ref on size calc * fix: panic should induce shutdown from event_distributor * fix: friendlier initialization that requires less manual kickstarting for test/devnets * fix: fewer available shards than provers should choose shard length * fix: update stored worker registry, improve logging for debug mode * fix: shut the fuck up, peer log * qol: log value should be snake cased * fix:non-archive snap sync issues * fix: separate X448/Decaf448 signed keys, add onion key to registry * fix: overflow arithmetic on frame number comparison * fix: worker registration should be idempotent if inputs are same, otherwise permit updated records * fix: remove global prover state from size calculation * fix: divide by zero case * fix: eager prover * fix: broadcast listener default * qol: diagnostic data for peer authenticator * fix: master/worker connectivity issue in sparse networks tight coupling of peer and workers can sometimes interfere if mesh is sparse, so give workers a pseudoidentity but publish messages with the proper peer key * fix: reorder steps of join creation * fix: join verify frame source + ensure domain is properly padded (unnecessary but good for consistency) * fix: add delegate to protobuf <-> reified join conversion * fix: preempt prover from planning with no workers * fix: use the unallocated workers to generate a proof * qol: underflow causes join fail in first ten frames on test/devnets * qol: small logging tweaks for easier log correlation in debug mode * qol: use fisher-yates shuffle to ensure prover allocations are evenly distributed when scores are equal * qol: separate decisional logic on post-enrollment confirmation into consensus engine, proposer, and worker manager where relevant, refactor out scoring * reuse shard descriptors for both join planning and confirm/reject decisions * fix: add missing interface method and amend test blossomsub to use new peer id basis * fix: only check allocations if they exist * fix: pomw mint proof data needs to be hierarchically under global intrinsic domain * staging temporary state under diagnostics * fix: first phase of distributed lock refactoring * fix: compute intrinsic locking * fix: hypergraph intrinsic locking * fix: token intrinsic locking * fix: update execution engines to support new locking model * fix: adjust tests with new execution shape * fix: weave in lock/unlock semantics to liveness provider * fix lock fallthrough, add missing allocation update * qol: additional logging for diagnostics, also testnet/devnet handling for confirmations * fix: establish grace period on halt scenario to permit recovery * fix: support test/devnet defaults for coverage scenarios * fix: nil ref on consensus halts for non-archive nodes * fix: remove unnecessary prefix from prover ref * add test coverage for fork choice behaviors and replay – once passing, blocker (2) is resolved * fix: no fork replay on repeat for non-archive nodes, snap now behaves correctly * rollup of pre-liveness check lock interactions * ahead of tests, get the protobuf/metrics-related changes out so teams can prepare * add test coverage for distributed lock behaviors – once passing, blocker (3) is resolved * fix: blocker (3) * Dev docs improvements (#445) * Make install deps script more robust * Improve testing instructions * Worker node should stop upon OS SIGINT/SIGTERM signal (#447) * move pebble close to Stop() * move deferred Stop() to Start() * add core id to worker stop log message * create done os signal channel and stop worker upon message to it --------- Co-authored-by: Cassandra Heart <7929478+CassOnMars@users.noreply.github.com> --------- Co-authored-by: Daz <daz_the_corgi@proton.me> Co-authored-by: Black Swan <3999712+blacks1ne@users.noreply.github.com>
139 lines
2.9 KiB
Go
139 lines
2.9 KiB
Go
package store
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/binary"
|
|
"slices"
|
|
|
|
"github.com/cockroachdb/pebble"
|
|
"github.com/pkg/errors"
|
|
"go.uber.org/zap"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/store"
|
|
)
|
|
|
|
var _ store.ShardsStore = (*PebbleShardsStore)(nil)
|
|
|
|
type PebbleShardsStore struct {
|
|
db store.KVDB
|
|
logger *zap.Logger
|
|
}
|
|
|
|
func NewPebbleShardsStore(
|
|
db store.KVDB,
|
|
logger *zap.Logger,
|
|
) *PebbleShardsStore {
|
|
return &PebbleShardsStore{
|
|
db,
|
|
logger,
|
|
}
|
|
}
|
|
|
|
func appShardKey(shardKey []byte, prefix []uint32) []byte {
|
|
key := []byte{SHARD, APP_SHARD_DATA}
|
|
key = append(key, shardKey...)
|
|
for _, p := range prefix {
|
|
key = binary.BigEndian.AppendUint32(key, p)
|
|
}
|
|
|
|
return key
|
|
}
|
|
|
|
func (p *PebbleShardsStore) RangeAppShards() ([]store.ShardInfo, error) {
|
|
shards := []store.ShardInfo{}
|
|
|
|
iter, err := p.db.NewIter(
|
|
appShardKey(bytes.Repeat([]byte{0}, 35), []uint32{}),
|
|
appShardKey(bytes.Repeat([]byte{0xff}, 35), []uint32{0xffff}),
|
|
)
|
|
if err != nil {
|
|
if errors.Is(err, pebble.ErrNotFound) {
|
|
return nil, store.ErrNotFound
|
|
}
|
|
|
|
return nil, errors.Wrap(err, "get app shards")
|
|
}
|
|
defer iter.Close()
|
|
|
|
for iter.First(); iter.Valid(); iter.Next() {
|
|
value := iter.Value()
|
|
offset := 0
|
|
if len(value)%4 != 0 {
|
|
offset += len(value) % 4
|
|
}
|
|
out := make([]uint32, len(value)/4)
|
|
buf := bytes.NewBuffer(value[offset:])
|
|
err = binary.Read(buf, binary.BigEndian, &out)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "get app shards")
|
|
}
|
|
key := slices.Clone(iter.Key())
|
|
shards = append(shards, store.ShardInfo{
|
|
L1: key[2:5],
|
|
L2: key[5:37],
|
|
Path: out,
|
|
})
|
|
}
|
|
|
|
return shards, nil
|
|
}
|
|
|
|
func (p *PebbleShardsStore) GetAppShards(
|
|
shardKey []byte,
|
|
prefix []uint32,
|
|
) ([]store.ShardInfo, error) {
|
|
endPrefix := slices.Clone(prefix)
|
|
endPrefix = append(endPrefix, 0xffff)
|
|
shards := []store.ShardInfo{}
|
|
|
|
iter, err := p.db.NewIter(
|
|
appShardKey(shardKey, prefix),
|
|
appShardKey(shardKey, endPrefix),
|
|
)
|
|
if err != nil {
|
|
if errors.Is(err, pebble.ErrNotFound) {
|
|
return nil, store.ErrNotFound
|
|
}
|
|
|
|
return nil, errors.Wrap(err, "get app shards")
|
|
}
|
|
defer iter.Close()
|
|
|
|
for iter.First(); iter.Valid(); iter.Next() {
|
|
value := iter.Value()
|
|
offset := 0
|
|
if len(value)%4 != 0 {
|
|
offset += len(value) % 4
|
|
}
|
|
out := make([]uint32, len(value)/4)
|
|
buf := bytes.NewBuffer(value[offset:])
|
|
err = binary.Read(buf, binary.BigEndian, &out)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "get app shards")
|
|
}
|
|
shards = append(shards, store.ShardInfo{
|
|
L1: shardKey[:3],
|
|
L2: shardKey[3:],
|
|
Path: out,
|
|
})
|
|
}
|
|
|
|
return shards, nil
|
|
}
|
|
|
|
func (p *PebbleShardsStore) PutAppShard(
|
|
txn store.Transaction,
|
|
shard store.ShardInfo,
|
|
) error {
|
|
key := appShardKey(slices.Concat(shard.L1, shard.L2), shard.Path)
|
|
return errors.Wrap(txn.Set(key, key[37:]), "put app shard")
|
|
}
|
|
|
|
func (p *PebbleShardsStore) DeleteAppShard(
|
|
txn store.Transaction,
|
|
shardKey []byte,
|
|
prefix []uint32,
|
|
) error {
|
|
key := appShardKey(shardKey, prefix)
|
|
return errors.Wrap(txn.Delete(key), "put app shard")
|
|
}
|