Watch the engine solve, right now

A capacitated delivery problem, solved live by the production engine. Press re-roll to give it a fresh one.

·
vehicles used
·
total distance (engine units)
·
solve time on the live server

Every solve returns a verification block that verifies coverage and capacity against the raw routes. You trust the answer because you checked it, not because we said so.

The exact call this page just made

POST https://route.elara-cortex.com/v1/demo/solve
{ "coords": [[depot],[stop],...], "demands": [0,..], "capacity": N }

// response, a certificate you re-check with arithmetic
{ "ok": true, "vehicles": N, "cost": …,
  "verified": { "coverage": true, "capacity": true, "cost_match": true },
  "routes": [[...]] }

Want full size? A free 7-day key opens the keyed engine, up to 1 000 stops with time-constrained and multi-modal routing. Get a key →

And it's proven, not just live

Provably optimal

Matches the mathematically proven optimum 5/5 where optimality is provable.

Beats the field

Beats Google's open solver on the public benchmarks we ran; on time-window tests their solver drops customers where ours serves all.

Real networks

Ran the actual route networks of 10 of the world's busiest airlines + a live city fleet. See the evidence →

Hardened

Survived a maximum-power adversarial security review, 6 of 6 attack lines closed by two independent proof engines.

Get a free key The evidence ledger → The benchmark paper →
Live engine at route.elara-cortex.com · provably optimal where provable · the mathematics is proprietary, the proof is yours to check
.LEKOLA. CODE ATELIER