• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Aleobft
      • Aleobft-static
      • Aleobft-stake2
      • Aleobft-dynamic
      • Aleobft-stake
        • Correctness
          • Unequivocal-dags-def-and-init
          • Same-committees-def-and-implied
          • Signer-records
          • Dag-omni-paths
          • Unequivocal-dags-next
          • Quorum-intersection
          • Previous-quorum-def-and-init-and-next
          • Unequivocal-signed-certificates
          • Same-associated-certificates
          • Nonforking-anchors-def-and-init-and-next
          • Signed-previous-quorum
          • Successor-predecessor-intersection
          • Fault-tolerance
          • Last-anchor-voters-def-and-init-and-next
          • Signer-quorum
          • Committed-redundant-def-and-init-and-next
          • Nonforking-blockchains-def-and-init
          • Dag-committees
          • No-self-messages
          • Blockchain-redundant-def-and-init-and-next
          • Backward-closure
          • Anchors-extension
          • Nonforking-blockchains-next
          • No-self-endorsed
          • Associated-certificates
          • Last-anchor-present
          • No-self-buffer
          • Signed-certificates
          • Last-blockchain-round
          • Dag-certificate-next
          • Omni-paths-def-and-implied
          • Simultaneous-induction
          • Ordered-even-blocks
          • Last-anchor-def-and-init
          • Last-anchor-next
          • Previous-quorum
          • Committed-anchors-sequences
          • Omni-paths
          • Last-anchor-voters
          • Unequivocal-dag
            • Unequivocal-dags-certificates-p-always
          • Signed-and-associated-cerificates
          • Nonforking-blockchains
          • Nonforking-anchors
          • Committed-redundant
          • Same-committees
          • Blockchain-redundant
        • Definition
      • Library-extensions
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
    • C
    • Java
    • Taspi
    • Bitcoin
    • Des
    • Ethereum
    • X86isa
    • Sha-2
    • Riscv
    • Yul
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
    • Where-do-i-place-my-book
    • Bigmems
    • Builtins
    • Axe
    • Execloader
    • Solidity
    • Leo
    • Paco
    • Concurrent-programs
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Correctness

Unequivocal-dag

Invariant that DAGs are unequivocal: proof that it holds in every reachable state.

This completes unequivocal-dags-def-and-init and unequivocal-dags-next by showing that the invariant holds in every reachable state.

Subtopics

Unequivocal-dags-certificates-p-always

The invariant holds in every state reachable from an initial state via a sequence of events.