1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
|
; AleoBFT Library
;
; Copyright (C) 2024 Provable Inc.
;
; License: See the LICENSE file distributed with this library.
;
; Authors: Alessandro Coglio (www.alessandrocoglio.info)
; Eric McCarthy (bendyarm on GitHub)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(in-package "ALEOBFT-STAKE2")
(include-book "backward-closure")
(include-book "signer-quorum")
(include-book "signed-previous-quorum")
(include-book "same-committees-def-and-implied")
(include-book "fault-tolerance")
(local (include-book "arithmetic-3/top" :dir :system))
(local (include-book "kestrel/built-ins/disable" :dir :system))
(local (acl2::disable-most-builtin-logic-defuns))
(local (acl2::disable-builtin-rewrite-rules-for-defaults))
(set-induction-depth-limit 0)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defxdoc+ dag-previous-quorum-def-and-init-and-next
:parents (correctness)
:short "Invariant that each certificate in a DAG
has references to previous certificates
that form a non-zero quorum in the committee for the previous round,
unless the round is 1,
in which case there are no references to previous certificates:
definition, establishment, and preservation."
:long
(xdoc::topstring
(xdoc::p
"When a new certificate is created via a @('create') event,
that event's preconditions require that the certificate includes
a non-zero quorum of references to certificates in the previous round,
unless the certificate round is 1,
in which case there must be no references.")
(xdoc::p
"When a certificate is stored into the DAG via an @('accept') event,
the validator checks that the certificate is signed by a quorum.
Under fault tolerance assumptions,
that quorum must contain at least one correct validator,
which must have signed the certificate only if
the references to previous certificates
form a non-zero quorum
(in the previous committee of the certiicate's round).
Under the invariant that validators agree on committees
(see @(see same-committees-def-and-implied)),
the correct signer and the storing validator
agree on the committee, and thus on the stake requirement.")
(xdoc::p
"Thus, all the certificates in a validator's DAG satisfy the invariant.
The other events do not modify DAGs.")
(xdoc::p
"The names for this invariant,
i.e. this XDOC topic as well as the function and theorem names,
just mention `quorum' for brevity,
even though that does not apply to round 1.
But rounds greater than 1 are the ``normal'' case,
while round 1 is a special case.
The names do not mention the `non-zero' requirement either,
but the quorum aspect is the main one here.")
(xdoc::p
"Here we define the invariant,
we prove that it holds in all initial states,
and we prove that it is preserved by all transitions.
Elsewhere we prove that
the invariant holds in every reachable state."))
:order-subtopics t
:default-parent t)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(define validator-dag-previous-quorum-p ((cert certificatep)
(vstate validator-statep))
:guard (or (equal (certificate->round cert) 1)
(active-committee-at-round (1- (certificate->round cert))
(validator-state->blockchain vstate)))
:returns (yes/no booleanp)
:short "Check if either a certificate has round 1
and it has no references to previous certificates,
or the round is not 1 and
the certificate's references to previous certificates
are in the committee for the round just before the certificate round
and form a non-zero quorum in that committee,
where the committee is calculated by a validator
(represented by its state)."
:long
(xdoc::topstring
(xdoc::p
"This is used by @(tsee dag-previous-quorum-p) to define our invariant.
The validator whose state is @('vstate') is
the one that has the certificate in the DAG.
The guard ensures that the validator can calculate the committee.")
(xdoc::p
"To check the non-zeroness of the quorum,
we equivalently check the non-emptiness of the previous references.")
(xdoc::p
"We prove a theorem about the predecessors of @('cert'),
which we use to prove @(tsee dag-predecessor-quorum-p)
from @(tsee dag-previous-quorum-p) later.
The theorem says that, under the invariant, for certificates after round 1,
the stake of the authors of the predecessor certificates
is at least the quorum stake for the committee at the previous round.
This is the case under the backward closure hypothesis
(which is an already proved invariant):
the authors of the predecessors are
exactly the previous certificate references (addresses) in the certificate.
Without the backward closure hypothesis,
the authors of the predecessors are the intersection of
the previous reference authors
and the authors of the certificates actually present in the previous round;
the closure tells us the the former is a subset of the latter,
which simplifies the intersection."))
(b* (((validator-state vstate) vstate)
((certificate cert) cert))
(if (= cert.round 1)
(set::emptyp cert.previous)
(b* ((commtt
(active-committee-at-round (1- cert.round) vstate.blockchain)))
(and (not (set::emptyp cert.previous))
(set::subset cert.previous
(committee-members commtt))
(>= (committee-members-stake cert.previous commtt)
(committee-quorum-stake commtt))))))
:guard-hints (("Goal" :in-theory (enable posp)))
:hooks (:fix)
///
(defruled predecessor-quorum-when-validator-dag-previous-quorum-p
(implies (and (validator-dag-previous-quorum-p cert vstate)
(certificate-previous-in-dag-p
cert (validator-state->dag vstate))
(not (equal (certificate->round cert) 1)))
(b* ((commtt (active-committee-at-round
(1- (certificate->round cert))
(validator-state->blockchain vstate)))
(stake (committee-members-stake
(certificate-set->author-set
(predecessors cert (validator-state->dag vstate)))
commtt)))
(and (> stake 0)
(>= stake
(committee-quorum-stake commtt)))))
:enable (predecessors
certs-with-authors+round-to-authors-of-round
certificate-set->author-set-of-certs-with-authors
certificate-previous-in-dag-p
committee-members-stake-0-to-emptyp-members
set::expensive-rules)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(define-sk dag-previous-quorum-p ((systate system-statep))
:guard (signer-quorum-p systate)
:returns (yes/no booleanp)
:short "Definition of the invariant:
for each certificate in the DAG of each validator,
either the certificate's round is 1
and the certificate has no references to previous certificates,
or the certificate's round is not 1
and the references to previous certificates
form a non-zero quorum in the committee of
the preceding round of the certificate."
:long
(xdoc::topstring
(xdoc::p
"This invariant, along with backward closure and non-equivocation,
guarantees that @(tsee dag-predecessor-quorum-p) holds, as we prove here.
The key lemma is
@('predecessor-quorum-when-validator-dag-previous-quorum-p')
proved in @(tsee validator-dag-previous-quorum-p).
Here we just need to enable some rules
to establish the hypotheses of that lemma."))
(forall (val cert)
(implies (and (set::in val (correct-addresses systate))
(set::in cert (validator-state->dag
(get-validator-state val systate))))
(validator-dag-previous-quorum-p
cert
(get-validator-state val systate))))
:guard-hints
(("Goal"
:in-theory (enable dag-has-committees-p-when-signer-quorum-p
dag-has-committees-p-necc-bind-dag
active-committee-at-previous-round-when-at-round )))
///
(fty::deffixequiv-sk dag-previous-quorum-p
:args ((systate system-statep)))
(defruled dag-predecessor-quorum-p-when-dag-previous-quorum-p
(implies (and (dag-previous-quorum-p systate)
(backward-closed-p systate)
(set::in val (correct-addresses systate)))
(dag-predecessor-quorum-p
(validator-state->dag (get-validator-state val systate))
(validator-state->blockchain (get-validator-state val systate))))
:enable (predecessor-quorum-when-validator-dag-previous-quorum-p
dag-predecessor-quorum-p
backward-closed-p-necc
dag-closedp-necc)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defruled dag-previous-quorum-p-when-init
:short "Establishment of the invariant:
the invariant holds in any initial system state."
:long
(xdoc::topstring
(xdoc::p
"Initially all the DAGs are empty,
so the universal quantification is trivially true."))
(implies (system-initp systate)
(dag-previous-quorum-p systate))
:enable (dag-previous-quorum-p
system-initp
system-validators-initp-necc
validator-init))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defsection dag-previous-quorum-p-of-next
:short "Preservation of the invariant:
if the invariant holds in a system state,
it also holds in the next system state."
:long
(xdoc::topstring
(xdoc::p
"The only two kinds of events that may change the DAG
are @('create') and @('accept').")
(xdoc::p
"For @('create'),
there are two cases to consider.
For an existing (i.e. old) certificate in the DAG,
we just need to show that the previous quorum property is preserved:
this is easy, and relies on the fact that
the blockchain, from which the committee is calculated,
does not change for @('create').
For a newly created certificate in @('create'),
the only change to the DAG is for the author:
the other validators are sent the certificate in messages,
but the messages are in the network, not in their DAGs.
The certificate's author adds the certificate directly to the DAG.
But @(tsee create-possiblep)
explicitly checks the previous quorum condition.")
(xdoc::p
"For @('accept'), we have a similar split,
considering a certificate already in the DAG (i.e. old),
and the newly stored certificate, moved from the network.
The case of an old certificate is similar to @('create');
again, we use the fact that the blockchain
does not change under an @('accept') event.
The case of the newly stored certificate is more complicated.
The conditions in @(tsee accept-possiblep) include the fact that
the certificate is signed by a quorum,
which, assuming fault tolerance (which we do),
must contain at least one correct validator:
see @('pick-correct-validator-when-fault-tolerant-and-geq-quorum')
in @(tsee pick-correct-validator).
We appeal to the previously proved
invariant @(tsee signed-previous-quorum-p)
to obtain that the previous quorum condition is satisfied
with respect to the signing validator
(which may differ from the target validator of @('accept')).
Then we use the invariant @(tsee same-committees-p)
to show that, if signer and storer differ,
they agree on that committee,
and thus on the previous quorum requirement.
Fault tolerance and the other invariants used in the proof
propagate to the theorem about @(tsee event-next).")
(xdoc::p
"DAGs do not change for the other kinds of events,
so the proofs for them always rely on the preservaton of the properties.
For each kind of event,
we prove a lemma about @(tsee validator-dag-previous-quorum-p)
and then a theorem about @(tsee dag-previous-quorum-p).
For @('advance'),
there is no change to the blockchain, so the proof is fairly easy.
For @('commit'), the blockchain changes,
but we use the fact that extending the blockchain
does not affect the committees calculated prior to the extension.
This property depends on the previously proved invariants
that blockchain rounds are even and ordered,
that the last committed round in the validator state
matches the latest block's round
(or they are both 0 if there are no blocks),
and that a validator can calculate the active committees
at all the rounds in which it has certificates;
so we need to add these invariants as hypothesis,
which therefore propagate to the theorem about @(tsee event-next)."))
;; create:
(defruled validator-dag-previous-quorum-p-of-create-next-old
(implies (validator-dag-previous-quorum-p
cert1
(get-validator-state val systate))
(validator-dag-previous-quorum-p
cert1
(get-validator-state val (create-next cert systate))))
:enable (validator-dag-previous-quorum-p
validator-state->blockchain-of-create-next
certificate->author-of-path-to-author+round))
(defruled validator-dag-previous-quorum-p-of-create-next-new
(implies (and (create-possiblep cert systate)
(set::in (certificate->author cert)
(correct-addresses systate)))
(validator-dag-previous-quorum-p
cert
(get-validator-state (certificate->author cert)
(create-next cert systate))))
:enable (validator-dag-previous-quorum-p
create-possiblep
create-author-possiblep
create-signer-possiblep
certificate->signers))
(defruled dag-previous-quorum-p-of-create-next
(implies (and (dag-previous-quorum-p systate)
(create-possiblep cert systate))
(dag-previous-quorum-p (create-next cert systate)))
:enable (dag-previous-quorum-p
dag-previous-quorum-p-necc
validator-state->dag-of-create-next
validator-dag-previous-quorum-p-of-create-next-old
validator-dag-previous-quorum-p-of-create-next-new))
;; accept:
(defruled validator-dag-previous-quorum-p-of-accept-next-old
(implies (and (validator-dag-previous-quorum-p
cert
(get-validator-state val systate))
(accept-possiblep msg systate))
(validator-dag-previous-quorum-p
cert
(get-validator-state val (accept-next msg systate))))
:enable (validator-dag-previous-quorum-p))
(defruled validator-dag-previous-quorum-p-of-accept-next-new
(implies (and (system-committees-fault-tolerant-p systate)
(signed-previous-quorum-p systate)
(same-committees-p systate)
(accept-possiblep msg systate)
(messagep msg))
(validator-dag-previous-quorum-p
(message->certificate msg)
(get-validator-state (message->destination msg)
(accept-next msg systate))))
:enable (validator-dag-previous-quorum-p
accept-possiblep
pick-correct-validator-is-correct
pick-correct-validator-in-set
in-signed-certs-when-in-system-and-signer
in-of-message-certs-with-dest
in-system-certs-when-in-some-dag
in-system-certs-when-in-network
validator-signed-previous-quorum-p
same-committees-p-necc
active-committee-at-previous-round-when-at-round
posp
system-committees-fault-tolerant-p-necc
validator-committees-fault-tolerant-p-necc
committee-nonemptyp-when-nonempty-subset)
:use ((:instance pick-correct-validator-when-fault-tolerant-and-geq-quorum
(vals (certificate->signers (message->certificate msg)))
(commtt (active-committee-at-round
(certificate->round (message->certificate msg))
(validator-state->blockchain
(get-validator-state (message->destination msg)
systate)))))
(:instance signed-previous-quorum-p-necc
(cert (message->certificate msg))
(val (pick-correct-validator
(certificate->signers (message->certificate msg))
systate)))
(:instance same-active-committees-p-necc
(round (1- (certificate->round
(message->certificate msg))))
(blocks1 (validator-state->blockchain
(get-validator-state (message->destination msg)
systate)))
(blocks2 (validator-state->blockchain
(get-validator-state
(pick-correct-validator
(certificate->signers
(message->certificate msg))
systate)
systate))))))
(defruled dag-previous-quorum-p-of-accept-next
(implies (and (dag-previous-quorum-p systate)
(system-committees-fault-tolerant-p systate)
(signed-previous-quorum-p systate)
(same-committees-p systate)
(accept-possiblep msg systate)
(messagep msg))
(dag-previous-quorum-p (accept-next msg systate)))
:enable (dag-previous-quorum-p
dag-previous-quorum-p-necc
validator-state->dag-of-accept-next
validator-dag-previous-quorum-p-of-accept-next-old
validator-dag-previous-quorum-p-of-accept-next-new))
;; advance:
(defruled validator-dag-previous-quorum-p-of-advance-next
(implies (and (validator-dag-previous-quorum-p
cert
(get-validator-state val1 systate))
(advance-possiblep val systate))
(validator-dag-previous-quorum-p
cert
(get-validator-state val1 (advance-next val systate))))
:enable validator-dag-previous-quorum-p)
(defruled dag-previous-quorum-p-of-advance-next
(implies (and (dag-previous-quorum-p systate)
(advance-possiblep val systate))
(dag-previous-quorum-p (advance-next val systate)))
:enable (dag-previous-quorum-p
dag-previous-quorum-p-necc
validator-dag-previous-quorum-p-of-advance-next))
;; commit:
(defruled validator-dag-previous-quorum-p-of-commit-next
(implies (and (last-blockchain-round-p systate)
(ordered-even-p systate)
(signer-quorum-p systate)
(set::in val1 (correct-addresses systate))
(set::in cert
(validator-state->dag
(get-validator-state val1 systate)))
(validator-dag-previous-quorum-p
cert
(get-validator-state val1 systate))
(commit-possiblep val systate)
(addressp val))
(validator-dag-previous-quorum-p
cert
(get-validator-state val1 (commit-next val systate))))
:enable (dag-has-committees-p-when-signer-quorum-p
dag-has-committees-p-necc-bind-dag
validator-dag-previous-quorum-p
validator-state->blockchain-of-commit-next
active-committee-at-round-of-extend-blockchain-no-change
active-committee-at-previous-round-when-at-round
blocks-ordered-even-p-of-extend-blockchain
certificates-ordered-even-p-of-collect-anchors
commit-possiblep
ordered-even-p-necc-fixing
collect-anchors-above-last-committed-round
last-blockchain-round-p-necc-fixing
posp
pos-fix
evenp))
(defruled dag-previous-quorum-p-of-commit-next
(implies (and (dag-previous-quorum-p systate)
(last-blockchain-round-p systate)
(ordered-even-p systate)
(signer-quorum-p systate)
(commit-possiblep val systate)
(addressp val))
(dag-previous-quorum-p (commit-next val systate)))
:enable (dag-previous-quorum-p
dag-previous-quorum-p-necc
validator-dag-previous-quorum-p-of-commit-next))
;; all events:
(defruled dag-previous-quorum-p-of-event-next
(implies (and (dag-previous-quorum-p systate)
(system-committees-fault-tolerant-p systate)
(last-blockchain-round-p systate)
(ordered-even-p systate)
(signed-previous-quorum-p systate)
(signer-quorum-p systate)
(same-committees-p systate)
(event-possiblep event systate))
(dag-previous-quorum-p (event-next event systate)))
:enable (event-possiblep
event-next)))
|