Infrastructure · Data Structures
Chain
Sequential data container (linked list)
Definition
Mechanism
A concrete sequential data structure: a list of linked nodes where each node (except the last) points to exactly one successor. Chain is the instantiated storage object — distinct from the more abstract Sequence (which describes temporal ordering semantics) and from the branching Tree topology. Chain is the canonical spatial form for strictly sequential, non-branching data.
Invariants
- Connectivity: Node(N) must point to Node(N+1).
- Acyclicity: No loops permitted.
Risks
Failure modes
None stated.
Relationships
Builds on
Used by
References
Mind
Goal-driven reasoning from target to preconditions
Mind
Step-by-step reasoning (Macro for Think(Chain))
Mind
Scale inference compute via extended reasoning
Concurrent flow
Mind
Simulating diverse experts
Society
Sequential LLM calls with validation gates
Mind
Interleaved thought-action-observation cycle
Mind
Execute a cognitive topology
The fractal unit of completed work
Reference
Data schema
{
"type": "object",
"required": [
"nodes",
"edges",
"root_id"
],
"properties": {
"nodes": {
"type": "array"
},
"edges": {
"type": "array"
},
"root_id": {
"type": "string"
}
}
}