PrismDevRelOpen the app
Examples: Compression admission

Overview

Example apps

Decision tables

Rule 30 cellStrike dieWise deferralCurrent supportHeader workPlant attunementCapability routePublish gateProposal admissionCompression admissionQuorum commitAddress admissionDataflow policyDraft admissionCoded matmul admissionUTQC row honestyCalculator protocolRequantization clampJCS NFC admissionTwo-seed barDocs sync

Policy decisions

Open policyNamespace authorizationAxiom policyGNAF claim wordingEmporous admissionPortal publication

State machines

MCP task lifecycleContainer lifecycleAtlas walk controlsVault escrow lifecycleRelease lifecycleOrganization lifecycle

// example · Decision tables

Compression admission

Decide if a new UORC archive replaces the best one so far. A smaller size must never come at the cost of lost data.

Inspired by UOR-Foundation/compression (live). UORC, lossless compression whose compressed object is an executable Universal Object Reference.

Pattern: Decision table, OMG DMN 1.5, hit policy FIRST. To write one of your own, follow How to build a decision table app.

What the Compression admission app does1. Request: roundtrip, incumbent, candidate, order 2. 4 rules: the first that matches wins 3. Answer: admit, keep, refuse 4. Proved: 3 theorems, 40 tests01Requestroundtrip,incumbent,candidate, order024 rulesthe first thatmatches wins03Answeradmit, keep,refuse04Proved3 theorems, 40testsWhat the Compression admission app does1. Request: roundtrip, incumbent, candidate, order 2. 4 rules: the first that matches wins 3. Answer: admit, keep, refuse 4. Proved: 3 theorems, 40 tests01Requestroundtrip, incumbent, candidate,order024 rulesthe first that matches wins03Answeradmit, keep, refuse04Proved3 theorems, 40 tests
What the Compression admission app does. A request goes in, the rules decide, and the Lean kernel has already proved what the rules promise.
The data in this figure
StepWhat happens
1. Requestroundtrip, incumbent, candidate, order
2. 4 rulesthe first that matches wins
3. Answeradmit, keep, refuse
4. Proved3 theorems, 40 tests
Fingerprint
ac05263a0359acd8888df31d00c7b77fb4d3bc5de05f13fa6655c357a867fc3a
Acceptance vectors
40
Claims
6

Verified by prismpm verify in the pinned SDK when this site was built.

The prompt

This is the whole input. Raw JSON · Open it in the builder · Download the app (.zip)

The prompt 299 lines
{
  "schema": "prism/prompt/1",
  "goal": "Decide if a new UORC archive replaces the best one so far. A smaller size must never come at the cost of lost data.",
  "pattern": "decisionTable",
  "repository": "UOR-Foundation/compression",
  "app": {
    "name": "uorc-admission",
    "title": "Compression admission",
    "purpose": "Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order.",
    "fields": [
      {
        "name": "roundtrip",
        "kind": "choice",
        "values": [
          "exact",
          "differs"
        ],
        "means": "whether replay reproduces every object and boundary byte for byte"
      },
      {
        "name": "incumbent",
        "kind": "number",
        "min": 0,
        "means": "the best-known archive's wire length, in bytes"
      },
      {
        "name": "candidate",
        "kind": "number",
        "min": 0,
        "means": "the candidate archive's wire length, in bytes"
      },
      {
        "name": "order",
        "kind": "choice",
        "values": [
          "before",
          "same",
          "after"
        ],
        "means": "with equal lengths, the candidate bytes against the incumbent bytes"
      }
    ],
    "outcomes": [
      "admit",
      "keep",
      "refuse"
    ],
    "meanings": {
      "admit": "the candidate replaces the incumbent as best-known archive",
      "keep": "the incumbent stays best-known",
      "refuse": "the candidate is not lossless and is rejected"
    },
    "rules": [
      {
        "when": [
          {
            "field": "roundtrip",
            "op": "is",
            "value": "differs"
          }
        ],
        "then": "refuse",
        "why": "src/Uorc/Search/Verify.lex.tex runTrial: any mismatch rejects the trial (full_bytes_not_digest_equality)"
      },
      {
        "when": [
          {
            "field": "candidate",
            "op": "<",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "admit",
        "why": "src/Uorc/Search/OrderRope.lex.tex beginDecision: a shorter challenger replaces the incumbent"
      },
      {
        "when": [
          {
            "field": "candidate",
            "op": ">",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "keep",
        "why": "OrderRope.lex.tex beginDecision: a longer challenger keeps the incumbent"
      },
      {
        "when": [
          {
            "field": "order",
            "op": "is",
            "value": "before"
          }
        ],
        "then": "admit",
        "why": "OrderRope.lex.tex: on equal length the first differing byte decides, and a smaller byte replaces"
      }
    ],
    "otherwise": "keep",
    "otherwiseWhy": "equal length and not before in byte order: keepIncumbent",
    "properties": [
      {
        "kind": "never",
        "when": [
          {
            "field": "roundtrip",
            "op": "is",
            "value": "differs"
          }
        ],
        "then": "admit",
        "why": "a lossy candidate is never admitted"
      },
      {
        "kind": "never",
        "when": [
          {
            "field": "candidate",
            "op": ">",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "admit",
        "why": "the best-known archive never grows"
      },
      {
        "kind": "always",
        "when": [
          {
            "field": "roundtrip",
            "op": "is",
            "value": "exact"
          },
          {
            "field": "candidate",
            "op": "<",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "admit",
        "why": "an exact, strictly shorter archive always replaces"
      }
    ],
    "examples": [
      {
        "request": "exact 1000 640 same",
        "response": "admit"
      },
      {
        "request": "exact 640 640 before",
        "response": "admit"
      },
      {
        "request": "exact 640 640 after",
        "response": "keep"
      },
      {
        "request": "exact 640 640 same",
        "response": "keep"
      },
      {
        "request": "exact 640 700 before",
        "response": "keep"
      },
      {
        "request": "differs 1000 10 before",
        "response": "refuse"
      }
    ]
  },
  "stakeholders": [
    {
      "name": "Compression researcher",
      "text": "Searches for smaller references and needs every admitted one to be exact and no longer than the one it replaces.",
      "concerns": [
        "Proved guarantees",
        "Correct answers"
      ]
    },
    {
      "name": "Benchmark reviewer",
      "text": "Compares measured results and needs a best-known archive never to be stated as a record or a minimum.",
      "concerns": [
        "Claim boundaries"
      ]
    }
  ],
  "concerns": [
    {
      "name": "Claim boundaries",
      "text": "A best-known checked archive is not a minimality certificate or a record; record status exists only when an external authority accepts it.",
      "model": "quality"
    }
  ],
  "components": [
    {
      "name": "UORC web client",
      "text": "The accessible file-oriented client in web/ and client/ that runs the search and shows the archive.",
      "kind": "staticSite"
    },
    {
      "name": "External record authority",
      "text": "The benchmark authority whose own rules decide whether a measured result is a record.",
      "kind": "externalSystem"
    }
  ],
  "threats": [
    {
      "name": "Digest-only verification",
      "text": "A candidate is accepted because a digest matched, while its bytes or boundaries differ.",
      "stride": "tampering",
      "asset": "answer",
      "likelihood": "low",
      "impact": "critical",
      "control": {
        "name": "Full byte replay",
        "text": "Verification compares every byte and boundary, never only a digest, and a mismatch is never admitted.",
        "evidence": [
          {
            "kind": "review",
            "reference": "src/Uorc/Search/Verify.lex.tex full_bytes_not_digest_equality"
          },
          {
            "kind": "proof",
            "reference": "UorcAdmissionProofs::inv001Holds"
          }
        ]
      }
    },
    {
      "name": "Boundary-shifted collection",
      "text": "An archive reproduces the same flattened bytes with the object boundaries moved.",
      "stride": "tampering",
      "asset": "request",
      "likelihood": "low",
      "impact": "major",
      "control": {
        "name": "Boundaries checked",
        "text": "Replay checks object counts and lengths, so a shifted boundary is a mismatch.",
        "evidence": [
          {
            "kind": "review",
            "reference": "src/Uorc/Search/Verify.lex.tex same_flattening_different_boundary_rejected"
          }
        ]
      }
    },
    {
      "name": "Record claimed",
      "text": "A best-known archive is published as a compression record or a minimum.",
      "stride": "repudiation",
      "asset": "answer",
      "likelihood": "medium",
      "impact": "major",
      "accepted": "The engine states only a best-known checked archive and produces no minimality certificate; README claim boundaries leave record status to the external authority."
    }
  ],
  "quality": [
    {
      "characteristic": "Functional suitability",
      "subcharacteristic": "Functional correctness",
      "requirement": "Lossless admissions",
      "text": "Every admitted archive replays its objects exactly.",
      "measure": "Lossy admissions",
      "measureText": "Requests with roundtrip differs answered admit.",
      "threshold": 0
    }
  ],
  "journeys": [
    {
      "stakeholder": "Compression researcher",
      "steps": [
        "REQ-001",
        "REQ-002",
        "REQ-003",
        "REQ-004",
        "otherwise"
      ]
    },
    {
      "stakeholder": "Benchmark reviewer",
      "steps": [
        "INV-001",
        "INV-002",
        "INV-003"
      ]
    }
  ],
  "license": "MIT OR Apache-2.0",
  "axioms": {}
}

What the app claims

Each claim is a row in model/ids.toml, a scenario and a test, and a theorem the Lean kernel checks. The claims are quoted as the model states them.

Pattern

Decision table: OMG DMN 1.5, hit policy FIRST. The rules are tried in order, and the first one that matches gives the answer. If none matches, the default answer applies. This is a DMN decision table with the FIRST hit policy.

PatternStandardAnswers
Decision tableOMG DMN 1.5, hit policy FIRSTadmit, keep, refuse
Rules for each answeradmit: 2 rules; keep: 1 rules; refuse: 1 rulesadmit2keep1 + defaultrefuse1
Rules for each answer. Each bar counts the rules that give one answer. When no rule matches, the answer is keep.
The data in this figure
rules
admit2
keep1
refuse1

Behavior

A request is roundtrip, incumbent, candidate, order, separated by spaces. The first rule that matches decides. If none matches, the answer is keep. A request over 112 bytes, or in any other form, is answered invalid.

RuleWhenAnswerWhy
REQ-001roundtrip is differsrefusesrc/Uorc/Search/Verify.lex.tex runTrial: any mismatch rejects the trial (full_bytes_not_digest_equality)
REQ-002candidate is below incumbentadmitsrc/Uorc/Search/OrderRope.lex.tex beginDecision: a shorter challenger replaces the incumbent
REQ-003candidate is above incumbentkeepOrderRope.lex.tex beginDecision: a longer challenger keeps the incumbent
REQ-004order is beforeadmitOrderRope.lex.tex: on equal length the first differing byte decides, and a smaller byte replaces
otherwiseno rule matcheskeepequal length and not before in byte order: keepIncumbent

Properties Lean proves

Each property is a theorem about the same definitions the app is built from. It is proved for every request, not only the tested ones.

PropertyStatementTheoremWhy
INV-001It never answers admit when roundtrip is differs.UorcAdmissionProofs::inv001Holdsa lossy candidate is never admitted
INV-002It never answers admit when candidate is above incumbent.UorcAdmissionProofs::inv002Holdsthe best-known archive never grows
INV-003It always answers admit when roundtrip is exact and candidate is below incumbent.UorcAdmissionProofs::inv003Holdsan exact, strictly shorter archive always replaces

Architecture

Stakeholders and the concerns each one views the app through (ISO/IEC/IEEE 42010).

StakeholderWho they areConcerns
Benchmark reviewerCompares measured results and needs a best-known archive never to be stated as a record or a minimum.Claim boundaries
Compression researcherSearches for smaller references and needs every admitted one to be exact and no longer than the one it replaces.Proved guarantees, Correct answers
VerifierAnyone who loads the holo, checks its fingerprint and replays its acceptance vectors before trusting an answer.Integrity of the published app, Refused malformed requests, Proved guarantees

Concerns

What the stakeholders care about, and the model each is viewed in.

ConcernWhat it meansModel
Claim boundariesA best-known checked archive is not a minimality certificate or a record; record status exists only when an external authority accepts it.quality
Correct answersEvery well-formed request is answered by the first rule that matches it, or keep when none does, as the spec states.quality
Integrity of the published appWhat a visitor runs is the holo the build verified, with its fingerprint and signed provenance beside it.security
Proved guaranteesEach of the 3 properties of the spec holds for every request, proved by the Lean kernel.quality
Refused malformed requestsA request that is not the 4 fields in order, or is longer than 112 bytes, is answered invalid and never guessed.security

Components

8 components and 11 edges between them.

ComponentKindWhat it is
BrowserexternalSystemThe visitor's web browser, which loads the page and runs the Compression admission guest.
Compression admission guestserviceThe Core-Wasm guest built from the model: it answers one request of at most 112 bytes with one answer of at most 64.
Compression admission pagestaticSiteThe page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors.
External record authorityexternalSystemThe benchmark authority whose own rules decide whether a measured result is a record.
GitHub PagesexternalSystemServes the page and the holo from the repository Pages workflow.
Prism buildcliAdapterprismpm verify in the SDK image prismpm.lock pins: it checks every theorem, builds the guest and replays every vector.
Source repositoryexternalSystemThe repository that holds the prompt, the model and its gate.
UORC web clientstaticSiteThe accessible file-oriented client in web/ and client/ that runs the search and shows the archive.

Design views

The SDK checks each view against the system model and draws it as OPL and PlantUML.

ViewDiagramViewpoint
Deciding a Compression admission requestopmObjectProcessCompression researcher: Correct answers
Components of Compression admissionumlComponentVerifier: Integrity of the published app
Answering a Compression admission requestumlSequenceCompression researcher: Correct answers
States of the Compression admission guestumlStateMachineVerifier: Refused malformed requests

Features and journeys

9 features. Each names the definitions that do the work and the tests that accept it. Each stakeholder has one journey.

Features and journeys 9 rows
FeatureCallsAccepted by
When roundtrip is differs, the answer is refuse.UorcAdmission::rule1, UorcAdmission::judgeUorcAdmission::application
When candidate is below incumbent, the answer is admit.UorcAdmission::rule2, UorcAdmission::judgeUorcAdmission::application
When candidate is above incumbent, the answer is keep.UorcAdmission::rule3, UorcAdmission::judgeUorcAdmission::application
When order is before, the answer is admit.UorcAdmission::rule4, UorcAdmission::judgeUorcAdmission::application
When no rule matches, the answer is keep.UorcAdmission::judgeUorcAdmission::application
A request that is not roundtrip, incumbent, candidate, order in order, separated by single spaces, or is over 112 bytes, is answered invalid.UorcAdmission::dispatch, UorcAdmission::decodeField1UorcAdmission::application
It never answers admit when roundtrip is differs.UorcAdmission::judgeUorcAdmissionProofs::inv001Holds
It never answers admit when candidate is above incumbent.UorcAdmission::judgeUorcAdmissionProofs::inv002Holds
It always answers admit when roundtrip is exact and candidate is below incumbent.UorcAdmission::judgeUorcAdmissionProofs::inv003Holds

Journeys

The ordered features each stakeholder takes.

StakeholderSteps
Benchmark reviewerINV-001 → INV-002 → INV-003
Compression researcherREQ-001 → REQ-002 → REQ-003 → REQ-004 → otherwise
Verifierrefuse → INV-001 → INV-002 → INV-003

Security and threat model

12 threats against 4 assets. Each has a STRIDE category, and either a control with evidence or a risk that is accepted on purpose.

Security and threat model 12 rows
ThreatSTRIDEAssetRiskAnswered by
Answer that breaks INV-001repudiationAnswermedium likelihood, critical impactProof of INV-001: proof UorcAdmissionProofs::inv001Holds
Answer that breaks INV-002repudiationAnswermedium likelihood, critical impactProof of INV-002: proof UorcAdmissionProofs::inv002Holds
Answer that breaks INV-003repudiationAnswermedium likelihood, critical impactProof of INV-003: proof UorcAdmissionProofs::inv003Holds
Boundary-shifted collectiontamperingRequest byteslow likelihood, major impactBoundaries checked: review src/Uorc/Search/Verify.lex.tex same_flattening_different_boundary_rejected
Digest-only verificationtamperingAnswerlow likelihood, critical impactFull byte replay: review src/Uorc/Search/Verify.lex.tex full_bytes_not_digest_equality; proof UorcAdmissionProofs::inv001Holds
Granted capabilityinformationDisclosureAnswerlow likelihood, major impactNo capability granted: gate prism-code check refuses an ungranted guest import
Malformed requesttamperingRequest byteshigh likelihood, major impactStrict decoder: gate malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify
Oversized requestdenialOfServiceRequest bytesmedium likelihood, minor impactBounded request: gate acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify
Record claimedrepudiationAnswermedium likelihood, major impactaccepted: The engine states only a best-known checked archive and produces no minimality certificate; README claim boundaries leave record status to the external authority.
Substituted holospoofingPublished hololow likelihood, critical impactFingerprint and provenance: gate actions/attest-build-provenance in the pages workflow; gate prism-code check of the holo identities in the page
Substituted hostspoofingPublished hololow likelihood, critical impactaccepted: A page cannot defend against its own host. The holo carries signed build provenance a visitor can check, and the app can be rebuilt from its prompt.
Tampered modeltamperingModel sourcelow likelihood, major impactRegenerated from the prompt: gate prismpm verify in the SDK image prismpm.lock pins; review app/prompt.json

Quality

ISO/IEC 25010:2023 requirements. Each has a measure and a threshold that a theorem pins.

RequirementCharacteristicMeasureThreshold
Bounded allocation: The guest allocates at most 224 bytes for one request.Performance efficiency: Resource utilizationGuest allocation bytes224
Bounded request: A request over 112 bytes is refused before any field is read.Performance efficiency: Time behaviourRequest bytes read112
Every property proved: All 3 properties are theorems the Lean kernel checks.Security: IntegrityUnproved properties0
Every request answered: Every request gets an answer: a rule, keep otherwise, or invalid.Functional suitability: Functional completenessUnanswered requests0
Every vector replays: All 40 acceptance vectors replay in the compiled guest, the shortest 0 bytes long.Reliability: FaultlessnessFailed vectors0
Examples answered as stated: Every one of the 6 examples of the spec is answered as it states.Functional suitability: Functional correctnessExample mismatches0
Lossless admissions: Every admitted archive replays its objects exactly.Functional suitability: Functional correctnessLossy admissions0

Compliance

One obligation per standard, each naming its evidence.

StandardSubjectEvidence
ISO/IEC/IEEE 42010:2022Architecture descriptionArchitecture::architectureDescriptionHolds
ISO/PAS 19450:2015 and OMG UML 2.5.1Design viewsDesign::viewOpmDecide, Design::viewUmlComponents, Design::viewUmlRequest, Design::viewUmlStates
ISO/IEC 25010:2023Product qualityQuality::qualityModelHolds
ISO/IEC 27034-1:2011 and ISO/IEC 27005:2022Application security and riskSecurity::controlSet
OMG DMN 1.5, hit policy FIRSTDecision tableUorcAdmission::judge
OpenSpecRequirementsUorcAdmission::application
SPDX MIT OR Apache-2.0LicensingUorcAdmission::application

Rendered design views

Written by the SDK from the design records when it verified the app.

design/Design.viewOpmDecide.opl
View: Design::viewOpmDecide
Title: Deciding a Compression admission request
Viewpoint: Architecture::viewpointCompressionResearcherCorrectAnswers
Notation: ISO/PAS 19450:2015 OPM, Prism OPL profile

componentBrowser is an object.
componentCompressionAdmissionGuest is an object.
componentCompressionAdmissionGuest can be stateDeciding or stateIdle.
processDecide is a process.
processEncodeAnswer is a process.
processJudge is a process.
processParseRequest is a process.
componentCompressionAdmissionGuest handles processDecide.
processParseRequest requires componentBrowser.
processEncodeAnswer affects componentBrowser.
processJudge invokes processEncodeAnswer.
processParseRequest invokes processJudge.
processDecide zooms into processParseRequest, processJudge, and processEncodeAnswer, in that sequence.
design/Design.viewUmlComponents.puml
@startuml
' UML 2.5.1 component diagram
' view: Design::viewUmlComponents
' viewpoint: Architecture::viewpointVerifierIntegrityOfThePublishedApp
title Components of Compression admission
component "componentBrowser" as c0
component "componentCompressionAdmissionGuest" as c1
component "componentCompressionAdmissionPage" as c2
component "componentExternalRecordAuthority" as c3
component "componentGitHubPages" as c4
component "componentPrismBuild" as c5
component "componentSourceRepository" as c6
component "componentUORCWebClient" as c7
c0 --> c1 : edgeBrowserToCompressionAdmissionGuest
c1 --> c0 : edgeCompressionAdmissionGuestToBrowser
c1 --> c3 : edgeCompressionAdmissionGuestToExternalRecordAuthority
c1 --> c7 : edgeCompressionAdmissionGuestToUORCWebClient
c2 --> c4 : edgeCompressionAdmissionPageToGitHubPages
c3 --> c1 : edgeExternalRecordAuthorityToCompressionAdmissionGuest
c4 --> c0 : edgeGitHubPagesToBrowser
c5 --> c1 : edgePrismBuildToCompressionAdmissionGuest
c5 --> c2 : edgePrismBuildToCompressionAdmissionPage
c6 --> c5 : edgeSourceRepositoryToPrismBuild
c7 --> c1 : edgeUORCWebClientToCompressionAdmissionGuest
@enduml
design/Design.viewUmlRequest.puml
@startuml
' UML 2.5.1 sequence diagram
' view: Design::viewUmlRequest
' viewpoint: Architecture::viewpointCompressionResearcherCorrectAnswers
title Answering a Compression admission request
participant "componentBrowser" as p0
participant "componentCompressionAdmissionGuest" as p1
p0 -> p1 : processDecide
p1 --> p0 : processDecide
@enduml
design/Design.viewUmlStates.puml
@startuml
' UML 2.5.1 state machine diagram
' view: Design::viewUmlStates
' viewpoint: Architecture::viewpointVerifierRefusedMalformedRequests
title States of the Compression admission guest
state "stateAnsweredAdmit" as s0
state "stateAnsweredKeep" as s1
state "stateAnsweredRefuse" as s2
state "stateDeciding" as s3
state "stateIdle" as s4
state "stateRefused" as s5
[*] --> s4
s4 --> s3 : processParseRequest
s4 --> s5 : processParseRequest
s3 --> s2 : processRule1
s3 --> s0 : processRule2
s3 --> s1 : processRule3
s3 --> s0 : processRule4
s3 --> s1 : processOtherwise
s0 --> s4 : processEncodeAnswer
s1 --> s4 : processEncodeAnswer
s2 --> s4 : processEncodeAnswer
s5 --> s4 : processEncodeAnswer
@enduml

Prism source

Every file the builder wrote, laid out as a repository created from UOR-Foundation/template. The language packages and Foundation modules every app shares are in the download.

app/src/Architecture.lex.tex 399 lines
\begin{lexlean}{Architecture}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Foundation.Arch}
\title{architectural component}
\begin{semanticmodule}
definition{
  name: standardIso25010,
  parameters: [],
  result: Foundation.Arch::StandardReference,
  body: (record Foundation.Arch::StandardReference {standardIndex := 0, editionIndex := 0, standardId := "ISO-25010-2023", edition := "2023"})
}

definition{
  name: standardIso27005,
  parameters: [],
  result: Foundation.Arch::StandardReference,
  body: (record Foundation.Arch::StandardReference {standardIndex := 1, editionIndex := 0, standardId := "ISO-27005-2022", edition := "2022"})
}

definition{
  name: standardIso27034,
  parameters: [],
  result: Foundation.Arch::StandardReference,
  body: (record Foundation.Arch::StandardReference {standardIndex := 2, editionIndex := 0, standardId := "ISO-27034-1-2011", edition := "2011"})
}

definition{
  name: standardIso42010,
  parameters: [],
  result: Foundation.Arch::StandardReference,
  body: (record Foundation.Arch::StandardReference {standardIndex := 4, editionIndex := 0, standardId := "ISO-42010-2022", edition := "2022"})
}

definition{
  name: stakeholderBenchmarkReviewer,
  parameters: [],
  result: Foundation.Arch::Stakeholder,
  body: (record Foundation.Arch::Stakeholder {index := 0, name := "Benchmark reviewer", text := "Compares measured results and needs a best-known archive never to be stated as a record or a minimum."})
}

definition{
  name: stakeholderCompressionResearcher,
  parameters: [],
  result: Foundation.Arch::Stakeholder,
  body: (record Foundation.Arch::Stakeholder {index := 1, name := "Compression researcher", text := "Searches for smaller references and needs every admitted one to be exact and no longer than the one it replaces."})
}

definition{
  name: stakeholderVerifier,
  parameters: [],
  result: Foundation.Arch::Stakeholder,
  body: (record Foundation.Arch::Stakeholder {index := 2, name := "Verifier", text := "Anyone who loads the holo, checks its fingerprint and replays its acceptance vectors before trusting an answer."})
}

definition{
  name: concernClaimBoundaries,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 0, name := "Claim boundaries", text := "A best-known checked archive is not a minimality certificate or a record; record status exists only when an external authority accepts it."})
}

definition{
  name: concernCorrectAnswers,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 1, name := "Correct answers", text := "Every well-formed request is answered by the first rule that matches it, or keep when none does, as the spec states."})
}

definition{
  name: concernIntegrityOfThePublishedApp,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 2, name := "Integrity of the published app", text := "What a visitor runs is the holo the build verified, with its fingerprint and signed provenance beside it."})
}

definition{
  name: concernProvedGuarantees,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 3, name := "Proved guarantees", text := "Each of the 3 properties of the spec holds for every request, proved by the Lean kernel."})
}

