Skip to content
Cognitive Horizon

01 / Selected systems

The work.
At a closer resolution.

The constraints are different. The standard is the same.
Understand the problem, make the decisions explicit, and measure what changed.

02 / Working study

The shortest path
isn't always available.

Resilience begins with an honest failure state.
Every route has a cost. Some have no answer.

Resilient routingStudy 01
Selected route Available Excluded
Weighted routing graphSeven nodes connected by eleven bidirectional links. The default shortest route from A to G is A, C, E, F, G with total cost eleven. 42324142397 AEdgeBRelay 01CRelay 02DCore 01ECore 02FEgressGClient
7 nodes / 11 links / positive weights

Illustrative model. Link weights are synthetic costs, not network latency or client benchmarks.

Model & method

A bidirectional graph with non-negative weights. Disabled links are removed before the shortest path is computed. An unreachable destination remains an explicit result, not a substituted success.

The solver uses Graphlib's Dijkstra implementation . Route cost is the sum of its edge weights. This model does not simulate congestion, distributed consensus, or convergence time.

The practice

AI, systems, and difficult software.
Independent in thought. Close to the work.

Decision record

Material study / generated photographic artwork

An artistic study of precision and information. Not a photograph of a client system or a company facility.

Find a closer look.