Examples with DeterministicTest com.radixdlt.harness.deterministic.DeterministicTest used on opensource projects

Example 1 with DeterministicTest

use of com.radixdlt.harness.deterministic.DeterministicTest in project radixdlt by radixdlt.

the class OneProposalTimeoutResponsiveTest method run.

private void run(int numNodes, long numViews, long dropPeriod) {
    DeterministicTest test = DeterministicTest.builder().numNodes(numNodes).messageSelector(MessageSelector.randomSelector(random)).messageMutator(dropSomeProposals(dropPeriod)).buildWithoutEpochs().runUntil(DeterministicTest.hasReachedView(View.of(numViews)));
    long requiredIndirectParents = numNodes <= 3 ? // there are no indirect parents for 3 nodes (QC is always formed)
    0 : // Edge case if dropPeriod a factor of numViews
    (numViews - 1) / dropPeriod;
    long requiredTimeouts = numViews / dropPeriod * 2;
    long timeoutQuorums = numNodes <= 3 ? // no timeout quorums for 3 nodes
    0 : // otherwise, every 2nd timeout forms a TC
    requiredTimeouts / 2;
    for (int nodeIndex = 0; nodeIndex < numNodes; ++nodeIndex) {
        SystemCounters counters = test.getSystemCounters(nodeIndex);
        long numberOfIndirectParents = counters.get(CounterType.BFT_VERTEX_STORE_INDIRECT_PARENTS);
        long totalNumberOfTimeouts = counters.get(CounterType.BFT_PACEMAKER_TIMEOUTS_SENT);
        long totalNumberOfTimeoutQuorums = counters.get(CounterType.BFT_TIMEOUT_QUORUMS);
        assertThat(numberOfIndirectParents).isEqualTo(requiredIndirectParents);
        assertThat(totalNumberOfTimeouts).isEqualTo(requiredTimeouts);
        assertThat(totalNumberOfTimeoutQuorums).isBetween(timeoutQuorums - 1, timeoutQuorums);
    }
}

Example 2 with DeterministicTest

use of com.radixdlt.harness.deterministic.DeterministicTest in project radixdlt by radixdlt.

the class PacemakerViewUpdateRaceConditionTest method test_pacemaker_view_update_race_condition.

@Test
public void test_pacemaker_view_update_race_condition() {
    final DeterministicTest test = DeterministicTest.builder().numNodes(numNodes).messageSelector(MessageSelector.randomSelector(random)).messageMutator(messUpMessagesForNodeUnderTest()).pacemakerTimeout(pacemakerTimeout).overrideWithIncorrectModule(new AbstractModule() {

        @ProvidesIntoSet
        @ProcessOnDispatch
        private EventProcessor<BFTInsertUpdate> bftInsertUpdateProcessor() {
            final Map<HashCode, PreparedVertex> insertedVertices = new HashMap<>();
            return bftInsertUpdate -> {
                final PreparedVertex inserted = bftInsertUpdate.getInserted();
                insertedVertices.putIfAbsent(inserted.getId(), inserted);
                final Optional<PreparedVertex> maybeParent = Optional.ofNullable(insertedVertices.get(inserted.getParentId()));
                maybeParent.ifPresent(parent -> {
                    if (parent.getView().equals(inserted.getView())) {
                        throw new IllegalStateException("Vertex can't have the same view as its parent.");
                    }
                });
            };
        }

        @Provides
        public ProposerElection proposerElection(BFTValidatorSet validatorSet) {
            final var sortedValidators = validatorSet.getValidators().stream().map(BFTValidator::getNode).sorted(Comparator.comparing(BFTNode::getKey, KeyComparator.instance().reversed())).toList();
            return view -> sortedValidators.get(((int) view.number() - 1) % sortedValidators.size());
        }
    }).buildWithoutEpochs().runUntil(nodeUnderTestReachesView(View.of(3)));
    final var counters = test.getSystemCounters(nodeUnderTestIndex);
    assertThat(counters.get(SystemCounters.CounterType.BFT_VOTE_QUORUMS)).isEqualTo(// ensure that quorum was formed
    2);
    assertThat(counters.get(SystemCounters.CounterType.BFT_PACEMAKER_TIMEOUTS_SENT)).isEqualTo(// ensure that timeouts were processed
    2);
}