definition{
  name: concernRefusedMalformedRequests,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 4, name := "Refused malformed requests", text := "A request that is not the 4 fields in order, or is longer than 112 bytes, is answered invalid and never guessed."})
}

definition{
  name: componentBrowser,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 0, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Browser", text := "The visitor's web browser, which loads the page and runs the Compression admission guest."})
}

definition{
  name: componentCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 1, kind := (ctor Foundation.Arch::ComponentKind.service), name := "Compression admission guest", text := "The Core-Wasm guest built from the model: it answers one request of at most 112 bytes with one answer of at most 64."})
}

definition{
  name: componentCompressionAdmissionPage,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 2, kind := (ctor Foundation.Arch::ComponentKind.staticSite), name := "Compression admission page", text := "The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors."})
}

definition{
  name: componentExternalRecordAuthority,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 3, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "External record authority", text := "The benchmark authority whose own rules decide whether a measured result is a record."})
}

definition{
  name: componentGitHubPages,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 4, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "GitHub Pages", text := "Serves the page and the holo from the repository Pages workflow."})
}

definition{
  name: componentPrismBuild,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 5, kind := (ctor Foundation.Arch::ComponentKind.cliAdapter), name := "Prism build", text := "prismpm verify in the SDK image prismpm.lock pins: it checks every theorem, builds the guest and replays every vector."})
}

definition{
  name: componentSourceRepository,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 6, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Source repository", text := "The repository that holds the prompt, the model and its gate."})
}

definition{
  name: componentUORCWebClient,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 7, kind := (ctor Foundation.Arch::ComponentKind.staticSite), name := "UORC web client", text := "The accessible file-oriented client in web/ and client/ that runs the search and shows the archive."})
}

