• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Taspi
      • Bitcoin
      • Riscv
      • Des
      • Ethereum
      • X86isa
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Regex
      • ACL2-programming-language
      • Json
      • Jfkr
      • Equational
      • Cryptography
      • Poseidon
      • Where-do-i-place-my-book
      • Axe
      • Bigmems
      • Builtins
      • Execloader
      • Aleo
        • Aleobft
          • Aleobft-static
          • Aleobft-stake2
          • Aleobft-dynamic
          • Aleobft-stake
            • Correctness
            • Definition
              • Initialization
              • Transitions
              • States
              • Events
                • Event
                • Messages
                  • Message-certs-with-dest
                  • Message
                  • Make-certificate-messages
                  • Message-set
                • Event-list
          • Aleobft-proposals
          • Library-extensions
        • Leo
      • Solidity
      • Paco
      • Concurrent-programs
      • Bls12-377-curves
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • States
  • Events

Messages

Messages.

We model the network that connects the validators as eventually reliable with authenticated senders, as commonly assumed in the BFT literature. The only kind of network communication that is relevant to our model is the exchange of certificates among validators. Since we model the exchange of proposals and signatures at an abstract level here, there are no explicit proposals, signatures, etc. exchanged in messages. Instead, validators may (nondeterministically) broadcast certificates, as formalized in the state transitions of the system. Those are not immediately delivered to the other validators, so we need to model the situation in which a certificate has been broadcast but not yet delivered, to at least some of the validators (others may have received it already). Thus, we model messages as consisting of certificates, augmented with destination addresses (one per message).

Subtopics

Message-certs-with-dest
Extract, from a set of messages, the ones with a given destination, and return their certificates.
Message
Fixtype of messages.
Make-certificate-messages
Create messages for a certificate with given destinations.
Message-set
Fixtype of sets of messages.