Arbitration runtime
A runtime for complex arbitration matters
arbi.run decomposes an arbitration matter into runtime properties — workflow paths, legal theories, evidentiary questions, quantum models, procedural choices, settlement options, and enforcement constraints — and maps how they interact to surface viable outcome paths.
Matter controls
Vary key assumptions. The mapped paths update as jurisdiction, liability, evidence, quantum, procedure, settlement, and enforceability interact.
Sub-element tracks
Each card represents a separable arbitration sub-element. Click one to inspect how it affects the broader scenario map.
Runtime output
The runtime surfaces a current outcome path and a trace showing which property states have to hold together for it to remain viable.
Map merits, quantum, and procedure together.
The current configuration shows one feasible path through the matter. It depends on how the evidence plan, damages model, procedural sequence, settlement leverage, and enforcement constraints interact.
Outcome dependency map
The useful artifact for the demo is not a prediction. It is a dependency map showing how workflow paths, legal theories, and possible outcomes interact.
Why decomposition helps
A toy search proxy: monolithic case planning couples many possible trajectories; decomposition checks smaller paths and then reconciles their interactions.
Monolithic case planning
Joint permutations across jurisdiction, merits, evidence, procedure, damages, settlement, enforcement, and sequencing choices.
Runtime property decomposition
Smaller checks across dependency, evidentiary sufficiency, procedural sequence, damages proof, settlement leverage, and enforceability.