REACTORTürkçe

17 facts

Gauss upgrades

17 facts about gauss upgrades from 1 Rialo source. Each one is the explanation Reactor shows after a question, followed by the exact line it rests on.

Test yourself on this topic in Atlas

Rethinking Protocol Upgrades with Gauss

Gauss treats consensus as a modular component and keeps the reconfiguration mechanism stable while the consensus protocol changes.

“Gauss is a new reconfiguration mechanism that rethinks this approach. Instead of embedding reconfiguration logic within the consensus algorithm, Gauss separates reconfiguration from consensus”

The inner log is the full consensus ordering including coordination messages; the outer log is the sanitized view of client transactions that execution sees.

“The inner log contains all entries ordered by consensus, including both client transactions and coordination messages. The outer log contains only client transactions”

The dirty inner log carries everything consensus orders, while the outer log exposes only the consistent prefix execution should see.

“In this sense, the inner log is "dirty": it contains everything consensus orders, while the outer log exposes the consistent prefix of that ordering that execution should see.”

Consensus commits more than execution ever sees: coordination entries and post-handover entries from the old configuration are filtered out.

“This is the "lie" in the paper's title: not every entry ordered and committed by consensus is exposed to execution.”

A Gauss transition replaces one epoch configuration with the next through preparation, handover and shutdown.

“Gauss performs these transitions in three phases: preparation , handover , and shutdown.”

EpochChange starts a transition, Ready signals a new validator is prepared, and Done carries the signed handover certificate; none are executed.

“Gauss defines three such entries: 𝗘𝗽𝗼𝗰𝗵𝗖𝗵𝗮𝗻𝗴𝗲, 𝗥𝗲𝗮𝗱𝘆, and 𝗗𝗼𝗻𝗲. These entries appear in the inner log but are not executed.”

Requiring all Ready messages avoids a faulty validator signalling readiness and then not participating, which could leave the new epoch stuck.

“This avoids a scenario where a faulty validator signals readiness but does not participate in the new epoch, leaving the system unable to reach quorum and make progress.”

The boundary is where the last Ready entry sits in the old inner log; it fixes the exact state the old configuration certifies and hands over.

“The boundary ℎ is the position of the final 𝗥𝗲𝗮𝗱𝘆 entry in the old inner log and defines the exact state that the old configuration certifies and transfers to the new configuration.”

Post-boundary entries from the old configuration are ignored by the log sanitizer, so T4 and T5 have to be resubmitted to the new epoch.

“T₄ and T₅ exist in the consensus-defined ordering, but the execution layer never sees them. Those transactions must be resubmitted under the new configuration”

Gauss does not pause: the old instance keeps ordering during the transition, and execution in the new configuration simply ignores its post-boundary entries.

“This design enables fast handover between configurations without requiring the system to pause. The old consensus instance can continue ordering transactions during the transition”

A quorum of Done messages means enough old validators agree on the boundary and can serve recovery, so the validator is no longer needed.

“Once a validator observes a quorum of 𝗗𝗼𝗻𝗲 messages, it knows it is no longer needed for recovery and can safely stop participating in consensus.”

Only transition one reaches three Done messages; the honest validator in the quorum intersection refuses to sign conflicting handover certificates.

“the second transition is rejected because it does not have enough signatures (2/4 instead of 3/4)”

Ready messages come first, the last one fixes the boundary h, execution follows the new inner log from there, and Done messages certify the handover later.

“The boundary ℎ is the position of the final 𝗥𝗲𝗮𝗱𝘆 entry in the old inner log and defines the exact state that the old configuration certifies and transfers to the new configuration. The outer log used by execution starts following the new inner log at the handover boundary, even though the transition is only certified complete later, when 𝗗𝗼𝗻𝗲 messages from the old configuration appear”

When reconfiguration lives inside consensus, changing consensus changes reconfiguration too, forcing bespoke migrations and sometimes downtime.

“In many SMR implementations, the reconfiguration mechanism is tightly coupled to the underlying consensus algorithm. If the consensus algorithm changes, the reconfiguration mechanism changes too.”

The log sanitization function filters out coordination entries while preserving the order in which transactions must be executed.

“The outer log contains only client transactions and is derived from the inner log by applying a deterministic log sanitization function that filters out coordination entries”

Validators agree on the inner log, but execution only ever processes the sanitized outer log.

“All validators agree on the ordering of entries in the inner log, but the execution engine does not process that log directly. It processes the sanitized outer log instead.”

This line is from the post Rethinking Protocol Upgrades with Gauss.

“Gauss prevents this by ensuring validators transition to the new configuration at the same boundary point and deterministically derive the same outer log.”

Other topics