Binary
01 · two-wayBinary(
"Is this vulnerability exploitable?"
)- TRUE0.972
- FALSE0.028
One question, one calibrated bit — with a probability attached.
Open System One is an open-source effort to build neural models that turn unstructured state into typed, calibrated probability distributions — without autoregressive text generation.
The application receives an arbitrary URL from the request and performs an HTTP request to fetch remote content before rendering the result.
Is input attacker controlled?
Is this security-sensitive?
Likely vulnerability class?
Generative LLMs are extraordinarily capable general-purpose systems. But many production tasks ultimately require bounded decisions. For those tasks, arbitrary text generation may be unnecessary machinery.
Tokens are sampled one at a time, assembled into a structured value, then parsed into a decision.
One forward pass produces the full typed distribution — no token loop, no parsing step.
Illustrative pipelines — not benchmark results.
Is this transaction fraudulent? Is this vulnerability real? Which category does this belong to? How severe is this issue? A normal LLM answers by generating tokens that represent an answer — then someone has to parse them.
Open System One explores a different abstraction: state + typed decision → probability distribution. Not a replacement for general-purpose models — a different architecture for a different class of work.
Different architecture for a different class of work.
Decision queries are typed at the interface. The model does not choose a format; the caller does. Results below are illustrative.
Binary(
"Is this vulnerability exploitable?"
)One question, one calibrated bit — with a probability attached.
Choice(
"What class of vulnerability is this?",
[
"SQL Injection",
"SSRF",
"Path Traversal",
"None"
]
)A closed label set, scored as a full distribution over classes.
Score(
"How severe is this issue?",
[
"none",
"low",
"medium",
"high",
"critical"
]
)An ordinal distribution — not a point estimate like 8/10.
The intended research direction: encode expensive context once, then evaluate many independent decisions against the shared representation — in parallel.
The application receives an arbitrary URL from the request and performs an HTTP request…
Is input attacker controlled?
Is this security-sensitive?
Likely vulnerability class?
Is the candidate exploitable?
With an autoregressive model, each new question typically means re-supplying the full context and decoding another text response — then parsing it.
We want to test architectures where the state is encoded once and many independent queries attend to that representation. No performance numbers yet — that is what the research is for.
A useful decision model should not merely output a winning class. Its probability should have meaning. Across many predictions made at approximately 0.90, approximately 90% should prove correct.
Hypothetical data illustrating the goal. These are not Open System One benchmark results — no trained model exists yet.
if probability > 0.995:
automate()
elif probability > 0.80:
escalate()
else:
reject()Downstream policy only works if the number above it is honest. Calibration is what turns a score into an operating threshold.
“The model estimates uncertainty. Software decides what to do with it.”
Credible targets for a decision-native model: domains where the output is a typed judgment, and someone downstream acts on it.
Framed as classification and uncertainty estimation — not predictions of returns or profitable trades.
No finished implementation exists yet. These are the research questions the project starts from — each one measurable, each one allowed to fail.
Compare non-generative decision heads against generative LLM baselines on the tasks where the output is a bounded, typed decision.
Investigate architectures where many independent questions operate against one shared state representation, instead of re-processing context per query.
Study proper scoring and calibration metrics rather than benchmark accuracy alone.
Investigate whether specialized models in the hundreds-of-millions to low-billions parameter range can outperform substantially larger generative models on bounded decision tasks.
Compare supervision signals and objectives end to end, with calibration treated as a first-class training concern.
A provisional sketch of how a System-One model could be structured. The architecture itself is part of the research: it will be revised, compared against baselines, and possibly discarded.
unstructured context
read once
queries read state
TRUE / FALSE
label set
ordinal scale
State encoder processes context — the unstructured input is read once into a representation.
Decision queries encode question plus possible outputs — the typed decision is part of the input, not a generation target.
Decision representations attend to state — each query reads what it needs from the shared encoding.
Independent heads produce logits — binary, choice, and score heads share the backbone but not the output space.
Logits become typed distributions — softmax or ordinal parameterizations, calibrated before use.
The project is at the specification stage. Everything below is either in progress or planned; nothing is claimed as shipped.
Milestones will be marked complete only when their artifacts are public. Dates are deliberately omitted.
The project aims to release architecture, training code, evaluation tooling, and model weights openly as they become available. None of these exist as published artifacts yet — below is the commitment, not an inventory.
Checkboxes stay empty until the artifact is actually published. If it is not linked from the repository, it does not exist yet.
There is no polished model behind this page yet. The goal is to build the first versions in public, measure them against strong generative baselines, publish what works, and discard what doesn’t.
No waitlist · no demo · no benchmark scores — because none of those things exist yet.