definition{
  name: edgeBrowserToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 0, fromIndex := 0, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeCompressionAdmissionGuestToBrowser,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 1, fromIndex := 1, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeCompressionAdmissionGuestToExternalRecordAuthority,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 2, fromIndex := 1, toIndex := 3, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeCompressionAdmissionGuestToUORCWebClient,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 3, fromIndex := 1, toIndex := 7, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeCompressionAdmissionPageToGitHubPages,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 4, fromIndex := 2, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeExternalRecordAuthorityToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 5, fromIndex := 3, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeGitHubPagesToBrowser,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 6, fromIndex := 4, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgePrismBuildToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 7, fromIndex := 5, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgePrismBuildToCompressionAdmissionPage,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 8, fromIndex := 5, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeSourceRepositoryToPrismBuild,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 9, fromIndex := 6, toIndex := 5, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: edgeUORCWebClientToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::Edge,
  body: (record Foundation.Arch::Edge {index := 10, fromIndex := 7, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}

definition{
  name: viewpointBenchmarkReviewerClaimBoundaries,
  parameters: [],
  result: Foundation.Arch::Viewpoint,
  body: (record Foundation.Arch::Viewpoint {index := 0, stakeholderIndex := 0, concernIndex := 0, modelKindIndex := 1})
}

definition{
  name: viewpointCompressionResearcherCorrectAnswers,
  parameters: [],
  result: Foundation.Arch::Viewpoint,
  body: (record Foundation.Arch::Viewpoint {index := 1, stakeholderIndex := 1, concernIndex := 1, modelKindIndex := 1})
}

definition{
  name: viewpointCompressionResearcherProvedGuarantees,
  parameters: [],
  result: Foundation.Arch::Viewpoint,
  body: (record Foundation.Arch::Viewpoint {index := 2, stakeholderIndex := 1, concernIndex := 3, modelKindIndex := 1})
}

definition{
  name: viewpointVerifierIntegrityOfThePublishedApp,
  parameters: [],
  result: Foundation.Arch::Viewpoint,
  body: (record Foundation.Arch::Viewpoint {index := 3, stakeholderIndex := 2, concernIndex := 2, modelKindIndex := 2})
}

definition{
  name: viewpointVerifierProvedGuarantees,
  parameters: [],
  result: Foundation.Arch::Viewpoint,
  body: (record Foundation.Arch::Viewpoint {index := 4, stakeholderIndex := 2, concernIndex := 3, modelKindIndex := 1})
}

definition{
  name: viewpointVerifierRefusedMalformedRequests,
  parameters: [],
  result: Foundation.Arch::Viewpoint,
  body: (record Foundation.Arch::Viewpoint {index := 5, stakeholderIndex := 2, concernIndex := 4, modelKindIndex := 2})
}

definition{
  name: viewBenchmarkReviewerClaimBoundaries,
  parameters: [],
  result: Foundation.Arch::View,
  body: (record Foundation.Arch::View {index := 0, viewpointIndex := 0, modelKindIndex := 1})
}

definition{
  name: viewCompressionResearcherCorrectAnswers,
  parameters: [],
  result: Foundation.Arch::View,
  body: (record Foundation.Arch::View {index := 1, viewpointIndex := 1, modelKindIndex := 1})
}

definition{
  name: viewCompressionResearcherProvedGuarantees,
  parameters: [],
  result: Foundation.Arch::View,
  body: (record Foundation.Arch::View {index := 2, viewpointIndex := 2, modelKindIndex := 1})
}

definition{
  name: viewVerifierIntegrityOfThePublishedApp,
  parameters: [],
  result: Foundation.Arch::View,
  body: (record Foundation.Arch::View {index := 3, viewpointIndex := 3, modelKindIndex := 2})
}

definition{
  name: viewVerifierProvedGuarantees,
  parameters: [],
  result: Foundation.Arch::View,
  body: (record Foundation.Arch::View {index := 4, viewpointIndex := 4, modelKindIndex := 1})
}

definition{
  name: viewVerifierRefusedMalformedRequests,
  parameters: [],
  result: Foundation.Arch::View,
  body: (record Foundation.Arch::View {index := 5, viewpointIndex := 5, modelKindIndex := 2})
}

definition{
  name: componentRecords,
  parameters: [],
  result: (List Foundation.Arch::Component),
  body: (cons (componentBrowser) (cons (componentCompressionAdmissionGuest) (cons (componentCompressionAdmissionPage) (cons (componentExternalRecordAuthority) (cons (componentGitHubPages) (cons (componentPrismBuild) (cons (componentSourceRepository) (cons (componentUORCWebClient) (nil Foundation.Arch::Component)))))))))
}

definition{
  name: edgeRecords,
  parameters: [],
  result: (List Foundation.Arch::Edge),
  body: (cons (edgeBrowserToCompressionAdmissionGuest) (cons (edgeCompressionAdmissionGuestToBrowser) (cons (edgeCompressionAdmissionGuestToExternalRecordAuthority) (cons (edgeCompressionAdmissionGuestToUORCWebClient) (cons (edgeCompressionAdmissionPageToGitHubPages) (cons (edgeExternalRecordAuthorityToCompressionAdmissionGuest) (cons (edgeGitHubPagesToBrowser) (cons (edgePrismBuildToCompressionAdmissionGuest) (cons (edgePrismBuildToCompressionAdmissionPage) (cons (edgeSourceRepositoryToPrismBuild) (cons (edgeUORCWebClientToCompressionAdmissionGuest) (nil Foundation.Arch::Edge))))))))))))
}

definition{
  name: viewpointRecords,
  parameters: [],
  result: (List Foundation.Arch::Viewpoint),
  body: (cons (viewpointBenchmarkReviewerClaimBoundaries) (cons (viewpointCompressionResearcherCorrectAnswers) (cons (viewpointCompressionResearcherProvedGuarantees) (cons (viewpointVerifierIntegrityOfThePublishedApp) (cons (viewpointVerifierProvedGuarantees) (cons (viewpointVerifierRefusedMalformedRequests) (nil Foundation.Arch::Viewpoint)))))))
}

definition{
  name: viewRecords,
  parameters: [],
  result: (List Foundation.Arch::View),
  body: (cons (viewBenchmarkReviewerClaimBoundaries) (cons (viewCompressionResearcherCorrectAnswers) (cons (viewCompressionResearcherProvedGuarantees) (cons (viewVerifierIntegrityOfThePublishedApp) (cons (viewVerifierProvedGuarantees) (cons (viewVerifierRefusedMalformedRequests) (nil Foundation.Arch::View)))))))
}

definition{
  name: edgesKnown,
  parameters: [count : Nat, records : (List Foundation.Arch::Edge)],
  result: Bool,
  body: (match records
    | List.nil => true
    | List.cons edge rest => (((project edge fromIndex) <? count) && (((project edge toIndex) <? count) && (edgesKnown count rest)))),
  recursive_argument: records
}

definition{
  name: viewpointsKnown,
  parameters: [
    stakeholderCount : Nat,
    concernCount : Nat,
    records : (List Foundation.Arch::Viewpoint)
  ],
  result: Bool,
  body: (match records
    | List.nil => true
    | List.cons viewpoint rest => (((project viewpoint stakeholderIndex) <? stakeholderCount) && (((project viewpoint concernIndex) <? concernCount) && (((project viewpoint modelKindIndex) <? 3) && (viewpointsKnown stakeholderCount concernCount rest))))),
  recursive_argument: records
}

definition{
  name: viewMatches,
  parameters: [view : Foundation.Arch::View, viewpoints : (List Foundation.Arch::Viewpoint)],
  result: Bool,
  body: (match viewpoints
    | List.nil => false
    | List.cons viewpoint rest => ((((project viewpoint index) =? (project view viewpointIndex)) && ((project viewpoint modelKindIndex) =? (project view modelKindIndex))) || (viewMatches view rest))),
  recursive_argument: viewpoints
}

definition{
  name: viewsConform,
  parameters: [
    viewpoints : (List Foundation.Arch::Viewpoint),
    records : (List Foundation.Arch::View)
  ],
  result: Bool,
  body: (match records
    | List.nil => true
    | List.cons view rest => ((viewMatches view viewpoints) && (viewsConform viewpoints rest))),
  recursive_argument: records
}

definition{
  name: architectureValid,
  parameters: [],
  result: Bool,
  body: ((edgesKnown 8 (edgeRecords)) && ((viewpointsKnown 3 5 (viewpointRecords)) && (viewsConform (viewpointRecords) (viewRecords))))
}

theorem{
  name: architectureDescriptionHolds,
  parameters: [],
  statement: ((architectureValid) = true),
  proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Compliance.lex.tex 56 lines
\begin{lexlean}{Compliance}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Architecture}
\importmodule{Design}
\importmodule{Quality}
\importmodule{Security}
\importmodule{UorcAdmission}
\title{standards reference}
\begin{semanticmodule}
structure{
  name: Obligation,
  type_parameters: [],
  parameters: [],
  fields: [
    {name: index, type: Nat},
    {name: standard, type: String},
    {name: subject, type: String},
    {name: text, type: String},
    {name: evidence, type: (List String)}
  ]
}

definition{
  name: obligations,
  parameters: [],
  result: (List Obligation),
  body: (cons (record Obligation {index := 0, standard := "ISO/IEC/IEEE 42010:2022", subject := "Architecture description", text := "Stakeholders, concerns, viewpoints and views are declared and their references resolve.", evidence := (cons "Architecture::architectureDescriptionHolds" (nil String))}) (cons (record Obligation {index := 1, standard := "ISO/PAS 19450:2015 and OMG UML 2.5.1", subject := "Design views", text := "Every design view is checked by the SDK against the system model before it is rendered.", evidence := (cons "Design::viewOpmDecide" (cons "Design::viewUmlComponents" (cons "Design::viewUmlRequest" (cons "Design::viewUmlStates" (nil String)))))}) (cons (record Obligation {index := 2, standard := "ISO/IEC 25010:2023", subject := "Product quality", text := "Characteristics, subcharacteristics, requirements and measures are numbered and their parents resolve.", evidence := (cons "Quality::qualityModelHolds" (nil String))}) (cons (record Obligation {index := 3, standard := "ISO/IEC 27034-1:2011 and ISO/IEC 27005:2022", subject := "Application security and risk", text := "Every threat has a STRIDE category and a mapped control with evidence, or an accepted risk with its rationale.", evidence := (cons "Security::controlSet" (nil String))}) (cons (record Obligation {index := 4, standard := "OMG DMN 1.5, hit policy FIRST", subject := "Decision table", text := "The 4 rules are tried in order and the first that matches gives the answer; otherwise keep.", evidence := (cons "UorcAdmission::judge" (nil String))}) (cons (record Obligation {index := 5, standard := "OpenSpec", subject := "Requirements", text := "Every rule and property of the spec is a requirement with a scenario in openspec/specs.", evidence := (cons "UorcAdmission::application" (nil String))}) (cons (record Obligation {index := 6, standard := "SPDX MIT OR Apache-2.0", subject := "Licensing", text := "The application and its model are offered under MIT OR Apache-2.0.", evidence := (cons "UorcAdmission::application" (nil String))}) (nil Obligation))))))))
}

definition{
  name: obligationsEvidenced,
  parameters: [position : Nat, items : (List Obligation)],
  result: Bool,
  body: (match items
    | List.nil => true
    | List.cons item rest => (((project item index) =? position) && (match{
      branches: [
        {body: false, binders: [], constructor: List.nil},
        {body: true, binders: [first, others], constructor: List.cons}
      ],
      scrutinee: (project item evidence)
    } && (obligationsEvidenced (position + 1) rest)))),
  recursive_argument: items
}

theorem{
  name: everyObligationEvidenced,
  parameters: [],
  statement: ((obligationsEvidenced 0 (obligations)) = true),
  proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Design.lex.tex 549 lines
\begin{lexlean}{Design}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{design view}
\begin{semanticmodule}
definition{
  name: processSendRequest,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentBrowser"})
}

definition{
  name: processDecide,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processParseRequest,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processJudge,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processEncodeAnswer,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processBuildAndVerify,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentPrismBuild"})
}

definition{
  name: processRule1,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processRule2,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processRule3,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processRule4,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: processOtherwise,
  parameters: [],
  result: Foundation.Arch::SystemProcess,
  body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: stateIdle,
  parameters: [],
  result: Foundation.Arch::SystemState,
  body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: stateDeciding,
  parameters: [],
  result: Foundation.Arch::SystemState,
  body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: stateRefused,
  parameters: [],
  result: Foundation.Arch::SystemState,
  body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: stateAnsweredAdmit,
  parameters: [],
  result: Foundation.Arch::SystemState,
  body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: stateAnsweredKeep,
  parameters: [],
  result: Foundation.Arch::SystemState,
  body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: stateAnsweredRefuse,
  parameters: [],
  result: Foundation.Arch::SystemState,
  body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: viewOpmDecide,
  parameters: [],
  result: Foundation.Arch::DesignView,
  body: (record Foundation.Arch::DesignView {title := "Deciding a Compression admission request", viewpoint := "Architecture::viewpointCompressionResearcherCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.opmObjectProcess)})
}

definition{
  name: viewUmlComponents,
  parameters: [],
  result: Foundation.Arch::DesignView,
  body: (record Foundation.Arch::DesignView {title := "Components of Compression admission", viewpoint := "Architecture::viewpointVerifierIntegrityOfThePublishedApp", diagram := (ctor Foundation.Arch::DesignDiagram.umlComponent)})
}

definition{
  name: viewUmlRequest,
  parameters: [],
  result: Foundation.Arch::DesignView,
  body: (record Foundation.Arch::DesignView {title := "Answering a Compression admission request", viewpoint := "Architecture::viewpointCompressionResearcherCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.umlSequence)})
}

definition{
  name: viewUmlStates,
  parameters: [],
  result: Foundation.Arch::DesignView,
  body: (record Foundation.Arch::DesignView {title := "States of the Compression admission guest", viewpoint := "Architecture::viewpointVerifierRefusedMalformedRequests", diagram := (ctor Foundation.Arch::DesignDiagram.umlStateMachine)})
}

definition{
  name: opmBrowser,
  parameters: [],
  result: Foundation.Arch::OpmThing,
  body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.object), subject := "Architecture::componentBrowser"})
}

definition{
  name: opmGuest,
  parameters: [],
  result: Foundation.Arch::OpmThing,
  body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.object), subject := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: opmDecide,
  parameters: [],
  result: Foundation.Arch::OpmThing,
  body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processDecide"})
}

definition{
  name: opmParseRequest,
  parameters: [],
  result: Foundation.Arch::OpmThing,
  body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processParseRequest"})
}

definition{
  name: opmJudge,
  parameters: [],
  result: Foundation.Arch::OpmThing,
  body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processJudge"})
}

definition{
  name: opmEncodeAnswer,
  parameters: [],
  result: Foundation.Arch::OpmThing,
  body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processEncodeAnswer"})
}

definition{
  name: opmGuestIdle,
  parameters: [],
  result: Foundation.Arch::OpmState,
  body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentCompressionAdmissionGuest", state := "Design::stateIdle"})
}

definition{
  name: opmGuestDeciding,
  parameters: [],
  result: Foundation.Arch::OpmState,
  body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentCompressionAdmissionGuest", state := "Design::stateDeciding"})
}

definition{
  name: opmGuestAgent,
  parameters: [],
  result: Foundation.Arch::OpmLink,
  body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.agent), source := "Architecture::componentCompressionAdmissionGuest", target := "Design::processDecide"})
}

definition{
  name: opmBrowserInstrument,
  parameters: [],
  result: Foundation.Arch::OpmLink,
  body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.instrument), source := "Architecture::componentBrowser", target := "Design::processParseRequest"})
}

definition{
  name: opmParseInvokesJudge,
  parameters: [],
  result: Foundation.Arch::OpmLink,
  body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.invocation), source := "Design::processParseRequest", target := "Design::processJudge"})
}

definition{
  name: opmJudgeInvokesEncode,
  parameters: [],
  result: Foundation.Arch::OpmLink,
  body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.invocation), source := "Design::processJudge", target := "Design::processEncodeAnswer"})
}

definition{
  name: opmEncodeAffectsBrowser,
  parameters: [],
  result: Foundation.Arch::OpmLink,
  body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.effect), source := "Architecture::componentBrowser", target := "Design::processEncodeAnswer"})
}

definition{
  name: opmZoomParseRequest,
  parameters: [],
  result: Foundation.Arch::OpmZoom,
  body: (record Foundation.Arch::OpmZoom {view := "Design::viewOpmDecide", process := "Design::processDecide", subprocess := "Design::processParseRequest", order := 0})
}

definition{
  name: opmZoomJudge,
  parameters: [],
  result: Foundation.Arch::OpmZoom,
  body: (record Foundation.Arch::OpmZoom {view := "Design::viewOpmDecide", process := "Design::processDecide", subprocess := "Design::processJudge", order := 1})
}

definition{
  name: opmZoomEncodeAnswer,
  parameters: [],
  result: Foundation.Arch::OpmZoom,
  body: (record Foundation.Arch::OpmZoom {view := "Design::viewOpmDecide", process := "Design::processDecide", subprocess := "Design::processEncodeAnswer", order := 2})
}

