Worktree isolation
Each agent owns a sandbox. Semantic search and file leases happen in separate transactions.
Hackathon judge demo
Run eleven overlapping tickets with worktrees alone, then with CORTEX, and inspect both returned applications.
The task order, ticket set and database are identical in both arms. Only coordination changes.
Read this before you press it. No two runs of this page are the same, and that is the point. Five agents work at once against one live cluster, so which agent wins a race, which duplicate is caught first and which defect survives into the returned application are decided while you watch. Some hazards will not fire on your run. A lane that failed identically every time would be a recording, not a system.
These five actions are the mechanism. The animation below uses the same actions reported by the running agents.
Each lane reports agent activity and committed rows separately. Nothing is marked successful before the returned file tree is inspected.
Each agent owns a sandbox. Semantic search and file leases happen in separate transactions.
The same semantic search and file claims succeed together or neither does.
Everything above this line happened before the run stopped.
Every bar below is one agent's own elapsed time on one ticket, drawn from the timestamps it streamed. Bars that overlap were running together.
Run the fleet. The figures above are computed from the run's own streamed timestamps and appear as it goes.
The two arms run one after the other so that neither lane's claim latency is measured under the other's load. Each lane's clock therefore starts at zero, and the shared scale compares elapsed time inside a lane, not one common wall clock.
Each card shows the active ticket, repository file and current action. A connector moves only when that agent emits a fleet event.
Intent search and all file claims share one serializable snapshot.
The tickets create three different coordination hazards. Worktrees handle none of them before agents start editing.
Both file trees come from the database and run without network access. The verdict below uses those trees and the terminal meters.
No verdict is calculated until both terminal summaries and both file trees exist.
Run the workload to compare duplicated work, lost writes and file collisions.
Waiting for the run to finish.
Waiting for the run to finish.
Each row is decided by running the returned application and asking it a question, not by searching its source for a string. The evidence is what the application answered.
Run-level figures appear only after the terminal message. A measured zero is shown as 0. Not applicable is N/A. Nobody measured it is TBD.
Run the fleet to load the grouped transaction transcript.
These are the mechanisms used by the CORTEX arm. The published benchmark remains separate from this demo run.
The search and every requested file claim commit together, or neither does.
Titan embeddings are compared in the cluster. The mechanism threshold is disclosed separately from the benchmark judge.
distance < 0.39 / refuse duplicate
A blocked agent learns the holder and the intent. It can re-plan instead of polling.
Completed and abandoned work becomes a durable finding scoped to the repository.
The change stream delivers database rows. Activity events remain separately labelled.
Same 30 tasks, five agents and recorded reasoning in both arms. Database behavior is live. Small synthetic corpus; serialized harness; CORTEX recall is outside that harness.
source: bench/results/2026-08-12T18-35-38-014Z
What judges should verify.
The two arms receive the same tasks and patches. CORTEX changes only the coordination path. Every result shown above is tied to streamed activity, committed rows, terminal meters or the returned file trees.