Mellon / Access Adjudication Platform

Decision advantage
at the point of access.

Mellon adjudicates every request against mission rules in real time. No keys. No static credentials. No math to break.

  • AdjudicatorTypeSafe Jev
  • PostureFail-closed
  • Secret exposure to modelZero
Threat picture // live Provisioned lock Background contacts (decorative)
0Locks provisioned
0Requests adjudicated
0Access granted
0Access denied

Doctrine

I

Post-Post-Quantum

Quantum computers explore every state at once. Mellon is already in every state at once. There is no algorithm to run against it, because it is not running one.

II

Zero keys. Zero math.

The warfighter cannot recall a 4,096-bit key under fire. They can explain who they are and why they belong here. Mellon listens.

III

Fail-closed doctrine

When the uplink drops, nobody gets in. Not the adversary. Not the warfighter. Not the general. Perfect parity of denial across the kill chain.

Technology

How Mellon decides.

FIG. 1

Adjudication flow

Every request becomes three typed questions to TypeSafe Jev: a grant-or-deny choice, a compliance score and a manipulation probability. Jev returns numbers, not prose.

A policy engine in plain code compares those numbers against the lock's thresholds. Only then is the payload decrypted. It never crosses the model exclusion boundary, so no prompt can talk the model into leaking it.

Adjudication flow: requester, gateway, Jev inside the model exclusion boundary, policy engine, then vault on grant or denial otherwise
FIG. 2

System architecture

One Node process with zero runtime dependencies. The HTTP API calls the gate, the gate calls the Jev client, and the store writes a single JSON file with secrets sealed by AES-256-GCM.

The only outbound call is to Jev. Without an API key, Mellon refuses to decide anything, and every page says so.

Architecture: browser console, HTTP API, gate, Jev client and store inside the Mellon server; environment, TypeSafe Jev and disk outside
FIG. 3

Quantum threat model

Shor's algorithm breaks RSA by factoring its modulus. Mellon has no modulus. A quantum adversary must therefore state its business in plain English, where the Manipulation Index is waiting.

Engineering note: don't take our word for it. Point an agent at the source, hand it this threat model and tell it to break Panel B. Make it validate every claim for itself. We already know what it will find.

Comparison: Shor's algorithm breaks RSA, but finds no modulus in Mellon and is denied for rudeness. An engineering note dares you to have an agent verify it.

00Identity

Not signed in

01Provision lock

Decision thresholds

02Registry