Page MenuHomePhabricator
Differential D2045 Diff 6060 src/test/avalanche_tests.cpp

Changeset View

Standalone View

View Options

src/test/avalanche_tests.cpp

Show All 12 Lines static std::vector<CInv> getInvsForNextPoll(const AvalancheProcessor &p) {
return p.getInvsForNextPoll(); return p.getInvsForNextPoll();
} }
}; };
BOOST_FIXTURE_TEST_SUITE(avalanche_tests, TestChain100Setup) BOOST_FIXTURE_TEST_SUITE(avalanche_tests, TestChain100Setup)
#define REGISTER_VOTE_AND_CHECK(vr, vote, state, finalized, confidence) \ #define REGISTER_VOTE_AND_CHECK(vr, vote, state, finalized, confidence) \
vr.registerVote(vote); \ vr.registerVote(vote); \
BOOST_CHECK_EQUAL(vr.isValid(), state); \ BOOST_CHECK_EQUAL(vr.isAccepted(), state); \
BOOST_CHECK_EQUAL(vr.hasFinalized(), finalized); \ BOOST_CHECK_EQUAL(vr.hasFinalized(), finalized); \
BOOST_CHECK_EQUAL(vr.getConfidence(), confidence); BOOST_CHECK_EQUAL(vr.getConfidence(), confidence);
BOOST_AUTO_TEST_CASE(vote_record) { BOOST_AUTO_TEST_CASE(vote_record) {
VoteRecord vr; VoteRecord vr;
// Check initial state. // Check initial state.
BOOST_CHECK_EQUAL(vr.isValid(), false); BOOST_CHECK_EQUAL(vr.isAccepted(), false);
BOOST_CHECK_EQUAL(vr.hasFinalized(), false); BOOST_CHECK_EQUAL(vr.hasFinalized(), false);
BOOST_CHECK_EQUAL(vr.getConfidence(), 0); BOOST_CHECK_EQUAL(vr.getConfidence(), 0);
// We register one vote for, which keep things at 4/4. // We register one vote for, which keep things at 4/4.
REGISTER_VOTE_AND_CHECK(vr, true, false, false, 0); REGISTER_VOTE_AND_CHECK(vr, true, false, false, 0);
// One more and we are at 5/3. // One more and we are at 5/3.
REGISTER_VOTE_AND_CHECK(vr, true, false, false, 0); REGISTER_VOTE_AND_CHECK(vr, true, false, false, 0);
Show All 29 Lines for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) {
REGISTER_VOTE_AND_CHECK(vr, false, false, false, i); REGISTER_VOTE_AND_CHECK(vr, false, false, false, i);
} }
// The next vote will finalize the decision. // The next vote will finalize the decision.
REGISTER_VOTE_AND_CHECK(vr, true, false, true, REGISTER_VOTE_AND_CHECK(vr, true, false, true,
AVALANCHE_FINALIZATION_SCORE); AVALANCHE_FINALIZATION_SCORE);
} }
BOOST_AUTO_TEST_CASE(block_update) {
CBlockIndex index;
CBlockIndex *pindex = &index;
std::set<AvalancheBlockUpdate::Status> status{
AvalancheBlockUpdate::Status::Invalid,
AvalancheBlockUpdate::Status::Rejected,
AvalancheBlockUpdate::Status::Accepted,
AvalancheBlockUpdate::Status::Finalized,
};
for (auto s : status) {
AvalancheBlockUpdate abu(pindex, s);
BOOST_CHECK(abu.getBlockIndex() == pindex);
BOOST_CHECK_EQUAL(abu.getStatus(), s);
}
}
BOOST_AUTO_TEST_CASE(block_register) { BOOST_AUTO_TEST_CASE(block_register) {
AvalancheProcessor p; AvalancheProcessor p;
std::vector<AvalancheBlockUpdate> updates;
CBlock block = CreateAndProcessBlock({}, CScript()); CBlock block = CreateAndProcessBlock({}, CScript());
const uint256 blockHash = block.GetHash(); const uint256 blockHash = block.GetHash();
const CBlockIndex *pindex = mapBlockIndex[blockHash]; const CBlockIndex *pindex = mapBlockIndex[blockHash];
// Querying for random block returns false. // Querying for random block returns false.
BOOST_CHECK(!p.isAccepted(pindex)); BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK(!p.hasFinalized(pindex));
// Add a new block. Check it is added to the polls. // Add a new block. Check it is added to the polls.
BOOST_CHECK(p.addBlockToReconcile(pindex)); BOOST_CHECK(p.addBlockToReconcile(pindex));
auto invs = AvalancheTest::getInvsForNextPoll(p); auto invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 1); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHash); BOOST_CHECK(invs[0].hash == blockHash);
// Newly added blocks are also considered rejected. // Newly added blocks are also considered rejected.
BOOST_CHECK(!p.isAccepted(pindex)); BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK(!p.hasFinalized(pindex));
// Let's vote for this block a few times. // Let's vote for this block a few times.
AvalancheResponse resp{0, {AvalancheVote(0, blockHash)}}; AvalancheResponse resp{0, {AvalancheVote(0, blockHash)}};
for (int i = 0; i < 5; i++) { for (int i = 0; i < 5; i++) {
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK(!p.isAccepted(pindex)); BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK(!p.hasFinalized(pindex)); BOOST_CHECK_EQUAL(updates.size(), 0);
} }
// Now the state will flip.
p.registerVotes(resp, updates);
BOOST_CHECK(p.isAccepted(pindex));
BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(updates[0].getBlockIndex() == pindex);
BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Accepted);
updates = {};
// Now it is accepted, but we can vote for it numerous times. // Now it is accepted, but we can vote for it numerous times.
for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) { for (int i = 1; i < AVALANCHE_FINALIZATION_SCORE; i++) {
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK(p.isAccepted(pindex)); BOOST_CHECK(p.isAccepted(pindex));
BOOST_CHECK(!p.hasFinalized(pindex)); BOOST_CHECK_EQUAL(updates.size(), 0);
} }
// As long as it is not finalized, we poll. // As long as it is not finalized, we poll.
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 1); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHash); BOOST_CHECK(invs[0].hash == blockHash);
// Now finalize the decision. // Now finalize the decision.
resp = {0, {AvalancheVote(1, blockHash)}}; p.registerVotes(resp, updates);
p.registerVotes(resp); BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(p.isAccepted(pindex)); BOOST_CHECK(updates[0].getBlockIndex() == pindex);
BOOST_CHECK(p.hasFinalized(pindex)); BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Finalized);
updates = {};
// Once the decision is finalized, there is no poll for it. // Once the decision is finalized, there is no poll for it.
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 0); BOOST_CHECK_EQUAL(invs.size(), 0);
// Now let's undo this and finalize rejection. // Now let's undo this and finalize rejection.
for (int i = 0; i < 5; i++) { BOOST_CHECK(p.addBlockToReconcile(pindex));
p.registerVotes(resp); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK(p.isAccepted(pindex)); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK(p.hasFinalized(pindex)); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHash);
// Only 3 here as we don't need to flip state.
resp = {0, {AvalancheVote(1, blockHash)}};
for (int i = 0; i < 3; i++) {
p.registerVotes(resp, updates);
BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK_EQUAL(updates.size(), 0);
} }
// Now it is rejected, but we can vote for it numerous times. // Now it is rejected, but we can vote for it numerous times.
for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) { for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE; i++) {
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK(!p.isAccepted(pindex)); BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK(!p.hasFinalized(pindex)); BOOST_CHECK_EQUAL(updates.size(), 0);
} }
// As long as it is not finalized, we poll. // As long as it is not finalized, we poll.
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 1); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHash); BOOST_CHECK(invs[0].hash == blockHash);
// Now finalize the decision. // Now finalize the decision.
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK(!p.isAccepted(pindex)); BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK(p.hasFinalized(pindex)); BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(updates[0].getBlockIndex() == pindex);
BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Invalid);
updates = {};
// Once the decision is finalized, there is no poll for it. // Once the decision is finalized, there is no poll for it.
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 0); BOOST_CHECK_EQUAL(invs.size(), 0);
// Adding the block twice does nothing. // Adding the block twice does nothing.
BOOST_CHECK(p.addBlockToReconcile(pindex));
BOOST_CHECK(!p.addBlockToReconcile(pindex)); BOOST_CHECK(!p.addBlockToReconcile(pindex));
BOOST_CHECK(!p.isAccepted(pindex)); BOOST_CHECK(!p.isAccepted(pindex));
BOOST_CHECK(p.hasFinalized(pindex));
} }
BOOST_AUTO_TEST_CASE(multi_block_register) { BOOST_AUTO_TEST_CASE(multi_block_register) {
AvalancheProcessor p; AvalancheProcessor p;
CBlockIndex indexA, indexB; CBlockIndex indexA, indexB;
std::vector<AvalancheBlockUpdate> updates;
// Make sure the block has a hash. // Make sure the block has a hash.
CBlock blockA = CreateAndProcessBlock({}, CScript()); CBlock blockA = CreateAndProcessBlock({}, CScript());
const uint256 blockHashA = blockA.GetHash(); const uint256 blockHashA = blockA.GetHash();
const CBlockIndex *pindexA = mapBlockIndex[blockHashA]; const CBlockIndex *pindexA = mapBlockIndex[blockHashA];
CBlock blockB = CreateAndProcessBlock({}, CScript()); CBlock blockB = CreateAndProcessBlock({}, CScript());
const uint256 blockHashB = blockB.GetHash(); const uint256 blockHashB = blockB.GetHash();
const CBlockIndex *pindexB = mapBlockIndex[blockHashB]; const CBlockIndex *pindexB = mapBlockIndex[blockHashB];
// Querying for random block returns false. // Querying for random block returns false.
BOOST_CHECK(!p.isAccepted(pindexA)); BOOST_CHECK(!p.isAccepted(pindexA));
BOOST_CHECK(!p.isAccepted(pindexB)); BOOST_CHECK(!p.isAccepted(pindexB));
// Start voting on block A. // Start voting on block A.
BOOST_CHECK(p.addBlockToReconcile(pindexA)); BOOST_CHECK(p.addBlockToReconcile(pindexA));
auto invs = AvalancheTest::getInvsForNextPoll(p); auto invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 1); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHashA); BOOST_CHECK(invs[0].hash == blockHashA);
AvalancheResponse resp{ AvalancheResponse resp{
0, {AvalancheVote(0, blockHashA), AvalancheVote(0, blockHashB)}}; 0, {AvalancheVote(0, blockHashA), AvalancheVote(0, blockHashB)}};
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 0);
// Start voting on block B after one vote. // Start voting on block B after one vote.
BOOST_CHECK(p.addBlockToReconcile(pindexB)); BOOST_CHECK(p.addBlockToReconcile(pindexB));
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 2); BOOST_CHECK_EQUAL(invs.size(), 2);
// Ensure B comes before A because it has accumulated more PoW. // Ensure B comes before A because it has accumulated more PoW.
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHashB); BOOST_CHECK(invs[0].hash == blockHashB);
BOOST_CHECK_EQUAL(invs[1].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[1].type, MSG_BLOCK);
BOOST_CHECK(invs[1].hash == blockHashA); BOOST_CHECK(invs[1].hash == blockHashA);
// Let's vote for this block a few times.
for (int i = 0; i < 4; i++) {
p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 0);
}
// Now the state will flip for A.
p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(updates[0].getBlockIndex() == pindexA);
BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Accepted);
updates = {};
// And then for B.
p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(updates[0].getBlockIndex() == pindexB);
BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Accepted);
updates = {};
// Now it is rejected, but we can vote for it numerous times. // Now it is rejected, but we can vote for it numerous times.
for (int i = 0; i < AVALANCHE_FINALIZATION_SCORE + 4; i++) { for (int i = 2; i < AVALANCHE_FINALIZATION_SCORE; i++) {
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 0);
} }
// Next vote will finalize block A. // Next vote will finalize block A.
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(updates[0].getBlockIndex() == pindexA);
BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Finalized);
updates = {};
// We do not vote on A anymore. // We do not vote on A anymore.
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 1); BOOST_CHECK_EQUAL(invs.size(), 1);
BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK); BOOST_CHECK_EQUAL(invs[0].type, MSG_BLOCK);
BOOST_CHECK(invs[0].hash == blockHashB); BOOST_CHECK(invs[0].hash == blockHashB);
// Next vote will finalize block B. // Next vote will finalize block B.
p.registerVotes(resp); p.registerVotes(resp, updates);
BOOST_CHECK_EQUAL(updates.size(), 1);
BOOST_CHECK(updates[0].getBlockIndex() == pindexB);
BOOST_CHECK_EQUAL(updates[0].getStatus(),
AvalancheBlockUpdate::Status::Finalized);
updates = {};
// There is nothing left to vote on. // There is nothing left to vote on.
invs = AvalancheTest::getInvsForNextPoll(p); invs = AvalancheTest::getInvsForNextPoll(p);
BOOST_CHECK_EQUAL(invs.size(), 0); BOOST_CHECK_EQUAL(invs.size(), 0);
} }
BOOST_AUTO_TEST_CASE(event_loop) { BOOST_AUTO_TEST_CASE(event_loop) {
AvalancheProcessor p; AvalancheProcessor p;
▲ Show 20 Lines • Show All 51 Lines • Show Last 20 Lines