ceremonyclient/node/execution/intrinsics/hypergraph/hypergraph_intrinsic_test.go
Cassandra Heart 53f7c2b5c9
v2.1.0.2 (#442)
* 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>
2025-10-23 01:03:06 -05:00

122 lines
3.9 KiB
Go
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

package hypergraph_test
import (
"math/big"
"slices"
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/mock"
"github.com/stretchr/testify/require"
"source.quilibrium.com/quilibrium/monorepo/node/execution/intrinsics/hypergraph"
hg "source.quilibrium.com/quilibrium/monorepo/node/execution/state/hypergraph"
"source.quilibrium.com/quilibrium/monorepo/types/mocks"
crypto "source.quilibrium.com/quilibrium/monorepo/types/tries"
)
func setupMockHypergraph(t *testing.T) (*mocks.MockInclusionProver, *mocks.MockHypergraph) {
mockHypergraph := &mocks.MockHypergraph{}
// Setup mock prover
mockProver := &mocks.MockInclusionProver{}
mockHypergraph.On("GetProver").Return(mockProver)
return mockProver, mockHypergraph
}
func TestNewHypergraphIntrinsic(t *testing.T) {
_, mockHypergraph := setupMockHypergraph(t)
// Create a valid configuration
config := &hypergraph.HypergraphIntrinsicConfiguration{
ReadPublicKey: make([]byte, 57),
WritePublicKey: make([]byte, 57),
}
// Create a mock key manager
mockKeyManager := &mocks.MockKeyManager{}
// Create a new intrinsic
intrinsic := hypergraph.NewHypergraphIntrinsic(config, mockHypergraph, nil, mockKeyManager, nil, nil)
// Verify the intrinsic was created successfully
assert.NotNil(t, intrinsic)
assert.Equal(t, config, intrinsic.Config())
assert.Equal(t, mockHypergraph, intrinsic.Hypergraph())
}
func TestLoadHypergraphIntrinsic(t *testing.T) {
// Setup mock objects
_, mockHypergraph := setupMockHypergraph(t)
mockInclusionProver := &mocks.MockInclusionProver{}
mockKeyManager := &mocks.MockKeyManager{}
// Setup app address
appAddress := make([]byte, 32)
vertexAddress := slices.Concat(appAddress, hg.HYPERGRAPH_METADATA_ADDRESS)
vertexId := [64]byte(vertexAddress)
// Setup mock vertex
mockVertex := &mocks.MockVertex{}
mockVertex.On("GetID").Return(vertexId)
mockHypergraph.On("GetVertex", vertexId).Return(mockVertex, nil)
// Setup mock tree and tree data
mockTree := &crypto.VectorCommitmentTree{}
// Mock the tree consensus structure
consensusTree := &crypto.VectorCommitmentTree{}
// Serialize the consensus tree
consensusBytes, err := crypto.SerializeNonLazyTree(consensusTree)
require.NoError(t, err)
// Mock the tree configuration structure
configTree := &crypto.VectorCommitmentTree{}
readKey := make([]byte, 57)
writeKey := make([]byte, 57)
configTree.Insert([]byte{0 << 2}, readKey, nil, big.NewInt(57))
configTree.Insert([]byte{1 << 2}, writeKey, nil, big.NewInt(57))
// Serialize the config tree
configBytes, err := crypto.SerializeNonLazyTree(configTree)
require.NoError(t, err)
// Insert the consensus tree into the main tree
mockTree.Insert([]byte{0 << 2}, consensusBytes, nil, big.NewInt(int64(len(consensusBytes))))
// Insert the sumcheck tree into the main tree we cheat this by reusing the consensus tree because they're equivalent objects here
mockTree.Insert([]byte{1 << 2}, consensusBytes, nil, big.NewInt(int64(len(consensusBytes))))
// RDF is empty for this intrinsic
mockTree.Insert([]byte{2 << 2}, []byte(""), nil, big.NewInt(0))
// Insert the config tree into the main tree
mockTree.Insert([]byte{16 << 2}, configBytes, nil, big.NewInt(int64(len(configBytes))))
// Set up the mock tree commit to return a value that will hash to the appAddress
mockTreeCommit := make([]byte, 32)
mockInclusionProver.On("CommitRaw", mock.Anything, mock.Anything).Return(mockTreeCommit, nil)
// Set up the hypergraph's GetVertexData to return our mock tree
mockHypergraph.On("GetVertexData", vertexId).Return(mockTree, nil)
// Create the intrinsic
intrinsic, err := hypergraph.LoadHypergraphIntrinsic(
appAddress,
mockHypergraph,
mockInclusionProver,
mockKeyManager,
nil,
nil,
)
// Verify the intrinsic was created successfully
assert.NotNil(t, intrinsic)
assert.NoError(t, err)
// Verify the underlying mocks were called
mockHypergraph.AssertCalled(t, "GetVertex", vertexId)
mockHypergraph.AssertCalled(t, "GetVertexData", vertexId)
}