definition{
  name: umlBrowser,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentBrowser"})
}

definition{
  name: umlCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentCompressionAdmissionGuest"})
}

definition{
  name: umlCompressionAdmissionPage,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentCompressionAdmissionPage"})
}

definition{
  name: umlExternalRecordAuthority,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentExternalRecordAuthority"})
}

definition{
  name: umlGitHubPages,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentGitHubPages"})
}

definition{
  name: umlPrismBuild,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentPrismBuild"})
}

definition{
  name: umlSourceRepository,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentSourceRepository"})
}

definition{
  name: umlUORCWebClient,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentUORCWebClient"})
}

definition{
  name: umlBrowserToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeBrowserToCompressionAdmissionGuest"})
}

definition{
  name: umlCompressionAdmissionGuestToBrowser,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCompressionAdmissionGuestToBrowser"})
}

definition{
  name: umlCompressionAdmissionGuestToExternalRecordAuthority,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCompressionAdmissionGuestToExternalRecordAuthority"})
}

definition{
  name: umlCompressionAdmissionGuestToUORCWebClient,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCompressionAdmissionGuestToUORCWebClient"})
}

definition{
  name: umlCompressionAdmissionPageToGitHubPages,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCompressionAdmissionPageToGitHubPages"})
}

definition{
  name: umlExternalRecordAuthorityToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeExternalRecordAuthorityToCompressionAdmissionGuest"})
}

definition{
  name: umlGitHubPagesToBrowser,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeGitHubPagesToBrowser"})
}

definition{
  name: umlPrismBuildToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToCompressionAdmissionGuest"})
}

definition{
  name: umlPrismBuildToCompressionAdmissionPage,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToCompressionAdmissionPage"})
}

definition{
  name: umlSourceRepositoryToPrismBuild,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeSourceRepositoryToPrismBuild"})
}

definition{
  name: umlUORCWebClientToCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::UmlConnector,
  body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeUORCWebClientToCompressionAdmissionGuest"})
}

definition{
  name: seqBrowser,
  parameters: [],
  result: Foundation.Arch::UmlLifeline,
  body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentBrowser", order := 0})
}

definition{
  name: seqCompressionAdmissionGuest,
  parameters: [],
  result: Foundation.Arch::UmlLifeline,
  body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentCompressionAdmissionGuest", order := 1})
}

definition{
  name: seqRequest,
  parameters: [],
  result: Foundation.Arch::UmlMessage,
  body: (record Foundation.Arch::UmlMessage {view := "Design::viewUmlRequest", kind := (ctor Foundation.Arch::UmlMessageKind.synchronous), order := 0, source := "Architecture::componentBrowser", target := "Architecture::componentCompressionAdmissionGuest", process := "Design::processDecide"})
}

definition{
  name: seqReply,
  parameters: [],
  result: Foundation.Arch::UmlMessage,
  body: (record Foundation.Arch::UmlMessage {view := "Design::viewUmlRequest", kind := (ctor Foundation.Arch::UmlMessageKind.reply), order := 1, source := "Architecture::componentCompressionAdmissionGuest", target := "Architecture::componentBrowser", process := "Design::processDecide"})
}

definition{
  name: stIdle,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateIdle", initial := true})
}

definition{
  name: stDeciding,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateDeciding", initial := false})
}

definition{
  name: stRefused,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateRefused", initial := false})
}

definition{
  name: stAnsweredAdmit,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredAdmit", initial := false})
}

definition{
  name: stAnsweredKeep,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredKeep", initial := false})
}

definition{
  name: stAnsweredRefuse,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredRefuse", initial := false})
}

definition{
  name: trAccept,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 0, source := "Design::stateIdle", target := "Design::stateDeciding", trigger := "Design::processParseRequest"})
}

definition{
  name: trRefuse,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 1, source := "Design::stateIdle", target := "Design::stateRefused", trigger := "Design::processParseRequest"})
}

definition{
  name: trRule1,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 2, source := "Design::stateDeciding", target := "Design::stateAnsweredRefuse", trigger := "Design::processRule1"})
}

definition{
  name: trRule2,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 3, source := "Design::stateDeciding", target := "Design::stateAnsweredAdmit", trigger := "Design::processRule2"})
}

definition{
  name: trRule3,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 4, source := "Design::stateDeciding", target := "Design::stateAnsweredKeep", trigger := "Design::processRule3"})
}

definition{
  name: trRule4,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 5, source := "Design::stateDeciding", target := "Design::stateAnsweredAdmit", trigger := "Design::processRule4"})
}

definition{
  name: trOtherwise,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 6, source := "Design::stateDeciding", target := "Design::stateAnsweredKeep", trigger := "Design::processOtherwise"})
}

definition{
  name: trResetAdmit,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 7, source := "Design::stateAnsweredAdmit", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}

definition{
  name: trResetKeep,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 8, source := "Design::stateAnsweredKeep", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}

definition{
  name: trResetRefuse,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 9, source := "Design::stateAnsweredRefuse", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}

definition{
  name: trResetRefused,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 10, source := "Design::stateRefused", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
\end{semanticmodule}
\end{lexlean}
app/src/Features.lex.tex 116 lines
\begin{lexlean}{Features}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{UorcAdmission}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{feature}
\begin{semanticmodule}
definition{
  name: acceptINV001,
  parameters: [],
  result: String,
  body: "UorcAdmissionProofs::inv001Holds"
}

definition{
  name: acceptINV002,
  parameters: [],
  result: String,
  body: "UorcAdmissionProofs::inv002Holds"
}

definition{
  name: acceptINV003,
  parameters: [],
  result: String,
  body: "UorcAdmissionProofs::inv003Holds"
}

definition{
  name: featureRule1,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When roundtrip is differs, the answer is refuse.", calls := (cons "UorcAdmission::rule1" (cons "UorcAdmission::judge" (nil String))), acceptance := (cons "UorcAdmission::application" (nil String))})
}

definition{
  name: featureRule2,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When candidate is below incumbent, the answer is admit.", calls := (cons "UorcAdmission::rule2" (cons "UorcAdmission::judge" (nil String))), acceptance := (cons "UorcAdmission::application" (nil String))})
}

definition{
  name: featureRule3,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When candidate is above incumbent, the answer is keep.", calls := (cons "UorcAdmission::rule3" (cons "UorcAdmission::judge" (nil String))), acceptance := (cons "UorcAdmission::application" (nil String))})
}

definition{
  name: featureRule4,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When order is before, the answer is admit.", calls := (cons "UorcAdmission::rule4" (cons "UorcAdmission::judge" (nil String))), acceptance := (cons "UorcAdmission::application" (nil String))})
}

definition{
  name: featureOtherwise,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When no rule matches, the answer is keep.", calls := (cons "UorcAdmission::judge" (nil String)), acceptance := (cons "UorcAdmission::application" (nil String))})
}

definition{
  name: featureRefuseMalformed,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "A request that is not roundtrip, incumbent, candidate, order in order, separated by single spaces, or is over 112 bytes, is answered invalid.", calls := (cons "UorcAdmission::dispatch" (cons "UorcAdmission::decodeField1" (nil String))), acceptance := (cons "UorcAdmission::application" (nil String))})
}

definition{
  name: featureINV001,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "It never answers admit when roundtrip is differs.", calls := (cons "UorcAdmission::judge" (nil String)), acceptance := (cons "Features::acceptINV001" (nil String))})
}

definition{
  name: featureINV002,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "It never answers admit when candidate is above incumbent.", calls := (cons "UorcAdmission::judge" (nil String)), acceptance := (cons "Features::acceptINV002" (nil String))})
}

definition{
  name: featureINV003,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "It always answers admit when roundtrip is exact and candidate is below incumbent.", calls := (cons "UorcAdmission::judge" (nil String)), acceptance := (cons "Features::acceptINV003" (nil String))})
}

definition{
  name: journeyBenchmarkReviewer,
  parameters: [],
  result: Foundation.Arch::Journey,
  body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderBenchmarkReviewer", steps := (cons "Features::featureINV001" (cons "Features::featureINV002" (cons "Features::featureINV003" (nil String))))})
}

definition{
  name: journeyCompressionResearcher,
  parameters: [],
  result: Foundation.Arch::Journey,
  body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderCompressionResearcher", steps := (cons "Features::featureRule1" (cons "Features::featureRule2" (cons "Features::featureRule3" (cons "Features::featureRule4" (cons "Features::featureOtherwise" (nil String))))))})
}

definition{
  name: journeyVerifier,
  parameters: [],
  result: Foundation.Arch::Journey,
  body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderVerifier", steps := (cons "Features::featureRefuseMalformed" (cons "Features::featureINV001" (cons "Features::featureINV002" (cons "Features::featureINV003" (nil String)))))})
}
\end{semanticmodule}
\end{lexlean}
app/src/Quality.lex.tex 347 lines
\begin{lexlean}{Quality}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\useglossary{prism.qual@1.0.0}
\importmodule{Foundation.Qual}
\title{quality measure}
\begin{semanticmodule}
structure{
  name: Named,
  type_parameters: [],
  parameters: [],
  fields: [{name: index, type: Nat}, {name: name, type: String}, {name: text, type: String}]
}

definition{
  name: characteristicFunctionalSuitability,
  parameters: [],
  result: Foundation.Qual::ProductQualityCharacteristic,
  body: (record Foundation.Qual::ProductQualityCharacteristic {index := 0})
}

definition{
  name: characteristicPerformanceEfficiency,
  parameters: [],
  result: Foundation.Qual::ProductQualityCharacteristic,
  body: (record Foundation.Qual::ProductQualityCharacteristic {index := 1})
}

definition{
  name: characteristicReliability,
  parameters: [],
  result: Foundation.Qual::ProductQualityCharacteristic,
  body: (record Foundation.Qual::ProductQualityCharacteristic {index := 2})
}

definition{
  name: characteristicSecurity,
  parameters: [],
  result: Foundation.Qual::ProductQualityCharacteristic,
  body: (record Foundation.Qual::ProductQualityCharacteristic {index := 3})
}

definition{
  name: subcharacteristicFaultlessness,
  parameters: [],
  result: Foundation.Qual::QualitySubcharacteristic,
  body: (record Foundation.Qual::QualitySubcharacteristic {index := 0, characteristicIndex := 2})
}

definition{
  name: subcharacteristicFunctionalCompleteness,
  parameters: [],
  result: Foundation.Qual::QualitySubcharacteristic,
  body: (record Foundation.Qual::QualitySubcharacteristic {index := 1, characteristicIndex := 0})
}

definition{
  name: subcharacteristicFunctionalCorrectness,
  parameters: [],
  result: Foundation.Qual::QualitySubcharacteristic,
  body: (record Foundation.Qual::QualitySubcharacteristic {index := 2, characteristicIndex := 0})
}

definition{
  name: subcharacteristicIntegrity,
  parameters: [],
  result: Foundation.Qual::QualitySubcharacteristic,
  body: (record Foundation.Qual::QualitySubcharacteristic {index := 3, characteristicIndex := 3})
}

definition{
  name: subcharacteristicResourceUtilization,
  parameters: [],
  result: Foundation.Qual::QualitySubcharacteristic,
  body: (record Foundation.Qual::QualitySubcharacteristic {index := 4, characteristicIndex := 1})
}

definition{
  name: subcharacteristicTimeBehaviour,
  parameters: [],
  result: Foundation.Qual::QualitySubcharacteristic,
  body: (record Foundation.Qual::QualitySubcharacteristic {index := 5, characteristicIndex := 1})
}

definition{
  name: requirementBoundedAllocation,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 0, subcharacteristicIndex := 4})
}

definition{
  name: requirementBoundedRequest,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 1, subcharacteristicIndex := 5})
}

definition{
  name: requirementEveryPropertyProved,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 2, subcharacteristicIndex := 3})
}

definition{
  name: requirementEveryRequestAnswered,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 3, subcharacteristicIndex := 1})
}

definition{
  name: requirementEveryVectorReplays,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 4, subcharacteristicIndex := 0})
}

definition{
  name: requirementExamplesAnsweredAsStated,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 5, subcharacteristicIndex := 2})
}

definition{
  name: requirementLosslessAdmissions,
  parameters: [],
  result: Foundation.Qual::QualityRequirement,
  body: (record Foundation.Qual::QualityRequirement {index := 6, subcharacteristicIndex := 2})
}

definition{
  name: measureExampleMismatches,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 0, requirementIndex := 5, threshold := 0})
}

definition{
  name: measureFailedVectors,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 1, requirementIndex := 4, threshold := 0})
}

definition{
  name: measureGuestAllocationBytes,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 2, requirementIndex := 0, threshold := 224})
}

definition{
  name: measureLossyAdmissions,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 3, requirementIndex := 6, threshold := 0})
}

definition{
  name: measureRequestBytesRead,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 4, requirementIndex := 1, threshold := 112})
}

definition{
  name: measureUnansweredRequests,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 5, requirementIndex := 3, threshold := 0})
}

definition{
  name: measureUnprovedProperties,
  parameters: [],
  result: Foundation.Qual::QualityMeasure,
  body: (record Foundation.Qual::QualityMeasure {index := 6, requirementIndex := 2, threshold := 0})
}

definition{
  name: characteristicNames,
  parameters: [],
  result: (List Named),
  body: (cons (record Named {index := 0, name := "Functional suitability", text := "Functional suitability, as ISO/IEC 25010:2023 defines it, for Compression admission."}) (cons (record Named {index := 1, name := "Performance efficiency", text := "Performance efficiency, as ISO/IEC 25010:2023 defines it, for Compression admission."}) (cons (record Named {index := 2, name := "Reliability", text := "Reliability, as ISO/IEC 25010:2023 defines it, for Compression admission."}) (cons (record Named {index := 3, name := "Security", text := "Security, as ISO/IEC 25010:2023 defines it, for Compression admission."}) (nil Named)))))
}

definition{
  name: subcharacteristicNames,
  parameters: [],
  result: (List Named),
  body: (cons (record Named {index := 0, name := "Faultlessness", text := "Reliability: Faultlessness."}) (cons (record Named {index := 1, name := "Functional completeness", text := "Functional suitability: Functional completeness."}) (cons (record Named {index := 2, name := "Functional correctness", text := "Functional suitability: Functional correctness."}) (cons (record Named {index := 3, name := "Integrity", text := "Security: Integrity."}) (cons (record Named {index := 4, name := "Resource utilization", text := "Performance efficiency: Resource utilization."}) (cons (record Named {index := 5, name := "Time behaviour", text := "Performance efficiency: Time behaviour."}) (nil Named)))))))
}

