mirror of
https://github.com/logos-blockchain/logos-blockchain-specs.git
synced 2026-01-08 08:03:13 +00:00
d8d22e7219
* Cleanup * Leaf committee member vote. * Leaf committee member vote, test. * Leaf committee member vote, test. * Description * Description * Description-refactoring * Cleanup * Fix leaf votes test * Clean overlay * Test single committee advances * Remove unhappy path test file * Update carnot description * Refactor local_timeout for NewView * Fix unhappy path conditions and added broadcasting * Unhappy path tests description * Commit all grandparents of a block from latest_committed view * Cleanup docs * Add unhappy path test vector * Remove block content --------- Co-authored-by: mjalalzai <33738574+MForensic@users.noreply.github.com>
23 lines
1.1 KiB
Python
23 lines
1.1 KiB
Python
# Unhappy path tests
|
|
|
|
# 1: At the end of the timeout the highQC in the next leader's aggregatedQC should be the highestQC held by the
|
|
# majority of nodes or a qc higher than th highestQC held by the majority of nodes.
|
|
# Majority means more than two thirds of total number of nodes, randomly assigned to committees.
|
|
|
|
|
|
# 2: Have consecutive view changes and verify the following state variable:
|
|
# last_timeout_view_qc.view
|
|
# high_qc.view
|
|
# current_view
|
|
# last_voted_view
|
|
|
|
# 3: Due failure consecutive condition between parent and grand parent blocks might not meet. So whenever the
|
|
# Consecutive view condition in the try_to_commit fails, then all the blocks between the latest_committed_block and the
|
|
# grandparent (including the grandparent) must be committed in order.
|
|
# As far as I know current code only excutes the grandparent only. It should also address the case above.
|
|
|
|
|
|
# 4: Have consecutive success adding two blocks then a failure and two consecutive success + 1 failure+ 1 success
|
|
# S1 <- S2 <- F1 <- S3 <- S4 <-F2 <- S5
|
|
|
|
# At S3, S1 should be committed. At S5, S2 and S3 must be committed |