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>
724 lines
26 KiB
Go
724 lines
26 KiB
Go
package global_test
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/binary"
|
|
"math/big"
|
|
"slices"
|
|
"testing"
|
|
|
|
"github.com/iden3/go-iden3-crypto/poseidon"
|
|
"github.com/pkg/errors"
|
|
"github.com/stretchr/testify/assert"
|
|
"github.com/stretchr/testify/mock"
|
|
"github.com/stretchr/testify/require"
|
|
"source.quilibrium.com/quilibrium/monorepo/hypergraph"
|
|
"source.quilibrium.com/quilibrium/monorepo/node/execution/intrinsics/global"
|
|
hgstate "source.quilibrium.com/quilibrium/monorepo/node/execution/state/hypergraph"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/crypto"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/execution/intrinsics"
|
|
thypergraph "source.quilibrium.com/quilibrium/monorepo/types/hypergraph"
|
|
"source.quilibrium.com/quilibrium/monorepo/types/mocks"
|
|
qcrypto "source.quilibrium.com/quilibrium/monorepo/types/tries"
|
|
)
|
|
|
|
func TestProverPause_Prove(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockSigner := new(mocks.MockBLSSigner)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(12345)
|
|
pubKey := make([]byte, 585) // Simulate a BLS48581G1 public key
|
|
for i := range pubKey {
|
|
pubKey[i] = byte(i % 256)
|
|
}
|
|
|
|
// Compute expected address
|
|
addressBI, err := poseidon.HashBytes(pubKey)
|
|
require.NoError(t, err)
|
|
address := addressBI.FillBytes(make([]byte, 32))
|
|
|
|
// Create expected domain for pause signature
|
|
pauseDomainPreimage := slices.Concat(intrinsics.GLOBAL_INTRINSIC_ADDRESS[:], []byte("PROVER_PAUSE"))
|
|
pauseDomain, err := poseidon.HashBytes(pauseDomainPreimage)
|
|
require.NoError(t, err)
|
|
|
|
// Create expected message
|
|
expectedMessage := make([]byte, 0, len(filter)+8)
|
|
expectedMessage = append(expectedMessage, filter...)
|
|
frameBytes := make([]byte, 8)
|
|
binary.BigEndian.PutUint64(frameBytes, frameNumber)
|
|
expectedMessage = append(expectedMessage, frameBytes...)
|
|
|
|
// Configure mock signer
|
|
mockSigner.On("Public").Return(pubKey)
|
|
mockSigner.On("SignWithDomain", expectedMessage, pauseDomain.Bytes()).
|
|
Return([]byte("signature"), nil)
|
|
|
|
// Configure mock key manager
|
|
mockKeyManager.On("GetSigningKey", "q-prover-key").Return(mockSigner, nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Call the prove function
|
|
err = proverPause.Prove(0) // Frame number parameter is not used in the Prove method
|
|
require.NoError(t, err)
|
|
|
|
// Verify the results
|
|
assert.NotNil(t, proverPause.PublicKeySignatureBLS48581)
|
|
assert.Equal(t, []byte("signature"), proverPause.PublicKeySignatureBLS48581.Signature)
|
|
assert.Equal(t, address, proverPause.PublicKeySignatureBLS48581.Address)
|
|
|
|
// Verify that all expected methods were called
|
|
mockSigner.AssertExpectations(t)
|
|
mockKeyManager.AssertExpectations(t)
|
|
}
|
|
|
|
func TestProverPause_Verify(t *testing.T) {
|
|
t.Run("Can pause when active", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(12345)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
pubkey := make([]byte, 585)
|
|
for i := range pubkey {
|
|
pubkey[i] = byte(i % 256)
|
|
}
|
|
|
|
// Setup tree with active status (1)
|
|
tree := &qcrypto.VectorCommitmentTree{}
|
|
tree.Insert([]byte{0}, pubkey, nil, big.NewInt(585))
|
|
tree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active (order 1)
|
|
|
|
mockHypergraph.On("GetVertex", mock.Anything).Return(hypergraph.NewVertex([32]byte(intrinsics.GLOBAL_INTRINSIC_ADDRESS), [32]byte(address), make([]byte, 74), big.NewInt(0)), nil)
|
|
mockHypergraph.On("GetVertexData", mock.Anything).Return(tree, nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, mockHypergraph, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data manually
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Create expected domain for pause signature
|
|
pauseDomainPreimage := slices.Concat(intrinsics.GLOBAL_INTRINSIC_ADDRESS[:], []byte("PROVER_PAUSE"))
|
|
pauseDomain, err := poseidon.HashBytes(pauseDomainPreimage)
|
|
require.NoError(t, err)
|
|
|
|
// Create expected message
|
|
expectedMessage := make([]byte, 0, len(filter)+8)
|
|
expectedMessage = append(expectedMessage, filter...)
|
|
frameBytes := make([]byte, 8)
|
|
binary.BigEndian.PutUint64(frameBytes, frameNumber)
|
|
expectedMessage = append(expectedMessage, frameBytes...)
|
|
|
|
// Configure mock key manager
|
|
mockKeyManager.On("ValidateSignature",
|
|
crypto.KeyTypeBLS48581G1,
|
|
pubkey,
|
|
expectedMessage,
|
|
[]byte("signature"),
|
|
pauseDomain.Bytes(),
|
|
).Return(true, nil)
|
|
|
|
// Call the verify function
|
|
valid, err := proverPause.Verify(frameNumber)
|
|
require.NoError(t, err)
|
|
assert.True(t, valid)
|
|
|
|
// Verify that all expected methods were called
|
|
mockKeyManager.AssertExpectations(t)
|
|
})
|
|
|
|
t.Run("Cannot pause when joining", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(12345)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
pubkey := make([]byte, 585)
|
|
for i := range pubkey {
|
|
pubkey[i] = byte(i % 256)
|
|
}
|
|
|
|
// Setup tree with joining status (0)
|
|
tree := &qcrypto.VectorCommitmentTree{}
|
|
tree.Insert([]byte{0}, pubkey, nil, big.NewInt(585))
|
|
tree.Insert([]byte{1 << 2}, []byte{0}, nil, big.NewInt(1)) // status = joining (order 1)
|
|
|
|
mockHypergraph.On("GetVertex", mock.Anything).Return(hypergraph.NewVertex([32]byte(intrinsics.GLOBAL_INTRINSIC_ADDRESS), [32]byte(address), make([]byte, 74), big.NewInt(0)), nil)
|
|
mockHypergraph.On("GetVertexData", mock.Anything).Return(tree, nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, mockHypergraph, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data manually
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call the verify function
|
|
valid, err := proverPause.Verify(frameNumber)
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "can only pause when allocation is active")
|
|
assert.False(t, valid)
|
|
})
|
|
|
|
t.Run("Cannot pause when already paused", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(12345)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
pubkey := make([]byte, 585)
|
|
for i := range pubkey {
|
|
pubkey[i] = byte(i % 256)
|
|
}
|
|
|
|
// Setup tree with paused status (2)
|
|
tree := &qcrypto.VectorCommitmentTree{}
|
|
tree.Insert([]byte{0}, pubkey, nil, big.NewInt(585))
|
|
tree.Insert([]byte{1 << 2}, []byte{2}, nil, big.NewInt(1)) // status = paused (order 1)
|
|
|
|
mockHypergraph.On("GetVertex", mock.Anything).Return(hypergraph.NewVertex([32]byte(intrinsics.GLOBAL_INTRINSIC_ADDRESS), [32]byte(address), make([]byte, 74), big.NewInt(0)), nil)
|
|
mockHypergraph.On("GetVertexData", mock.Anything).Return(tree, nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, mockHypergraph, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data manually
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call the verify function
|
|
valid, err := proverPause.Verify(frameNumber)
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "can only pause when allocation is active")
|
|
assert.False(t, valid)
|
|
})
|
|
|
|
t.Run("Invalid signature fails", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(12345)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
pubkey := make([]byte, 585)
|
|
for i := range pubkey {
|
|
pubkey[i] = byte(i % 256)
|
|
}
|
|
|
|
// Setup tree with active status (1)
|
|
tree := &qcrypto.VectorCommitmentTree{}
|
|
tree.Insert([]byte{0}, pubkey, nil, big.NewInt(585))
|
|
tree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active (order 1)
|
|
|
|
mockHypergraph.On("GetVertex", mock.Anything).Return(hypergraph.NewVertex([32]byte(intrinsics.GLOBAL_INTRINSIC_ADDRESS), [32]byte(address), make([]byte, 74), big.NewInt(0)), nil)
|
|
mockHypergraph.On("GetVertexData", mock.Anything).Return(tree, nil)
|
|
|
|
// Create expected domain for pause signature
|
|
pauseDomainPreimage := slices.Concat(intrinsics.GLOBAL_INTRINSIC_ADDRESS[:], []byte("PROVER_PAUSE"))
|
|
pauseDomain, err := poseidon.HashBytes(pauseDomainPreimage)
|
|
require.NoError(t, err)
|
|
|
|
// Create expected message
|
|
expectedMessage := make([]byte, 0, len(filter)+8)
|
|
expectedMessage = append(expectedMessage, filter...)
|
|
frameBytes := make([]byte, 8)
|
|
binary.BigEndian.PutUint64(frameBytes, frameNumber)
|
|
expectedMessage = append(expectedMessage, frameBytes...)
|
|
|
|
// Configure mock key manager to return false
|
|
mockKeyManager.On("ValidateSignature",
|
|
crypto.KeyTypeBLS48581G1,
|
|
pubkey,
|
|
expectedMessage,
|
|
[]byte("signature"),
|
|
pauseDomain.Bytes(),
|
|
).Return(false, nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, mockHypergraph, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data manually
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call the verify function
|
|
valid, err := proverPause.Verify(frameNumber)
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "invalid signature")
|
|
assert.False(t, valid)
|
|
})
|
|
}
|
|
|
|
func TestProverPause_Materialize(t *testing.T) {
|
|
t.Run("Materialize pause - updates status to paused", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
hypergraphState := hgstate.NewHypergraphState(mockHypergraph)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(253000)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
// Create full address
|
|
fullAddress := [64]byte{}
|
|
copy(fullAddress[:32], intrinsics.GLOBAL_INTRINSIC_ADDRESS[:])
|
|
copy(fullAddress[32:], address)
|
|
|
|
// Setup existing tree with active status (1)
|
|
proverTypeBI, _ := poseidon.HashBytes(
|
|
slices.Concat(bytes.Repeat([]byte{0xff}, 32), []byte("prover:Prover")),
|
|
)
|
|
existingTree := &qcrypto.VectorCommitmentTree{}
|
|
existingTree.Insert([]byte{0}, []byte("pubkey"), nil, big.NewInt(6))
|
|
existingTree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active
|
|
existingTree.Insert(bytes.Repeat([]byte{0xff}, 32), proverTypeBI.FillBytes(make([]byte, 32)), nil, big.NewInt(1))
|
|
allocationTypeBI, _ := poseidon.HashBytes(
|
|
slices.Concat(bytes.Repeat([]byte{0xff}, 32), []byte("allocation:ProverAllocation")),
|
|
)
|
|
existingAllocTree := &qcrypto.VectorCommitmentTree{}
|
|
existingAllocTree.Insert([]byte{0}, address, nil, big.NewInt(32))
|
|
existingAllocTree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active
|
|
existingAllocTree.Insert([]byte{2 << 2}, filter, nil, big.NewInt(32))
|
|
existingAllocTree.Insert(bytes.Repeat([]byte{0xff}, 32), allocationTypeBI.FillBytes(make([]byte, 32)), nil, big.NewInt(32))
|
|
|
|
allocBI, _ := poseidon.HashBytes(slices.Concat([]byte("PROVER_ALLOCATION"), []byte("pubkey"), filter))
|
|
alloc := allocBI.FillBytes(make([]byte, 32))
|
|
fullAllocAddr := [64]byte(slices.Concat(intrinsics.GLOBAL_INTRINSIC_ADDRESS[:], alloc))
|
|
|
|
// Create existing vertex
|
|
existingVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAddress[:32]),
|
|
[32]byte(fullAddress[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
existingAllocVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAllocAddr[:32]),
|
|
[32]byte(fullAllocAddr[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
|
|
// Configure mock to return existing vertex and tree
|
|
mockHypergraph.On("GetVertex", fullAddress).Return(existingVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAddress).Return(existingTree, nil)
|
|
mockHypergraph.On("GetVertex", fullAllocAddr).Return(existingAllocVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAllocAddr).Return(existingAllocTree, nil)
|
|
mockHypergraph.On("GetHyperedge", mock.Anything).Return(&mockHyperedge{}, nil)
|
|
|
|
// Expect the tree to be updated with paused status and pause frame
|
|
mockHypergraph.On("AddVertex",
|
|
mock.MatchedBy(func(v thypergraph.Vertex) bool {
|
|
id := v.GetID()
|
|
return bytes.Equal(id[:], fullAddress[:])
|
|
}),
|
|
mock.MatchedBy(func(tree *qcrypto.VectorCommitmentTree) bool {
|
|
// Check that status was updated to paused (2)
|
|
statusBytes, _ := tree.Get([]byte{1 << 2}) // Status (order 1)
|
|
if len(statusBytes) != 1 || statusBytes[0] != 2 {
|
|
return false
|
|
}
|
|
// Check that pause frame was stored
|
|
frameBytes, _ := tree.Get([]byte{6 << 2}) // PauseFrameNumber (order 6)
|
|
if len(frameBytes) != 8 {
|
|
return false
|
|
}
|
|
storedFrame := binary.BigEndian.Uint64(frameBytes)
|
|
return storedFrame == frameNumber
|
|
}),
|
|
).Return(nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call Materialize
|
|
newState, err := proverPause.Materialize(frameNumber, hypergraphState)
|
|
require.NoError(t, err)
|
|
assert.NotNil(t, newState)
|
|
assert.Equal(t, hypergraphState, newState)
|
|
})
|
|
|
|
t.Run("Materialize prover not found - returns error", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
hypergraphState := hgstate.NewHypergraphState(mockHypergraph)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(253000)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
// Create full address
|
|
fullAddress := [64]byte{}
|
|
copy(fullAddress[:32], intrinsics.GLOBAL_INTRINSIC_ADDRESS[:])
|
|
copy(fullAddress[32:], address)
|
|
|
|
// Configure mock to return nil vertex (prover not found)
|
|
mockHypergraph.On("GetVertex", fullAddress).Return(nil, assert.AnError)
|
|
mockHypergraph.On("GetVertexData", fullAddress).Return(nil, assert.AnError)
|
|
mockHypergraph.On("GetHyperedge", mock.Anything).Return(nil, assert.AnError)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call Materialize
|
|
newState, err := proverPause.Materialize(frameNumber, hypergraphState)
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "prover not found")
|
|
assert.Nil(t, newState)
|
|
})
|
|
|
|
t.Run("Materialize hypergraph get error - returns error", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
hypergraphState := hgstate.NewHypergraphState(mockHypergraph)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(253000)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
// Create full address
|
|
fullAddress := [64]byte{}
|
|
copy(fullAddress[:32], intrinsics.GLOBAL_INTRINSIC_ADDRESS[:])
|
|
copy(fullAddress[32:], address)
|
|
|
|
// Create existing vertex
|
|
existingVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAddress[:32]),
|
|
[32]byte(fullAddress[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
|
|
// Configure mock to return vertex but error on data
|
|
mockHypergraph.On("GetVertex", fullAddress).Return(existingVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAddress).Return(nil, errors.New("hypergraph get error"))
|
|
mockHypergraph.On("GetHyperedge", mock.Anything).Return(&mockHyperedge{}, nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call Materialize
|
|
newState, err := proverPause.Materialize(frameNumber, hypergraphState)
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "prover not found")
|
|
assert.Nil(t, newState)
|
|
})
|
|
|
|
t.Run("Materialize hypergraph add error - returns error", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
hypergraphState := hgstate.NewHypergraphState(mockHypergraph)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(253000)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
// Create full address
|
|
fullAddress := [64]byte{}
|
|
copy(fullAddress[:32], intrinsics.GLOBAL_INTRINSIC_ADDRESS[:])
|
|
copy(fullAddress[32:], address)
|
|
|
|
// Setup existing tree with active status (1)
|
|
proverTypeBI, _ := poseidon.HashBytes(
|
|
slices.Concat(bytes.Repeat([]byte{0xff}, 32), []byte("prover:Prover")),
|
|
)
|
|
existingTree := &qcrypto.VectorCommitmentTree{}
|
|
existingTree.Insert([]byte{0}, []byte("pubkey"), nil, big.NewInt(6))
|
|
existingTree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active
|
|
existingTree.Insert(bytes.Repeat([]byte{0xff}, 32), proverTypeBI.FillBytes(make([]byte, 32)), nil, big.NewInt(1))
|
|
allocationTypeBI, _ := poseidon.HashBytes(
|
|
slices.Concat(bytes.Repeat([]byte{0xff}, 32), []byte("allocation:ProverAllocation")),
|
|
)
|
|
existingAllocTree := &qcrypto.VectorCommitmentTree{}
|
|
existingAllocTree.Insert([]byte{0}, address, nil, big.NewInt(32))
|
|
existingAllocTree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active
|
|
existingAllocTree.Insert([]byte{2 << 2}, filter, nil, big.NewInt(32))
|
|
existingAllocTree.Insert(bytes.Repeat([]byte{0xff}, 32), allocationTypeBI.FillBytes(make([]byte, 32)), nil, big.NewInt(32))
|
|
|
|
allocBI, _ := poseidon.HashBytes(slices.Concat([]byte("PROVER_ALLOCATION"), []byte("pubkey"), filter))
|
|
alloc := allocBI.FillBytes(make([]byte, 32))
|
|
fullAllocAddr := [64]byte(slices.Concat(intrinsics.GLOBAL_INTRINSIC_ADDRESS[:], alloc))
|
|
|
|
// Create existing vertex
|
|
existingVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAddress[:32]),
|
|
[32]byte(fullAddress[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
existingAllocVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAllocAddr[:32]),
|
|
[32]byte(fullAllocAddr[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
|
|
// Configure mock to return existing vertex and tree
|
|
mockHypergraph.On("GetVertex", fullAddress).Return(existingVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAddress).Return(existingTree, nil)
|
|
mockHypergraph.On("GetVertex", fullAllocAddr).Return(existingAllocVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAllocAddr).Return(existingAllocTree, nil)
|
|
mockHypergraph.On("GetHyperedge", mock.Anything).Return(&mockHyperedge{}, nil)
|
|
txn := &mocks.MockTransaction{}
|
|
txn.On("Abort").Return(nil)
|
|
mockHypergraph.On("NewTransaction", false).Return(txn, nil)
|
|
mockProver := new(mocks.MockInclusionProver)
|
|
mockProver.On("CommitRaw", mock.Anything, mock.Anything).Return(make([]byte, 74), nil)
|
|
mockHypergraph.On("GetProver").Return(mockProver)
|
|
|
|
// Configure Add to return an error
|
|
mockHypergraph.On("AddVertex",
|
|
mock.Anything,
|
|
mock.Anything,
|
|
).Return(errors.New("hypergraph add error"))
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call Materialize
|
|
newState, err := proverPause.Materialize(frameNumber, hypergraphState)
|
|
require.NoError(t, err)
|
|
|
|
err = newState.Commit()
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "hypergraph add error")
|
|
})
|
|
|
|
t.Run("Materialize with existing data - preserves other fields", func(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
mockHypergraph := new(mocks.MockHypergraph)
|
|
mockHypergraph.On("GetCoveredPrefix").Return([]int{}, nil)
|
|
hypergraphState := hgstate.NewHypergraphState(mockHypergraph)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(253000)
|
|
address := make([]byte, 32)
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
// Create full address
|
|
fullAddress := [64]byte{}
|
|
copy(fullAddress[:32], intrinsics.GLOBAL_INTRINSIC_ADDRESS[:])
|
|
copy(fullAddress[32:], address)
|
|
|
|
// Setup existing tree with active status and some other data
|
|
proverTypeBI, _ := poseidon.HashBytes(
|
|
slices.Concat(bytes.Repeat([]byte{0xff}, 32), []byte("prover:Prover")),
|
|
)
|
|
existingTree := &qcrypto.VectorCommitmentTree{}
|
|
existingTree.Insert([]byte{0}, []byte("pubkey"), nil, big.NewInt(6))
|
|
existingTree.Insert([]byte{2 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active
|
|
existingTree.Insert([]byte{4 << 2}, []byte("join frame"), nil, big.NewInt(10)) // JoinFrameNumber (order 4)
|
|
existingTree.Insert([]byte{5 << 2}, []byte("other data"), nil, big.NewInt(10)) // LeaveFrameNumber (order 5)
|
|
existingTree.Insert(bytes.Repeat([]byte{0xff}, 32), proverTypeBI.FillBytes(make([]byte, 32)), nil, big.NewInt(1))
|
|
allocationTypeBI, _ := poseidon.HashBytes(
|
|
slices.Concat(bytes.Repeat([]byte{0xff}, 32), []byte("allocation:ProverAllocation")),
|
|
)
|
|
existingAllocTree := &qcrypto.VectorCommitmentTree{}
|
|
existingAllocTree.Insert([]byte{0}, address, nil, big.NewInt(32))
|
|
existingAllocTree.Insert([]byte{1 << 2}, []byte{1}, nil, big.NewInt(1)) // status = active
|
|
existingAllocTree.Insert([]byte{2 << 2}, filter, nil, big.NewInt(32))
|
|
existingAllocTree.Insert(bytes.Repeat([]byte{0xff}, 32), allocationTypeBI.FillBytes(make([]byte, 32)), nil, big.NewInt(32))
|
|
|
|
allocBI, _ := poseidon.HashBytes(slices.Concat([]byte("PROVER_ALLOCATION"), []byte("pubkey"), filter))
|
|
alloc := allocBI.FillBytes(make([]byte, 32))
|
|
fullAllocAddr := [64]byte(slices.Concat(intrinsics.GLOBAL_INTRINSIC_ADDRESS[:], alloc))
|
|
|
|
// Create existing vertex
|
|
existingVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAddress[:32]),
|
|
[32]byte(fullAddress[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
existingAllocVertex := hypergraph.NewVertex(
|
|
[32]byte(fullAllocAddr[:32]),
|
|
[32]byte(fullAllocAddr[32:]),
|
|
make([]byte, 74),
|
|
big.NewInt(7),
|
|
)
|
|
|
|
// Configure mock to return existing vertex and tree
|
|
mockHypergraph.On("GetVertex", fullAddress).Return(existingVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAddress).Return(existingTree, nil)
|
|
mockHypergraph.On("GetVertex", fullAllocAddr).Return(existingAllocVertex, nil)
|
|
mockHypergraph.On("GetVertexData", fullAllocAddr).Return(existingAllocTree, nil)
|
|
mockHypergraph.On("GetHyperedge", mock.Anything).Return(&mockHyperedge{}, nil)
|
|
|
|
// Expect the tree to preserve existing data
|
|
mockHypergraph.On("AddVertex",
|
|
mock.MatchedBy(func(v thypergraph.Vertex) bool {
|
|
id := v.GetID()
|
|
return bytes.Equal(id[:], fullAddress[:])
|
|
}),
|
|
mock.MatchedBy(func(tree *qcrypto.VectorCommitmentTree) bool {
|
|
// Check that other data is preserved
|
|
joinFrame, _ := tree.Get([]byte{4 << 2}) // JoinFrameNumber (order 4)
|
|
if !bytes.Equal(joinFrame, []byte("join frame")) {
|
|
return false
|
|
}
|
|
otherData, _ := tree.Get([]byte{5 << 2}) // LeaveFrameNumber (order 5)
|
|
return bytes.Equal(otherData, []byte("other data"))
|
|
}),
|
|
).Return(nil)
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call Materialize
|
|
newState, err := proverPause.Materialize(frameNumber, hypergraphState)
|
|
require.NoError(t, err)
|
|
assert.NotNil(t, newState)
|
|
})
|
|
}
|
|
|
|
func TestProverPause_GetCost(t *testing.T) {
|
|
// Setup
|
|
mockKeyManager := new(mocks.MockKeyManager)
|
|
|
|
// Test data
|
|
filter := []byte("testfilter")
|
|
frameNumber := uint64(12345)
|
|
address := make([]byte, 32) // Simulate an address derived from the public key
|
|
for i := range address {
|
|
address[i] = byte(i % 256)
|
|
}
|
|
|
|
// Create the prover pause operation
|
|
rdfMultiprover := createMockRDFMultiprover()
|
|
proverPause, err := global.NewProverPause(filter, frameNumber, mockKeyManager, nil, rdfMultiprover)
|
|
require.NoError(t, err)
|
|
|
|
// Set up the signature data manually
|
|
proverPause.PublicKeySignatureBLS48581 = global.BLS48581AddressedSignature{
|
|
Signature: []byte("signature"),
|
|
Address: address,
|
|
}
|
|
|
|
// Call the GetCost function
|
|
cost, err := proverPause.GetCost()
|
|
require.NoError(t, err)
|
|
assert.Equal(t, int64(0), cost.Int64())
|
|
}
|