Documentation
¶
Overview ¶
Package horizon houses DAG order-theory predicates.
It answers reachability, LCA, and antichain queries, and provides small helpers for certificate/skip detection under a DAG model. In the metaphor, the "event horizon" is the boundary beyond which reordering cannot affect committed history; here, it's a precise predicate over the poset.
Index ¶
- func FindPath[V comparable](store dag.Store[V], from, to V) ([]V, bool)
- func TransitiveClosure[V comparable](store dag.Store[V], vertex V) []V
- func ValidateCertificate[V comparable](store dag.Store[V], cert Certificate[V], isValid func(V) bool) bool
- type Certificate
- type Meta
- type Params
- type SkipList
- type VertexID
- type View
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func FindPath ¶
func FindPath[V comparable](store dag.Store[V], from, to V) ([]V, bool)
FindPath finds a path between two vertices in the DAG
func TransitiveClosure ¶
func TransitiveClosure[V comparable](store dag.Store[V], vertex V) []V
TransitiveClosure computes the transitive closure of a vertex in the DAG
func ValidateCertificate ¶
func ValidateCertificate[V comparable](store dag.Store[V], cert Certificate[V], isValid func(V) bool) bool
ValidateCertificate checks if a certificate is valid given a validator function
Types ¶
type Certificate ¶
type Certificate[V comparable] struct { Vertex V Proof []V Threshold int }
Certificate represents a proof that a vertex has achieved consensus
type SkipList ¶
type SkipList[V comparable] struct { Levels map[V][]V }
SkipList represents a skip list data structure for efficient DAG traversal
func BuildSkipList ¶
func BuildSkipList[V comparable](store dag.Store[V], vertices []V) *SkipList[V]
BuildSkipList constructs a skip list from DAG vertices for efficient navigation
Source Files