Infrastructure · Data Structures

Cyclic

Recursive or iterative topology

Definition

Mechanism

A Topology that permits feedback Loops, allowing a process to revisit previous states or refine outputs iteratively. Essential for self-correcting systems and recursive optimization.

Invariants

  1. Recurrence: At least one path exists from a node to itself.
  2. Termination Condition: Must have a defined exit state to prevent infinite loops.

Risks

Failure modes

None stated.

Relationships

Builds on

References

Loop

Repeated execution cycle

Topology

Interface for reasoning structures

Nothing in this library builds on this pattern yet.

Reference

Data schema

{
  "type": "object",
  "description": "A cyclic topology — nodes connected in a closed loop where traversal returns to origin.",
  "properties": {
    "nodes": {
      "type": "array",
      "description": "Ordered node identifiers traversed in the cycle"
    },
    "period": {
      "type": "integer",
      "description": "Cycle length"
    }
  }
}

Identity

Ref
Cyclic#a8f6
Sema ID
sema:Cyclic#mh:SHA-256:a8f6c907685f7a420ccdc584e4b9066b476aa82171a6d280eb1441fc2769b423
Ring
2
Tier
1
Updated
2026-11-11
Supersedes
  • sema:Cyclic#mh:SHA-256:ac1335676817eaedd894da4a2d11671dec5a20dba76a8f5d55d1a6eed20e2051
  • sema:Cyclic#mh:SHA-256:6d5fe05bc8d72bd3758ea9c644e8108ac47aa144dc60b6c3e0de3b0d85d941a0