Digital Twin

Deterministic BFS reachability trace (Forward Networks-style)

Pure SQL/graph reachability proof — given a list of failed links, walk the topology BFS from spines outward and emit each hop. Output is byte-identical for the same (topology snapshot, failed_links) input — no probability, no LLM.

Use cases: · Audit / compliance — show why a leaf became unreachable. · Diff against Monte Carlo — deterministic baseline vs probabilistic spread. · Root-cause closure — capture the exact spine→leaf path that broke.

Reference: Forward Networks 'deterministic network query' (2026 Forward AI launch).

post/api/digital-twin/deterministic-trace

Request

  • Base URL: https://api.fiber.ac (the document declares no server; this is the origin it was published from)
  • URL: https://api.fiber.ac/api/digital-twin/deterministic-trace
  • Auth: none declared

Request body

object required

Response

hop-by-hop BFS trace + reachable/unreachable leaf sets + input hash

unknown required

Changes

No recorded changes to this operation across all 1 revision of this API.