definition{
  name: requirementNames,
  parameters: [],
  result: (List Named),
  body: (cons (record Named {index := 0, name := "Bounded allocation", text := "The guest allocates at most 224 bytes for one request."}) (cons (record Named {index := 1, name := "Bounded request", text := "A request over 112 bytes is refused before any field is read."}) (cons (record Named {index := 2, name := "Every property proved", text := "All 3 properties are theorems the Lean kernel checks."}) (cons (record Named {index := 3, name := "Every request answered", text := "Every request gets an answer: a rule, keep otherwise, or invalid."}) (cons (record Named {index := 4, name := "Every vector replays", text := "All 40 acceptance vectors replay in the compiled guest, the shortest 0 bytes long."}) (cons (record Named {index := 5, name := "Examples answered as stated", text := "Every one of the 6 examples of the spec is answered as it states."}) (cons (record Named {index := 6, name := "Lossless admissions", text := "Every admitted archive replays its objects exactly."}) (nil Named))))))))
}

definition{
  name: measureNames,
  parameters: [],
  result: (List Named),
  body: (cons (record Named {index := 0, name := "Example mismatches", text := "Examples the guest answers otherwise than they state."}) (cons (record Named {index := 1, name := "Failed vectors", text := "Acceptance vectors whose replay differs from the model."}) (cons (record Named {index := 2, name := "Guest allocation bytes", text := "Most bytes the guest allocates for one request."}) (cons (record Named {index := 3, name := "Lossy admissions", text := "Requests with roundtrip differs answered admit."}) (cons (record Named {index := 4, name := "Request bytes read", text := "Longest request the guest decodes, in bytes."}) (cons (record Named {index := 5, name := "Unanswered requests", text := "Acceptance vectors the guest does not answer."}) (cons (record Named {index := 6, name := "Unproved properties", text := "Properties of the spec without a checked theorem."}) (nil Named))))))))
}

definition{
  name: subcharacteristicRecords,
  parameters: [],
  result: (List Foundation.Qual::QualitySubcharacteristic),
  body: (cons (subcharacteristicFaultlessness) (cons (subcharacteristicFunctionalCompleteness) (cons (subcharacteristicFunctionalCorrectness) (cons (subcharacteristicIntegrity) (cons (subcharacteristicResourceUtilization) (cons (subcharacteristicTimeBehaviour) (nil Foundation.Qual::QualitySubcharacteristic)))))))
}

definition{
  name: requirementRecords,
  parameters: [],
  result: (List Foundation.Qual::QualityRequirement),
  body: (cons (requirementBoundedAllocation) (cons (requirementBoundedRequest) (cons (requirementEveryPropertyProved) (cons (requirementEveryRequestAnswered) (cons (requirementEveryVectorReplays) (cons (requirementExamplesAnsweredAsStated) (cons (requirementLosslessAdmissions) (nil Foundation.Qual::QualityRequirement))))))))
}

definition{
  name: measureRecords,
  parameters: [],
  result: (List Foundation.Qual::QualityMeasure),
  body: (cons (measureExampleMismatches) (cons (measureFailedVectors) (cons (measureGuestAllocationBytes) (cons (measureLossyAdmissions) (cons (measureRequestBytesRead) (cons (measureUnansweredRequests) (cons (measureUnprovedProperties) (nil Foundation.Qual::QualityMeasure))))))))
}

definition{
  name: namesNumbered,
  parameters: [position : Nat, names : (List Named)],
  result: Bool,
  body: (match names
    | List.nil => true
    | List.cons item rest => (((project item index) =? position) && (namesNumbered (position + 1) rest))),
  recursive_argument: names
}

definition{
  name: parentsKnown,
  parameters: [count : Nat, records : (List Foundation.Qual::QualitySubcharacteristic)],
  result: Bool,
  body: (match records
    | List.nil => true
    | List.cons item rest => (((project item characteristicIndex) <? count) && (parentsKnown count rest))),
  recursive_argument: records
}

definition{
  name: requirementsKnown,
  parameters: [count : Nat, records : (List Foundation.Qual::QualityRequirement)],
  result: Bool,
  body: (match records
    | List.nil => true
    | List.cons item rest => (((project item subcharacteristicIndex) <? count) && (requirementsKnown count rest))),
  recursive_argument: records
}

definition{
  name: measuresKnown,
  parameters: [count : Nat, records : (List Foundation.Qual::QualityMeasure)],
  result: Bool,
  body: (match records
    | List.nil => true
    | List.cons item rest => (((project item requirementIndex) <? count) && (measuresKnown count rest))),
  recursive_argument: records
}

definition{
  name: thresholdOf,
  parameters: [wanted : Nat, records : (List Foundation.Qual::QualityMeasure)],
  result: Nat,
  body: (match records
    | List.nil => 0
    | List.cons head rest => (if ((project head index) =? wanted) then (project head threshold) else (thresholdOf wanted rest))),
  recursive_argument: records
}

definition{
  name: qualityValid,
  parameters: [],
  result: Bool,
  body: ((namesNumbered 0 (characteristicNames)) && ((namesNumbered 0 (subcharacteristicNames)) && ((namesNumbered 0 (requirementNames)) && ((namesNumbered 0 (measureNames)) && ((parentsKnown 4 (subcharacteristicRecords)) && ((requirementsKnown 6 (requirementRecords)) && (measuresKnown 7 (measureRecords))))))))
}

theorem{
  name: qualityModelHolds,
  parameters: [],
  statement: ((qualityValid) = true),
  proof: decide{}
}

theorem{
  name: measureExampleMismatchesThreshold,
  parameters: [],
  statement: ((thresholdOf 0 (measureRecords)) = 0),
  proof: decide{}
}

theorem{
  name: measureFailedVectorsThreshold,
  parameters: [],
  statement: ((thresholdOf 1 (measureRecords)) = 0),
  proof: decide{}
}

theorem{
  name: measureGuestAllocationBytesThreshold,
  parameters: [],
  statement: ((thresholdOf 2 (measureRecords)) = 224),
  proof: decide{}
}

theorem{
  name: measureLossyAdmissionsThreshold,
  parameters: [],
  statement: ((thresholdOf 3 (measureRecords)) = 0),
  proof: decide{}
}

theorem{
  name: measureRequestBytesReadThreshold,
  parameters: [],
  statement: ((thresholdOf 4 (measureRecords)) = 112),
  proof: decide{}
}

theorem{
  name: measureUnansweredRequestsThreshold,
  parameters: [],
  statement: ((thresholdOf 5 (measureRecords)) = 0),
  proof: decide{}
}

theorem{
  name: measureUnprovedPropertiesThreshold,
  parameters: [],
  statement: ((thresholdOf 6 (measureRecords)) = 0),
  proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Security.lex.tex 551 lines
\begin{lexlean}{Security}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\useglossary{prism.sec@1.0.0}
\importmodule{Foundation.Sec}
\importmodule{Production.ThreatModel}
\importmodule{Architecture}
\title{security threat}
\begin{semanticmodule}
definition{
  name: assetAnswer,
  parameters: [],
  result: Foundation.Sec::Asset,
  body: (record Foundation.Sec::Asset {index := 0, componentIndex := 1})
}

definition{
  name: assetModelSource,
  parameters: [],
  result: Foundation.Sec::Asset,
  body: (record Foundation.Sec::Asset {index := 1, componentIndex := 6})
}

definition{
  name: assetPublishedHolo,
  parameters: [],
  result: Foundation.Sec::Asset,
  body: (record Foundation.Sec::Asset {index := 2, componentIndex := 2})
}

definition{
  name: assetRequestBytes,
  parameters: [],
  result: Foundation.Sec::Asset,
  body: (record Foundation.Sec::Asset {index := 3, componentIndex := 1})
}

definition{
  name: threatAnswerThatBreaksINV001,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 0})
}

definition{
  name: threatAnswerThatBreaksINV002,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 1})
}

definition{
  name: threatAnswerThatBreaksINV003,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 2})
}

definition{
  name: threatBoundaryShiftedCollection,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 3})
}

definition{
  name: threatDigestOnlyVerification,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 4})
}

definition{
  name: threatGrantedCapability,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 5})
}

definition{
  name: threatMalformedRequest,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 6})
}

definition{
  name: threatOversizedRequest,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 7})
}

definition{
  name: threatRecordClaimed,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 8})
}

definition{
  name: threatSubstitutedHolo,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 9})
}

definition{
  name: threatSubstitutedHost,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 10})
}

definition{
  name: threatTamperedModel,
  parameters: [],
  result: Foundation.Sec::Threat,
  body: (record Foundation.Sec::Threat {index := 11})
}

definition{
  name: riskAnswerThatBreaksINV001,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 0, assetIndex := 0, threatIndex := 0, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}

definition{
  name: riskAnswerThatBreaksINV002,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 1, assetIndex := 0, threatIndex := 1, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}

definition{
  name: riskAnswerThatBreaksINV003,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 2, assetIndex := 0, threatIndex := 2, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}

definition{
  name: riskBoundaryShiftedCollection,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 3, assetIndex := 3, threatIndex := 3, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}

definition{
  name: riskDigestOnlyVerification,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 4, assetIndex := 0, threatIndex := 4, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.critical)})
}

definition{
  name: riskGrantedCapability,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 5, assetIndex := 0, threatIndex := 5, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}

definition{
  name: riskMalformedRequest,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 6, assetIndex := 3, threatIndex := 6, likelihood := (ctor Foundation.Sec::Likelihood.high), impact := (ctor Foundation.Sec::Impact.major)})
}

definition{
  name: riskOversizedRequest,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 7, assetIndex := 3, threatIndex := 7, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.minor)})
}

definition{
  name: riskRecordClaimed,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 8, assetIndex := 0, threatIndex := 8, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.major)})
}

definition{
  name: riskSubstitutedHolo,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 9, assetIndex := 2, threatIndex := 9, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.critical)})
}

definition{
  name: riskSubstitutedHost,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 10, assetIndex := 2, threatIndex := 10, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.critical)})
}

definition{
  name: riskTamperedModel,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 11, assetIndex := 1, threatIndex := 11, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}

definition{
  name: controlBoundariesChecked,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 0, riskIndex := 3})
}

definition{
  name: controlBoundedRequest,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 1, riskIndex := 7})
}

definition{
  name: controlFingerprintAndProvenance,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 2, riskIndex := 9})
}

definition{
  name: controlFullByteReplay,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 3, riskIndex := 4})
}

definition{
  name: controlNoCapabilityGranted,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 4, riskIndex := 5})
}

definition{
  name: controlProofOfINV001,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 5, riskIndex := 0})
}

definition{
  name: controlProofOfINV002,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 6, riskIndex := 1})
}

definition{
  name: controlProofOfINV003,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 7, riskIndex := 2})
}

definition{
  name: controlRegeneratedFromThePrompt,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 8, riskIndex := 11})
}

definition{
  name: controlStrictDecoder,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 9, riskIndex := 6})
}

definition{
  name: controlSet,
  parameters: [],
  result: Production.ThreatModel::ControlSet,
  body: (record Production.ThreatModel::ControlSet {title := "Compression admission security controls", text := "Compression admission answers one request with one answer in a Core-Wasm guest granted no capability. Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order.", version := "0.1.0", lastModified := "2026-11-12T18:44:38Z"})
}

definition{
  name: modeledAssetAnswer,
  parameters: [],
  result: Production.ThreatModel::ModeledAsset,
  body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetAnswer", name := "Answer", text := "The answer the guest returns: one of admit, keep, refuse, or invalid."})
}

definition{
  name: modeledAssetModelSource,
  parameters: [],
  result: Production.ThreatModel::ModeledAsset,
  body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetModelSource", name := "Model source", text := "The prompt, the spec and the LexLean model in the repository, from which the holo is built."})
}

definition{
  name: modeledAssetPublishedHolo,
  parameters: [],
  result: Production.ThreatModel::ModeledAsset,
  body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetPublishedHolo", name := "Published holo", text := "The holo and page the Pages workflow publishes, with its fingerprint and signed provenance."})
}

definition{
  name: modeledAssetRequestBytes,
  parameters: [],
  result: Production.ThreatModel::ModeledAsset,
  body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetRequestBytes", name := "Request bytes", text := "The bytes a caller sends, at most 112 of them."})
}

definition{
  name: modeledThreatAnswerThatBreaksINV001,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV001", name := "Answer that breaks INV-001", text := "The guest answers admit although roundtrip is differs, which matters because a lossy candidate is never admitted.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}

definition{
  name: modeledThreatAnswerThatBreaksINV002,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV002", name := "Answer that breaks INV-002", text := "The guest answers admit although candidate is above incumbent, which matters because the best-known archive never grows.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}

definition{
  name: modeledThreatAnswerThatBreaksINV003,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV003", name := "Answer that breaks INV-003", text := "The guest answers admit not when roundtrip is exact and candidate is below incumbent, which matters because an exact, strictly shorter archive always replaces.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}

definition{
  name: modeledThreatBoundaryShiftedCollection,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatBoundaryShiftedCollection", name := "Boundary-shifted collection", text := "An archive reproduces the same flattened bytes with the object boundaries moved.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

definition{
  name: modeledThreatDigestOnlyVerification,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatDigestOnlyVerification", name := "Digest-only verification", text := "A candidate is accepted because a digest matched, while its bytes or boundaries differ.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

definition{
  name: modeledThreatGrantedCapability,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatGrantedCapability", name := "Granted capability", text := "The guest reads, stores or sends data beyond the request it answers.", category := (ctor Production.ThreatModel::Stride.informationDisclosure)})
}

definition{
  name: modeledThreatMalformedRequest,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatMalformedRequest", name := "Malformed request", text := "A request with a missing, extra, unknown or badly written field is answered as if it were well formed.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

definition{
  name: modeledThreatOversizedRequest,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatOversizedRequest", name := "Oversized request", text := "A request longer than 112 bytes makes the guest parse or allocate without bound.", category := (ctor Production.ThreatModel::Stride.denialOfService)})
}

definition{
  name: modeledThreatRecordClaimed,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatRecordClaimed", name := "Record claimed", text := "A best-known archive is published as a compression record or a minimum.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}

definition{
  name: modeledThreatSubstitutedHolo,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSubstitutedHolo", name := "Substituted holo", text := "A holo other than the one the build verified is served under the app address.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}

definition{
  name: modeledThreatSubstitutedHost,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSubstitutedHost", name := "Substituted host", text := "Something other than the repository Pages workflow serves pages under its address.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}

definition{
  name: modeledThreatTamperedModel,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatTamperedModel", name := "Tampered model", text := "The model the holo is built from differs from the reviewed prompt and spec.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

definition{
  name: modeledControlBoundariesChecked,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBoundariesChecked", name := "Boundaries checked", text := "Replay checks object counts and lengths, so a shifted boundary is a mismatch.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "src/Uorc/Search/Verify.lex.tex same_flattening_different_boundary_rejected"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: modeledControlBoundedRequest,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBoundedRequest", name := "Bounded request", text := "dispatch answers invalid for a request over 112 bytes before reading a field, and the guest allocates at most 224.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: modeledControlFingerprintAndProvenance,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlFingerprintAndProvenance", name := "Fingerprint and provenance", text := "The page verifies the holo digests before it runs, and the build signs its provenance as the repository workflow.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "actions/attest-build-provenance in the pages workflow"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prism-code check of the holo identities in the page"}) (nil Production.ThreatModel::Evidence)))})
}

definition{
  name: modeledControlFullByteReplay,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlFullByteReplay", name := "Full byte replay", text := "Verification compares every byte and boundary, never only a digest, and a mismatch is never admitted.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "src/Uorc/Search/Verify.lex.tex full_bytes_not_digest_equality"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "UorcAdmissionProofs::inv001Holds"}) (nil Production.ThreatModel::Evidence)))})
}

