Examples: Proposal admission
Overview
Example appsDecision 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// example · Decision tables
Proposal admission
Decide if a router's proposal joins the app. A stale, unclear or clashing proposal never becomes part of it.
Inspired by UOR-Foundation/foundry (live). Prism AI Foundry: describe an app, and it is built, proved and published.
Pattern: Decision table, OMG DMN 1.5, hit policy FIRST. To write one of your own, follow How to build a decision table app.
The data in this figure
| Step | What happens |
|---|---|
| 1. Request | revision, ambiguity, constraints, conflicts |
| 2. 4 rules | the first that matches wins |
| 3. Answer | admit, refuse, open |
| 4. Proved | 4 theorems, 36 tests |
- Fingerprint
71f1aad34ee8501f5d7814505ea88b91f00c04a676593938c491404a4148a9be- Acceptance vectors
- 36
- Claims
- 7
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 293 lines
{
"schema": "prism/prompt/1",
"goal": "Decide if a router's proposal joins the app. A stale, unclear or clashing proposal never becomes part of it.",
"pattern": "decisionTable",
"repository": "UOR-Foundation/foundry",
"app": {
"name": "proposal-admission",
"title": "Proposal admission",
"purpose": "Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict.",
"fields": [
{
"name": "revision",
"kind": "choice",
"values": [
"current",
"stale"
],
"means": "whether the intent and registry revision match the expected ones"
},
{
"name": "ambiguity",
"kind": "choice",
"values": [
"none",
"ambiguous"
],
"means": "whether the proposal lists an unresolved ambiguity"
},
{
"name": "constraints",
"kind": "choice",
"values": [
"resolved",
"unresolved"
],
"means": "whether the proposal lists an unresolved constraint"
},
{
"name": "conflicts",
"kind": "number",
"min": 0,
"means": "selected features that conflict with another"
}
],
"outcomes": [
"admit",
"refuse",
"open"
],
"meanings": {
"admit": "the selected features join the composition",
"refuse": "refused: stale, or the composition is rejected",
"open": "refused with an unresolved issue, ambiguity or constraint, to resolve and propose again"
},
"rules": [
{
"when": [
{
"field": "revision",
"op": "is",
"value": "stale"
}
],
"then": "refuse",
"why": "app/src/ProposalAdmission.lex.tex admitProposal: staleIntent and staleRegistry are checked first (staleIntentRefused, staleRegistryRefused)"
},
{
"when": [
{
"field": "ambiguity",
"op": "is",
"value": "ambiguous"
}
],
"then": "open",
"why": "admitProposal: any ambiguity is unresolvedAmbiguity, never a default (ambiguityRefused)"
},
{
"when": [
{
"field": "constraints",
"op": "is",
"value": "unresolved"
}
],
"then": "open",
"why": "admitProposal: an unresolved constraint is unresolvedConstraint (constraintRefused)"
},
{
"when": [
{
"field": "conflicts",
"op": ">=",
"value": 1
}
],
"then": "refuse",
"why": "app/src/FeatureComposition.lex.tex hasConflict: admitComposition rejects conflicting features (compositionRejected)"
}
],
"otherwise": "admit",
"otherwiseWhy": "current, unambiguous, resolved and consistent: admitProposal returns the features",
"properties": [
{
"kind": "never",
"when": [
{
"field": "ambiguity",
"op": "is",
"value": "ambiguous"
}
],
"then": "admit",
"why": "no silent defaults"
},
{
"kind": "never",
"when": [
{
"field": "constraints",
"op": "is",
"value": "unresolved"
}
],
"then": "admit",
"why": "unresolved issues refuse acceptance"
},
{
"kind": "never",
"when": [
{
"field": "conflicts",
"op": ">=",
"value": 1
}
],
"then": "admit",
"why": "the composition stays consistent"
},
{
"kind": "never",
"when": [
{
"field": "revision",
"op": "is",
"value": "stale"
}
],
"then": "admit",
"why": "a proposal against an old registry or intent is never admitted"
}
],
"examples": [
{
"request": "current none resolved 0",
"response": "admit"
},
{
"request": "current ambiguous resolved 0",
"response": "open"
},
{
"request": "current none unresolved 2",
"response": "open"
},
{
"request": "current none resolved 2",
"response": "refuse"
},
{
"request": "stale none resolved 0",
"response": "refuse"
},
{
"request": "current ambiguous resolved 3",
"response": "open"
}
]
},
"stakeholders": [
{
"name": "App builder",
"text": "Describes an app in plain words and needs only current, unambiguous, consistent parts to reach it.",
"concerns": [
"Proved guarantees",
"Correct answers"
]
},
{
"name": "Registry maintainer",
"text": "Publishes versioned feature contracts and needs a proposal made against an older registry revision to be refused.",
"concerns": [
"Proved guarantees"
]
}
],
"components": [
{
"name": "Router",
"text": "The model that reads the description and proposes versioned feature references with a confidence; inference belongs to the runner, not the kernel.",
"kind": "externalSystem"
},
{
"name": "Feature registry",
"text": "The registry of canonical versioned feature contracts that admission resolves references against.",
"kind": "database"
}
],
"threats": [
{
"name": "Confidence as permission",
"text": "A router's high confidence is taken as a grant, budget or evidence for a proposal.",
"stride": "elevationOfPrivilege",
"asset": "request",
"likelihood": "medium",
"impact": "major",
"control": {
"name": "Confidence grants nothing",
"text": "Admission never reads confidence to decide, and the kernel proves confidence cannot grant a permission or raise a budget.",
"evidence": [
{
"kind": "review",
"reference": "app/src/ProposalAdmission.lex.tex confidenceCannotGrantPermission"
},
{
"kind": "review",
"reference": "app/src/ProposalAdmission.lex.tex confidenceCannotIncreaseBudget"
}
]
}
},
{
"name": "Stale registry",
"text": "A proposal written against an older registry revision is admitted with contracts that changed.",
"stride": "tampering",
"asset": "request",
"likelihood": "medium",
"impact": "major",
"control": {
"name": "Revision match proved",
"text": "A stale proposal is never admitted, proved for every request.",
"evidence": [
{
"kind": "proof",
"reference": "ProposalAdmissionProofs::inv004Holds"
}
]
}
},
{
"name": "Router-authored contract",
"text": "A router supplies its own contract text in place of the registered one.",
"stride": "spoofing",
"asset": "source",
"likelihood": "low",
"impact": "major",
"accepted": "Admission resolves canonical contracts from the supplied registry by key and version and never accepts router-authored contracts (proposalBoundary); the app sees only the outcome of that resolution."
}
],
"quality": [
{
"characteristic": "Interaction capability",
"subcharacteristic": "User error protection",
"requirement": "Ambiguity returned, never guessed",
"text": "Every ambiguous or unresolved proposal is answered open, so the builder resolves it.",
"measure": "Guessed proposals",
"measureText": "Requests with an ambiguity or unresolved constraint answered admit.",
"threshold": 0
}
],
"journeys": [
{
"stakeholder": "App builder",
"steps": [
"REQ-002",
"REQ-003",
"REQ-004",
"otherwise"
]
},
{
"stakeholder": "Registry maintainer",
"steps": [
"REQ-001",
"INV-004",
"INV-003"
]
}
],
"concerns": [],
"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.
PA-01The app never answers admit when ambiguity is ambiguousPA-02The app never answers admit when constraints is unresolvedPA-03The app never answers admit when conflicts is at least 1PA-04The app never answers admit when revision is stalePA-05The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it referencesPA-06The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declaredPA-07Every compliance obligation is numbered in order and names its evidence
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.
| Pattern | Standard | Answers |
|---|---|---|
| Decision table | OMG DMN 1.5, hit policy FIRST | admit, refuse, open |
Behavior
A request is revision, ambiguity, constraints, conflicts, separated by spaces. The first rule that matches decides. If none matches, the answer is admit. A request over 112 bytes, or in any other form, is answered invalid.
| Rule | When | Answer | Why |
|---|---|---|---|
| REQ-001 | revision is stale | refuse | app/src/ProposalAdmission.lex.tex admitProposal: staleIntent and staleRegistry are checked first (staleIntentRefused, staleRegistryRefused) |
| REQ-002 | ambiguity is ambiguous | open | admitProposal: any ambiguity is unresolvedAmbiguity, never a default (ambiguityRefused) |
| REQ-003 | constraints is unresolved | open | admitProposal: an unresolved constraint is unresolvedConstraint (constraintRefused) |
| REQ-004 | conflicts is at least 1 | refuse | app/src/FeatureComposition.lex.tex hasConflict: admitComposition rejects conflicting features (compositionRejected) |
| otherwise | no rule matches | admit | current, unambiguous, resolved and consistent: admitProposal returns the features |
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.
| Property | Statement | Theorem | Why |
|---|---|---|---|
| INV-001 | It never answers admit when ambiguity is ambiguous. | ProposalAdmissionProofs::inv001Holds | no silent defaults |
| INV-002 | It never answers admit when constraints is unresolved. | ProposalAdmissionProofs::inv002Holds | unresolved issues refuse acceptance |
| INV-003 | It never answers admit when conflicts is at least 1. | ProposalAdmissionProofs::inv003Holds | the composition stays consistent |
| INV-004 | It never answers admit when revision is stale. | ProposalAdmissionProofs::inv004Holds | a proposal against an old registry or intent is never admitted |
Architecture
Stakeholders and the concerns each one views the app through (ISO/IEC/IEEE 42010).
| Stakeholder | Who they are | Concerns |
|---|---|---|
| App builder | Describes an app in plain words and needs only current, unambiguous, consistent parts to reach it. | Proved guarantees, Correct answers |
| Registry maintainer | Publishes versioned feature contracts and needs a proposal made against an older registry revision to be refused. | Proved guarantees |
| Verifier | Anyone 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.
| Concern | What it means | Model |
|---|---|---|
| Correct answers | Every well-formed request is answered by the first rule that matches it, or admit when none does, as the spec states. | quality |
| Integrity of the published app | What a visitor runs is the holo the build verified, with its fingerprint and signed provenance beside it. | security |
| Proved guarantees | Each of the 4 properties of the spec holds for every request, proved by the Lean kernel. | quality |
| Refused malformed requests | A 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.
| Component | Kind | What it is |
|---|---|---|
| Browser | externalSystem | The visitor's web browser, which loads the page and runs the Proposal admission guest. |
| Feature registry | database | The registry of canonical versioned feature contracts that admission resolves references against. |
| GitHub Pages | externalSystem | Serves the page and the holo from the repository Pages workflow. |
| Prism build | cliAdapter | prismpm verify in the SDK image prismpm.lock pins: it checks every theorem, builds the guest and replays every vector. |
| Proposal admission guest | service | The Core-Wasm guest built from the model: it answers one request of at most 112 bytes with one answer of at most 64. |
| Proposal admission page | staticSite | The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors. |
| Router | externalSystem | The model that reads the description and proposes versioned feature references with a confidence; inference belongs to the runner, not the kernel. |
| Source repository | externalSystem | The repository that holds the prompt, the model and its gate. |
Design views
The SDK checks each view against the system model and draws it as OPL and PlantUML.
| View | Diagram | Viewpoint |
|---|---|---|
| Deciding a Proposal admission request | opmObjectProcess | App builder: Correct answers |
| Components of Proposal admission | umlComponent | Verifier: Integrity of the published app |
| Answering a Proposal admission request | umlSequence | App builder: Correct answers |
| States of the Proposal admission guest | umlStateMachine | Verifier: Refused malformed requests |
Features and journeys
10 features. Each names the definitions that do the work and the tests that accept it. Each stakeholder has one journey.
Features and journeys 10 rows
| Feature | Calls | Accepted by |
|---|---|---|
| When revision is stale, the answer is refuse. | ProposalAdmission::rule1, ProposalAdmission::judge | ProposalAdmission::application |
| When ambiguity is ambiguous, the answer is open. | ProposalAdmission::rule2, ProposalAdmission::judge | ProposalAdmission::application |
| When constraints is unresolved, the answer is open. | ProposalAdmission::rule3, ProposalAdmission::judge | ProposalAdmission::application |
| When conflicts is at least 1, the answer is refuse. | ProposalAdmission::rule4, ProposalAdmission::judge | ProposalAdmission::application |
| When no rule matches, the answer is admit. | ProposalAdmission::judge | ProposalAdmission::application |
| A request that is not revision, ambiguity, constraints, conflicts in order, separated by single spaces, or is over 112 bytes, is answered invalid. | ProposalAdmission::dispatch, ProposalAdmission::decodeField1 | ProposalAdmission::application |
| It never answers admit when ambiguity is ambiguous. | ProposalAdmission::judge | ProposalAdmissionProofs::inv001Holds |
| It never answers admit when constraints is unresolved. | ProposalAdmission::judge | ProposalAdmissionProofs::inv002Holds |
| It never answers admit when conflicts is at least 1. | ProposalAdmission::judge | ProposalAdmissionProofs::inv003Holds |
| It never answers admit when revision is stale. | ProposalAdmission::judge | ProposalAdmissionProofs::inv004Holds |
Journeys
The ordered features each stakeholder takes.
| Stakeholder | Steps |
|---|---|
| App builder | REQ-002 → REQ-003 → REQ-004 → otherwise |
| Registry maintainer | REQ-001 → INV-004 → INV-003 |
| Verifier | refuse → INV-001 → INV-002 → INV-003 → INV-004 |
Security and threat model
13 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 13 rows
| Threat | STRIDE | Asset | Risk | Answered by |
|---|---|---|---|---|
| Answer that breaks INV-001 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-001: proof ProposalAdmissionProofs::inv001Holds |
| Answer that breaks INV-002 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-002: proof ProposalAdmissionProofs::inv002Holds |
| Answer that breaks INV-003 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-003: proof ProposalAdmissionProofs::inv003Holds |
| Answer that breaks INV-004 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-004: proof ProposalAdmissionProofs::inv004Holds |
| Confidence as permission | elevationOfPrivilege | Request bytes | medium likelihood, major impact | Confidence grants nothing: review app/src/ProposalAdmission.lex.tex confidenceCannotGrantPermission; review app/src/ProposalAdmission.lex.tex confidenceCannotIncreaseBudget |
| Granted capability | informationDisclosure | Answer | low likelihood, major impact | No capability granted: gate prism-code check refuses an ungranted guest import |
| Malformed request | tampering | Request bytes | high likelihood, major impact | Strict decoder: gate malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify |
| Oversized request | denialOfService | Request bytes | medium likelihood, minor impact | Bounded request: gate acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify |
| Router-authored contract | spoofing | Model source | low likelihood, major impact | accepted: Admission resolves canonical contracts from the supplied registry by key and version and never accepts router-authored contracts (proposalBoundary); the app sees only the outcome of that resolution. |
| Stale registry | tampering | Request bytes | medium likelihood, major impact | Revision match proved: proof ProposalAdmissionProofs::inv004Holds |
| Substituted holo | spoofing | Published holo | low likelihood, critical impact | Fingerprint and provenance: gate actions/attest-build-provenance in the pages workflow; gate prism-code check of the holo identities in the page |
| Substituted host | spoofing | Published holo | low likelihood, critical impact | accepted: 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 model | tampering | Model source | low likelihood, major impact | Regenerated 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.
Quality 7 rows
| Requirement | Characteristic | Measure | Threshold |
|---|---|---|---|
| Ambiguity returned, never guessed: Every ambiguous or unresolved proposal is answered open, so the builder resolves it. | Interaction capability: User error protection | Guessed proposals | 0 |
| Bounded allocation: The guest allocates at most 224 bytes for one request. | Performance efficiency: Resource utilization | Guest allocation bytes | 224 |
| Bounded request: A request over 112 bytes is refused before any field is read. | Performance efficiency: Time behaviour | Request bytes read | 112 |
| Every property proved: All 4 properties are theorems the Lean kernel checks. | Security: Integrity | Unproved properties | 0 |
| Every request answered: Every request gets an answer: a rule, admit otherwise, or invalid. | Functional suitability: Functional completeness | Unanswered requests | 0 |
| Every vector replays: All 36 acceptance vectors replay in the compiled guest, the shortest 0 bytes long. | Reliability: Faultlessness | Failed vectors | 0 |
| Examples answered as stated: Every one of the 6 examples of the spec is answered as it states. | Functional suitability: Functional correctness | Example mismatches | 0 |
Compliance
One obligation per standard, each naming its evidence.
| Standard | Subject | Evidence |
|---|---|---|
| ISO/IEC/IEEE 42010:2022 | Architecture description | Architecture::architectureDescriptionHolds |
| ISO/PAS 19450:2015 and OMG UML 2.5.1 | Design views | Design::viewOpmDecide, Design::viewUmlComponents, Design::viewUmlRequest, Design::viewUmlStates |
| ISO/IEC 25010:2023 | Product quality | Quality::qualityModelHolds |
| ISO/IEC 27034-1:2011 and ISO/IEC 27005:2022 | Application security and risk | Security::controlSet |
| OMG DMN 1.5, hit policy FIRST | Decision table | ProposalAdmission::judge |
| OpenSpec | Requirements | ProposalAdmission::application |
| SPDX MIT OR Apache-2.0 | Licensing | ProposalAdmission::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 Proposal admission request
Viewpoint: Architecture::viewpointAppBuilderCorrectAnswers
Notation: ISO/PAS 19450:2015 OPM, Prism OPL profile
componentBrowser is an object.
componentProposalAdmissionGuest is an object.
componentProposalAdmissionGuest can be stateDeciding or stateIdle.
processDecide is a process.
processEncodeAnswer is a process.
processJudge is a process.
processParseRequest is a process.
componentProposalAdmissionGuest 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 Proposal admission
component "componentBrowser" as c0
component "componentFeatureRegistry" as c1
component "componentGitHubPages" as c2
component "componentPrismBuild" as c3
component "componentProposalAdmissionGuest" as c4
component "componentProposalAdmissionPage" as c5
component "componentRouter" as c6
component "componentSourceRepository" as c7
c0 --> c4 : edgeBrowserToProposalAdmissionGuest
c1 --> c4 : edgeFeatureRegistryToProposalAdmissionGuest
c2 --> c0 : edgeGitHubPagesToBrowser
c3 --> c4 : edgePrismBuildToProposalAdmissionGuest
c3 --> c5 : edgePrismBuildToProposalAdmissionPage
c4 --> c0 : edgeProposalAdmissionGuestToBrowser
c4 --> c1 : edgeProposalAdmissionGuestToFeatureRegistry
c4 --> c6 : edgeProposalAdmissionGuestToRouter
c5 --> c2 : edgeProposalAdmissionPageToGitHubPages
c6 --> c4 : edgeRouterToProposalAdmissionGuest
c7 --> c3 : edgeSourceRepositoryToPrismBuild
@enduml
design/Design.viewUmlRequest.puml
@startuml
' UML 2.5.1 sequence diagram
' view: Design::viewUmlRequest
' viewpoint: Architecture::viewpointAppBuilderCorrectAnswers
title Answering a Proposal admission request
participant "componentBrowser" as p0
participant "componentProposalAdmissionGuest" 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 Proposal admission guest
state "stateAnsweredAdmit" as s0
state "stateAnsweredOpen" 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 --> s1 : processRule2
s3 --> s1 : processRule3
s3 --> s2 : processRule4
s3 --> s0 : processOtherwise
s0 --> s4 : processEncodeAnswer
s2 --> s4 : processEncodeAnswer
s1 --> 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 392 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: stakeholderAppBuilder,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 0, name := "App builder", text := "Describes an app in plain words and needs only current, unambiguous, consistent parts to reach it."})
}
definition{
name: stakeholderRegistryMaintainer,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 1, name := "Registry maintainer", text := "Publishes versioned feature contracts and needs a proposal made against an older registry revision to be refused."})
}
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: concernCorrectAnswers,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 0, name := "Correct answers", text := "Every well-formed request is answered by the first rule that matches it, or admit when none does, as the spec states."})
}
definition{
name: concernIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 1, 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 := 2, name := "Proved guarantees", text := "Each of the 4 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 := 3, 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 Proposal admission guest."})
}
definition{
name: componentFeatureRegistry,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 1, kind := (ctor Foundation.Arch::ComponentKind.database), name := "Feature registry", text := "The registry of canonical versioned feature contracts that admission resolves references against."})
}
definition{
name: componentGitHubPages,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 2, 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 := 3, 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: componentProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 4, kind := (ctor Foundation.Arch::ComponentKind.service), name := "Proposal 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: componentProposalAdmissionPage,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 5, kind := (ctor Foundation.Arch::ComponentKind.staticSite), name := "Proposal admission page", text := "The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors."})
}
definition{
name: componentRouter,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 6, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Router", text := "The model that reads the description and proposes versioned feature references with a confidence; inference belongs to the runner, not the kernel."})
}
definition{
name: componentSourceRepository,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 7, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Source repository", text := "The repository that holds the prompt, the model and its gate."})
}
definition{
name: edgeBrowserToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 0, fromIndex := 0, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeFeatureRegistryToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 1, fromIndex := 1, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeGitHubPagesToBrowser,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 2, fromIndex := 2, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgePrismBuildToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 3, fromIndex := 3, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgePrismBuildToProposalAdmissionPage,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 4, fromIndex := 3, toIndex := 5, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeProposalAdmissionGuestToBrowser,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 5, fromIndex := 4, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeProposalAdmissionGuestToFeatureRegistry,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 6, fromIndex := 4, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeProposalAdmissionGuestToRouter,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 7, fromIndex := 4, toIndex := 6, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeProposalAdmissionPageToGitHubPages,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 8, fromIndex := 5, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeRouterToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 9, fromIndex := 6, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeSourceRepositoryToPrismBuild,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 10, fromIndex := 7, toIndex := 3, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: viewpointAppBuilderCorrectAnswers,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 0, stakeholderIndex := 0, concernIndex := 0, modelKindIndex := 1})
}
definition{
name: viewpointAppBuilderProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 1, stakeholderIndex := 0, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointRegistryMaintainerProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 2, stakeholderIndex := 1, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointVerifierIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 3, stakeholderIndex := 2, concernIndex := 1, modelKindIndex := 2})
}
definition{
name: viewpointVerifierProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 4, stakeholderIndex := 2, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointVerifierRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 5, stakeholderIndex := 2, concernIndex := 3, modelKindIndex := 2})
}
definition{
name: viewAppBuilderCorrectAnswers,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 0, viewpointIndex := 0, modelKindIndex := 1})
}
definition{
name: viewAppBuilderProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 1, viewpointIndex := 1, modelKindIndex := 1})
}
definition{
name: viewRegistryMaintainerProvedGuarantees,
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 (componentFeatureRegistry) (cons (componentGitHubPages) (cons (componentPrismBuild) (cons (componentProposalAdmissionGuest) (cons (componentProposalAdmissionPage) (cons (componentRouter) (cons (componentSourceRepository) (nil Foundation.Arch::Component)))))))))
}
definition{
name: edgeRecords,
parameters: [],
result: (List Foundation.Arch::Edge),
body: (cons (edgeBrowserToProposalAdmissionGuest) (cons (edgeFeatureRegistryToProposalAdmissionGuest) (cons (edgeGitHubPagesToBrowser) (cons (edgePrismBuildToProposalAdmissionGuest) (cons (edgePrismBuildToProposalAdmissionPage) (cons (edgeProposalAdmissionGuestToBrowser) (cons (edgeProposalAdmissionGuestToFeatureRegistry) (cons (edgeProposalAdmissionGuestToRouter) (cons (edgeProposalAdmissionPageToGitHubPages) (cons (edgeRouterToProposalAdmissionGuest) (cons (edgeSourceRepositoryToPrismBuild) (nil Foundation.Arch::Edge))))))))))))
}
definition{
name: viewpointRecords,
parameters: [],
result: (List Foundation.Arch::Viewpoint),
body: (cons (viewpointAppBuilderCorrectAnswers) (cons (viewpointAppBuilderProvedGuarantees) (cons (viewpointRegistryMaintainerProvedGuarantees) (cons (viewpointVerifierIntegrityOfThePublishedApp) (cons (viewpointVerifierProvedGuarantees) (cons (viewpointVerifierRefusedMalformedRequests) (nil Foundation.Arch::Viewpoint)))))))
}
definition{
name: viewRecords,
parameters: [],
result: (List Foundation.Arch::View),
body: (cons (viewAppBuilderCorrectAnswers) (cons (viewAppBuilderProvedGuarantees) (cons (viewRegistryMaintainerProvedGuarantees) (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 4 (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{ProposalAdmission}
\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 admit.", evidence := (cons "ProposalAdmission::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 "ProposalAdmission::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 "ProposalAdmission::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::componentProposalAdmissionGuest"})
}
definition{
name: processParseRequest,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: processJudge,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: processEncodeAnswer,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
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::componentProposalAdmissionGuest"})
}
definition{
name: processRule2,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: processRule3,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: processRule4,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: processOtherwise,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: stateIdle,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: stateDeciding,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: stateRefused,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: stateAnsweredAdmit,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: stateAnsweredRefuse,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: stateAnsweredOpen,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: viewOpmDecide,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Deciding a Proposal admission request", viewpoint := "Architecture::viewpointAppBuilderCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.opmObjectProcess)})
}
definition{
name: viewUmlComponents,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Components of Proposal 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 Proposal admission request", viewpoint := "Architecture::viewpointAppBuilderCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.umlSequence)})
}
definition{
name: viewUmlStates,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "States of the Proposal 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::componentProposalAdmissionGuest"})
}
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::componentProposalAdmissionGuest", state := "Design::stateIdle"})
}
definition{
name: opmGuestDeciding,
parameters: [],
result: Foundation.Arch::OpmState,
body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentProposalAdmissionGuest", 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::componentProposalAdmissionGuest", 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: umlFeatureRegistry,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentFeatureRegistry"})
}
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: umlProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentProposalAdmissionGuest"})
}
definition{
name: umlProposalAdmissionPage,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentProposalAdmissionPage"})
}
definition{
name: umlRouter,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentRouter"})
}
definition{
name: umlSourceRepository,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentSourceRepository"})
}
definition{
name: umlBrowserToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeBrowserToProposalAdmissionGuest"})
}
definition{
name: umlFeatureRegistryToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeFeatureRegistryToProposalAdmissionGuest"})
}
definition{
name: umlGitHubPagesToBrowser,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeGitHubPagesToBrowser"})
}
definition{
name: umlPrismBuildToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToProposalAdmissionGuest"})
}
definition{
name: umlPrismBuildToProposalAdmissionPage,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToProposalAdmissionPage"})
}
definition{
name: umlProposalAdmissionGuestToBrowser,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeProposalAdmissionGuestToBrowser"})
}
definition{
name: umlProposalAdmissionGuestToFeatureRegistry,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeProposalAdmissionGuestToFeatureRegistry"})
}
definition{
name: umlProposalAdmissionGuestToRouter,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeProposalAdmissionGuestToRouter"})
}
definition{
name: umlProposalAdmissionPageToGitHubPages,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeProposalAdmissionPageToGitHubPages"})
}
definition{
name: umlRouterToProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeRouterToProposalAdmissionGuest"})
}
definition{
name: umlSourceRepositoryToPrismBuild,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeSourceRepositoryToPrismBuild"})
}
definition{
name: seqBrowser,
parameters: [],
result: Foundation.Arch::UmlLifeline,
body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentBrowser", order := 0})
}
definition{
name: seqProposalAdmissionGuest,
parameters: [],
result: Foundation.Arch::UmlLifeline,
body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentProposalAdmissionGuest", 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::componentProposalAdmissionGuest", 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::componentProposalAdmissionGuest", 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: stAnsweredRefuse,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredRefuse", initial := false})
}
definition{
name: stAnsweredOpen,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredOpen", 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::stateAnsweredOpen", 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::stateAnsweredOpen", 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::stateAnsweredRefuse", 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::stateAnsweredAdmit", 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: trResetRefuse,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 8, source := "Design::stateAnsweredRefuse", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetOpen,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 9, source := "Design::stateAnsweredOpen", 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 130 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{ProposalAdmission}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{feature}
\begin{semanticmodule}
definition{
name: acceptINV001,
parameters: [],
result: String,
body: "ProposalAdmissionProofs::inv001Holds"
}
definition{
name: acceptINV002,
parameters: [],
result: String,
body: "ProposalAdmissionProofs::inv002Holds"
}
definition{
name: acceptINV003,
parameters: [],
result: String,
body: "ProposalAdmissionProofs::inv003Holds"
}
definition{
name: acceptINV004,
parameters: [],
result: String,
body: "ProposalAdmissionProofs::inv004Holds"
}
definition{
name: featureRule1,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When revision is stale, the answer is refuse.", calls := (cons "ProposalAdmission::rule1" (cons "ProposalAdmission::judge" (nil String))), acceptance := (cons "ProposalAdmission::application" (nil String))})
}
definition{
name: featureRule2,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When ambiguity is ambiguous, the answer is open.", calls := (cons "ProposalAdmission::rule2" (cons "ProposalAdmission::judge" (nil String))), acceptance := (cons "ProposalAdmission::application" (nil String))})
}
definition{
name: featureRule3,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When constraints is unresolved, the answer is open.", calls := (cons "ProposalAdmission::rule3" (cons "ProposalAdmission::judge" (nil String))), acceptance := (cons "ProposalAdmission::application" (nil String))})
}
definition{
name: featureRule4,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When conflicts is at least 1, the answer is refuse.", calls := (cons "ProposalAdmission::rule4" (cons "ProposalAdmission::judge" (nil String))), acceptance := (cons "ProposalAdmission::application" (nil String))})
}
definition{
name: featureOtherwise,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When no rule matches, the answer is admit.", calls := (cons "ProposalAdmission::judge" (nil String)), acceptance := (cons "ProposalAdmission::application" (nil String))})
}
definition{
name: featureRefuseMalformed,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "A request that is not revision, ambiguity, constraints, conflicts in order, separated by single spaces, or is over 112 bytes, is answered invalid.", calls := (cons "ProposalAdmission::dispatch" (cons "ProposalAdmission::decodeField1" (nil String))), acceptance := (cons "ProposalAdmission::application" (nil String))})
}
definition{
name: featureINV001,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers admit when ambiguity is ambiguous.", calls := (cons "ProposalAdmission::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 constraints is unresolved.", calls := (cons "ProposalAdmission::judge" (nil String)), acceptance := (cons "Features::acceptINV002" (nil String))})
}
definition{
name: featureINV003,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers admit when conflicts is at least 1.", calls := (cons "ProposalAdmission::judge" (nil String)), acceptance := (cons "Features::acceptINV003" (nil String))})
}
definition{
name: featureINV004,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers admit when revision is stale.", calls := (cons "ProposalAdmission::judge" (nil String)), acceptance := (cons "Features::acceptINV004" (nil String))})
}
definition{
name: journeyAppBuilder,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderAppBuilder", steps := (cons "Features::featureRule2" (cons "Features::featureRule3" (cons "Features::featureRule4" (cons "Features::featureOtherwise" (nil String)))))})
}
definition{
name: journeyRegistryMaintainer,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderRegistryMaintainer", steps := (cons "Features::featureRule1" (cons "Features::featureINV004" (cons "Features::featureINV003" (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" (cons "Features::featureINV004" (nil String))))))})
}
\end{semanticmodule}
\end{lexlean}
app/src/Quality.lex.tex 361 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: characteristicInteractionCapability,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 1})
}
definition{
name: characteristicPerformanceEfficiency,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 2})
}
definition{
name: characteristicReliability,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 3})
}
definition{
name: characteristicSecurity,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 4})
}
definition{
name: subcharacteristicFaultlessness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 0, characteristicIndex := 3})
}
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 := 4})
}
definition{
name: subcharacteristicResourceUtilization,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 4, characteristicIndex := 2})
}
definition{
name: subcharacteristicTimeBehaviour,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 5, characteristicIndex := 2})
}
definition{
name: subcharacteristicUserErrorProtection,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 6, characteristicIndex := 1})
}
definition{
name: requirementAmbiguityReturnedNeverGuessed,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 0, subcharacteristicIndex := 6})
}
definition{
name: requirementBoundedAllocation,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 1, subcharacteristicIndex := 4})
}
definition{
name: requirementBoundedRequest,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 2, subcharacteristicIndex := 5})
}
definition{
name: requirementEveryPropertyProved,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 3, subcharacteristicIndex := 3})
}
definition{
name: requirementEveryRequestAnswered,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 4, subcharacteristicIndex := 1})
}
definition{
name: requirementEveryVectorReplays,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 5, subcharacteristicIndex := 0})
}
definition{
name: requirementExamplesAnsweredAsStated,
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 := 6, threshold := 0})
}
definition{
name: measureFailedVectors,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 1, requirementIndex := 5, threshold := 0})
}
definition{
name: measureGuessedProposals,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 2, requirementIndex := 0, threshold := 0})
}
definition{
name: measureGuestAllocationBytes,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 3, requirementIndex := 1, threshold := 224})
}
definition{
name: measureRequestBytesRead,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 4, requirementIndex := 2, threshold := 112})
}
definition{
name: measureUnansweredRequests,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 5, requirementIndex := 4, threshold := 0})
}
definition{
name: measureUnprovedProperties,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 6, requirementIndex := 3, 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 Proposal admission."}) (cons (record Named {index := 1, name := "Interaction capability", text := "Interaction capability, as ISO/IEC 25010:2023 defines it, for Proposal admission."}) (cons (record Named {index := 2, name := "Performance efficiency", text := "Performance efficiency, as ISO/IEC 25010:2023 defines it, for Proposal admission."}) (cons (record Named {index := 3, name := "Reliability", text := "Reliability, as ISO/IEC 25010:2023 defines it, for Proposal admission."}) (cons (record Named {index := 4, name := "Security", text := "Security, as ISO/IEC 25010:2023 defines it, for Proposal 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."}) (cons (record Named {index := 6, name := "User error protection", text := "Interaction capability: User error protection."}) (nil Named))))))))
}
definition{
name: requirementNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Ambiguity returned, never guessed", text := "Every ambiguous or unresolved proposal is answered open, so the builder resolves it."}) (cons (record Named {index := 1, name := "Bounded allocation", text := "The guest allocates at most 224 bytes for one request."}) (cons (record Named {index := 2, name := "Bounded request", text := "A request over 112 bytes is refused before any field is read."}) (cons (record Named {index := 3, name := "Every property proved", text := "All 4 properties are theorems the Lean kernel checks."}) (cons (record Named {index := 4, name := "Every request answered", text := "Every request gets an answer: a rule, admit otherwise, or invalid."}) (cons (record Named {index := 5, name := "Every vector replays", text := "All 36 acceptance vectors replay in the compiled guest, the shortest 0 bytes long."}) (cons (record Named {index := 6, name := "Examples answered as stated", text := "Every one of the 6 examples of the spec is answered as it states."}) (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 := "Guessed proposals", text := "Requests with an ambiguity or unresolved constraint answered admit."}) (cons (record Named {index := 3, name := "Guest allocation bytes", text := "Most bytes the guest allocates for one request."}) (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) (cons (subcharacteristicUserErrorProtection) (nil Foundation.Qual::QualitySubcharacteristic))))))))
}
definition{
name: requirementRecords,
parameters: [],
result: (List Foundation.Qual::QualityRequirement),
body: (cons (requirementAmbiguityReturnedNeverGuessed) (cons (requirementBoundedAllocation) (cons (requirementBoundedRequest) (cons (requirementEveryPropertyProved) (cons (requirementEveryRequestAnswered) (cons (requirementEveryVectorReplays) (cons (requirementExamplesAnsweredAsStated) (nil Foundation.Qual::QualityRequirement))))))))
}
definition{
name: measureRecords,
parameters: [],
result: (List Foundation.Qual::QualityMeasure),
body: (cons (measureExampleMismatches) (cons (measureFailedVectors) (cons (measureGuessedProposals) (cons (measureGuestAllocationBytes) (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 5 (subcharacteristicRecords)) && ((requirementsKnown 7 (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: measureGuessedProposalsThreshold,
parameters: [],
statement: ((thresholdOf 2 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureGuestAllocationBytesThreshold,
parameters: [],
statement: ((thresholdOf 3 (measureRecords)) = 224),
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 593 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 := 4})
}
definition{
name: assetModelSource,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 1, componentIndex := 7})
}
definition{
name: assetPublishedHolo,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 2, componentIndex := 5})
}
definition{
name: assetRequestBytes,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 3, componentIndex := 4})
}
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: threatAnswerThatBreaksINV004,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 3})
}
definition{
name: threatConfidenceAsPermission,
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: threatRouterAuthoredContract,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 8})
}
definition{
name: threatStaleRegistry,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 9})
}
definition{
name: threatSubstitutedHolo,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 10})
}
definition{
name: threatSubstitutedHost,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 11})
}
definition{
name: threatTamperedModel,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 12})
}
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: riskAnswerThatBreaksINV004,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 3, assetIndex := 0, threatIndex := 3, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskConfidenceAsPermission,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 4, assetIndex := 3, threatIndex := 4, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.major)})
}
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: riskRouterAuthoredContract,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 8, assetIndex := 1, threatIndex := 8, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskStaleRegistry,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 9, assetIndex := 3, threatIndex := 9, 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 := 10, assetIndex := 2, threatIndex := 10, 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 := 11, assetIndex := 2, threatIndex := 11, 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 := 12, assetIndex := 1, threatIndex := 12, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: controlBoundedRequest,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 0, riskIndex := 7})
}
definition{
name: controlConfidenceGrantsNothing,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 1, riskIndex := 4})
}
definition{
name: controlFingerprintAndProvenance,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 2, riskIndex := 10})
}
definition{
name: controlNoCapabilityGranted,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 3, riskIndex := 5})
}
definition{
name: controlProofOfINV001,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 4, riskIndex := 0})
}
definition{
name: controlProofOfINV002,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 5, riskIndex := 1})
}
definition{
name: controlProofOfINV003,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 6, riskIndex := 2})
}
definition{
name: controlProofOfINV004,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 7, riskIndex := 3})
}
definition{
name: controlRegeneratedFromThePrompt,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 8, riskIndex := 12})
}
definition{
name: controlRevisionMatchProved,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 9, riskIndex := 9})
}
definition{
name: controlStrictDecoder,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 10, riskIndex := 6})
}
definition{
name: controlSet,
parameters: [],
result: Production.ThreatModel::ControlSet,
body: (record Production.ThreatModel::ControlSet {title := "Proposal admission security controls", text := "Proposal admission answers one request with one answer in a Core-Wasm guest granted no capability. Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict.", 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, refuse, open, 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 ambiguity is ambiguous, which matters because no silent defaults.", 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 constraints is unresolved, which matters because unresolved issues refuse acceptance.", 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 although conflicts is at least 1, which matters because the composition stays consistent.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatAnswerThatBreaksINV004,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV004", name := "Answer that breaks INV-004", text := "The guest answers admit although revision is stale, which matters because a proposal against an old registry or intent is never admitted.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatConfidenceAsPermission,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatConfidenceAsPermission", name := "Confidence as permission", text := "A router's high confidence is taken as a grant, budget or evidence for a proposal.", category := (ctor Production.ThreatModel::Stride.elevationOfPrivilege)})
}
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: modeledThreatRouterAuthoredContract,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatRouterAuthoredContract", name := "Router-authored contract", text := "A router supplies its own contract text in place of the registered one.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}
definition{
name: modeledThreatStaleRegistry,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatStaleRegistry", name := "Stale registry", text := "A proposal written against an older registry revision is admitted with contracts that changed.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
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: 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: modeledControlConfidenceGrantsNothing,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlConfidenceGrantsNothing", name := "Confidence grants nothing", text := "Admission never reads confidence to decide, and the kernel proves confidence cannot grant a permission or raise a budget.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "app/src/ProposalAdmission.lex.tex confidenceCannotGrantPermission"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "app/src/ProposalAdmission.lex.tex confidenceCannotIncreaseBudget"}) (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: 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 ambiguity is ambiguous. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "ProposalAdmissionProofs::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 constraints is unresolved. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "ProposalAdmissionProofs::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 never answers admit when conflicts is at least 1. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "ProposalAdmissionProofs::inv003Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlProofOfINV004,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV004", name := "Proof of INV-004", text := "It never answers admit when revision is stale. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "ProposalAdmissionProofs::inv004Holds"}) (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: modeledControlRevisionMatchProved,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlRevisionMatchProved", name := "Revision match proved", text := "A stale proposal is never admitted, proved for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "ProposalAdmissionProofs::inv004Holds"}) (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: mappingOversizedRequest,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatOversizedRequest", controls := (cons "Security::controlBoundedRequest" (nil String))})
}
definition{
name: mappingConfidenceAsPermission,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatConfidenceAsPermission", controls := (cons "Security::controlConfidenceGrantsNothing" (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: 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: mappingAnswerThatBreaksINV004,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV004", controls := (cons "Security::controlProofOfINV004" (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: mappingStaleRegistry,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatStaleRegistry", controls := (cons "Security::controlRevisionMatchProved" (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: acceptedRouterAuthoredContract,
parameters: [],
result: Production.ThreatModel::AcceptedRisk,
body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatRouterAuthoredContract", rationale := "Admission resolves canonical contracts from the supplied registry by key and version and never accepts router-authored contracts (proposalBoundary); the app sees only the outcome of that resolution."})
}
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/ProposalAdmission.lex.tex 233 lines
\begin{lexlean}{ProposalAdmission}
\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: revisionCurrent, parameters: [], result: Nat, body: 0}
definition{name: revisionStale, parameters: [], result: Nat, body: 1}
definition{name: ambiguityNone, parameters: [], result: Nat, body: 0}
definition{name: ambiguityAmbiguous, parameters: [], result: Nat, body: 1}
definition{name: constraintsResolved, parameters: [], result: Nat, body: 0}
definition{name: constraintsUnresolved, parameters: [], result: Nat, body: 1}
definition{name: answerAdmit, parameters: [], result: Nat, body: 0}
definition{name: answerRefuse, parameters: [], result: Nat, body: 1}
definition{name: answerOpen, parameters: [], result: Nat, body: 2}
structure{
name: Request,
type_parameters: [],
parameters: [],
fields: [
{name: revision, type: Nat},
{name: ambiguity, type: Nat},
{name: constraints, type: Nat},
{name: conflicts, 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: parseRevision,
parameters: [value : Bytes],
result: (Option Nat),
body: (if (prim equal value 0x63757272656e74 : Bool) then (ctor Option.some [Nat] (revisionCurrent)) else (if (prim equal value 0x7374616c65 : Bool) then (ctor Option.some [Nat] (revisionStale)) else (ctor Option.none [Nat])))
}
definition{
name: parseAmbiguity,
parameters: [value : Bytes],
result: (Option Nat),
body: (if (prim equal value 0x6e6f6e65 : Bool) then (ctor Option.some [Nat] (ambiguityNone)) else (if (prim equal value 0x616d626967756f7573 : Bool) then (ctor Option.some [Nat] (ambiguityAmbiguous)) else (ctor Option.none [Nat])))
}
definition{
name: parseConstraints,
parameters: [value : Bytes],
result: (Option Nat),
body: (if (prim equal value 0x7265736f6c766564 : Bool) then (ctor Option.some [Nat] (constraintsResolved)) else (if (prim equal value 0x756e7265736f6c766564 : Bool) then (ctor Option.some [Nat] (constraintsUnresolved)) else (ctor Option.none [Nat])))
}
definition{
name: parseConflicts,
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: 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 (parseConflicts (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 {revision := v1, ambiguity := v2, constraints := v3, conflicts := 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 (parseConstraints (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 (parseAmbiguity (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 (parseRevision (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 revision) =? (revisionStale))
}
definition{
name: rule2,
parameters: [request : Request],
result: Bool,
body: ((project request ambiguity) =? (ambiguityAmbiguous))
}
definition{
name: rule3,
parameters: [request : Request],
result: Bool,
body: ((project request constraints) =? (constraintsUnresolved))
}
definition{
name: rule4,
parameters: [request : Request],
result: Bool,
body: (1 <=? (project request conflicts))
}
definition{
name: judge,
parameters: [request : Request],
result: Nat,
body: (if (rule1 request) then (answerRefuse) else (if (rule2 request) then (answerOpen) else (if (rule3 request) then (answerOpen) else (if (rule4 request) then (answerRefuse) else (answerAdmit)))))
}
definition{
name: encodeAnswer,
parameters: [code : Nat],
result: Bytes,
body: (if (code =? (answerAdmit)) then 0x61646d6974 else (if (code =? (answerRefuse)) then 0x726566757365 else (if (code =? (answerOpen)) then 0x6f70656e 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 := "Proposal admission", cargoName := "prism-proposal-admission", cargoVersion := "0.1.0", cargoDescription := "Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are", cargoRepository := "https://github.com/UOR-Foundation/PrismPM", cargoHomepage := "https://github.com/UOR-Foundation/PrismPM", libraryRoots := (cons "PrismProposalAdmission.ProposalAdmission.dispatch" (nil String)), acceptanceVectors := (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c7665642030, response := 0x61646d6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420616d626967756f7573207265736f6c7665642030, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e6520756e7265736f6c7665642032, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c7665642032, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c65206e6f6e65207265736f6c7665642030, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420616d626967756f7573207265736f6c7665642033, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c7665642031, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e6520756e7265736f6c7665642030, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e6520756e7265736f6c7665642031, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420616d626967756f7573207265736f6c7665642031, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420616d626967756f757320756e7265736f6c7665642030, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420616d626967756f757320756e7265736f6c7665642031, response := 0x6f70656e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c65206e6f6e65207265736f6c7665642031, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c65206e6f6e6520756e7265736f6c7665642030, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c65206e6f6e6520756e7265736f6c7665642031, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c6520616d626967756f7573207265736f6c7665642030, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c6520616d626967756f7573207265736f6c7665642031, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c6520616d626967756f757320756e7265736f6c7665642030, response := 0x726566757365}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7374616c6520616d626967756f757320756e7265736f6c7665642031, 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 := 0x63757272656e74206e6f6e65207265736f6c766564, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c76656420302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420206e6f6e6520207265736f6c766564202030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x756e6b6e6f776e206e6f6e65207265736f6c7665642030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e7420756e6b6e6f776e207265736f6c7665642030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e6520756e6b6e6f776e2030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c766564203037, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c766564202d31, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c766564202b31, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c7665642031303030303030303030303030303030303030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c76656420d9a1, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x63757272656e74206e6f6e65207265736f6c7665642078, 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 := "PrismProposalAdmission.ProposalAdmission.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 := "Proposal admission", heading := "Proposal admission", inputLabel := "Request: revision ambiguity constraints conflicts", submitLabel := "Decide", outputLabel := "Answer", inputError := "Invalid request", responseError := "Invalid response"})})
}
\end{semanticmodule}
\end{lexlean}
app/src/ProposalAdmissionProofs.lex.tex 141 lines
\begin{lexlean}{ProposalAdmissionProofs}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{ProposalAdmission}
\title{Text application model}
\begin{semanticmodule}
definition{
name: breaksInv001,
parameters: [request : ProposalAdmission::Request],
result: Bool,
body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && ((project request ambiguity) =? (ProposalAdmission::ambiguityAmbiguous))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))
}
theorem{
name: inv001Holds,
parameters: [request : ProposalAdmission::Request],
statement: ((breaksInv001 request) = false),
proof: linear_arithmetic{
definitions: [
ProposalAdmission::ambiguityAmbiguous,
ProposalAdmission::ambiguityNone,
ProposalAdmission::answerAdmit,
ProposalAdmission::answerOpen,
ProposalAdmission::answerRefuse,
ProposalAdmission::constraintsResolved,
ProposalAdmission::constraintsUnresolved,
ProposalAdmission::judge,
ProposalAdmission::revisionCurrent,
ProposalAdmission::revisionStale,
ProposalAdmission::rule1,
ProposalAdmission::rule2,
ProposalAdmission::rule3,
ProposalAdmission::rule4,
breaksInv001
]
},
axioms: [Quot.sound, propext]
}
definition{
name: breaksInv002,
parameters: [request : ProposalAdmission::Request],
result: Bool,
body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && ((project request constraints) =? (ProposalAdmission::constraintsUnresolved))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))
}
theorem{
name: inv002Holds,
parameters: [request : ProposalAdmission::Request],
statement: ((breaksInv002 request) = false),
proof: linear_arithmetic{
definitions: [
ProposalAdmission::ambiguityAmbiguous,
ProposalAdmission::ambiguityNone,
ProposalAdmission::answerAdmit,
ProposalAdmission::answerOpen,
ProposalAdmission::answerRefuse,
ProposalAdmission::constraintsResolved,
ProposalAdmission::constraintsUnresolved,
ProposalAdmission::judge,
ProposalAdmission::revisionCurrent,
ProposalAdmission::revisionStale,
ProposalAdmission::rule1,
ProposalAdmission::rule2,
ProposalAdmission::rule3,
ProposalAdmission::rule4,
breaksInv002
]
},
axioms: [Quot.sound, propext]
}
definition{
name: breaksInv003,
parameters: [request : ProposalAdmission::Request],
result: Bool,
body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && (1 <=? (project request conflicts))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))
}
theorem{
name: inv003Holds,
parameters: [request : ProposalAdmission::Request],
statement: ((breaksInv003 request) = false),
proof: linear_arithmetic{
definitions: [
ProposalAdmission::ambiguityAmbiguous,
ProposalAdmission::ambiguityNone,
ProposalAdmission::answerAdmit,
ProposalAdmission::answerOpen,
ProposalAdmission::answerRefuse,
ProposalAdmission::constraintsResolved,
ProposalAdmission::constraintsUnresolved,
ProposalAdmission::judge,
ProposalAdmission::revisionCurrent,
ProposalAdmission::revisionStale,
ProposalAdmission::rule1,
ProposalAdmission::rule2,
ProposalAdmission::rule3,
ProposalAdmission::rule4,
breaksInv003
]
},
axioms: [Quot.sound, propext]
}
definition{
name: breaksInv004,
parameters: [request : ProposalAdmission::Request],
result: Bool,
body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && ((project request revision) =? (ProposalAdmission::revisionStale))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))
}
theorem{
name: inv004Holds,
parameters: [request : ProposalAdmission::Request],
statement: ((breaksInv004 request) = false),
proof: linear_arithmetic{
definitions: [
ProposalAdmission::ambiguityAmbiguous,
ProposalAdmission::ambiguityNone,
ProposalAdmission::answerAdmit,
ProposalAdmission::answerOpen,
ProposalAdmission::answerRefuse,
ProposalAdmission::constraintsResolved,
ProposalAdmission::constraintsUnresolved,
ProposalAdmission::judge,
ProposalAdmission::revisionCurrent,
ProposalAdmission::revisionStale,
ProposalAdmission::rule1,
ProposalAdmission::rule2,
ProposalAdmission::rule3,
ProposalAdmission::rule4,
breaksInv004
]
},
axioms: [Quot.sound, propext]
}
\end{semanticmodule}
\end{lexlean}
app/lexlean.toml 43 lines
spec = "lexlean/project/1"
name = "prism-proposal-admission"
language = "1.2"
module_prefix = "PrismProposalAdmission"
source_roots = ["src"]
entrypoints = ["src/Architecture.lex.tex", "src/Compliance.lex.tex", "src/Design.lex.tex", "src/Features.lex.tex", "src/ProposalAdmission.lex.tex", "src/ProposalAdmissionProofs.lex.tex", "src/Quality.lex.tex", "src/Security.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 294 lines
{
"schema": "prism/prompt/1",
"goal": "Decide if a router's proposal joins the app. A stale, unclear or clashing proposal never becomes part of it.",
"pattern": "decisionTable",
"repository": "UOR-Foundation/foundry",
"app": {
"name": "proposal-admission",
"title": "Proposal admission",
"purpose": "Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict.",
"fields": [
{
"name": "revision",
"kind": "choice",
"values": [
"current",
"stale"
],
"means": "whether the intent and registry revision match the expected ones"
},
{
"name": "ambiguity",
"kind": "choice",
"values": [
"none",
"ambiguous"
],
"means": "whether the proposal lists an unresolved ambiguity"
},
{
"name": "constraints",
"kind": "choice",
"values": [
"resolved",
"unresolved"
],
"means": "whether the proposal lists an unresolved constraint"
},
{
"name": "conflicts",
"kind": "number",
"min": 0,
"means": "selected features that conflict with another"
}
],
"outcomes": [
"admit",
"refuse",
"open"
],
"meanings": {
"admit": "the selected features join the composition",
"refuse": "refused: stale, or the composition is rejected",
"open": "refused with an unresolved issue, ambiguity or constraint, to resolve and propose again"
},
"rules": [
{
"when": [
{
"field": "revision",
"op": "is",
"value": "stale"
}
],
"then": "refuse",
"why": "app/src/ProposalAdmission.lex.tex admitProposal: staleIntent and staleRegistry are checked first (staleIntentRefused, staleRegistryRefused)"
},
{
"when": [
{
"field": "ambiguity",
"op": "is",
"value": "ambiguous"
}
],
"then": "open",
"why": "admitProposal: any ambiguity is unresolvedAmbiguity, never a default (ambiguityRefused)"
},
{
"when": [
{
"field": "constraints",
"op": "is",
"value": "unresolved"
}
],
"then": "open",
"why": "admitProposal: an unresolved constraint is unresolvedConstraint (constraintRefused)"
},
{
"when": [
{
"field": "conflicts",
"op": ">=",
"value": 1
}
],
"then": "refuse",
"why": "app/src/FeatureComposition.lex.tex hasConflict: admitComposition rejects conflicting features (compositionRejected)"
}
],
"otherwise": "admit",
"otherwiseWhy": "current, unambiguous, resolved and consistent: admitProposal returns the features",
"properties": [
{
"kind": "never",
"when": [
{
"field": "ambiguity",
"op": "is",
"value": "ambiguous"
}
],
"then": "admit",
"why": "no silent defaults"
},
{
"kind": "never",
"when": [
{
"field": "constraints",
"op": "is",
"value": "unresolved"
}
],
"then": "admit",
"why": "unresolved issues refuse acceptance"
},
{
"kind": "never",
"when": [
{
"field": "conflicts",
"op": ">=",
"value": 1
}
],
"then": "admit",
"why": "the composition stays consistent"
},
{
"kind": "never",
"when": [
{
"field": "revision",
"op": "is",
"value": "stale"
}
],
"then": "admit",
"why": "a proposal against an old registry or intent is never admitted"
}
],
"examples": [
{
"request": "current none resolved 0",
"response": "admit"
},
{
"request": "current ambiguous resolved 0",
"response": "open"
},
{
"request": "current none unresolved 2",
"response": "open"
},
{
"request": "current none resolved 2",
"response": "refuse"
},
{
"request": "stale none resolved 0",
"response": "refuse"
},
{
"request": "current ambiguous resolved 3",
"response": "open"
}
]
},
"stakeholders": [
{
"name": "App builder",
"text": "Describes an app in plain words and needs only current, unambiguous, consistent parts to reach it.",
"concerns": [
"Proved guarantees",
"Correct answers"
]
},
{
"name": "Registry maintainer",
"text": "Publishes versioned feature contracts and needs a proposal made against an older registry revision to be refused.",
"concerns": [
"Proved guarantees"
]
}
],
"components": [
{
"name": "Router",
"text": "The model that reads the description and proposes versioned feature references with a confidence; inference belongs to the runner, not the kernel.",
"kind": "externalSystem"
},
{
"name": "Feature registry",
"text": "The registry of canonical versioned feature contracts that admission resolves references against.",
"kind": "database"
}
],
"threats": [
{
"name": "Confidence as permission",
"text": "A router's high confidence is taken as a grant, budget or evidence for a proposal.",
"stride": "elevationOfPrivilege",
"asset": "request",
"likelihood": "medium",
"impact": "major",
"control": {
"name": "Confidence grants nothing",
"text": "Admission never reads confidence to decide, and the kernel proves confidence cannot grant a permission or raise a budget.",
"evidence": [
{
"kind": "review",
"reference": "app/src/ProposalAdmission.lex.tex confidenceCannotGrantPermission"
},
{
"kind": "review",
"reference": "app/src/ProposalAdmission.lex.tex confidenceCannotIncreaseBudget"
}
]
}
},
{
"name": "Stale registry",
"text": "A proposal written against an older registry revision is admitted with contracts that changed.",
"stride": "tampering",
"asset": "request",
"likelihood": "medium",
"impact": "major",
"control": {
"name": "Revision match proved",
"text": "A stale proposal is never admitted, proved for every request.",
"evidence": [
{
"kind": "proof",
"reference": "ProposalAdmissionProofs::inv004Holds"
}
]
}
},
{
"name": "Router-authored contract",
"text": "A router supplies its own contract text in place of the registered one.",
"stride": "spoofing",
"asset": "source",
"likelihood": "low",
"impact": "major",
"accepted": "Admission resolves canonical contracts from the supplied registry by key and version and never accepts router-authored contracts (proposalBoundary); the app sees only the outcome of that resolution."
}
],
"quality": [
{
"characteristic": "Interaction capability",
"subcharacteristic": "User error protection",
"requirement": "Ambiguity returned, never guessed",
"text": "Every ambiguous or unresolved proposal is answered open, so the builder resolves it.",
"measure": "Guessed proposals",
"measureText": "Requests with an ambiguity or unresolved constraint answered admit.",
"threshold": 0
}
],
"journeys": [
{
"stakeholder": "App builder",
"steps": [
"REQ-002",
"REQ-003",
"REQ-004",
"otherwise"
]
},
{
"stakeholder": "Registry maintainer",
"steps": [
"REQ-001",
"INV-004",
"INV-003"
]
}
],
"concerns": [],
"license": "MIT OR Apache-2.0",
"axioms": {}
}
model/ids.toml 65 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 = "PA-01"
level = "build"
suite = "proposal_admission"
statement = "The app never answers admit when ambiguity is ambiguous"
[[id]]
id = "PA-02"
level = "build"
suite = "proposal_admission"
statement = "The app never answers admit when constraints is unresolved"
[[id]]
id = "PA-03"
level = "build"
suite = "proposal_admission"
statement = "The app never answers admit when conflicts is at least 1"
[[id]]
id = "PA-04"
level = "build"
suite = "proposal_admission"
statement = "The app never answers admit when revision is stale"
[[id]]
id = "PA-05"
level = "build"
suite = "proposal_admission"
statement = "The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references"
[[id]]
id = "PA-06"
level = "build"
suite = "proposal_admission"
statement = "The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared"
[[id]]
id = "PA-07"
level = "build"
suite = "proposal_admission"
statement = "Every compliance obligation is numbered in order and names its evidence"
features/suites/proposal_admission.feature 44 lines
Feature: proposal_admission
This repository's Prism application, in app/, generated by prism-code from its
spec: Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict.
@PA-01 @build
Scenario: The app never answers admit when ambiguity is ambiguous
Given the model in app/src/ProposalAdmission.lex.tex
When the Lean kernel checks inv001Holds during prismpm verify
Then no request meets breaksInv001
@PA-02 @build
Scenario: The app never answers admit when constraints is unresolved
Given the model in app/src/ProposalAdmission.lex.tex
When the Lean kernel checks inv002Holds during prismpm verify
Then no request meets breaksInv002
@PA-03 @build
Scenario: The app never answers admit when conflicts is at least 1
Given the model in app/src/ProposalAdmission.lex.tex
When the Lean kernel checks inv003Holds during prismpm verify
Then no request meets breaksInv003
@PA-04 @build
Scenario: The app never answers admit when revision is stale
Given the model in app/src/ProposalAdmission.lex.tex
When the Lean kernel checks inv004Holds during prismpm verify
Then no request meets breaksInv004
@PA-05 @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
@PA-06 @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
@PA-07 @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/proposal_admission.rs 132 lines
//! The `proposal_admission` suite: one test per scenario in `features/suites/proposal_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/ProposalAdmissionProofs.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"
);
}
/// `PA-01`: The app never answers admit when ambiguity is ambiguous
#[test]
fn proposal_admission_pa_01() {
pinned(
"breaksInv001",
"body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && ((project request ambiguity) =? (ProposalAdmission::ambiguityAmbiguous))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))",
"inv001Holds",
);
}
/// `PA-02`: The app never answers admit when constraints is unresolved
#[test]
fn proposal_admission_pa_02() {
pinned(
"breaksInv002",
"body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && ((project request constraints) =? (ProposalAdmission::constraintsUnresolved))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))",
"inv002Holds",
);
}
/// `PA-03`: The app never answers admit when conflicts is at least 1
#[test]
fn proposal_admission_pa_03() {
pinned(
"breaksInv003",
"body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && (1 <=? (project request conflicts))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))",
"inv003Holds",
);
}
/// `PA-04`: The app never answers admit when revision is stale
#[test]
fn proposal_admission_pa_04() {
pinned(
"breaksInv004",
"body: ((((((project request revision) <? 2) && ((project request ambiguity) <? 2)) && ((project request constraints) <? 2)) && ((project request revision) =? (ProposalAdmission::revisionStale))) && ((ProposalAdmission::judge request) =? (ProposalAdmission::answerAdmit)))",
"inv004Holds",
);
}
/// `PA-05`: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
#[test]
fn proposal_admission_pa_05() {
holds(
"app/src/Architecture.lex.tex",
"architectureDescriptionHolds",
"((architectureValid) = true)",
);
}
/// `PA-06`: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
#[test]
fn proposal_admission_pa_06() {
holds(
"app/src/Quality.lex.tex",
"qualityModelHolds",
"((qualityValid) = true)",
);
}
/// `PA-07`: Every compliance obligation is numbered in order and names its evidence
#[test]
fn proposal_admission_pa_07() {
holds(
"app/src/Compliance.lex.tex",
"everyObligationEvidenced",
"((obligationsEvidenced 0 (obligations)) = true)",
);
}
site/app.json 113 lines
{
"name": "Proposal admission",
"shortName": "Proposal",
"live": "https://uor-foundation.github.io/foundry/",
"purpose": "Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict. Send revision, ambiguity, constraints or conflicts, separated by spaces; it answers admit, refuse or open, and invalid request for anything else.",
"inputLabel": "Request: revision ambiguity constraints conflicts",
"placeholder": "current none resolved 0",
"submitLabel": "Decide",
"outputLabel": "Answer",
"answers": {
"positive": [
"admit"
],
"negative": [
"refuse",
"open"
],
"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": "PA-01: the app never answers admit when ambiguity is ambiguous. PA-02: the app never answers admit when constraints is unresolved. PA-03: the app never answers admit when conflicts is at least 1. PA-04: the app never answers admit when revision is stale.",
"proposition": {
"name": "judge",
"text": "judge request :=\n revision is stale → refuse\n ambiguity is ambiguous → open\n constraints is unresolved → open\n conflicts is at least 1 → refuse\n otherwise → admit",
"plain": "Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict."
},
"theorems": [
{
"name": "inv001Holds",
"statement": "no request meets breaksInv001: the app never answers admit when ambiguity is ambiguous",
"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/ProposalAdmissionProofs.lex.tex"
},
{
"name": "inv002Holds",
"statement": "no request meets breaksInv002: the app never answers admit when constraints is unresolved",
"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/ProposalAdmissionProofs.lex.tex"
},
{
"name": "inv003Holds",
"statement": "no request meets breaksInv003: the app never answers admit when conflicts is at least 1",
"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/ProposalAdmissionProofs.lex.tex"
},
{
"name": "inv004Holds",
"statement": "no request meets breaksInv004: the app never answers admit when revision is stale",
"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/ProposalAdmissionProofs.lex.tex"
}
],
"pinned": [
{
"name": "proposal_admission_pa_01",
"what": "PA-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/proposal_admission.rs"
},
{
"name": "proposal_admission_pa_02",
"what": "PA-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/proposal_admission.rs"
},
{
"name": "proposal_admission_pa_03",
"what": "PA-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/proposal_admission.rs"
},
{
"name": "proposal_admission_pa_04",
"what": "PA-04'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/proposal_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/foundry/actions/workflows/bootstrap.yml"
},
"build": {
"id": "printed by prismpm verify in every pages run",
"url": "https://github.com/UOR-Foundation/foundry/actions/workflows/pages.yml"
}
},
"repository": "https://github.com/UOR-Foundation/foundry",
"report": "https://github.com/UOR-Foundation/foundry/blob/main/TEMPLATE-VERIFICATION.md"
}
openspec/specs/proposal-admission/spec.md 171 lines
# proposal-admission Specification
<!-- Generated by Prism from prism/spec.json. Change the app through your agent with /prism, not by editing this file. -->
## Purpose
Proposal admission: Decide whether a router's proposal is admitted, refused, or returned with an open issue, from whether its intent and registry revision are current, whether it is ambiguous, whether its constraints are resolved and how many selected features conflict.
## Requirements
### Requirement: Never admit when ambiguity is ambiguous
The app SHALL NOT answer `admit` when ambiguity is ambiguous, because no silent defaults.
Verified: to be proved by Lean for every request (INV-001, theorem `inv001Holds`).
#### Scenario: INV-001 holds
- **WHEN** the request is `current ambiguous resolved 0` (an acceptance example)
- **THEN** the answer SHALL NOT be `admit`
- **AND** the app answers `open`, decided by REQ-002
### Requirement: Never admit when constraints is unresolved
The app SHALL NOT answer `admit` when constraints is unresolved, because unresolved issues refuse acceptance.
Verified: to be proved by Lean for every request (INV-002, theorem `inv002Holds`).
#### Scenario: INV-002 holds
- **WHEN** the request is `current none unresolved 2` (an acceptance example)
- **THEN** the answer SHALL NOT be `admit`
- **AND** the app answers `open`, decided by REQ-003
### Requirement: Never admit when conflicts is at least 1
The app SHALL NOT answer `admit` when conflicts is at least 1, because the composition stays consistent.
Verified: to be proved by Lean for every request (INV-003, theorem `inv003Holds`).
#### Scenario: INV-003 holds
- **WHEN** the request is `current none unresolved 2` (an acceptance example)
- **THEN** the answer SHALL NOT be `admit`
- **AND** the app answers `open`, decided by REQ-003
### Requirement: Never admit when revision is stale
The app SHALL NOT answer `admit` when revision is stale, because a proposal against an old registry or intent is never admitted.
Verified: to be proved by Lean for every request (INV-004, theorem `inv004Holds`).
#### Scenario: INV-004 holds
- **WHEN** the request is `stale none resolved 0` (an acceptance example)
- **THEN** the answer SHALL NOT be `admit`
- **AND** the app answers `refuse`, decided by REQ-001
### Requirement: REQ-001 refuse when revision is stale
The app SHALL answer `refuse` when revision is stale, because app/src/ProposalAdmission.lex.tex admitProposal: staleIntent and staleRegistry are checked first (staleIntentRefused, staleRegistryRefused).
Verified: tested by the acceptance vectors (`rule1`).
#### Scenario: REQ-001 decides
- **WHEN** the request is `stale none resolved 0` (an acceptance example)
- **THEN** the answer SHALL be `refuse`, decided by REQ-001
### Requirement: REQ-002 open when ambiguity is ambiguous
The app SHALL answer `open` when ambiguity is ambiguous and no earlier rule matches, because admitProposal: any ambiguity is unresolvedAmbiguity, never a default (ambiguityRefused).
Verified: tested by the acceptance vectors (`rule2`).
#### Scenario: REQ-002 decides
- **WHEN** the request is `current ambiguous resolved 0` (an acceptance example)
- **THEN** the answer SHALL be `open`, decided by REQ-002
### Requirement: REQ-003 open when constraints is unresolved
The app SHALL answer `open` when constraints is unresolved and no earlier rule matches, because admitProposal: an unresolved constraint is unresolvedConstraint (constraintRefused).
Verified: tested by the acceptance vectors (`rule3`).
#### Scenario: REQ-003 decides
- **WHEN** the request is `current none unresolved 2` (an acceptance example)
- **THEN** the answer SHALL be `open`, decided by REQ-003
### Requirement: REQ-004 refuse when conflicts is at least 1
The app SHALL answer `refuse` when conflicts is at least 1 and no earlier rule matches, because app/src/FeatureComposition.lex.tex hasConflict: admitComposition rejects conflicting features (compositionRejected).
Verified: tested by the acceptance vectors (`rule4`).
#### Scenario: REQ-004 decides
- **WHEN** the request is `current none resolved 2` (an acceptance example)
- **THEN** the answer SHALL be `refuse`, decided by REQ-004
### Requirement: Otherwise admit
The app SHALL answer `admit` when no rule matches, because current, unambiguous, resolved and consistent: admitProposal returns the features.
Verified: tested by the acceptance vectors.
#### Scenario: No rule matches
- **WHEN** the request is `current none resolved 0` (an acceptance example)
- **THEN** the answer SHALL be `admit`
### 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 `current none unresolved 2` (an acceptance example)
- **THEN** the answer SHALL be `open`, 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`, `refuse`, `open`, or `invalid` for anything else.
| Field | Accepts | Means |
| --- | --- | --- |
| `revision` | `current`, `stale` | whether the intent and registry revision match the expected ones |
| `ambiguity` | `none`, `ambiguous` | whether the proposal lists an unresolved ambiguity |
| `constraints` | `resolved`, `unresolved` | whether the proposal lists an unresolved constraint |
| `conflicts` | whole number from 0 | selected features that conflict with another |
| Answer | Means |
| --- | --- |
| `admit` | the selected features join the composition |
| `refuse` | refused: stale, or the composition is rejected |
| `open` | refused with an unresolved issue, ambiguity or constraint, to resolve and propose again |
| `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
- `current none resolved 0` gives `admit`
- `current ambiguous resolved 0` gives `open`
- `current none unresolved 2` gives `open`
- `current none resolved 2` gives `refuse`
- `stale none resolved 0` gives `refuse`
- `current ambiguous resolved 3` gives `open`
## 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/ProposalAdmission.lex.tex` is the LexLean model generated from it. It is the single source of the app.
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.