mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-21 18:37: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>
227 lines
5.3 KiB
Go
227 lines
5.3 KiB
Go
package hypergraph
|
|
|
|
import (
|
|
"math/big"
|
|
"slices"
|
|
|
|
"github.com/pkg/errors"
|
|
hgstate "source.quilibrium.com/quilibrium/monorepo/node/execution/state/hypergraph"
|
|
qcrypto "source.quilibrium.com/quilibrium/monorepo/types/crypto"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/execution/intrinsics"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/execution/state"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/hypergraph"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/keys"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/tries"
|
|
)
|
|
|
|
type VertexAdd struct {
|
|
Domain [32]byte
|
|
DataAddress [32]byte
|
|
Data []qcrypto.VerEncProof
|
|
Signature []byte // Ed448 signature for write authorization
|
|
inclusionProver qcrypto.InclusionProver
|
|
keyManager keys.KeyManager
|
|
signer qcrypto.Signer
|
|
config *HypergraphIntrinsicConfiguration
|
|
verenc qcrypto.VerifiableEncryptor
|
|
rawData []byte
|
|
encryptionKey []byte
|
|
}
|
|
|
|
// NewVertexAdd constructs a new vertex addition.
|
|
func NewVertexAdd(
|
|
domain [32]byte,
|
|
dataAddress [32]byte,
|
|
rawData []byte,
|
|
encryptionKey []byte,
|
|
inclusionProver qcrypto.InclusionProver,
|
|
signer qcrypto.Signer,
|
|
config *HypergraphIntrinsicConfiguration,
|
|
verenc qcrypto.VerifiableEncryptor,
|
|
keyManager keys.KeyManager,
|
|
) *VertexAdd {
|
|
return &VertexAdd{
|
|
Domain: domain,
|
|
DataAddress: dataAddress,
|
|
inclusionProver: inclusionProver,
|
|
signer: signer,
|
|
config: config,
|
|
verenc: verenc,
|
|
rawData: rawData,
|
|
encryptionKey: encryptionKey,
|
|
keyManager: keyManager,
|
|
}
|
|
}
|
|
|
|
// GetCost implements intrinsics.IntrinsicOperation.
|
|
func (h *VertexAdd) GetCost() (*big.Int, error) {
|
|
// Cost is proportional to the size of the data
|
|
if h.Data == nil {
|
|
if h.rawData == nil {
|
|
return big.NewInt(0), errors.Wrap(
|
|
errors.New("missing data for vertex"),
|
|
"get cost",
|
|
)
|
|
}
|
|
|
|
return big.NewInt((int64(len(h.rawData)+54) / 55) * 55), nil
|
|
}
|
|
|
|
return big.NewInt(int64(len(h.Data)) * 55), nil
|
|
}
|
|
|
|
// Materialize implements intrinsics.IntrinsicOperation.
|
|
func (h *VertexAdd) Materialize(
|
|
frameNumber uint64,
|
|
state state.State,
|
|
) (state.State, error) {
|
|
hgs, ok := state.(*hgstate.HypergraphState)
|
|
if !ok {
|
|
return nil, errors.Wrap(errors.New("invalid state"), "materialize")
|
|
}
|
|
|
|
// Obtain prior entry (if exists)
|
|
var prior *tries.VectorCommitmentTree
|
|
data, err := hgs.Get(
|
|
h.Domain[:],
|
|
h.DataAddress[:],
|
|
hgstate.VertexAddsDiscriminator,
|
|
)
|
|
if err == nil {
|
|
prior = data.(*tries.VectorCommitmentTree)
|
|
}
|
|
|
|
// Compress the entries for vertex tree format
|
|
out := []hypergraph.Encrypted{}
|
|
for _, d := range h.Data {
|
|
out = append(out, d.Compress())
|
|
}
|
|
|
|
tree := hypergraph.EncryptedToVertexTree(h.inclusionProver, out)
|
|
|
|
// Create the materialized state
|
|
value := hgs.NewVertexAddMaterializedState(
|
|
h.Domain,
|
|
h.DataAddress,
|
|
frameNumber,
|
|
prior,
|
|
tree,
|
|
)
|
|
|
|
// Set the state
|
|
err = hgs.Set(
|
|
h.Domain[:],
|
|
h.DataAddress[:],
|
|
hgstate.VertexAddsDiscriminator,
|
|
frameNumber,
|
|
value,
|
|
)
|
|
|
|
return hgs, errors.Wrap(err, "materialize")
|
|
}
|
|
|
|
// Prove implements intrinsics.IntrinsicOperation.
|
|
func (h *VertexAdd) Prove(frameNumber uint64) error {
|
|
if len(h.rawData) == 0 {
|
|
return errors.Wrap(errors.New("missing data for vertex"), "prove")
|
|
}
|
|
|
|
h.Data = h.verenc.Encrypt(h.rawData, h.encryptionKey)
|
|
if len(h.Data) == 0 {
|
|
return errors.Wrap(errors.New("could not encrypt data"), "prove")
|
|
}
|
|
|
|
message := []byte{}
|
|
message = append(message, h.Domain[:]...)
|
|
message = append(message, h.DataAddress[:]...)
|
|
diskSize := 0
|
|
for _, d := range h.Data {
|
|
data := d.ToBytes()
|
|
message = append(message, data...)
|
|
diskSize += len(data)
|
|
}
|
|
|
|
if diskSize > 1024*1024*5 {
|
|
return errors.Wrap(errors.New("data too large"), "prove")
|
|
}
|
|
|
|
sig, err := h.signer.SignWithDomain(
|
|
message,
|
|
slices.Concat(h.Domain[:], []byte("VERTEX_ADD")),
|
|
)
|
|
if err != nil {
|
|
return errors.Wrap(err, "prove")
|
|
}
|
|
|
|
h.Signature = sig
|
|
|
|
return nil
|
|
}
|
|
|
|
func (h *VertexAdd) GetReadAddresses(
|
|
frameNumber uint64,
|
|
) ([][]byte, error) {
|
|
return nil, nil
|
|
}
|
|
|
|
func (h *VertexAdd) GetWriteAddresses(
|
|
frameNumber uint64,
|
|
) ([][]byte, error) {
|
|
return [][]byte{
|
|
slices.Concat(
|
|
h.Domain[:],
|
|
h.DataAddress[:],
|
|
),
|
|
}, nil
|
|
}
|
|
|
|
// Verify implements intrinsics.IntrinsicOperation.
|
|
func (h *VertexAdd) Verify(frameNumber uint64) (bool, error) {
|
|
// Check if data is valid and can be committed
|
|
if len(h.Data) == 0 {
|
|
return false, errors.Wrap(errors.New("missing data for vertex"), "verify")
|
|
}
|
|
|
|
for _, d := range h.Data {
|
|
if !d.Verify() {
|
|
return false, errors.Wrap(
|
|
errors.New("invalid proof for data"),
|
|
"verify",
|
|
)
|
|
}
|
|
}
|
|
|
|
message := []byte{}
|
|
message = append(message, h.Domain[:]...)
|
|
message = append(message, h.DataAddress[:]...)
|
|
diskSize := 0
|
|
for _, d := range h.Data {
|
|
data := d.ToBytes()
|
|
message = append(message, data...)
|
|
diskSize += len(data)
|
|
}
|
|
|
|
if diskSize > 1024*1024*5 {
|
|
return false, errors.Wrap(errors.New("data too large"), "verify")
|
|
}
|
|
|
|
valid, err := h.keyManager.ValidateSignature(
|
|
qcrypto.KeyTypeEd448,
|
|
h.config.WritePublicKey,
|
|
message,
|
|
h.Signature,
|
|
slices.Concat(h.Domain[:], []byte("VERTEX_ADD")),
|
|
)
|
|
if err != nil {
|
|
return false, errors.Wrap(err, "verify")
|
|
}
|
|
|
|
if !valid {
|
|
return false, errors.Wrap(errors.New("invalid signature"), "verify")
|
|
}
|
|
|
|
return true, nil
|
|
}
|
|
|
|
var _ intrinsics.IntrinsicOperation = (*VertexAdd)(nil)
|