THEPROTOCOL

LYCEUM

#19 of 21Tier II · full anatomy6/6 primitives live in production
Education and Credentialing

Credentials that verify in seconds, revoke honestly, and can prove a threshold without opening the transcript.

Open the live chamber in the app
The animated flow, the attack replays and the deep architecture run there; this page is the reference text.

Who this serves

The problem

A degree is verified by emailing a registrar and waiting; a licence is checked against a register that lags reality; a forged certificate costs less than the courier that delivers it. And the honest candidate has only one move: hand over the entire transcript when the question was a single threshold.

The system

LYCEUM issues credentials as signed attestations: the engineering faculty signs the degree, the medical board signs the licence, each expiry-dated, each revocable, each verifiable by anyone against the issuer’s published keys in seconds, with no registrar in the loop. When the board revokes a licence on Tuesday, the revocation rides the event stream to every verifier that has ever cached it, and Wednesday’s verification honestly fails.

The quiet superpower is selective proof. A hospital needs to know a candidate passed the boards above the threshold; it does not need the score. The candidate proves the threshold with a zero-knowledge attestation verified against a published circuit, so the verifier confirms the rule held without ever seeing the number, and the transcript stays where it belongs. Scholarship stipends run the same rails as everything else here: escrowed at award, released on attested progress, disputed with evidence when it comes to that.

The cast and their ceilings

AgentRoleCeiling
faculty-issuerSigns degrees and course creditIssue and revoke its own attestations only.
board-issuerSigns and revokes licencesIts own register; revocations broadcast.
verifier-deskChecks candidates for employersVerify only. Sees proofs, not transcripts.
scholarship-fundEscrows stipendsFund and release on attested progress.

The flow, step by step

  1. The faculty signs. The credential is dated, revocable, and its own proof.
  2. The candidate proves the threshold without opening the transcript.
  3. The employer verifies the rule held. The score stays private.
  4. A Tuesday revocation reaches every verifier by Wednesday.
  5. Stipends release from escrow on attested progress.

Each need, mapped to a live primitive

The needThe protocol primitiveStatus
A credential is a signed attestationIssuer-signed, expiry-dated, revocable attestationsLIVE
Revocation that actually reaches verifiersRevocation over the event stream, not a phone callLIVE
Prove the grade, hide the transcriptZK attestations: PlonK verification over published circuitsLIVE (gated)
Tuition and stipends in escrowMilestone contracts for programmes and scholarshipsLIVE
Issuers with reputationsTrust scores earned on verified outcomesLIVE
Records that outlive the issuerAppend-only ledger; verification needs no live registrarLIVE

The attack this chamber refuses: The beautiful forgery

The attack. A candidate presents a perfectly typeset degree certificate from a real university that never issued it.

Why it fails. Verification does not read the document; it checks the issuer’s signature against published keys. A forgery is not a worse document here, it is a missing signature, and the check that finds it takes seconds and asks nobody’s permission.

Rail S14 · Immutable ledger. Append-only, replayable, forensically searchable. History cannot be edited.

What actually happens. The verification fails plainly, the real issuer’s register is untouched, and the beautiful typesetting convinces exactly no one who checked.

Deep architecture

LYCEUM deployed: the issuing institutions sign on their own frame; verifiers check against published keys in seconds with no registrar in the loop; revocations ride the event stream to everyone who ever cached a credential; and the transcripts sit below, deliberately connected to nothing, because the zero-knowledge rail exists precisely so they never have to leave. The trace replays one candidate, issuance to a threshold proved without a score.

The deployment, traced

  1. Issuance reads the student information system, which remains the academic truth.
  2. The engineering faculty signs the degree: expiry-dated, revocable, its keys published.
  3. The medical board signs the licence on the same rails.
  4. A hospital verifies in seconds against the issuer’s published keys. No registrar is in the loop.
  5. The hospital needs to know the boards were passed above threshold. It does not need the score. The candidate proves the threshold, zero-knowledge.
  6. The proof verifies against a published circuit. The rule held; the number never appeared.
  7. The verifier records the proof, not the transcript.
  8. On Tuesday, the board revokes a licence.
  9. The revocation rides the event stream to every verifier that ever cached the credential. Wednesday’s verification honestly fails.
  10. Scholarship stipends run the same rails: escrowed at award.
  11. The stipend lands exactly once, staged.
  12. Each stage releases on attested progress, and a dispute, if it comes, argues over evidence.

Adoption, phase by phase

Discover: One credential class, re-read as attestations.

Pilot: One faculty issues; one employer verifies.

Production: The institution signs; the sector verifies.

Federation: Credentials that travel; scores that do not.

Sizing

LevelWhatContainers
L1Candidates and small employers join with accounts only0 of theirs
L2An institution issues via agents against a hosted seatagents only
L3A frame per institution or sector body~9, one VM up

One threshold, proved without the score

sequenceDiagram
  participant SIS as SIS (source of truth)
  participant Fac as faculty-issuer
  participant Att as signed attestations
  participant Anna as candidate
  participant ZK as ZK circuit (published)
  participant Hos as verifier-desk
  SIS-->>Fac: result, read-side
  Fac->>Att: attestation signed, expiry-dated
  Anna->>ZK: prove: score above threshold
  ZK-->>Hos: proof verifies against the circuit
  Hos->>Att: issuer keys checked, seconds
  Note over Hos: the rule held; the number never appeared
  Note over Att: a Tuesday revocation makes Wednesday's check honestly fail

Topology, as declared

flowchart LR
  F["faculty issuer"] -->|"sign attestation<br/>expiry + revocable"| CRED["credential<br/>verifiable vs published keys"]
  CRED -->|"ZK threshold proof<br/>PlonK, published circuit"| V["verifier"]
  B["board issuer"] -->|"revocation"| WS["event stream<br/>reaches cached verifiers"]
  FUND["scholarship escrow"] -->|"release on attested progress"| TEG["TEG"]
  CRED --> ES[("append-only record<br/>outlives the issuer")]

Standing it up

What this does not claim