consensus-test
Safe HaskellSafe-Inferred
LanguageHaskell2010

Test.Consensus.Genesis.Setup.Classifiers

Synopsis

Documentation

data Classifiers Source #

Interesting categories to classify test inputs

Constructors

Classifiers 

Fields

  • existsSelectableAdversaryBool

    There are more than k blocks in at least one alternative chain after the intersection

  • allAdversariesSelectableBool

    There are more than k blocks in all alternative chains after the intersection. Note that this is always guaranteed for the honest chain.

  • allAdversariesForecastableBool

    There is always at least one block per sliding forecast window in all alternative chains. Note that this is always guaranteed for the honest chain.

  • allAdversariesKPlus1InForecastBool

    All adversaries have at least k+1 block in the forecast window the follows their intersection with the trunk. Note that the generator always enforces that the trunk wins in all _Genesis_ windows after the intersection. In particular, if sgen = sfor, then the trunk will have at least k+2.

  • genesisWindowAfterIntersectionBool

    There are at least scg slots after the intersection on both the honest and the alternative chain

    Knowing if there is a Genesis window after the intersection is important because otherwise the Genesis node has no chance to advance the immutable tip past the Limit on Eagerness.

  • longerThanGenesisWindowBool

    The honest chain's slot count is greater than or equal to the Genesis window size.

data ResultClassifiers Source #

Interesting categories to classify test results

Constructors

ResultClassifiers 

Fields

data ScheduleClassifiers Source #

Constructors

ScheduleClassifiers 

Fields

classifiersHasHeader blk ⇒ GenesisTest blk schedule → Classifiers Source #