definition{
  name: modeledControlNoCapabilityGranted,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlNoCapabilityGranted", name := "No capability granted", text := "prism.toml grants the holo nothing and the model declares capabilitiesEmpty, so a guest import of any host capability is refused.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prism-code check refuses an ungranted guest import"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: modeledControlProofOfINV001,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV001", name := "Proof of INV-001", text := "It never answers admit when roundtrip is differs. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "UorcAdmissionProofs::inv001Holds"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: modeledControlProofOfINV002,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV002", name := "Proof of INV-002", text := "It never answers admit when candidate is above incumbent. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "UorcAdmissionProofs::inv002Holds"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: modeledControlProofOfINV003,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV003", name := "Proof of INV-003", text := "It always answers admit when roundtrip is exact and candidate is below incumbent. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "UorcAdmissionProofs::inv003Holds"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: modeledControlRegeneratedFromThePrompt,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlRegeneratedFromThePrompt", name := "Regenerated from the prompt", text := "The model is written from the prompt by the builder, and the build checks every theorem and replays every vector in the pinned SDK.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prismpm verify in the SDK image prismpm.lock pins"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "app/prompt.json"}) (nil Production.ThreatModel::Evidence)))})
}

definition{
  name: modeledControlStrictDecoder,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlStrictDecoder", name := "Strict decoder", text := "Every field is decoded exactly: choices from their list, numbers as plain decimal digits within their bounds, single spaces between fields; anything else is invalid.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify"}) (nil Production.ThreatModel::Evidence))})
}

definition{
  name: mappingBoundaryShiftedCollection,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatBoundaryShiftedCollection", controls := (cons "Security::controlBoundariesChecked" (nil String))})
}

definition{
  name: mappingOversizedRequest,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatOversizedRequest", controls := (cons "Security::controlBoundedRequest" (nil String))})
}

definition{
  name: mappingSubstitutedHolo,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatSubstitutedHolo", controls := (cons "Security::controlFingerprintAndProvenance" (nil String))})
}

definition{
  name: mappingDigestOnlyVerification,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatDigestOnlyVerification", controls := (cons "Security::controlFullByteReplay" (nil String))})
}

definition{
  name: mappingGrantedCapability,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatGrantedCapability", controls := (cons "Security::controlNoCapabilityGranted" (nil String))})
}

definition{
  name: mappingAnswerThatBreaksINV001,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV001", controls := (cons "Security::controlProofOfINV001" (nil String))})
}

definition{
  name: mappingAnswerThatBreaksINV002,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV002", controls := (cons "Security::controlProofOfINV002" (nil String))})
}

definition{
  name: mappingAnswerThatBreaksINV003,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV003", controls := (cons "Security::controlProofOfINV003" (nil String))})
}

definition{
  name: mappingTamperedModel,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatTamperedModel", controls := (cons "Security::controlRegeneratedFromThePrompt" (nil String))})
}

definition{
  name: mappingMalformedRequest,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatMalformedRequest", controls := (cons "Security::controlStrictDecoder" (nil String))})
}

definition{
  name: acceptedRecordClaimed,
  parameters: [],
  result: Production.ThreatModel::AcceptedRisk,
  body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatRecordClaimed", rationale := "The engine states only a best-known checked archive and produces no minimality certificate; README claim boundaries leave record status to the external authority."})
}

definition{
  name: acceptedSubstitutedHost,
  parameters: [],
  result: Production.ThreatModel::AcceptedRisk,
  body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatSubstitutedHost", rationale := "A page cannot defend against its own host. The holo carries signed build provenance a visitor can check, and the app can be rebuilt from its prompt."})
}
\end{semanticmodule}
\end{lexlean}
app/src/UorcAdmission.lex.tex 234 lines
\begin{lexlean}{UorcAdmission}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Foundation.Bytes}
\importmodule{Foundation.View.Text.V1.Model}
\title{Text application model}
\begin{semanticmodule}
definition{name: roundtripExact, parameters: [], result: Nat, body: 0}

definition{name: roundtripDiffers, parameters: [], result: Nat, body: 1}

definition{name: orderBefore, parameters: [], result: Nat, body: 0}

definition{name: orderSame, parameters: [], result: Nat, body: 1}

definition{name: orderAfter, parameters: [], result: Nat, body: 2}

definition{name: answerAdmit, parameters: [], result: Nat, body: 0}

definition{name: answerKeep, parameters: [], result: Nat, body: 1}

definition{name: answerRefuse, parameters: [], result: Nat, body: 2}

structure{
  name: Request,
  type_parameters: [],
  parameters: [],
  fields: [
    {name: roundtrip, type: Nat},
    {name: incumbent, type: Nat},
    {name: candidate, type: Nat},
    {name: order, type: Nat}
  ]
}

definition{
  name: byteAt,
  parameters: [s : Bytes, i : Nat],
  result: (Option Nat),
  body: (match (prim index s i : (Option UInt8))
    | Option.none => (ctor Option.none [Nat])
    | Option.some b => (ctor Option.some [Nat] (prim to_nat b : Nat))),
  axioms: [Quot.sound, propext]
}

definition{
  name: digitsValue,
  parameters: [s : Bytes, i : Nat, acc : Nat, fuel : Nat],
  result: (Option Nat),
  body: (match fuel
    | Nat.zero => (ctor Option.some [Nat] acc)
    | Nat.succ rest => (match (byteAt s i)
      | Option.none => (ctor Option.none [Nat])
      | Option.some d => (if ((d <? 48) || (57 <? d)) then (ctor Option.none [Nat]) else (digitsValue s (i + 1) ((prim multiply acc 10 : Nat) + (prim subtract d 48 : Nat)) rest)))),
  axioms: [Quot.sound, propext],
  recursive_argument: fuel
}

definition{
  name: parseDigits,
  parameters: [s : Bytes],
  result: (Option Nat),
  body: (if ((Foundation.Bytes::byteLength s) =? 0) then (ctor Option.none [Nat]) else (if (18 <? (Foundation.Bytes::byteLength s)) then (ctor Option.none [Nat]) else (match (byteAt s 0)
    | Option.none => (ctor Option.none [Nat])
    | Option.some lead => (if ((lead =? 48) && (1 <? (Foundation.Bytes::byteLength s))) then (ctor Option.none [Nat]) else (digitsValue s 0 0 (Foundation.Bytes::byteLength s)))))),
  axioms: [Quot.sound, propext]
}

definition{
  name: parseNumber,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (parseDigits value),
  axioms: [Quot.sound, propext]
}

definition{
  name: parseRoundtrip,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (if (prim equal value 0x6578616374 : Bool) then (ctor Option.some [Nat] (roundtripExact)) else (if (prim equal value 0x64696666657273 : Bool) then (ctor Option.some [Nat] (roundtripDiffers)) else (ctor Option.none [Nat])))
}

definition{
  name: parseIncumbent,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (match (parseNumber value)
    | Option.none => (ctor Option.none [Nat])
    | Option.some parsed => (ctor Option.some [Nat] parsed)),
  axioms: [Quot.sound, propext]
}

definition{
  name: parseCandidate,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (match (parseNumber value)
    | Option.none => (ctor Option.none [Nat])
    | Option.some parsed => (ctor Option.some [Nat] parsed)),
  axioms: [Quot.sound, propext]
}

definition{
  name: parseOrder,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (if (prim equal value 0x6265666f7265 : Bool) then (ctor Option.some [Nat] (orderBefore)) else (if (prim equal value 0x73616d65 : Bool) then (ctor Option.some [Nat] (orderSame)) else (if (prim equal value 0x6166746572 : Bool) then (ctor Option.some [Nat] (orderAfter)) else (ctor Option.none [Nat]))))
}

definition{
  name: sliceOf,
  parameters: [s : Bytes, start : Nat, count : Nat],
  result: Bytes,
  body: (match (prim slice s start count : (Option Bytes))
    | Option.none => 0x
    | Option.some part => part)
}

definition{
  name: fieldEnd,
  parameters: [s : Bytes, i : Nat, fuel : Nat],
  result: Nat,
  body: (match fuel
    | Nat.zero => i
    | Nat.succ rest => (match (byteAt s i)
      | Option.none => i
      | Option.some d => (if (d =? 32) then i else (fieldEnd s (i + 1) rest)))),
  axioms: [Quot.sound, propext],
  recursive_argument: fuel
}

definition{
  name: decodeField4,
  parameters: [s : Bytes, start : Nat, v1 : Nat, v2 : Nat, v3 : Nat],
  result: (Option Request),
  body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseOrder (sliceOf s start (prim subtract e start : Nat)))
    | Option.none => (ctor Option.none [Request])
    | Option.some v4 => (if (e =? (Foundation.Bytes::byteLength s)) then (ctor Option.some [Request] (record Request {roundtrip := v1, incumbent := v2, candidate := v3, order := v4})) else (ctor Option.none [Request])))),
  axioms: [Quot.sound, propext]
}

definition{
  name: decodeField3,
  parameters: [s : Bytes, start : Nat, v1 : Nat, v2 : Nat],
  result: (Option Request),
  body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseCandidate (sliceOf s start (prim subtract e start : Nat)))
    | Option.none => (ctor Option.none [Request])
    | Option.some v3 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField4 s (e + 1) v1 v2 v3) else (ctor Option.none [Request])))),
  axioms: [Quot.sound, propext]
}

definition{
  name: decodeField2,
  parameters: [s : Bytes, start : Nat, v1 : Nat],
  result: (Option Request),
  body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseIncumbent (sliceOf s start (prim subtract e start : Nat)))
    | Option.none => (ctor Option.none [Request])
    | Option.some v2 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField3 s (e + 1) v1 v2) else (ctor Option.none [Request])))),
  axioms: [Quot.sound, propext]
}

definition{
  name: decodeField1,
  parameters: [s : Bytes, start : Nat],
  result: (Option Request),
  body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseRoundtrip (sliceOf s start (prim subtract e start : Nat)))
    | Option.none => (ctor Option.none [Request])
    | Option.some v1 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField2 s (e + 1) v1) else (ctor Option.none [Request])))),
  axioms: [Quot.sound, propext]
}

definition{
  name: rule1,
  parameters: [request : Request],
  result: Bool,
  body: ((project request roundtrip) =? (roundtripDiffers))
}

definition{
  name: rule2,
  parameters: [request : Request],
  result: Bool,
  body: ((project request candidate) <? (project request incumbent))
}

definition{
  name: rule3,
  parameters: [request : Request],
  result: Bool,
  body: ((project request incumbent) <? (project request candidate))
}

definition{
  name: rule4,
  parameters: [request : Request],
  result: Bool,
  body: ((project request order) =? (orderBefore))
}

definition{
  name: judge,
  parameters: [request : Request],
  result: Nat,
  body: (if (rule1 request) then (answerRefuse) else (if (rule2 request) then (answerAdmit) else (if (rule3 request) then (answerKeep) else (if (rule4 request) then (answerAdmit) else (answerKeep)))))
}

definition{
  name: encodeAnswer,
  parameters: [code : Nat],
  result: Bytes,
  body: (if (code =? (answerAdmit)) then 0x61646d6974 else (if (code =? (answerKeep)) then 0x6b656570 else (if (code =? (answerRefuse)) then 0x726566757365 else 0x696e76616c6964)))
}

definition{
  name: dispatch,
  parameters: [value : Bytes],
  result: Bytes,
  body: (if (112 <? (Foundation.Bytes::byteLength value)) then 0x696e76616c6964 else (match (decodeField1 value 0)
    | Option.none => 0x696e76616c6964
    | Option.some request => (encodeAnswer (judge request)))),
  axioms: [Quot.sound, propext]
}

definition{
  name: application,
  parameters: [],
  result: Foundation.View.Text.V1.Model::TextApplication,
  body: (record Foundation.View.Text.V1.Model::TextApplication {profile := "prismpm/text-application/1", name := "Compression admission", cargoName := "prism-uorc-admission", cargoVersion := "0.1.0", cargoDescription := "Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order.", cargoRepository := "https://github.com/UOR-Foundation/PrismPM", cargoHomepage := "https://github.com/UOR-Foundation/PrismPM", libraryRoots := (cons "PrismUorcAdmission.UorcAdmission.dispatch" (nil String)), acceptanceVectors := (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742031303030203634302073616d65, response := 0x61646d6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742036343020363430206265666f7265, response := 0x61646d6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742036343020363430206166746572, response := 0x6b656570}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420363430203634302073616d65, response := 0x6b656570}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742036343020373030206265666f7265, response := 0x6b656570}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x646966666572732031303030203130206265666f7265, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420302030206265666f7265, response := 0x61646d6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6578616374203020302073616d65, response := 0x6b656570}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420302031206265666f7265, response := 0x6b656570}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6578616374203020312073616d65, response := 0x6b656570}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420312030206265666f7265, response := 0x61646d6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6578616374203120302073616d65, response := 0x61646d6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6469666665727320302030206265666f7265, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x64696666657273203020302073616d65, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6469666665727320302031206265666f7265, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x64696666657273203020312073616d65, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6469666665727320312030206265666f7265, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x64696666657273203120302073616d65, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0xff, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420302030206265666f7265206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420203020203020206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x756e6b6e6f776e20302030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742030372030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6578616374202d312030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6578616374202b312030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420313030303030303030303030303030303030302030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420d9a12030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420782030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742030203037206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742030202d31206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742030202b31206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420302031303030303030303030303030303030303030206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6578616374203020d9a1206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x657861637420302078206265666f7265, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x65786163742030203020756e6b6e6f776e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x78787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (nil Foundation.View.Text.V1.Model::AcceptanceVector))))))))))))))))))))))))))))))))))))))))), entryRoot := "PrismUorcAdmission.UorcAdmission.dispatch", coreContract := "hologram:guest/core-wasm@1", requestMaximum := (112 : UInt32), responseMaximum := (64 : UInt32), guestAllocationMaximum := (224 : UInt32), capabilitiesEmpty := true, fatArchive := true, primaryLayer := (0 : UInt8), viewLayer := (1 : UInt8), view := (record Foundation.View.Text.V1.Model::TextView {title := "Compression admission", heading := "Compression admission", inputLabel := "Request: roundtrip incumbent candidate order", submitLabel := "Decide", outputLabel := "Answer", inputError := "Invalid request", responseError := "Invalid response"})})
}
\end{semanticmodule}
\end{lexlean}
app/src/UorcAdmissionProofs.lex.tex 105 lines
\begin{lexlean}{UorcAdmissionProofs}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{UorcAdmission}
\title{Text application model}
\begin{semanticmodule}
definition{
  name: breaksInv001,
  parameters: [request : UorcAdmission::Request],
  result: Bool,
  body: (((((project request roundtrip) <? 2) && ((project request order) <? 3)) && ((project request roundtrip) =? (UorcAdmission::roundtripDiffers))) && ((UorcAdmission::judge request) =? (UorcAdmission::answerAdmit)))
}

