Skip to content

Update fp-components.mdx - fix typos #737

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
cpengilly merged 2 commits into from
Jun 27, 2024
Merged

Update fp-components.mdx - fix typos #737

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
452b5ca
Update fp-components.mdx - fix typos
michalsidzej Jun 11, 2024
c1b4fb3
fix: grammar error
michalsidzej Jun 12, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions pages/stack/protocol/fault-proofs/fp-components.mdx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -68,12 +68,12 @@ They contain a function to resolve this commitment to be true or false, which is
* Incentive Compatibility: The system penalizes false claims and rewards truthful ones to ensure fair participation.
* Resolution: Each game has a mechanism to definitively validate or invalidate the root claim.

The standard is the bi-section game. This is a specific type of dispute game, and the first game built in the OP Stack's dispute protocol.
The standard is the bisection game. This is a specific type of dispute game, and the first game built in the OP Stack's dispute protocol.
We bisect over output roots (which each correspond to single L2 blocks), until we get to a single block `n -> n+1` state transition. Then, we bisect over a single block state transition's execution trace as described before. This is an optimization to reduce the runtime of the off-chain VM.
After bisection has reached commitments to the state at individual trace instructions, the `FaultDisputeGame` executes a single instruction step on chain using a generic VM.
The VM's state transition function, which we'll call `T`, can be anything, so long as it adheres to the form `T(s, i) -> s'`, where `s` = the agreed upon prestate, `i` = the state transition inputs, and `s'` = the post state.

The first full implementation of the VM generic in the bisection game includes a single MIPS thread context on top of the EVM to execute single instructions within an execution trace generated by `Cannon` and the `op-program`.
The first full implementation of the VM generic in the bisection game includes a single MIPS thread context on top of the EVM to execute a single instruction within an execution trace generated by `Cannon` and the `op-program`.

## Next Steps

Expand Down