• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Aleobft
      • Aleobft-static
        • Correctness
        • Definition
          • Transitions
            • Events-possiblep
            • Events-next
            • Event-next
            • Event-possiblep
            • Transitions-store-certificate
            • Transitions-receive-certificate
            • Transitions-create-certificate
            • Transitions-timer-expires
            • Transitions-commit-anchors
            • Transitions-advance-round
              • Advance-round-possiblep
              • Advance-round-next
          • Operations
          • States
          • Initialization
          • Events
      • Aleobft-dynamic
      • Aleobft-stake2
      • Aleobft-stake
      • 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
    • Yul
    • Riscv
    • 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

• Transitions-advance-round

Advance-round-next

New state resulting from an advance-round event.

Signature

(advance-round-next val systate) → new-systate

Arguments

val — Guard (addressp val).

systate — Guard (system-statep systate).

Returns

new-systate — Type (system-statep new-systate).

The round number is incremented by 1.

The timer is restarted, i.e. it is set to running.

Definitions and Theorems

Function: advance-round-next-val

(defun advance-round-next-val (round vstate)
  (declare (xargs :guard (and (posp round)
                              (validator-statep vstate))))
  (let ((__function__ 'advance-round-next-val))
    (declare (ignorable __function__))
    (change-validator-state vstate
                            :round (1+ round)
                            :timer (timer-running))))

Theorem: validator-statep-of-advance-round-next-val

(defthm validator-statep-of-advance-round-next-val
  (b* ((new-vstate (advance-round-next-val round vstate)))
    (validator-statep new-vstate))
  :rule-classes :rewrite)

Function: advance-round-next

(defun advance-round-next (val systate)
  (declare (xargs :guard (and (addressp val)
                              (system-statep systate))))
  (declare (xargs :guard (advance-round-possiblep val systate)))
  (let ((__function__ 'advance-round-next))
    (declare (ignorable __function__))
    (b* ((vstate (get-validator-state val systate))
         (round (validator-state->round vstate))
         (new-vstate (advance-round-next-val round vstate)))
      (update-validator-state val new-vstate systate))))

Theorem: system-statep-of-advance-round-next

(defthm system-statep-of-advance-round-next
  (b* ((new-systate (advance-round-next val systate)))
    (system-statep new-systate))
  :rule-classes :rewrite)

Theorem: advance-round-next-of-system-state-fix-systate

(defthm advance-round-next-of-system-state-fix-systate
  (equal (advance-round-next val (system-state-fix systate))
         (advance-round-next val systate)))

Theorem: advance-round-next-system-state-equiv-congruence-on-systate

(defthm advance-round-next-system-state-equiv-congruence-on-systate
  (implies (system-state-equiv systate systate-equiv)
           (equal (advance-round-next val systate)
                  (advance-round-next val systate-equiv)))
  :rule-classes :congruence)

Theorem: validator-state->round-of-advance-round-next

(defthm validator-state->round-of-advance-round-next
 (implies
  (and (in val (correct-addresses systate))
       (advance-round-possiblep val1 systate))
  (equal
   (validator-state->round
        (get-validator-state val (advance-round-next val1 systate)))
   (if
    (equal val val1)
    (1+ (validator-state->round (get-validator-state val systate)))
    (validator-state->round (get-validator-state val systate))))))

Theorem: validator-state->dag-of-advance-round-next

(defthm validator-state->dag-of-advance-round-next
 (implies
  (and (in val (correct-addresses systate))
       (advance-round-possiblep val1 systate))
  (equal
   (validator-state->dag
        (get-validator-state val (advance-round-next val1 systate)))
   (validator-state->dag (get-validator-state val systate)))))

Theorem: validator-state->last-of-advance-round-next

(defthm validator-state->last-of-advance-round-next
 (implies
  (and (in val (correct-addresses systate))
       (advance-round-possiblep val1 systate))
  (equal
   (validator-state->last
        (get-validator-state val (advance-round-next val1 systate)))
   (validator-state->last (get-validator-state val systate)))))

Theorem: validator-state->blockchain-of-advance-round-next

(defthm validator-state->blockchain-of-advance-round-next
 (implies
  (and (in val (correct-addresses systate))
       (advance-round-possiblep val1 systate))
  (equal
   (validator-state->blockchain
        (get-validator-state val (advance-round-next val1 systate)))
   (validator-state->blockchain
        (get-validator-state val systate)))))

Theorem: validator-state->committed-of-advance-round-next

(defthm validator-state->committed-of-advance-round-next
 (implies
  (and (in val (correct-addresses systate))
       (advance-round-possiblep val1 systate))
  (equal
   (validator-state->committed
        (get-validator-state val (advance-round-next val1 systate)))
   (validator-state->committed (get-validator-state val systate)))))