theorem{
  name: inv001Holds,
  parameters: [request : UorcAdmission::Request],
  statement: ((breaksInv001 request) = false),
  proof: linear_arithmetic{
    definitions: [
      UorcAdmission::answerAdmit,
      UorcAdmission::answerKeep,
      UorcAdmission::answerRefuse,
      UorcAdmission::judge,
      UorcAdmission::orderAfter,
      UorcAdmission::orderBefore,
      UorcAdmission::orderSame,
      UorcAdmission::roundtripDiffers,
      UorcAdmission::roundtripExact,
      UorcAdmission::rule1,
      UorcAdmission::rule2,
      UorcAdmission::rule3,
      UorcAdmission::rule4,
      breaksInv001
    ]
  },
  axioms: [Quot.sound, propext]
}

definition{
  name: breaksInv002,
  parameters: [request : UorcAdmission::Request],
  result: Bool,
  body: (((((project request roundtrip) <? 2) && ((project request order) <? 3)) && ((project request incumbent) <? (project request candidate))) && ((UorcAdmission::judge request) =? (UorcAdmission::answerAdmit)))
}

theorem{
  name: inv002Holds,
  parameters: [request : UorcAdmission::Request],
  statement: ((breaksInv002 request) = false),
  proof: linear_arithmetic{
    definitions: [
      UorcAdmission::answerAdmit,
      UorcAdmission::answerKeep,
      UorcAdmission::answerRefuse,
      UorcAdmission::judge,
      UorcAdmission::orderAfter,
      UorcAdmission::orderBefore,
      UorcAdmission::orderSame,
      UorcAdmission::roundtripDiffers,
      UorcAdmission::roundtripExact,
      UorcAdmission::rule1,
      UorcAdmission::rule2,
      UorcAdmission::rule3,
      UorcAdmission::rule4,
      breaksInv002
    ]
  },
  axioms: [Quot.sound, propext]
}

definition{
  name: breaksInv003,
  parameters: [request : UorcAdmission::Request],
  result: Bool,
  body: ((((((project request roundtrip) <? 2) && ((project request order) <? 3)) && ((project request roundtrip) =? (UorcAdmission::roundtripExact))) && ((project request candidate) <? (project request incumbent))) && (not ((UorcAdmission::judge request) =? (UorcAdmission::answerAdmit))))
}

theorem{
  name: inv003Holds,
  parameters: [request : UorcAdmission::Request],
  statement: ((breaksInv003 request) = false),
  proof: linear_arithmetic{
    definitions: [
      UorcAdmission::answerAdmit,
      UorcAdmission::answerKeep,
      UorcAdmission::answerRefuse,
      UorcAdmission::judge,
      UorcAdmission::orderAfter,
      UorcAdmission::orderBefore,
      UorcAdmission::orderSame,
      UorcAdmission::roundtripDiffers,
      UorcAdmission::roundtripExact,
      UorcAdmission::rule1,
      UorcAdmission::rule2,
      UorcAdmission::rule3,
      UorcAdmission::rule4,
      breaksInv003
    ]
  },
  axioms: [Quot.sound, propext]
}
\end{semanticmodule}
\end{lexlean}
app/lexlean.toml 43 lines
spec = "lexlean/project/1"
name = "prism-uorc-admission"
language = "1.2"
module_prefix = "PrismUorcAdmission"
source_roots = ["src"]
entrypoints = ["src/Architecture.lex.tex", "src/Compliance.lex.tex", "src/Design.lex.tex", "src/Features.lex.tex", "src/Quality.lex.tex", "src/Security.lex.tex", "src/UorcAdmission.lex.tex", "src/UorcAdmissionProofs.lex.tex"]
build_root = ".lexlean"
lockfile = "lexlean.lock"
lean_workspace = "."
lean_toolchain = "leanprover/lean4:v4.32.1"

[[lexicon_source]]
package = "lexlean.std.nat"
kind = "builtin"

[[lexicon_source]]
package = "prism.arch"
kind = "path"
path = "language/prism.arch"

[[lexicon_source]]
package = "prism.qual"
kind = "path"
path = "language/prism.qual"

[[lexicon_source]]
package = "prism.sec"
kind = "path"
path = "language/prism.sec"

