mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-27 05:17:27 +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>
194 lines
4.4 KiB
Go
194 lines
4.4 KiB
Go
package compute
|
|
|
|
import (
|
|
"bytes"
|
|
"math/big"
|
|
"slices"
|
|
|
|
"github.com/iden3/go-iden3-crypto/poseidon"
|
|
"github.com/pkg/errors"
|
|
hg "source.quilibrium.com/quilibrium/monorepo/node/execution/state/hypergraph"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/compiler"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/execution/intrinsics"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/execution/state"
|
|
qcrypto "source.quilibrium.com/quilibrium/monorepo/types/tries"
|
|
)
|
|
|
|
// CodeDeployment represents a code deployment operation
|
|
type CodeDeployment struct {
|
|
// The QCL circuit to deploy
|
|
Circuit []byte
|
|
// The QCL types/classes of the main arguments, 0 - garbler, 1 - evaluator
|
|
InputTypes [2]string
|
|
// The QCL types/classes of the output values
|
|
OutputTypes []string
|
|
// The app address
|
|
Domain [32]byte
|
|
|
|
inputQCLSource []byte
|
|
inputSizes [2][]int
|
|
compiler compiler.CircuitCompiler
|
|
}
|
|
|
|
// NewCodeDeployment creates a new code deployment
|
|
func NewCodeDeployment(
|
|
domain [32]byte,
|
|
sourceCode []byte,
|
|
inputTypes [2]string,
|
|
inputSizes [2][]int,
|
|
outputTypes []string,
|
|
compiler compiler.CircuitCompiler,
|
|
) (*CodeDeployment, error) {
|
|
return &CodeDeployment{
|
|
inputQCLSource: sourceCode,
|
|
Domain: domain,
|
|
InputTypes: inputTypes,
|
|
OutputTypes: outputTypes,
|
|
inputSizes: inputSizes,
|
|
compiler: compiler,
|
|
}, nil
|
|
}
|
|
|
|
// GetCost implements intrinsics.IntrinsicOperation
|
|
func (c *CodeDeployment) GetCost() (*big.Int, error) {
|
|
// Cost based on code size
|
|
return big.NewInt(int64(len(c.Circuit))), nil
|
|
}
|
|
|
|
// Prove implements intrinsics.IntrinsicOperation
|
|
func (c *CodeDeployment) Prove(frameNumber uint64) (err error) {
|
|
defer func() {
|
|
if r := recover(); r != nil {
|
|
err = errors.Wrap(
|
|
errors.New("panic encountered while proving code"),
|
|
"prove",
|
|
)
|
|
}
|
|
}()
|
|
|
|
compiledCircuit, err := c.compiler.Compile(
|
|
string(c.inputQCLSource),
|
|
c.inputSizes[:],
|
|
)
|
|
if err != nil {
|
|
return errors.Wrap(err, "verify")
|
|
}
|
|
|
|
buf := new(bytes.Buffer)
|
|
if err = compiledCircuit.Marshal(buf); err != nil {
|
|
return errors.Wrap(err, "verify")
|
|
}
|
|
|
|
out := buf.Bytes()
|
|
c.Circuit = out
|
|
|
|
return nil
|
|
}
|
|
|
|
func (c *CodeDeployment) GetReadAddresses(
|
|
frameNumber uint64,
|
|
) ([][]byte, error) {
|
|
return nil, nil
|
|
}
|
|
|
|
func (c *CodeDeployment) GetWriteAddresses(
|
|
frameNumber uint64,
|
|
) ([][]byte, error) {
|
|
// Get the domain from the hypergraph
|
|
domain := c.Domain
|
|
|
|
// Generate a unique address for this code file
|
|
codeAddressBI, err := poseidon.HashBytes(
|
|
slices.Concat(
|
|
domain[:],
|
|
c.Circuit,
|
|
),
|
|
)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "get write addresses")
|
|
}
|
|
|
|
codeAddress := codeAddressBI.FillBytes(make([]byte, 32))
|
|
codeFullAddress := [64]byte{}
|
|
copy(codeFullAddress[:32], c.Domain[:])
|
|
copy(codeFullAddress[32:], codeAddress)
|
|
|
|
return [][]byte{codeFullAddress[:]}, nil
|
|
}
|
|
|
|
// Verify implements intrinsics.IntrinsicOperation
|
|
func (c *CodeDeployment) Verify(frameNumber uint64) (bool, error) {
|
|
buf := bytes.NewReader(c.Circuit)
|
|
err := c.compiler.ValidateCircuit(buf)
|
|
if err != nil {
|
|
return false, errors.Wrap(err, "verify")
|
|
}
|
|
|
|
return true, nil
|
|
}
|
|
|
|
// Materialize implements intrinsics.IntrinsicOperation
|
|
func (c *CodeDeployment) Materialize(
|
|
frameNumber uint64,
|
|
state state.State,
|
|
) (state.State, error) {
|
|
hypergraph, ok := state.(*hg.HypergraphState)
|
|
if !ok {
|
|
return nil, errors.Wrap(errors.New("invalid state type"), "materialize")
|
|
}
|
|
|
|
// Get the domain from the hypergraph
|
|
domain := c.Domain
|
|
|
|
// Generate a unique address for this code file
|
|
codeAddressBI, err := poseidon.HashBytes(
|
|
slices.Concat(
|
|
domain[:],
|
|
c.Circuit,
|
|
),
|
|
)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "materialize")
|
|
}
|
|
|
|
codeAddress := codeAddressBI.FillBytes(make([]byte, 32))
|
|
|
|
// Create a tree to store the code
|
|
codeTree := &qcrypto.VectorCommitmentTree{}
|
|
|
|
// Store the code content
|
|
if err := codeTree.Insert(
|
|
[]byte{0 << 2}, // Index 0
|
|
c.Circuit,
|
|
nil,
|
|
big.NewInt(int64(len(c.Circuit))),
|
|
); err != nil {
|
|
return nil, errors.Wrap(err, "materialize")
|
|
}
|
|
|
|
// Create the materialized state
|
|
value := hypergraph.NewVertexAddMaterializedState(
|
|
[32]byte(domain),
|
|
[32]byte(codeAddress),
|
|
frameNumber,
|
|
nil,
|
|
codeTree,
|
|
)
|
|
|
|
// Set the state
|
|
err = hypergraph.Set(
|
|
domain[:],
|
|
codeAddress,
|
|
hg.VertexAddsDiscriminator,
|
|
frameNumber,
|
|
value,
|
|
)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "materialize")
|
|
}
|
|
|
|
return hypergraph, nil
|
|
}
|
|
|
|
var _ intrinsics.IntrinsicOperation = (*CodeDeployment)(nil)
|