Example 3 with DeterministicTest

use of com.radixdlt.harness.deterministic.DeterministicTest in project radixdlt by radixdlt.

the class QuorumWithoutALeaderWithTimeoutsTest method run.

private void run(int numNodes, long numViews) {
    final DeterministicTest test = DeterministicTest.builder().numNodes(numNodes).messageSelector(MessageSelector.randomSelector(random)).messageMutator(dropAllNonTimeoutVotes()).buildWithoutEpochs().runUntil(DeterministicTest.hasReachedView(View.of(numViews)));
    for (int nodeIndex = 0; nodeIndex < numNodes; ++nodeIndex) {
        final SystemCounters counters = test.getSystemCounters(nodeIndex);
        final long numberOfIndirectParents = counters.get(CounterType.BFT_VERTEX_STORE_INDIRECT_PARENTS);
        final long totalNumberOfTimeouts = counters.get(CounterType.BFT_PACEMAKER_TIMEOUTS_SENT);
        final long totalNumberOfTimeoutQuorums = counters.get(CounterType.BFT_TIMEOUT_QUORUMS);
        final long totalNumberOfVoteQuorums = counters.get(CounterType.BFT_VOTE_QUORUMS);
        // no TCs
        assertThat(totalNumberOfTimeoutQuorums).isEqualTo(0);
        // no indirect parents
        assertThat(numberOfIndirectParents).isEqualTo(0);
        // a timeout for each view
        assertThat(totalNumberOfTimeouts).isEqualTo(numViews - 1);
        assertThat(totalNumberOfVoteQuorums).isBetween(numViews - 2, // quorum count matches views
        numViews);
    }
}

Example 4 with DeterministicTest

use of com.radixdlt.harness.deterministic.DeterministicTest in project radixdlt by radixdlt.

the class RandomChannelOrderResponsiveTest method run.

private void run(int numNodes, long viewsToRun) {
    assertEquals(0, viewsToRun % numNodes);
    final Random random = new Random(12345);
    DeterministicTest test = DeterministicTest.builder().numNodes(numNodes).messageSelector(MessageSelector.randomSelector(random)).messageMutator(MessageMutator.dropTimeouts()).buildWithoutEpochs().runUntil(DeterministicTest.hasReachedView(View.of(viewsToRun)));
    List<Long> proposalsMade = IntStream.range(0, numNodes).mapToObj(test::getSystemCounters).map(counters -> counters.get(CounterType.BFT_PACEMAKER_PROPOSALS_SENT)).collect(ImmutableList.toImmutableList());
    final long numViews = viewsToRun / numNodes;
    assertThat(proposalsMade).hasSize(numNodes).areAtLeast(numNodes - 1, new Condition<>(l -> l == numViews, "has as many proposals as views")).areAtMost(1, new Condition<>(l -> l == numViews - 1, "has one less proposal"));
}

Example 5 with DeterministicTest

use of com.radixdlt.harness.deterministic.DeterministicTest in project radixdlt by radixdlt.

the class MovingWindowValidatorsTest method run.

private void run(int numNodes, int windowSize, long maxEpoch, View highView) {
    DeterministicTest bftTest = DeterministicTest.builder().numNodes(numNodes).messageMutator(mutator()).messageSelector(firstSelector()).epochNodeIndexesMapping(windowedEpochToNodesMapper(windowSize, numNodes)).buildWithEpochs(highView).runUntil(DeterministicTest.hasReachedEpochView(EpochView.of(maxEpoch, highView)));
    LinkedList<SystemCounters> testCounters = systemCounters(bftTest);
    assertThat(testCounters).extracting(sc -> sc.get(CounterType.BFT_VERTEX_STORE_INDIRECT_PARENTS)).containsOnly(0L);
    assertThat(testCounters).extracting(sc -> sc.get(CounterType.BFT_PACEMAKER_TIMEOUTS_SENT)).containsOnly(0L);
    long maxCount = maxProcessedFor(numNodes, windowSize, maxEpoch, highView.number());
    assertThat(testCounters).extracting(sc -> sc.get(CounterType.BFT_COMMITTED_VERTICES)).allMatch(between(maxCount - maxEpoch, maxCount));
}