[limits]
max_file_bytes = 4194304
max_total_source_bytes = 67108864
max_primitive_atoms = 2000000
max_token_lattice_edges = 4000000
max_parse_states = 4000000
max_ir_nodes = 2000000
max_scope_depth = 1024
max_import_depth = 128
max_diagnostics = 256
max_child_output_bytes = 16777216
child_timeout_ms = 300000
app/prompt.json 300 lines
{
  "schema": "prism/prompt/1",
  "goal": "Decide if a new UORC archive replaces the best one so far. A smaller size must never come at the cost of lost data.",
  "pattern": "decisionTable",
  "repository": "UOR-Foundation/compression",
  "app": {
    "name": "uorc-admission",
    "title": "Compression admission",
    "purpose": "Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order.",
    "fields": [
      {
        "name": "roundtrip",
        "kind": "choice",
        "values": [
          "exact",
          "differs"
        ],
        "means": "whether replay reproduces every object and boundary byte for byte"
      },
      {
        "name": "incumbent",
        "kind": "number",
        "min": 0,
        "means": "the best-known archive's wire length, in bytes"
      },
      {
        "name": "candidate",
        "kind": "number",
        "min": 0,
        "means": "the candidate archive's wire length, in bytes"
      },
      {
        "name": "order",
        "kind": "choice",
        "values": [
          "before",
          "same",
          "after"
        ],
        "means": "with equal lengths, the candidate bytes against the incumbent bytes"
      }
    ],
    "outcomes": [
      "admit",
      "keep",
      "refuse"
    ],
    "meanings": {
      "admit": "the candidate replaces the incumbent as best-known archive",
      "keep": "the incumbent stays best-known",
      "refuse": "the candidate is not lossless and is rejected"
    },
    "rules": [
      {
        "when": [
          {
            "field": "roundtrip",
            "op": "is",
            "value": "differs"
          }
        ],
        "then": "refuse",
        "why": "src/Uorc/Search/Verify.lex.tex runTrial: any mismatch rejects the trial (full_bytes_not_digest_equality)"
      },
      {
        "when": [
          {
            "field": "candidate",
            "op": "<",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "admit",
        "why": "src/Uorc/Search/OrderRope.lex.tex beginDecision: a shorter challenger replaces the incumbent"
      },
      {
        "when": [
          {
            "field": "candidate",
            "op": ">",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "keep",
        "why": "OrderRope.lex.tex beginDecision: a longer challenger keeps the incumbent"
      },
      {
        "when": [
          {
            "field": "order",
            "op": "is",
            "value": "before"
          }
        ],
        "then": "admit",
        "why": "OrderRope.lex.tex: on equal length the first differing byte decides, and a smaller byte replaces"
      }
    ],
    "otherwise": "keep",
    "otherwiseWhy": "equal length and not before in byte order: keepIncumbent",
    "properties": [
      {
        "kind": "never",
        "when": [
          {
            "field": "roundtrip",
            "op": "is",
            "value": "differs"
          }
        ],
        "then": "admit",
        "why": "a lossy candidate is never admitted"
      },
      {
        "kind": "never",
        "when": [
          {
            "field": "candidate",
            "op": ">",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "admit",
        "why": "the best-known archive never grows"
      },
      {
        "kind": "always",
        "when": [
          {
            "field": "roundtrip",
            "op": "is",
            "value": "exact"
          },
          {
            "field": "candidate",
            "op": "<",
            "value": {
              "field": "incumbent"
            }
          }
        ],
        "then": "admit",
        "why": "an exact, strictly shorter archive always replaces"
      }
    ],
    "examples": [
      {
        "request": "exact 1000 640 same",
        "response": "admit"
      },
      {
        "request": "exact 640 640 before",
        "response": "admit"
      },
      {
        "request": "exact 640 640 after",
        "response": "keep"
      },
      {
        "request": "exact 640 640 same",
        "response": "keep"
      },
      {
        "request": "exact 640 700 before",
        "response": "keep"
      },
      {
        "request": "differs 1000 10 before",
        "response": "refuse"
      }
    ]
  },
  "stakeholders": [
    {
      "name": "Compression researcher",
      "text": "Searches for smaller references and needs every admitted one to be exact and no longer than the one it replaces.",
      "concerns": [
        "Proved guarantees",
        "Correct answers"
      ]
    },
    {
      "name": "Benchmark reviewer",
      "text": "Compares measured results and needs a best-known archive never to be stated as a record or a minimum.",
      "concerns": [
        "Claim boundaries"
      ]
    }
  ],
  "concerns": [
    {
      "name": "Claim boundaries",
      "text": "A best-known checked archive is not a minimality certificate or a record; record status exists only when an external authority accepts it.",
      "model": "quality"
    }
  ],
  "components": [
    {
      "name": "UORC web client",
      "text": "The accessible file-oriented client in web/ and client/ that runs the search and shows the archive.",
      "kind": "staticSite"
    },
    {
      "name": "External record authority",
      "text": "The benchmark authority whose own rules decide whether a measured result is a record.",
      "kind": "externalSystem"
    }
  ],
  "threats": [
    {
      "name": "Digest-only verification",
      "text": "A candidate is accepted because a digest matched, while its bytes or boundaries differ.",
      "stride": "tampering",
      "asset": "answer",
      "likelihood": "low",
      "impact": "critical",
      "control": {
        "name": "Full byte replay",
        "text": "Verification compares every byte and boundary, never only a digest, and a mismatch is never admitted.",
        "evidence": [
          {
            "kind": "review",
            "reference": "src/Uorc/Search/Verify.lex.tex full_bytes_not_digest_equality"
          },
          {
            "kind": "proof",
            "reference": "UorcAdmissionProofs::inv001Holds"
          }
        ]
      }
    },
    {
      "name": "Boundary-shifted collection",
      "text": "An archive reproduces the same flattened bytes with the object boundaries moved.",
      "stride": "tampering",
      "asset": "request",
      "likelihood": "low",
      "impact": "major",
      "control": {
        "name": "Boundaries checked",
        "text": "Replay checks object counts and lengths, so a shifted boundary is a mismatch.",
        "evidence": [
          {
            "kind": "review",
            "reference": "src/Uorc/Search/Verify.lex.tex same_flattening_different_boundary_rejected"
          }
        ]
      }
    },
    {
      "name": "Record claimed",
      "text": "A best-known archive is published as a compression record or a minimum.",
      "stride": "repudiation",
      "asset": "answer",
      "likelihood": "medium",
      "impact": "major",
      "accepted": "The engine states only a best-known checked archive and produces no minimality certificate; README claim boundaries leave record status to the external authority."
    }
  ],
  "quality": [
    {
      "characteristic": "Functional suitability",
      "subcharacteristic": "Functional correctness",
      "requirement": "Lossless admissions",
      "text": "Every admitted archive replays its objects exactly.",
      "measure": "Lossy admissions",
      "measureText": "Requests with roundtrip differs answered admit.",
      "threshold": 0
    }
  ],
  "journeys": [
    {
      "stakeholder": "Compression researcher",
      "steps": [
        "REQ-001",
        "REQ-002",
        "REQ-003",
        "REQ-004",
        "otherwise"
      ]
    },
    {
      "stakeholder": "Benchmark reviewer",
      "steps": [
        "INV-001",
        "INV-002",
        "INV-003"
      ]
    }
  ],
  "license": "MIT OR Apache-2.0",
  "axioms": {}
}
model/ids.toml 59 lines
# model/ids.toml --- the conformance ID register.
#
# Every ID this repository claims, in one place, so that nothing is referenced
# without being defined. `CONFORMANCE.md` is generated from this file. A test
# whose name ends in an ID not listed here fails `check-model`, and an ID listed
# here with no scenario and no test fails it too (CM-02).
#
# `level` is the honesty level (R2):
#   some-true  a fact reproduced from an authority; not established here
#   build      constructed here and validated against its oracle
#   open       measured and reported, never asserted
#
# Every row here has a scenario in `features/suites/` and a test whose name ends
# in the ID, lowercased with underscores (R3, CM-02). There is no "pending"
# state: a capability that is not built does not get a row, and every row in this
# file is built.
#
# The first row is the template's own Prism application in `app/` (TC-01).
# A capability starts with a row here; `just new-capability` writes the row,
# its scenario and its failing test in the order `AGENTS.md` sets out.

spec = "template/1"

[[id]]
id = "UA-01"
level = "build"
suite = "uorc_admission"
statement = "The app never answers admit when roundtrip is differs"

[[id]]
id = "UA-02"
level = "build"
suite = "uorc_admission"
statement = "The app never answers admit when candidate is above incumbent"

[[id]]
id = "UA-03"
level = "build"
suite = "uorc_admission"
statement = "The app always answers admit when roundtrip is exact and candidate is below incumbent"

[[id]]
id = "UA-04"
level = "build"
suite = "uorc_admission"
statement = "The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references"

[[id]]
id = "UA-05"
level = "build"
suite = "uorc_admission"
statement = "The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared"

[[id]]
id = "UA-06"
level = "build"
suite = "uorc_admission"
statement = "Every compliance obligation is numbered in order and names its evidence"
features/suites/uorc_admission.feature 38 lines
Feature: uorc_admission

  This repository's Prism application, in app/, generated by prism-code from its
  spec: Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order.

  @UA-01 @build
  Scenario: The app never answers admit when roundtrip is differs
    Given the model in app/src/UorcAdmission.lex.tex
    When the Lean kernel checks inv001Holds during prismpm verify
    Then no request meets breaksInv001

  @UA-02 @build
  Scenario: The app never answers admit when candidate is above incumbent
    Given the model in app/src/UorcAdmission.lex.tex
    When the Lean kernel checks inv002Holds during prismpm verify
    Then no request meets breaksInv002

  @UA-03 @build
  Scenario: The app always answers admit when roundtrip is exact and candidate is below incumbent
    Given the model in app/src/UorcAdmission.lex.tex
    When the Lean kernel checks inv003Holds during prismpm verify
    Then no request meets breaksInv003
  @UA-04 @build
  Scenario: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
    Given the model in app/src/Architecture.lex.tex
    When the Lean kernel checks architectureDescriptionHolds during prismpm verify
    Then the architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
  @UA-05 @build
  Scenario: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
    Given the model in app/src/Quality.lex.tex
    When the Lean kernel checks qualityModelHolds during prismpm verify
    Then the ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
  @UA-06 @build
  Scenario: Every compliance obligation is numbered in order and names its evidence
    Given the model in app/src/Compliance.lex.tex
    When the Lean kernel checks everyObligationEvidenced during prismpm verify
    Then every compliance obligation is numbered in order and names its evidence
crates/conformance/tests/uorc_admission.rs 122 lines
//! The `uorc_admission` suite: one test per scenario in `features/suites/uorc_admission.feature`.
//!
//! Written by the Prism-DevRel builder from the app's prompt. The theorems are
//! checked by the Lean kernel when `just vv` runs `prismpm verify` on `app/`.
//! What these tests hold fixed is what each theorem is about, so a weakened
//! statement that still verifies fails the gate.

use std::path::PathBuf;

fn root() -> PathBuf {
    PathBuf::from(env!("CARGO_MANIFEST_DIR"))
        .ancestors()
        .nth(2)
        .expect("crates/conformance is two below the root")
        .to_path_buf()
}

/// The body of the top-level declaration named `name`, up to its closing brace.
fn declaration<'a>(model: &'a str, name: &str) -> &'a str {
    let start = model
        .find(&format!("\n  name: {name},\n"))
        .unwrap_or_else(|| panic!("{name} is not declared"));
    let end = model[start..]
        .find("\n}\n")
        .unwrap_or_else(|| panic!("{name} is not closed"));
    &model[start..start + end]
}

fn module(path: &str) -> String {
    std::fs::read_to_string(root().join(path)).expect("the module")
}

/// The condition no request may meet, and the theorem that says none does.
fn pinned(breaks: &str, condition: &str, theorem: &str) {
    let model = module("app/src/UorcAdmissionProofs.lex.tex");
    let found = declaration(&model, breaks);
    assert!(
        found.contains(condition),
        "the condition of {breaks} changed:\n{found}"
    );
    let holds = declaration(&model, theorem);
    let statement = format!("statement: (({breaks} request) = false),");
    assert!(
        holds.contains(&statement),
        "{theorem} must state that no request meets {breaks}:\n{holds}"
    );
}

/// A facet theorem: proved by `decide`, about exactly this predicate.
fn holds(path: &str, theorem: &str, statement: &str) {
    let model = module(path);
    let found = declaration(&model, theorem);
    assert!(
        found.contains(&format!("statement: {statement},")),
        "{theorem} must state {statement}:\n{found}"
    );
    assert!(
        found.contains("proof: decide{}"),
        "{theorem} is proved by decide"
    );
}

/// `UA-01`: The app never answers admit when roundtrip is differs
#[test]
fn uorc_admission_ua_01() {
    pinned(
        "breaksInv001",
        "body: (((((project request roundtrip) <? 2) && ((project request order) <? 3)) && ((project request roundtrip) =? (UorcAdmission::roundtripDiffers))) && ((UorcAdmission::judge request) =? (UorcAdmission::answerAdmit)))",
        "inv001Holds",
    );
}

/// `UA-02`: The app never answers admit when candidate is above incumbent
#[test]
fn uorc_admission_ua_02() {
    pinned(
        "breaksInv002",
        "body: (((((project request roundtrip) <? 2) && ((project request order) <? 3)) && ((project request incumbent) <? (project request candidate))) && ((UorcAdmission::judge request) =? (UorcAdmission::answerAdmit)))",
        "inv002Holds",
    );
}

/// `UA-03`: The app always answers admit when roundtrip is exact and candidate is below incumbent
#[test]
fn uorc_admission_ua_03() {
    pinned(
        "breaksInv003",
        "body: ((((((project request roundtrip) <? 2) && ((project request order) <? 3)) && ((project request roundtrip) =? (UorcAdmission::roundtripExact))) && ((project request candidate) <? (project request incumbent))) && (not ((UorcAdmission::judge request) =? (UorcAdmission::answerAdmit))))",
        "inv003Holds",
    );
}

/// `UA-04`: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
#[test]
fn uorc_admission_ua_04() {
    holds(
        "app/src/Architecture.lex.tex",
        "architectureDescriptionHolds",
        "((architectureValid) = true)",
    );
}

/// `UA-05`: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
#[test]
fn uorc_admission_ua_05() {
    holds(
        "app/src/Quality.lex.tex",
        "qualityModelHolds",
        "((qualityValid) = true)",
    );
}

/// `UA-06`: Every compliance obligation is numbered in order and names its evidence
#[test]
fn uorc_admission_ua_06() {
    holds(
        "app/src/Compliance.lex.tex",
        "everyObligationEvidenced",
        "((obligationsEvidenced 0 (obligations)) = true)",
    );
}
site/app.json 102 lines
{
  "name": "Compression admission",
  "shortName": "Compression",
  "live": "https://uor-foundation.github.io/compression/",
  "purpose": "Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order. Send roundtrip, incumbent, candidate or order, separated by spaces; it answers admit, keep or refuse, and invalid request for anything else.",
  "inputLabel": "Request: roundtrip incumbent candidate order",
  "placeholder": "exact 1000 640 same",
  "submitLabel": "Decide",
  "outputLabel": "Answer",
  "answers": {
    "positive": [
      "admit"
    ],
    "negative": [
      "keep",
      "refuse"
    ],
    "refusal": "invalid request"
  },
  "promise": {
    "headline": "Says conformant exactly when every policy file matches its lock.",
    "detail": "Each of the six universal policy files is compared with the digest the lock records, and any file that drifted is named."
  },
  "claim": "UA-01: the app never answers admit when roundtrip is differs. UA-02: the app never answers admit when candidate is above incumbent. UA-03: the app always answers admit when roundtrip is exact and candidate is below incumbent.",
  "proposition": {
    "name": "judge",
    "text": "judge request :=\n  roundtrip is differs → refuse\n  candidate is below incumbent → admit\n  candidate is above incumbent → keep\n  order is before → admit\n  otherwise → keep",
    "plain": "Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order."
  },
  "theorems": [
    {
      "name": "inv001Holds",
      "statement": "no request meets breaksInv001: the app never answers admit when roundtrip is differs",
      "how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
      "where": "app/src/UorcAdmissionProofs.lex.tex"
    },
    {
      "name": "inv002Holds",
      "statement": "no request meets breaksInv002: the app never answers admit when candidate is above incumbent",
      "how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
      "where": "app/src/UorcAdmissionProofs.lex.tex"
    },
    {
      "name": "inv003Holds",
      "statement": "no request meets breaksInv003: the app always answers admit when roundtrip is exact and candidate is below incumbent",
      "how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
      "where": "app/src/UorcAdmissionProofs.lex.tex"
    }
  ],
  "pinned": [
    {
      "name": "uorc_admission_ua_01",
      "what": "UA-01's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
      "where": "crates/conformance/tests/uorc_admission.rs"
    },
    {
      "name": "uorc_admission_ua_02",
      "what": "UA-02's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
      "where": "crates/conformance/tests/uorc_admission.rs"
    },
    {
      "name": "uorc_admission_ua_03",
      "what": "UA-03's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
      "where": "crates/conformance/tests/uorc_admission.rs"
    }
  ],
  "trusted": [
    {
      "name": "SDK image",
      "value": "the digest prismpm.lock pins; see the bootstrap workflow's log"
    },
    {
      "name": "Lean toolchain",
      "value": "leanprover/lean4:v4.32.1"
    },
    {
      "name": "LexLean compiler semantics",
      "value": "5262e5b4c8b5668ae7066ad686757a6bb7f80c941d515fb9d586894fbc7de69a"
    },
    {
      "name": "prism-code runtime, vendored",
      "value": "0.2.0, see try/vendor/prism-code/VENDOR.md"
    },
    {
      "name": "Your browser",
      "value": "runs the WebAssembly guest and this page"
    }
  ],
  "attestations": {
    "proof": {
      "id": "not recorded: the proof ran in the SDK image, not on the UOR MCP server",
      "url": "https://github.com/UOR-Foundation/compression/actions/workflows/bootstrap.yml"
    },
    "build": {
      "id": "printed by prismpm verify in every pages run",
      "url": "https://github.com/UOR-Foundation/compression/actions/workflows/pages.yml"
    }
  },
  "repository": "https://github.com/UOR-Foundation/compression",
  "report": "https://github.com/UOR-Foundation/compression/blob/main/TEMPLATE-VERIFICATION.md"
}
openspec/specs/uorc-admission/spec.md 159 lines
# uorc-admission Specification

<!-- Generated by Prism from prism/spec.json. Change the app through your agent with /prism, not by editing this file. -->

## Purpose

Compression admission: Decide whether a checked candidate replaces the incumbent archive, the incumbent is kept, or the candidate is refused, from its byte-exact replay, both wire lengths and, on a tie, their byte order.

## Requirements

### Requirement: Never admit when roundtrip is differs

The app SHALL NOT answer `admit` when roundtrip is differs, because a lossy candidate is never admitted.

Verified: to be proved by Lean for every request (INV-001, theorem `inv001Holds`).

#### Scenario: INV-001 holds

- **WHEN** the request is `differs 1000 10 before` (an acceptance example)
- **THEN** the answer SHALL NOT be `admit`
- **AND** the app answers `refuse`, decided by REQ-001

### Requirement: Never admit when candidate is above incumbent

The app SHALL NOT answer `admit` when candidate is above incumbent, because the best-known archive never grows.

Verified: to be proved by Lean for every request (INV-002, theorem `inv002Holds`).

#### Scenario: INV-002 holds

- **WHEN** the request is `exact 640 700 before` (an acceptance example)
- **THEN** the answer SHALL NOT be `admit`
- **AND** the app answers `keep`, decided by REQ-003

### Requirement: Always admit when roundtrip is exact and candidate is below incumbent

The app SHALL answer `admit` when roundtrip is exact and candidate is below incumbent, because an exact, strictly shorter archive always replaces.

Verified: to be proved by Lean for every request (INV-003, theorem `inv003Holds`).

#### Scenario: INV-003 holds

- **WHEN** the request is `exact 1000 640 same` (an acceptance example)
- **THEN** the answer SHALL be `admit`
- **AND** the app answers `admit`, decided by REQ-002

### Requirement: REQ-001 refuse when roundtrip is differs

The app SHALL answer `refuse` when roundtrip is differs, because src/Uorc/Search/Verify.lex.tex runTrial: any mismatch rejects the trial (full_bytes_not_digest_equality).

Verified: tested by the acceptance vectors (`rule1`).

#### Scenario: REQ-001 decides

- **WHEN** the request is `differs 1000 10 before` (an acceptance example)
- **THEN** the answer SHALL be `refuse`, decided by REQ-001

### Requirement: REQ-002 admit when candidate is below incumbent

The app SHALL answer `admit` when candidate is below incumbent and no earlier rule matches, because src/Uorc/Search/OrderRope.lex.tex beginDecision: a shorter challenger replaces the incumbent.

Verified: tested by the acceptance vectors (`rule2`).

#### Scenario: REQ-002 decides

- **WHEN** the request is `exact 1000 640 same` (an acceptance example)
- **THEN** the answer SHALL be `admit`, decided by REQ-002

### Requirement: REQ-003 keep when candidate is above incumbent

The app SHALL answer `keep` when candidate is above incumbent and no earlier rule matches, because OrderRope.lex.tex beginDecision: a longer challenger keeps the incumbent.

Verified: tested by the acceptance vectors (`rule3`).

#### Scenario: REQ-003 decides

- **WHEN** the request is `exact 640 700 before` (an acceptance example)
- **THEN** the answer SHALL be `keep`, decided by REQ-003

### Requirement: REQ-004 admit when order is before

The app SHALL answer `admit` when order is before and no earlier rule matches, because OrderRope.lex.tex: on equal length the first differing byte decides, and a smaller byte replaces.

Verified: tested by the acceptance vectors (`rule4`).

#### Scenario: REQ-004 decides

- **WHEN** the request is `exact 640 640 before` (an acceptance example)
- **THEN** the answer SHALL be `admit`, decided by REQ-004

### Requirement: Otherwise keep

The app SHALL answer `keep` when no rule matches, because equal length and not before in byte order: keepIncumbent.

Verified: tested by the acceptance vectors.

#### Scenario: No rule matches

- **WHEN** the request is `exact 640 640 after` (an acceptance example)
- **THEN** the answer SHALL be `keep`

### Requirement: The first matching rule decides

The app SHALL try REQ-001, REQ-002, REQ-003, REQ-004 in that order, and the first rule that matches SHALL decide.

Verified: tested by the acceptance vectors.

#### Scenario: Two rules match

- **WHEN** the request is `exact 640 700 before` (an acceptance example)
- **THEN** the answer SHALL be `keep`, decided by REQ-003, the earlier rule

### Requirement: Request and answers

The app SHALL read one request as one line of 4 fields separated by single spaces, in this order, and SHALL answer exactly one of `admit`, `keep`, `refuse`, or `invalid` for anything else.

| Field | Accepts | Means |
| --- | --- | --- |
| `roundtrip` | `exact`, `differs` | whether replay reproduces every object and boundary byte for byte |
| `incumbent` | whole number from 0 | the best-known archive's wire length, in bytes |
| `candidate` | whole number from 0 | the candidate archive's wire length, in bytes |
| `order` | `before`, `same`, `after` | with equal lengths, the candidate bytes against the incumbent bytes |

| Answer | Means |
| --- | --- |
| `admit` | the candidate replaces the incumbent as best-known archive |
| `keep` | the incumbent stays best-known |
| `refuse` | the candidate is not lossless and is rejected |
| `invalid` | the request is malformed |

Verified: reading a request is tested, not proved.

#### Scenario: A malformed request is invalid

- **WHEN** the request is not 4 fields in this order
- **THEN** the answer SHALL be `invalid`

## Examples

- `exact 1000 640 same` gives `admit`
- `exact 640 640 before` gives `admit`
- `exact 640 640 after` gives `keep`
- `exact 640 640 same` gives `keep`
- `exact 640 700 before` gives `keep`
- `differs 1000 10 before` gives `refuse`

## What is proved and what is tested

Lean proves each property marked proved above, for every request that decodes, with no exceptions and no sampling. The proof is about `judge`, the function the WebAssembly guest runs, because both come from the same model.

The parsing of requests is tested, not proved: the acceptance vectors in the app replay through the built guest, including malformed and oversized requests.

Nothing here says the rules are the right rules. That is the part only you can judge.

## Files

- `prism/spec.json` is this spec as data.
- `src/UorcAdmission.lex.tex` is the LexLean model generated from it. It is the single source of the app.

how-to guideBuildexampleMarkdown

Words on this page 6
record
One entry in a facet: a component, a threat, a measure or a journey step, with the place in the source it came from.
Lean kernel
The small checker at the heart of the Lean prover. It accepts a proof only if every step follows the rules.
theorem
A statement about the model that the Lean kernel has checked, so it holds for every input, not only the ones tested.
SDK
Software development kit. Here, the PrismPM container image that builds, checks and verifies Prism models.
stakeholder
A person or group with an interest in the system, as ISO/IEC/IEEE 42010 defines it.
decision table
A table of rules, as in OMG DMN 1.5: each row says which inputs lead to which outcome.