mirror of
https://github.com/luxfi/bft.git
synced 2026-10-30 17:01:54 +00:00
The module is luxfi/bft and that is now the only name it answers to. - simplex/ -> engine/. Upstream's module is named for the protocol, so its root package and its engine package shared that name; under luxfi/bft the engine package would have collided with the module's own root package. It is the consensus engine, so engine.Epoch and engine.NewEpoch read without stutter. - Identifiers keep the qualifier where it carries meaning and only change the word: a block produced by this protocol as against a pre-existing chain's block is a real distinction, so makeNonSimplexBlock became makeNonBFTBlock, lastNonSimplexInnerBlockHeight became lastNonBFTInnerBlockHeight, newSnowToSimplexChain became newSnowToBFTChain. Dropping the qualifier outright would have left names that assert nothing. - The canoto-tagged fields of StateMachineMetadata lose the prefix entirely: EpochInfo, ProtocolMetadata, Blacklist. The wire format is unchanged — canoto keys off the tag numbers, which still read 1,2,3,4,5, and the generated .canoto.go files were renamed in step with the source. The msm fuzz and encoding round-trip tests cover this. - Prose cites the protocol paper by reference number instead of by name, so the origin stays findable without the name. The HyperSDK sentence still says Avalanche because that sentence is about Avalanche's VM and is true. Also here, from review of the logger port: - monitor_test's Fatal panics instead of returning. It reported a state the caller had declared impossible and then carried on regardless, which made it the one Fatal in the tree that was weaker than the original. - TestInstanceNonValidatorBootstraps asserts the property it is named for — that the node was still a non-validator when the bootstrap finished — rather than counting how many times a debug line was emitted. The count tracks how often onEpochChange happened to observe the branch, so transitions can coalesce; it measured 2 here where it had been reliably 3, and a logger-cost explanation was tested and refuted. The count never checked the property either way: a node that wrongly became a validator mid-bootstrap would still have counted 3. - SilenceExceptKeywords documents last-call-wins, and Trace/Verbo now reaching hooks is recorded where a future hook author will see it. Co-authored-by: Hanzo Dev <[email protected]>
300 lines
8.4 KiB
Go
300 lines
8.4 KiB
Go
// Copyright (C) 2019-2025, Ava Labs, Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package nonvalidator
|
|
|
|
import (
|
|
"context"
|
|
"testing"
|
|
|
|
"github.com/luxfi/bft/common"
|
|
"github.com/luxfi/bft/testutil"
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
// sealingTestBlock wraps testutil.TestBlock so tests can control whether the
|
|
// block reports itself as a sealing block.
|
|
type sealingTestBlock struct {
|
|
*testutil.TestBlock
|
|
sealingInfo *common.SealingBlockInfo
|
|
}
|
|
|
|
func (b *sealingTestBlock) SealingBlockInfo() *common.SealingBlockInfo {
|
|
return b.sealingInfo
|
|
}
|
|
|
|
func (b *sealingTestBlock) Verify(_ context.Context) (common.VerifiedBlock, error) {
|
|
return b, nil
|
|
}
|
|
|
|
func newSealingTestBlock(seq, epoch uint64, prev common.Digest, sealingInfo *common.SealingBlockInfo) *sealingTestBlock {
|
|
return &sealingTestBlock{
|
|
TestBlock: testutil.NewTestBlock(common.ProtocolMetadata{
|
|
Seq: seq,
|
|
Round: seq,
|
|
Epoch: epoch,
|
|
Prev: prev,
|
|
}, common.Blacklist{}),
|
|
sealingInfo: sealingInfo,
|
|
}
|
|
}
|
|
|
|
type indexedBlock struct {
|
|
seq uint64
|
|
round uint64
|
|
epoch uint64
|
|
sealingInfo *common.SealingBlockInfo
|
|
}
|
|
|
|
func TestNewEpochs(t *testing.T) {
|
|
// nonBFTBlock represents a block from before the first ever BFT block —
|
|
// i.e., genesis(epoch 0) or the last block produced by the prior consensus (Snowman).
|
|
// Its epoch is 0 and it has no sealing info.
|
|
var nonBFTBlock = indexedBlock{seq: 0, round: 0, epoch: 0, sealingInfo: nil}
|
|
|
|
nodes := common.Nodes{
|
|
{Id: common.NodeID{1}},
|
|
{Id: common.NodeID{2}},
|
|
{Id: common.NodeID{3}},
|
|
{Id: common.NodeID{4}},
|
|
}
|
|
|
|
sigAggCreator := func(n []common.Node) common.SignatureAggregator {
|
|
return &testutil.TestSignatureAggregator{N: len(n)}
|
|
}
|
|
|
|
tests := []struct {
|
|
name string
|
|
blocks []indexedBlock
|
|
expectedErr error
|
|
expectedEpoch uint64
|
|
expectEmpty bool
|
|
expectedLen int
|
|
}{
|
|
{
|
|
name: "no last accepted",
|
|
blocks: nil,
|
|
expectedErr: errNoGenesis,
|
|
},
|
|
{
|
|
// genesis is the only block — pre-BFT, epoch 0.
|
|
name: "last accepted is genesis",
|
|
blocks: []indexedBlock{
|
|
nonBFTBlock,
|
|
},
|
|
expectEmpty: true,
|
|
},
|
|
{
|
|
// the latest block is itself a sealing block at seq 2.
|
|
name: "last accepted is sealing",
|
|
blocks: []indexedBlock{
|
|
nonBFTBlock,
|
|
{seq: 1, round: 1, epoch: 1, sealingInfo: &common.SealingBlockInfo{ValidatorSet: nodes}},
|
|
{seq: 2, round: 2, epoch: 2, sealingInfo: &common.SealingBlockInfo{ValidatorSet: nodes}},
|
|
},
|
|
expectedEpoch: 2,
|
|
expectedLen: 1,
|
|
},
|
|
{
|
|
// the latest block is not a sealing block; epoch field points back to
|
|
// the sealing block at seq 1.
|
|
name: "last accepted is not sealing",
|
|
blocks: []indexedBlock{
|
|
nonBFTBlock,
|
|
{seq: 1, round: 1, epoch: 1, sealingInfo: &common.SealingBlockInfo{ValidatorSet: nodes}},
|
|
{seq: 2, round: 2, epoch: 1, sealingInfo: nil},
|
|
{seq: 3, round: 3, epoch: 1, sealingInfo: nil},
|
|
},
|
|
expectedEpoch: 1,
|
|
expectedLen: 1,
|
|
},
|
|
{
|
|
// the latest block is not a sealing block; its epoch field points back to
|
|
// the block at seq 1, but that block has no sealing info either.
|
|
name: "referenced block is missing sealing info",
|
|
blocks: []indexedBlock{
|
|
nonBFTBlock,
|
|
{seq: 1, round: 1, epoch: 1, sealingInfo: nil},
|
|
{seq: 2, round: 2, epoch: 1, sealingInfo: nil},
|
|
},
|
|
expectedErr: errMissingSealingInfo,
|
|
},
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
storage := testutil.NewInMemStorage()
|
|
for _, b := range tt.blocks {
|
|
block := newSealingTestBlock(b.seq, b.epoch, common.Digest{}, b.sealingInfo)
|
|
require.NoError(t, storage.Index(context.Background(), block, common.Finalization{}))
|
|
}
|
|
|
|
epochs, err := newEpochs(storage, sigAggCreator)
|
|
require.ErrorIs(t, err, tt.expectedErr)
|
|
if err != nil {
|
|
return
|
|
}
|
|
|
|
if tt.expectEmpty {
|
|
require.Empty(t, epochs)
|
|
return
|
|
}
|
|
|
|
require.Len(t, epochs, tt.expectedLen)
|
|
meta, ok := epochs[tt.expectedEpoch]
|
|
require.True(t, ok)
|
|
require.Equal(t, tt.expectedEpoch, meta.epoch)
|
|
require.Equal(t, nodes, meta.nodes)
|
|
require.Len(t, meta.eligibleSigners, len(nodes))
|
|
for _, n := range nodes {
|
|
_, ok := meta.eligibleSigners[string(n.Id)]
|
|
require.True(t, ok)
|
|
}
|
|
require.NotNil(t, meta.signatureAggregator)
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestRemoveOldEpochs(t *testing.T) {
|
|
newEpochsMap := func() epochs {
|
|
return epochs{
|
|
1: &epochMetadata{epoch: 1},
|
|
2: &epochMetadata{epoch: 2},
|
|
3: &epochMetadata{epoch: 3},
|
|
4: &epochMetadata{epoch: 4},
|
|
}
|
|
}
|
|
|
|
tests := []struct {
|
|
name string
|
|
startEpoch uint64
|
|
expectedEpochs []uint64
|
|
}{
|
|
{
|
|
name: "remove none",
|
|
startEpoch: 0,
|
|
expectedEpochs: []uint64{1, 2, 3, 4},
|
|
},
|
|
{
|
|
name: "remove some",
|
|
startEpoch: 3,
|
|
expectedEpochs: []uint64{3, 4},
|
|
},
|
|
{
|
|
name: "remove all",
|
|
startEpoch: 5,
|
|
expectedEpochs: []uint64{},
|
|
},
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
e := newEpochsMap()
|
|
e.removeOldEpochs(tt.startEpoch)
|
|
|
|
require.Len(t, e, len(tt.expectedEpochs))
|
|
for _, epoch := range tt.expectedEpochs {
|
|
_, ok := e[epoch]
|
|
require.True(t, ok, "expected epoch %d to remain", epoch)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
// TestCanValidate checks whether the epochs struct properly validates higher epochs
|
|
// by keeping track of received sealing blocks.
|
|
func TestCanValidate(t *testing.T) {
|
|
tc := newSeededChain(t, testNodes, 2)
|
|
// create our epochs
|
|
e3, e4, e5 := tc.appendSealing(testNodes), tc.appendSealing(testNodes), tc.appendSealing(testNodes)
|
|
b6 := tc.appendBlock()
|
|
|
|
sigAggCreator := func(n []common.Node) common.SignatureAggregator {
|
|
return &testutil.TestSignatureAggregator{N: len(n)}
|
|
}
|
|
|
|
epochs, err := newEpochs(tc, sigAggCreator)
|
|
require.NoError(t, err)
|
|
|
|
// should not be able to validate anything yet
|
|
require.False(t, epochs.canValidate(b6))
|
|
require.False(t, epochs.canValidate(e5))
|
|
require.False(t, epochs.canValidate(e4))
|
|
require.False(t, epochs.canValidate(e3))
|
|
|
|
// say epoch 5 has been seen f + 1 times
|
|
epochs[e5.Metadata.Seq] = newEpochMetadata(e5.Metadata.Seq, e5.SealingBlockInfo(), sigAggCreator)
|
|
|
|
// we should be able to validate backwards now
|
|
require.False(t, epochs.canValidate(b6))
|
|
require.False(t, epochs.canValidate(e5))
|
|
require.True(t, epochs.canValidate(e4))
|
|
require.False(t, epochs.canValidate(e3))
|
|
|
|
epochs[e4.Metadata.Seq] = newEpochMetadata(e4.Metadata.Seq, e4.SealingBlockInfo(), sigAggCreator)
|
|
require.False(t, epochs.canValidate(b6))
|
|
require.False(t, epochs.canValidate(e5))
|
|
require.False(t, epochs.canValidate(e4)) // cannot validate twice
|
|
require.True(t, epochs.canValidate(e3))
|
|
}
|
|
|
|
func newSealingQuorumRound(epoch uint64, numValidators int) *common.QuorumRound {
|
|
validatorSet := make(common.Nodes, numValidators)
|
|
for i := range validatorSet {
|
|
validatorSet[i] = common.Node{Id: common.NodeID{byte(i + 1)}, Weight: 1}
|
|
}
|
|
|
|
return &common.QuorumRound{
|
|
Block: newSealingTestBlock(1, epoch, common.Digest{}, &common.SealingBlockInfo{
|
|
ValidatorSet: validatorSet,
|
|
}),
|
|
}
|
|
}
|
|
|
|
type testValidatorSetRetriever struct {
|
|
nodes common.Nodes
|
|
}
|
|
|
|
func (v *testValidatorSetRetriever) Validators() common.Nodes {
|
|
return v.nodes
|
|
}
|
|
|
|
// TestCollectedQuorumRound feeds an epochReplicator a sealing-block quorum round
|
|
// for an unknown epoch and asserts collectedQuorumRound only confirms the epoch
|
|
// once a threshold of distinct validators have voted for the same digest.
|
|
func TestCollectedQuorumRound(t *testing.T) {
|
|
tests := []struct {
|
|
name string
|
|
qr *common.QuorumRound
|
|
}{
|
|
{
|
|
name: "4 validator nodes",
|
|
qr: newSealingQuorumRound(1, 4),
|
|
},
|
|
{
|
|
name: "16 validator nodes",
|
|
qr: newSealingQuorumRound(1, 16),
|
|
},
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
voters := tt.qr.Block.SealingBlockInfo().ValidatorSet
|
|
// votes required to confirm the epoch.
|
|
threshold := common.F(len(voters)) + 1
|
|
require.GreaterOrEqual(t, len(voters), threshold, "need at least threshold validators to vote with")
|
|
e := newEpochReplicator(testutil.MakeLogger(t, 1), &testValidatorSetRetriever{
|
|
nodes: voters,
|
|
})
|
|
|
|
// Each distinct vote below the threshold leaves the epoch unconfirmed.
|
|
for i := 0; i < threshold-1; i++ {
|
|
require.False(t, e.collectedSealingBlockInfo(tt.qr.Block.SealingBlockInfo(), tt.qr.Block.BlockHeader(), voters[i].Id))
|
|
}
|
|
|
|
// The threshold-th distinct vote for the same digest confirms it.
|
|
require.True(t, e.collectedSealingBlockInfo(tt.qr.Block.SealingBlockInfo(), tt.qr.Block.BlockHeader(), voters[threshold-1].Id))
|
|
})
|
|
}
|
|
}
|