cross

func CrossSafeHazards ¶

func CrossSafeHazards(d SafeStartDeps, chainID types.ChainID, inL1DerivedFrom eth.BlockID,
	candidate types.BlockSeal, execMsgs []*types.ExecutingMessage) (hazards map[types.ChainIndex]types.BlockSeal, err error)

CrossSafeHazards checks if the given messages all exist and pass invariants. It returns a hazard-set: if any intra-block messaging happened, these hazard blocks have to be verified.

func CrossSafeUpdate ¶

func CrossSafeUpdate(ctx context.Context, logger log.Logger, chainID types.ChainID, d CrossSafeDeps) error

func CrossUnsafeHazards ¶

func CrossUnsafeHazards(d UnsafeStartDeps, chainID types.ChainID,
	candidate types.BlockSeal, execMsgs []*types.ExecutingMessage) (hazards map[types.ChainIndex]types.BlockSeal, err error)

CrossUnsafeHazards checks if the given messages all exist and pass invariants. It returns a hazard-set: if any intra-block messaging happened, these hazard blocks have to be verified.

func CrossUnsafeUpdate ¶

func CrossUnsafeUpdate(ctx context.Context, logger log.Logger, chainID types.ChainID, d CrossUnsafeDeps) error

func GenerateMermaidDiagram ¶

func GenerateMermaidDiagram(g *graph) string

GenerateMermaidDiagram creates a Mermaid flowchart diagram from the graph data for debugging.

func HazardCycleChecks ¶

func HazardCycleChecks(d CycleCheckDeps, inTimestamp uint64, hazards map[types.ChainIndex]types.BlockSeal) error

HazardCycleChecks checks for cyclical dependencies between logs at the given timestamp. Here the timestamp invariant alone does not ensure ordering of messages.

We perform this check in 3 steps:

• Gather all logs across all hazard blocks at the given timestamp.
• Build the logs into a directed graph of dependencies between logs.
• Check the graph for cycles.

The edges of the graph are determined by:

• For all logs except the first in a block, there is an edge from the previous log.
• For all executing messages, there is an edge from the initiating message.

The edges between sequential logs ensure the graph is well-connected and free of any disjoint subgraphs that would make cycle checking more difficult.

The cycle check is performed by executing Kahn's topological sort algorithm which succeeds if and only if a graph is acyclic.

Returns nil if no cycles are found or ErrCycle if a cycle is detected.

func HazardSafeFrontierChecks ¶

func HazardSafeFrontierChecks(d SafeFrontierCheckDeps, inL1DerivedFrom eth.BlockID, hazards map[types.ChainIndex]types.BlockSeal) error

HazardSafeFrontierChecks verifies all the hazard blocks are either:

• already cross-safe.
• the first (if not first: local blocks to verify before proceeding) local-safe block, after the cross-safe block.

func HazardUnsafeFrontierChecks ¶

func HazardUnsafeFrontierChecks(d UnsafeFrontierCheckDeps, hazards map[types.ChainIndex]types.BlockSeal) error

HazardUnsafeFrontierChecks verifies all the hazard blocks are either:

• already cross-unsafe.
• the first (if not first: local blocks to verify before proceeding) local-unsafe block, after the cross-unsafe block.