types

package
v1.7.4 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Apr 23, 2024 License: MIT Imports: 8 Imported by: 0

Documentation

Index

Constants

View Source
const (
	CannonGameType       uint32 = 0
	PermissionedGameType uint32 = 1
	AsteriscGameType     uint32 = 2
	AlphabetGameType     uint32 = 255
)

Variables

View Source
var (
	// ErrClaimNotFound is returned when a claim does not exist in the game state.
	ErrClaimNotFound = errors.New("claim not found in game state")
)
View Source
var (
	ErrGameDepthReached = errors.New("game depth reached")
)
View Source
var (
	ErrPositionDepthTooSmall = errors.New("position depth is too small")
)

Functions

func NewGameState

func NewGameState(claims []Claim, depth Depth) *gameState

NewGameState returns a new game state. The provided Claim is used as the root node.

Types

type Action

type Action struct {
	Type           ActionType
	ParentIdx      int
	ParentPosition Position
	IsAttack       bool

	// Moves
	Value common.Hash

	// Steps
	PreState   []byte
	ProofData  []byte
	OracleData *PreimageOracleData
}

type ActionType

type ActionType string
const (
	ActionTypeMove ActionType = "move"
	ActionTypeStep ActionType = "step"
)

func (ActionType) String

func (a ActionType) String() string

type Claim

type Claim struct {
	ClaimData
	// WARN: CounteredBy is a mutable field in the FaultDisputeGame contract
	//       and rely on it for determining whether to step on leaf claims.
	//       When caching is implemented for the Challenger, this will need
	//       to be changed/removed to avoid invalid/stale contract state.
	CounteredBy common.Address
	Claimant    common.Address
	Clock       Clock
	// Location of the claim & it's parent inside the contract. Does not exist
	// for claims that have not made it to the contract.
	ContractIndex       int
	ParentContractIndex int
}

Claim extends ClaimData with information about the relationship between two claims. It uses ClaimData to break cyclicity without using pointers. If the position of the game is Depth 0, IndexAtDepth 0 it is the root claim and the Parent field is empty & meaningless.

func (Claim) ChessTime added in v1.7.0

func (c Claim) ChessTime(now time.Time) time.Duration

ChessTime returns the amount of time accumulated in the chess clock. Does not assume the claim is countered and uses the specified time to calculate the time since the claim was posted.

func (Claim) ID added in v1.7.2

func (c Claim) ID() ClaimID

func (Claim) IsRoot

func (c Claim) IsRoot() bool

IsRoot returns true if this claim is the root claim.

type ClaimData

type ClaimData struct {
	Value common.Hash
	Bond  *big.Int
	Position
}

ClaimData is the core of a claim. It must be unique inside a specific game.

func (*ClaimData) ValueBytes

func (c *ClaimData) ValueBytes() [32]byte

type ClaimID added in v1.7.2

type ClaimID common.Hash

type Clock added in v1.7.0

type Clock struct {
	// Duration is the time elapsed on the chess clock at the last update.
	Duration time.Duration

	// Timestamp is the time that the clock was last updated.
	Timestamp time.Time
}

Clock tracks the chess clock for a claim.

func NewClock added in v1.7.0

func NewClock(duration time.Duration, timestamp time.Time) Clock

NewClock creates a new Clock instance.

type ClockReader added in v1.5.1

type ClockReader interface {
	Now() time.Time
}

type Depth added in v1.4.3

type Depth uint64

Depth is the depth of a position in a game tree where the root level has depth 0, the root's children have depth 1, their children have depth 2, and so on.

type Game

type Game interface {
	// Claims returns all of the claims in the game.
	Claims() []Claim

	// GetParent returns the parent of the provided claim.
	GetParent(claim Claim) (Claim, error)

	// DefendsParent returns true if and only if the claim is a defense (i.e. goes right) of
	// its parent.
	DefendsParent(claim Claim) bool

	// IsDuplicate returns true if the provided [Claim] already exists in the game state
	// referencing the same parent claim
	IsDuplicate(claim Claim) bool

	// AgreeWithClaimLevel returns if the game state agrees with the provided claim level.
	AgreeWithClaimLevel(claim Claim, agreeWithRootClaim bool) bool

	MaxDepth() Depth

	// AncestorWithTraceIndex finds the ancestor of claim with trace index idx if present.
	// Returns the claim and true if the ancestor is found, or Claim{}, false if not.
	AncestorWithTraceIndex(claim Claim, idx *big.Int) (Claim, bool)
}

Game is an interface that represents the state of a dispute game.

type Position

type Position struct {
	// contains filtered or unexported fields
}

Position is a golang wrapper around the dispute game Position type.

func NewPosition

func NewPosition(depth Depth, indexAtDepth *big.Int) Position

func NewPositionFromGIndex

func NewPositionFromGIndex(x *big.Int) Position

NewPositionFromGIndex creates a new Position given a generalized index.

func (Position) Attack

func (p Position) Attack() Position

Attack creates a new position which is the attack position of this one.

func (Position) Defend

func (p Position) Defend() Position

Defend creates a new position which is the defend position of this one.

func (Position) Depth

func (p Position) Depth() Depth

func (Position) IndexAtDepth

func (p Position) IndexAtDepth() *big.Int

func (Position) IsRootPosition

func (p Position) IsRootPosition() bool

func (Position) MoveRight added in v1.2.0

func (p Position) MoveRight() Position

func (Position) Print

func (p Position) Print(maxDepth Depth)

func (Position) RelativeToAncestorAtDepth added in v1.2.0

func (p Position) RelativeToAncestorAtDepth(ancestor Depth) (Position, error)

RelativeToAncestorAtDepth returns a new position for a subtree. [ancestor] is the depth of the subtree root node.

func (Position) RightOf added in v1.2.0

func (p Position) RightOf(parent Position) bool

func (Position) String added in v1.4.2

func (p Position) String() string

func (Position) ToGIndex

func (p Position) ToGIndex() *big.Int

func (Position) TraceIndex

func (p Position) TraceIndex(maxDepth Depth) *big.Int

TraceIndex calculates the what the index of the claim value would be inside the trace. It is equivalent to going right until the final depth has been reached.

type PreimageOracleData

type PreimageOracleData struct {
	IsLocal   bool
	OracleKey []byte

	OracleOffset uint32

	// 4844 blob data
	BlobFieldIndex uint64
	BlobCommitment []byte
	BlobProof      []byte
	// contains filtered or unexported fields
}

PreimageOracleData encapsulates the preimage oracle data to load into the onchain oracle.

func NewPreimageOracleBlobData added in v1.6.1

func NewPreimageOracleBlobData(key []byte, data []byte, offset uint32, fieldIndex uint64, commitment []byte, proof []byte) *PreimageOracleData

func NewPreimageOracleData

func NewPreimageOracleData(key []byte, data []byte, offset uint32) *PreimageOracleData

NewPreimageOracleData creates a new PreimageOracleData instance.

func (*PreimageOracleData) GetIdent

func (p *PreimageOracleData) GetIdent() *big.Int

GetIdent returns the ident for the preimage oracle data.

func (*PreimageOracleData) GetPrecompileAddress added in v1.7.2

func (p *PreimageOracleData) GetPrecompileAddress() common.Address

func (*PreimageOracleData) GetPrecompileInput added in v1.7.2

func (p *PreimageOracleData) GetPrecompileInput() []byte

func (*PreimageOracleData) GetPreimageWithSize added in v1.5.1

func (p *PreimageOracleData) GetPreimageWithSize() []byte

GetPreimageWithSize returns the preimage with its length prefix.

func (*PreimageOracleData) GetPreimageWithoutSize

func (p *PreimageOracleData) GetPreimageWithoutSize() []byte

GetPreimageWithoutSize returns the preimage for the preimage oracle data.

type PrestateProvider added in v1.4.2

type PrestateProvider interface {
	// AbsolutePreStateCommitment is the commitment of the pre-image value of the trace that transitions to the trace value at index 0
	AbsolutePreStateCommitment(ctx context.Context) (hash common.Hash, err error)
}

PrestateProvider defines an interface to request the absolute prestate.

type StepCallData

type StepCallData struct {
	ClaimIndex uint64
	IsAttack   bool
	StateData  []byte
	Proof      []byte
}

StepCallData encapsulates the data needed to perform a step.

type TraceAccessor added in v1.4.2

type TraceAccessor interface {
	// Get returns the claim value at the requested position, evaluated in the context of the specified claim (ref).
	Get(ctx context.Context, game Game, ref Claim, pos Position) (common.Hash, error)

	// GetStepData returns the data required to execute the step at the specified position,
	// evaluated in the context of the specified claim (ref).
	GetStepData(ctx context.Context, game Game, ref Claim, pos Position) (prestate []byte, proofData []byte, preimageData *PreimageOracleData, err error)
}

TraceAccessor defines an interface to request data from a TraceProvider with additional context for the game position. This can be used to implement split games where lower layers of the game may have different values depending on claims at higher levels in the game.

type TraceProvider

type TraceProvider interface {
	PrestateProvider

	// Get returns the claim value at the requested index.
	// Get(i) = Keccak256(GetPreimage(i))
	Get(ctx context.Context, i Position) (common.Hash, error)

	// GetStepData returns the data required to execute the step at the specified trace index.
	// This includes the pre-state of the step (not hashed), the proof data required during step execution
	// and any pre-image data that needs to be loaded into the oracle prior to execution (may be nil)
	// The prestate returned from GetStepData for trace 10 should be the pre-image of the claim from trace 9
	GetStepData(ctx context.Context, i Position) (prestate []byte, proofData []byte, preimageData *PreimageOracleData, err error)
}

TraceProvider is a generic way to get a claim value at a specific step in the trace.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL