diff --git a/experimental/fault-proof/fault-dispute-game.html b/experimental/fault-proof/fault-dispute-game.html index ee2f8bf06..8840f5e0d 100644 --- a/experimental/fault-proof/fault-dispute-game.html +++ b/experimental/fault-proof/fault-dispute-game.html @@ -438,7 +438,7 @@

Team Dynamics

@@ -453,7 +453,7 @@

Game Clock

Every claim in the game has a Clock. A claim inherits the clock of its grandparent claim in the DAG (and so on). Akin to a chess clock, it keeps track of the total time each team takes to make moves, preventing delays. -Making a move resumes the clock for the disputed claim and puases it for the newly added one.

+Making a move resumes the clock for the disputed claim and pauses it for the newly added one.

A move against a particular claim is no longer possible once the parent of the disputed claim's Clock has exceeded half of the GAME_DURATION. By which point, the claim's clock has expired.

Resolution

diff --git a/glossary.html b/glossary.html index 5002c3e38..f3654c105 100644 --- a/glossary.html +++ b/glossary.html @@ -591,7 +591,7 @@

unsafe L2 block becomes the new safe L2 head.

In order to perform consolidation, the node verifies that the payload attributes derived from the L1 chain match the oldest unsafe L2 block exactly.

-

See the Engine Queue section of the L2 chain derivatiaon spec for more information.

+

See the Engine Queue section of the L2 chain derivation spec for more information.

Finalized L2 Head

The finalized L2 head is the highest L2 block that can be derived from finalized L1 blocks — i.e. L1 blocks older than two L1 epochs (64 L1 time slots).

diff --git a/index.html b/index.html index 57e891095..1ef94087b 100644 --- a/index.html +++ b/index.html @@ -228,7 +228,7 @@

Design GoalsOur aim is to design a protocol specification that is: