Examples: Two-seed bar
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
Two-seed bar
Decide if a two-seed UOR-R4 run beats its baselines, so a result inside the noise is never called a win.
Inspired by UOR-Foundation/uor-r4 (live). An open research project testing whether geometry and integer tables can replace a transformer's run-time machinery in a laptop-scale language model.
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 | seed1, seed2, unigram, t2, target |
| 2. 6 rules | the first that matches wins |
| 3. Answer | pass, trails-unigram, trails-t2, split, inside-band |
| 4. Proved | 3 theorems, 72 tests |
- Fingerprint
96efafee4f6ed20db5a3881572a19610baf587cc747a9bff02ec5437aa312aac- Acceptance vectors
- 72
- Claims
- 6
Verified by prismpm verify in the pinned SDK when this site was built.
The prompt
This is the whole input. Raw JSON · Open it in the builder · Download the app (.zip)
The prompt 354 lines
{
"schema": "prism/prompt/1",
"pattern": "decisionTable",
"goal": "Decide if a two-seed UOR-R4 run beats its baselines, so a result inside the noise is never called a win.",
"repository": "UOR-Foundation/uor-r4",
"license": "MIT",
"app": {
"name": "r4-seed-gate",
"title": "Two-seed bar",
"purpose": "Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread).",
"fields": [
{
"name": "seed1",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the seed 1 artifact gets right"
},
{
"name": "seed2",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the seed 2 artifact gets right"
},
{
"name": "unigram",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the unigram table gets right"
},
{
"name": "t2",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the T2 previous-word table gets right"
},
{
"name": "target",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "the required target: T2 plus max(24, the absolute difference of the two seeds)"
}
],
"outcomes": [
"pass",
"trails-unigram",
"trails-t2",
"split",
"inside-band"
],
"meanings": {
"pass": "both seeds beat the unigram table and reach the target",
"trails-unigram": "a seed does not beat the unigram table",
"trails-t2": "both seeds score below T2",
"split": "one seed reaches the target and the other does not",
"inside-band": "both seeds miss the target, at least one at or above T2: inside the noise band, not a win"
},
"rules": [
{
"when": [
{
"field": "seed1",
"op": "<=",
"value": {
"field": "unigram"
}
}
],
"then": "trails-unigram",
"why": "docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed"
},
{
"when": [
{
"field": "seed2",
"op": "<=",
"value": {
"field": "unigram"
}
}
],
"then": "trails-unigram",
"why": "docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed"
},
{
"when": [
{
"field": "seed1",
"op": "<",
"value": {
"field": "t2"
}
},
{
"field": "seed2",
"op": "<",
"value": {
"field": "t2"
}
}
],
"then": "trails-t2",
"why": "README.md: the first human-text runs trail the baselines"
},
{
"when": [
{
"field": "seed1",
"op": ">=",
"value": {
"field": "target"
}
},
{
"field": "seed2",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "split",
"why": "README.md: one seed ahead and one behind is not a win; the bar holds at both seeds"
},
{
"when": [
{
"field": "seed2",
"op": ">=",
"value": {
"field": "target"
}
},
{
"field": "seed1",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "split",
"why": "README.md: one seed ahead and one behind is not a win; the bar holds at both seeds"
},
{
"when": [
{
"field": "seed1",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "inside-band",
"why": "docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: >= T2 + max(24, |s1 - s2|); README.md: the 6 Nov best run is inside the noise band, not a win"
}
],
"otherwise": "pass",
"otherwiseWhy": "docs/labs/m1-close-saved-model/README.md bar (d): both seeds beat Unigram and reach the T2 target, as 7,002 and 7,001 against 6,324 did",
"properties": [
{
"kind": "never",
"when": [
{
"field": "seed1",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "pass",
"why": "a seed below the target is not a pass"
},
{
"kind": "never",
"when": [
{
"field": "seed2",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "pass",
"why": "a seed below the target is not a pass"
},
{
"kind": "never",
"when": [
{
"field": "seed1",
"op": "<=",
"value": {
"field": "unigram"
}
}
],
"then": "pass",
"why": "a model that does not beat word frequency has learned nothing"
}
],
"examples": [
{
"request": "7002 7001 1226 6300 6324",
"response": "pass"
},
{
"request": "272867 234892 200000 256660 294635",
"response": "inside-band"
},
{
"request": "455 371 1226 6300 6384",
"response": "trails-unigram"
},
{
"request": "5009 5000 1226 6300 6324",
"response": "trails-t2"
},
{
"request": "6400 6330 1226 6300 6370",
"response": "split"
}
]
},
"stakeholders": [
{
"name": "Researcher",
"text": "Runs training experiments and needs each two-seed result classified by the pre-registered bar, negative results included.",
"concerns": [
"Correct answers",
"Proved guarantees"
]
},
{
"name": "Reviewer",
"text": "Reads the research notebook and needs no result inside the noise band or at one seed reported as a win.",
"concerns": [
"Proved guarantees",
"Refused malformed requests"
]
}
],
"components": [
{
"name": "d11-scorer",
"text": "The artifact scorer that counts each seed's top-1 rows on a panel.",
"kind": "cliAdapter"
},
{
"name": "Research notebook",
"text": "docs/research/notebook, where every result is one row.",
"kind": "externalSystem"
}
],
"threats": [
{
"name": "Single-seed win reported",
"text": "One seed's score above the target is reported as a pass while the other seed misses it.",
"stride": "repudiation",
"asset": "answer",
"likelihood": "high",
"impact": "major",
"control": {
"name": "Both seeds bar",
"text": "Each seed must reach the target.",
"evidence": [
{
"kind": "proof",
"reference": "R4SeedGateProofs::inv001Holds"
},
{
"kind": "proof",
"reference": "R4SeedGateProofs::inv002Holds"
}
]
}
},
{
"name": "Target below the noise floor",
"text": "A caller sends a target below T2 plus 24, so a noise-level gain passes.",
"stride": "tampering",
"asset": "request",
"likelihood": "medium",
"impact": "major",
"accepted": "The target is computed by the pre-registered gate sheet before scoring; the app compares against the target it is given."
},
{
"name": "Sealed panel scored early",
"text": "The fresh panel is scored before the DEV decision, so the pass is not a confirmation.",
"stride": "tampering",
"asset": "source",
"likelihood": "low",
"impact": "major",
"accepted": "refuse_sealed_fresh_source in the scorer guards the seal; this app only classifies counts."
}
],
"quality": [
{
"characteristic": "Functional suitability",
"subcharacteristic": "Functional correctness",
"requirement": "Both seeds required",
"text": "A pass needs both of the two seeds to reach the target.",
"measure": "Seeds required",
"measureText": "Seeds that must reach the target before pass.",
"threshold": 2
},
{
"characteristic": "Reliability",
"subcharacteristic": "Faultlessness",
"requirement": "No noise-band win",
"text": "No result with a seed below the target is answered pass.",
"measure": "Noise-band passes",
"measureText": "Acceptance vectors with a seed below the target answered pass.",
"threshold": 0
}
],
"journeys": [
{
"stakeholder": "Researcher",
"steps": [
"REQ-001",
"REQ-003",
"REQ-006",
"otherwise"
]
},
{
"stakeholder": "Reviewer",
"steps": [
"REQ-004",
"REQ-005",
"INV-001",
"INV-002",
"INV-003",
"refuse"
]
}
],
"axioms": {
"inv002Holds": [
"Classical.choice",
"Quot.sound",
"propext"
]
},
"concerns": []
}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.
RS-01The app never answers pass when seed1 is below targetRS-02The app never answers pass when seed2 is below targetRS-03The app never answers pass when seed1 is at most unigramRS-04The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it referencesRS-05The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declaredRS-06Every 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 | pass, trails-unigram, trails-t2, split, inside-band |
Behavior
A request is seed1, seed2, unigram, t2, target, separated by spaces. The first rule that matches decides. If none matches, the answer is pass. A request over 136 bytes, or in any other form, is answered invalid.
Behavior 7 rows
| Rule | When | Answer | Why |
|---|---|---|---|
| REQ-001 | seed1 is at most unigram | trails-unigram | docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed |
| REQ-002 | seed2 is at most unigram | trails-unigram | docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed |
| REQ-003 | seed1 is below t2 and seed2 is below t2 | trails-t2 | README.md: the first human-text runs trail the baselines |
| REQ-004 | seed1 is at least target and seed2 is below target | split | README.md: one seed ahead and one behind is not a win; the bar holds at both seeds |
| REQ-005 | seed2 is at least target and seed1 is below target | split | README.md: one seed ahead and one behind is not a win; the bar holds at both seeds |
| REQ-006 | seed1 is below target | inside-band | docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: >= T2 + max(24, |s1 - s2|); README.md: the 6 Nov best run is inside the noise band, not a win |
| otherwise | no rule matches | pass | docs/labs/m1-close-saved-model/README.md bar (d): both seeds beat Unigram and reach the T2 target, as 7,002 and 7,001 against 6,324 did |
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 pass when seed1 is below target. | R4SeedGateProofs::inv001Holds | a seed below the target is not a pass |
| INV-002 | It never answers pass when seed2 is below target. | R4SeedGateProofs::inv002Holds | a seed below the target is not a pass |
| INV-003 | It never answers pass when seed1 is at most unigram. | R4SeedGateProofs::inv003Holds | a model that does not beat word frequency has learned nothing |
Architecture
Stakeholders and the concerns each one views the app through (ISO/IEC/IEEE 42010).
| Stakeholder | Who they are | Concerns |
|---|---|---|
| Researcher | Runs training experiments and needs each two-seed result classified by the pre-registered bar, negative results included. | Correct answers, Proved guarantees |
| Reviewer | Reads the research notebook and needs no result inside the noise band or at one seed reported as a win. | Proved guarantees, Refused malformed requests |
| 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 pass 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 3 properties of the spec holds for every request, proved by the Lean kernel. | quality |
| Refused malformed requests | A request that is not the 5 fields in order, or is longer than 136 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 Two-seed bar guest. |
| d11-scorer | cliAdapter | The artifact scorer that counts each seed's top-1 rows on a panel. |
| 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. |
| Research notebook | externalSystem | docs/research/notebook, where every result is one row. |
| Source repository | externalSystem | The repository that holds the prompt, the model and its gate. |
| Two-seed bar guest | service | The Core-Wasm guest built from the model: it answers one request of at most 136 bytes with one answer of at most 64. |
| Two-seed bar page | staticSite | The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors. |
Design views
The SDK checks each view against the system model and draws it as OPL and PlantUML.
| View | Diagram | Viewpoint |
|---|---|---|
| Deciding a Two-seed bar request | opmObjectProcess | Researcher: Correct answers |
| Components of Two-seed bar | umlComponent | Verifier: Integrity of the published app |
| Answering a Two-seed bar request | umlSequence | Researcher: Correct answers |
| States of the Two-seed bar guest | umlStateMachine | Reviewer: Refused malformed requests |
Features and journeys
11 features. Each names the definitions that do the work and the tests that accept it. Each stakeholder has one journey.
Features and journeys 11 rows
| Feature | Calls | Accepted by |
|---|---|---|
| When seed1 is at most unigram, the answer is trails-unigram. | R4SeedGate::rule1, R4SeedGate::judge | R4SeedGate::application |
| When seed2 is at most unigram, the answer is trails-unigram. | R4SeedGate::rule2, R4SeedGate::judge | R4SeedGate::application |
| When seed1 is below t2 and seed2 is below t2, the answer is trails-t2. | R4SeedGate::rule3, R4SeedGate::judge | R4SeedGate::application |
| When seed1 is at least target and seed2 is below target, the answer is split. | R4SeedGate::rule4, R4SeedGate::judge | R4SeedGate::application |
| When seed2 is at least target and seed1 is below target, the answer is split. | R4SeedGate::rule5, R4SeedGate::judge | R4SeedGate::application |
| When seed1 is below target, the answer is inside-band. | R4SeedGate::rule6, R4SeedGate::judge | R4SeedGate::application |
| When no rule matches, the answer is pass. | R4SeedGate::judge | R4SeedGate::application |
| A request that is not seed1, seed2, unigram, t2, target in order, separated by single spaces, or is over 136 bytes, is answered invalid. | R4SeedGate::dispatch, R4SeedGate::decodeField1 | R4SeedGate::application |
| It never answers pass when seed1 is below target. | R4SeedGate::judge | R4SeedGateProofs::inv001Holds |
| It never answers pass when seed2 is below target. | R4SeedGate::judge | R4SeedGateProofs::inv002Holds |
| It never answers pass when seed1 is at most unigram. | R4SeedGate::judge | R4SeedGateProofs::inv003Holds |
Journeys
The ordered features each stakeholder takes.
| Stakeholder | Steps |
|---|---|
| Researcher | REQ-001 → REQ-003 → REQ-006 → otherwise |
| Reviewer | REQ-004 → REQ-005 → INV-001 → INV-002 → INV-003 → refuse |
| Verifier | refuse → INV-001 → INV-002 → INV-003 |
Security and threat model
12 threats against 4 assets. Each has a STRIDE category, and either a control with evidence or a risk that is accepted on purpose.
Security and threat model 12 rows
| Threat | STRIDE | Asset | Risk | Answered by |
|---|---|---|---|---|
| Answer that breaks INV-001 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-001: proof R4SeedGateProofs::inv001Holds |
| Answer that breaks INV-002 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-002: proof R4SeedGateProofs::inv002Holds |
| Answer that breaks INV-003 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-003: proof R4SeedGateProofs::inv003Holds |
| 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 |
| Sealed panel scored early | tampering | Model source | low likelihood, major impact | accepted: refuse_sealed_fresh_source in the scorer guards the seal; this app only classifies counts. |
| Single-seed win reported | repudiation | Answer | high likelihood, major impact | Both seeds bar: proof R4SeedGateProofs::inv001Holds; proof R4SeedGateProofs::inv002Holds |
| 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 |
| Target below the noise floor | tampering | Request bytes | medium likelihood, major impact | accepted: The target is computed by the pre-registered gate sheet before scoring; the app compares against the target it is given. |
Quality
ISO/IEC 25010:2023 requirements. Each has a measure and a threshold that a theorem pins.
Quality 8 rows
| Requirement | Characteristic | Measure | Threshold |
|---|---|---|---|
| Both seeds required: A pass needs both of the two seeds to reach the target. | Functional suitability: Functional correctness | Seeds required | 2 |
| Bounded allocation: The guest allocates at most 272 bytes for one request. | Performance efficiency: Resource utilization | Guest allocation bytes | 272 |
| Bounded request: A request over 136 bytes is refused before any field is read. | Performance efficiency: Time behaviour | Request bytes read | 136 |
| Every property proved: All 3 properties are theorems the Lean kernel checks. | Security: Integrity | Unproved properties | 0 |
| Every request answered: Every request gets an answer: a rule, pass otherwise, or invalid. | Functional suitability: Functional completeness | Unanswered requests | 0 |
| Every vector replays: All 72 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 5 examples of the spec is answered as it states. | Functional suitability: Functional correctness | Example mismatches | 0 |
| No noise-band win: No result with a seed below the target is answered pass. | Reliability: Faultlessness | Noise-band passes | 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 | R4SeedGate::judge |
| OpenSpec | Requirements | R4SeedGate::application |
| SPDX MIT | Licensing | R4SeedGate::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 Two-seed bar request
Viewpoint: Architecture::viewpointResearcherCorrectAnswers
Notation: ISO/PAS 19450:2015 OPM, Prism OPL profile
componentBrowser is an object.
componentTwoSeedBarGuest is an object.
componentTwoSeedBarGuest can be stateDeciding or stateIdle.
processDecide is a process.
processEncodeAnswer is a process.
processJudge is a process.
processParseRequest is a process.
componentTwoSeedBarGuest 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 Two-seed bar
component "componentBrowser" as c0
component "componentD11Scorer" as c1
component "componentGitHubPages" as c2
component "componentPrismBuild" as c3
component "componentResearchNotebook" as c4
component "componentSourceRepository" as c5
component "componentTwoSeedBarGuest" as c6
component "componentTwoSeedBarPage" as c7
c0 --> c6 : edgeBrowserToTwoSeedBarGuest
c1 --> c6 : edgeD11ScorerToTwoSeedBarGuest
c2 --> c0 : edgeGitHubPagesToBrowser
c3 --> c6 : edgePrismBuildToTwoSeedBarGuest
c3 --> c7 : edgePrismBuildToTwoSeedBarPage
c4 --> c6 : edgeResearchNotebookToTwoSeedBarGuest
c5 --> c3 : edgeSourceRepositoryToPrismBuild
c6 --> c0 : edgeTwoSeedBarGuestToBrowser
c6 --> c1 : edgeTwoSeedBarGuestToD11Scorer
c6 --> c4 : edgeTwoSeedBarGuestToResearchNotebook
c7 --> c2 : edgeTwoSeedBarPageToGitHubPages
@enduml
design/Design.viewUmlRequest.puml
@startuml
' UML 2.5.1 sequence diagram
' view: Design::viewUmlRequest
' viewpoint: Architecture::viewpointResearcherCorrectAnswers
title Answering a Two-seed bar request
participant "componentBrowser" as p0
participant "componentTwoSeedBarGuest" 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::viewpointReviewerRefusedMalformedRequests
title States of the Two-seed bar guest
state "stateAnsweredInsideBand" as s0
state "stateAnsweredPass" as s1
state "stateAnsweredSplit" as s2
state "stateAnsweredTrailsT2" as s3
state "stateAnsweredTrailsUnigram" as s4
state "stateDeciding" as s5
state "stateIdle" as s6
state "stateRefused" as s7
[*] --> s6
s6 --> s5 : processParseRequest
s6 --> s7 : processParseRequest
s5 --> s4 : processRule1
s5 --> s4 : processRule2
s5 --> s3 : processRule3
s5 --> s2 : processRule4
s5 --> s2 : processRule5
s5 --> s0 : processRule6
s5 --> s1 : processOtherwise
s1 --> s6 : processEncodeAnswer
s4 --> s6 : processEncodeAnswer
s3 --> s6 : processEncodeAnswer
s2 --> s6 : processEncodeAnswer
s0 --> s6 : processEncodeAnswer
s7 --> s6 : 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 406 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: stakeholderResearcher,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 0, name := "Researcher", text := "Runs training experiments and needs each two-seed result classified by the pre-registered bar, negative results included."})
}
definition{
name: stakeholderReviewer,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 1, name := "Reviewer", text := "Reads the research notebook and needs no result inside the noise band or at one seed reported as a win."})
}
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 pass 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 3 properties of the spec holds for every request, proved by the Lean kernel."})
}
definition{
name: concernRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 3, name := "Refused malformed requests", text := "A request that is not the 5 fields in order, or is longer than 136 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 Two-seed bar guest."})
}
definition{
name: componentD11Scorer,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 1, kind := (ctor Foundation.Arch::ComponentKind.cliAdapter), name := "d11-scorer", text := "The artifact scorer that counts each seed's top-1 rows on a panel."})
}
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: componentResearchNotebook,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 4, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Research notebook", text := "docs/research/notebook, where every result is one row."})
}
definition{
name: componentSourceRepository,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 5, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Source repository", text := "The repository that holds the prompt, the model and its gate."})
}
definition{
name: componentTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 6, kind := (ctor Foundation.Arch::ComponentKind.service), name := "Two-seed bar guest", text := "The Core-Wasm guest built from the model: it answers one request of at most 136 bytes with one answer of at most 64."})
}
definition{
name: componentTwoSeedBarPage,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 7, kind := (ctor Foundation.Arch::ComponentKind.staticSite), name := "Two-seed bar page", text := "The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors."})
}
definition{
name: edgeBrowserToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 0, fromIndex := 0, toIndex := 6, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeD11ScorerToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 1, fromIndex := 1, toIndex := 6, 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: edgePrismBuildToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 3, fromIndex := 3, toIndex := 6, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgePrismBuildToTwoSeedBarPage,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 4, fromIndex := 3, toIndex := 7, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeResearchNotebookToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 5, fromIndex := 4, toIndex := 6, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeSourceRepositoryToPrismBuild,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 6, fromIndex := 5, toIndex := 3, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeTwoSeedBarGuestToBrowser,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 7, fromIndex := 6, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeTwoSeedBarGuestToD11Scorer,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 8, fromIndex := 6, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeTwoSeedBarGuestToResearchNotebook,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 9, fromIndex := 6, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeTwoSeedBarPageToGitHubPages,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 10, fromIndex := 7, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: viewpointResearcherCorrectAnswers,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 0, stakeholderIndex := 0, concernIndex := 0, modelKindIndex := 1})
}
definition{
name: viewpointResearcherProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 1, stakeholderIndex := 0, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointReviewerProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 2, stakeholderIndex := 1, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointReviewerRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 3, stakeholderIndex := 1, concernIndex := 3, modelKindIndex := 2})
}
definition{
name: viewpointVerifierIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 4, stakeholderIndex := 2, concernIndex := 1, modelKindIndex := 2})
}
definition{
name: viewpointVerifierProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 5, stakeholderIndex := 2, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointVerifierRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 6, stakeholderIndex := 2, concernIndex := 3, modelKindIndex := 2})
}
definition{
name: viewResearcherCorrectAnswers,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 0, viewpointIndex := 0, modelKindIndex := 1})
}
definition{
name: viewResearcherProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 1, viewpointIndex := 1, modelKindIndex := 1})
}
definition{
name: viewReviewerProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 2, viewpointIndex := 2, modelKindIndex := 1})
}
definition{
name: viewReviewerRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 3, viewpointIndex := 3, modelKindIndex := 2})
}
definition{
name: viewVerifierIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 4, viewpointIndex := 4, modelKindIndex := 2})
}
definition{
name: viewVerifierProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 5, viewpointIndex := 5, modelKindIndex := 1})
}
definition{
name: viewVerifierRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 6, viewpointIndex := 6, modelKindIndex := 2})
}
definition{
name: componentRecords,
parameters: [],
result: (List Foundation.Arch::Component),
body: (cons (componentBrowser) (cons (componentD11Scorer) (cons (componentGitHubPages) (cons (componentPrismBuild) (cons (componentResearchNotebook) (cons (componentSourceRepository) (cons (componentTwoSeedBarGuest) (cons (componentTwoSeedBarPage) (nil Foundation.Arch::Component)))))))))
}
definition{
name: edgeRecords,
parameters: [],
result: (List Foundation.Arch::Edge),
body: (cons (edgeBrowserToTwoSeedBarGuest) (cons (edgeD11ScorerToTwoSeedBarGuest) (cons (edgeGitHubPagesToBrowser) (cons (edgePrismBuildToTwoSeedBarGuest) (cons (edgePrismBuildToTwoSeedBarPage) (cons (edgeResearchNotebookToTwoSeedBarGuest) (cons (edgeSourceRepositoryToPrismBuild) (cons (edgeTwoSeedBarGuestToBrowser) (cons (edgeTwoSeedBarGuestToD11Scorer) (cons (edgeTwoSeedBarGuestToResearchNotebook) (cons (edgeTwoSeedBarPageToGitHubPages) (nil Foundation.Arch::Edge))))))))))))
}
definition{
name: viewpointRecords,
parameters: [],
result: (List Foundation.Arch::Viewpoint),
body: (cons (viewpointResearcherCorrectAnswers) (cons (viewpointResearcherProvedGuarantees) (cons (viewpointReviewerProvedGuarantees) (cons (viewpointReviewerRefusedMalformedRequests) (cons (viewpointVerifierIntegrityOfThePublishedApp) (cons (viewpointVerifierProvedGuarantees) (cons (viewpointVerifierRefusedMalformedRequests) (nil Foundation.Arch::Viewpoint))))))))
}
definition{
name: viewRecords,
parameters: [],
result: (List Foundation.Arch::View),
body: (cons (viewResearcherCorrectAnswers) (cons (viewResearcherProvedGuarantees) (cons (viewReviewerProvedGuarantees) (cons (viewReviewerRefusedMalformedRequests) (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{R4SeedGate}
\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 6 rules are tried in order and the first that matches gives the answer; otherwise pass.", evidence := (cons "R4SeedGate::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 "R4SeedGate::application" (nil String))}) (cons (record Obligation {index := 6, standard := "SPDX MIT", subject := "Licensing", text := "The application and its model are offered under MIT.", evidence := (cons "R4SeedGate::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 619 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::componentTwoSeedBarGuest"})
}
definition{
name: processParseRequest,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processJudge,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processEncodeAnswer,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
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::componentTwoSeedBarGuest"})
}
definition{
name: processRule2,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processRule3,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processRule4,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processRule5,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processRule6,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: processOtherwise,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateIdle,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateDeciding,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateRefused,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateAnsweredPass,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateAnsweredTrailsUnigram,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateAnsweredTrailsT2,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateAnsweredSplit,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: stateAnsweredInsideBand,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: viewOpmDecide,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Deciding a Two-seed bar request", viewpoint := "Architecture::viewpointResearcherCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.opmObjectProcess)})
}
definition{
name: viewUmlComponents,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Components of Two-seed bar", 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 Two-seed bar request", viewpoint := "Architecture::viewpointResearcherCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.umlSequence)})
}
definition{
name: viewUmlStates,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "States of the Two-seed bar guest", viewpoint := "Architecture::viewpointReviewerRefusedMalformedRequests", 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::componentTwoSeedBarGuest"})
}
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::componentTwoSeedBarGuest", state := "Design::stateIdle"})
}
definition{
name: opmGuestDeciding,
parameters: [],
result: Foundation.Arch::OpmState,
body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentTwoSeedBarGuest", 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::componentTwoSeedBarGuest", 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: umlD11Scorer,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentD11Scorer"})
}
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: umlResearchNotebook,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentResearchNotebook"})
}
definition{
name: umlSourceRepository,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentSourceRepository"})
}
definition{
name: umlTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentTwoSeedBarGuest"})
}
definition{
name: umlTwoSeedBarPage,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentTwoSeedBarPage"})
}
definition{
name: umlBrowserToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeBrowserToTwoSeedBarGuest"})
}
definition{
name: umlD11ScorerToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeD11ScorerToTwoSeedBarGuest"})
}
definition{
name: umlGitHubPagesToBrowser,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeGitHubPagesToBrowser"})
}
definition{
name: umlPrismBuildToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToTwoSeedBarGuest"})
}
definition{
name: umlPrismBuildToTwoSeedBarPage,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToTwoSeedBarPage"})
}
definition{
name: umlResearchNotebookToTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeResearchNotebookToTwoSeedBarGuest"})
}
definition{
name: umlSourceRepositoryToPrismBuild,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeSourceRepositoryToPrismBuild"})
}
definition{
name: umlTwoSeedBarGuestToBrowser,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeTwoSeedBarGuestToBrowser"})
}
definition{
name: umlTwoSeedBarGuestToD11Scorer,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeTwoSeedBarGuestToD11Scorer"})
}
definition{
name: umlTwoSeedBarGuestToResearchNotebook,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeTwoSeedBarGuestToResearchNotebook"})
}
definition{
name: umlTwoSeedBarPageToGitHubPages,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeTwoSeedBarPageToGitHubPages"})
}
definition{
name: seqBrowser,
parameters: [],
result: Foundation.Arch::UmlLifeline,
body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentBrowser", order := 0})
}
definition{
name: seqTwoSeedBarGuest,
parameters: [],
result: Foundation.Arch::UmlLifeline,
body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentTwoSeedBarGuest", 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::componentTwoSeedBarGuest", 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::componentTwoSeedBarGuest", 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: stAnsweredPass,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredPass", initial := false})
}
definition{
name: stAnsweredTrailsUnigram,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredTrailsUnigram", initial := false})
}
definition{
name: stAnsweredTrailsT2,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredTrailsT2", initial := false})
}
definition{
name: stAnsweredSplit,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredSplit", initial := false})
}
definition{
name: stAnsweredInsideBand,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredInsideBand", 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::stateAnsweredTrailsUnigram", 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::stateAnsweredTrailsUnigram", 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::stateAnsweredTrailsT2", 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::stateAnsweredSplit", trigger := "Design::processRule4"})
}
definition{
name: trRule5,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 6, source := "Design::stateDeciding", target := "Design::stateAnsweredSplit", trigger := "Design::processRule5"})
}
definition{
name: trRule6,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 7, source := "Design::stateDeciding", target := "Design::stateAnsweredInsideBand", trigger := "Design::processRule6"})
}
definition{
name: trOtherwise,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 8, source := "Design::stateDeciding", target := "Design::stateAnsweredPass", trigger := "Design::processOtherwise"})
}
definition{
name: trResetPass,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 9, source := "Design::stateAnsweredPass", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetTrailsUnigram,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 10, source := "Design::stateAnsweredTrailsUnigram", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetTrailsT2,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 11, source := "Design::stateAnsweredTrailsT2", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetSplit,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 12, source := "Design::stateAnsweredSplit", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetInsideBand,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 13, source := "Design::stateAnsweredInsideBand", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetRefused,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 14, 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{R4SeedGate}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{feature}
\begin{semanticmodule}
definition{
name: acceptINV001,
parameters: [],
result: String,
body: "R4SeedGateProofs::inv001Holds"
}
definition{
name: acceptINV002,
parameters: [],
result: String,
body: "R4SeedGateProofs::inv002Holds"
}
definition{
name: acceptINV003,
parameters: [],
result: String,
body: "R4SeedGateProofs::inv003Holds"
}
definition{
name: featureRule1,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When seed1 is at most unigram, the answer is trails-unigram.", calls := (cons "R4SeedGate::rule1" (cons "R4SeedGate::judge" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureRule2,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When seed2 is at most unigram, the answer is trails-unigram.", calls := (cons "R4SeedGate::rule2" (cons "R4SeedGate::judge" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureRule3,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When seed1 is below t2 and seed2 is below t2, the answer is trails-t2.", calls := (cons "R4SeedGate::rule3" (cons "R4SeedGate::judge" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureRule4,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When seed1 is at least target and seed2 is below target, the answer is split.", calls := (cons "R4SeedGate::rule4" (cons "R4SeedGate::judge" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureRule5,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When seed2 is at least target and seed1 is below target, the answer is split.", calls := (cons "R4SeedGate::rule5" (cons "R4SeedGate::judge" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureRule6,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When seed1 is below target, the answer is inside-band.", calls := (cons "R4SeedGate::rule6" (cons "R4SeedGate::judge" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureOtherwise,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When no rule matches, the answer is pass.", calls := (cons "R4SeedGate::judge" (nil String)), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureRefuseMalformed,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "A request that is not seed1, seed2, unigram, t2, target in order, separated by single spaces, or is over 136 bytes, is answered invalid.", calls := (cons "R4SeedGate::dispatch" (cons "R4SeedGate::decodeField1" (nil String))), acceptance := (cons "R4SeedGate::application" (nil String))})
}
definition{
name: featureINV001,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers pass when seed1 is below target.", calls := (cons "R4SeedGate::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 pass when seed2 is below target.", calls := (cons "R4SeedGate::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 pass when seed1 is at most unigram.", calls := (cons "R4SeedGate::judge" (nil String)), acceptance := (cons "Features::acceptINV003" (nil String))})
}
definition{
name: journeyResearcher,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderResearcher", steps := (cons "Features::featureRule1" (cons "Features::featureRule3" (cons "Features::featureRule6" (cons "Features::featureOtherwise" (nil String)))))})
}
definition{
name: journeyReviewer,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderReviewer", steps := (cons "Features::featureRule4" (cons "Features::featureRule5" (cons "Features::featureINV001" (cons "Features::featureINV002" (cons "Features::featureINV003" (cons "Features::featureRefuseMalformed" (nil String)))))))})
}
definition{
name: journeyVerifier,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderVerifier", steps := (cons "Features::featureRefuseMalformed" (cons "Features::featureINV001" (cons "Features::featureINV002" (cons "Features::featureINV003" (nil String)))))})
}
\end{semanticmodule}
\end{lexlean}
app/src/Quality.lex.tex 368 lines
\begin{lexlean}{Quality}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\useglossary{prism.qual@1.0.0}
\importmodule{Foundation.Qual}
\title{quality measure}
\begin{semanticmodule}
structure{
name: Named,
type_parameters: [],
parameters: [],
fields: [{name: index, type: Nat}, {name: name, type: String}, {name: text, type: String}]
}
definition{
name: characteristicFunctionalSuitability,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 0})
}
definition{
name: characteristicPerformanceEfficiency,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 1})
}
definition{
name: characteristicReliability,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 2})
}
definition{
name: characteristicSecurity,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 3})
}
definition{
name: subcharacteristicFaultlessness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 0, characteristicIndex := 2})
}
definition{
name: subcharacteristicFunctionalCompleteness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 1, characteristicIndex := 0})
}
definition{
name: subcharacteristicFunctionalCorrectness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 2, characteristicIndex := 0})
}
definition{
name: subcharacteristicIntegrity,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 3, characteristicIndex := 3})
}
definition{
name: subcharacteristicResourceUtilization,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 4, characteristicIndex := 1})
}
definition{
name: subcharacteristicTimeBehaviour,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 5, characteristicIndex := 1})
}
definition{
name: requirementBothSeedsRequired,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 0, subcharacteristicIndex := 2})
}
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: requirementNoNoiseBandWin,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 7, subcharacteristicIndex := 0})
}
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: measureGuestAllocationBytes,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 2, requirementIndex := 1, threshold := 272})
}
definition{
name: measureNoiseBandPasses,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 3, requirementIndex := 7, threshold := 0})
}
definition{
name: measureRequestBytesRead,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 4, requirementIndex := 2, threshold := 136})
}
definition{
name: measureSeedsRequired,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 5, requirementIndex := 0, threshold := 2})
}
definition{
name: measureUnansweredRequests,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 6, requirementIndex := 4, threshold := 0})
}
definition{
name: measureUnprovedProperties,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 7, 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 Two-seed bar."}) (cons (record Named {index := 1, name := "Performance efficiency", text := "Performance efficiency, as ISO/IEC 25010:2023 defines it, for Two-seed bar."}) (cons (record Named {index := 2, name := "Reliability", text := "Reliability, as ISO/IEC 25010:2023 defines it, for Two-seed bar."}) (cons (record Named {index := 3, name := "Security", text := "Security, as ISO/IEC 25010:2023 defines it, for Two-seed bar."}) (nil Named)))))
}
definition{
name: subcharacteristicNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Faultlessness", text := "Reliability: Faultlessness."}) (cons (record Named {index := 1, name := "Functional completeness", text := "Functional suitability: Functional completeness."}) (cons (record Named {index := 2, name := "Functional correctness", text := "Functional suitability: Functional correctness."}) (cons (record Named {index := 3, name := "Integrity", text := "Security: Integrity."}) (cons (record Named {index := 4, name := "Resource utilization", text := "Performance efficiency: Resource utilization."}) (cons (record Named {index := 5, name := "Time behaviour", text := "Performance efficiency: Time behaviour."}) (nil Named)))))))
}
definition{
name: requirementNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Both seeds required", text := "A pass needs both of the two seeds to reach the target."}) (cons (record Named {index := 1, name := "Bounded allocation", text := "The guest allocates at most 272 bytes for one request."}) (cons (record Named {index := 2, name := "Bounded request", text := "A request over 136 bytes is refused before any field is read."}) (cons (record Named {index := 3, name := "Every property proved", text := "All 3 properties are theorems the Lean kernel checks."}) (cons (record Named {index := 4, name := "Every request answered", text := "Every request gets an answer: a rule, pass otherwise, or invalid."}) (cons (record Named {index := 5, name := "Every vector replays", text := "All 72 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 5 examples of the spec is answered as it states."}) (cons (record Named {index := 7, name := "No noise-band win", text := "No result with a seed below the target is answered pass."}) (nil Named)))))))))
}
definition{
name: measureNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Example mismatches", text := "Examples the guest answers otherwise than they state."}) (cons (record Named {index := 1, name := "Failed vectors", text := "Acceptance vectors whose replay differs from the model."}) (cons (record Named {index := 2, name := "Guest allocation bytes", text := "Most bytes the guest allocates for one request."}) (cons (record Named {index := 3, name := "Noise-band passes", text := "Acceptance vectors with a seed below the target answered pass."}) (cons (record Named {index := 4, name := "Request bytes read", text := "Longest request the guest decodes, in bytes."}) (cons (record Named {index := 5, name := "Seeds required", text := "Seeds that must reach the target before pass."}) (cons (record Named {index := 6, name := "Unanswered requests", text := "Acceptance vectors the guest does not answer."}) (cons (record Named {index := 7, name := "Unproved properties", text := "Properties of the spec without a checked theorem."}) (nil Named)))))))))
}
definition{
name: subcharacteristicRecords,
parameters: [],
result: (List Foundation.Qual::QualitySubcharacteristic),
body: (cons (subcharacteristicFaultlessness) (cons (subcharacteristicFunctionalCompleteness) (cons (subcharacteristicFunctionalCorrectness) (cons (subcharacteristicIntegrity) (cons (subcharacteristicResourceUtilization) (cons (subcharacteristicTimeBehaviour) (nil Foundation.Qual::QualitySubcharacteristic)))))))
}
definition{
name: requirementRecords,
parameters: [],
result: (List Foundation.Qual::QualityRequirement),
body: (cons (requirementBothSeedsRequired) (cons (requirementBoundedAllocation) (cons (requirementBoundedRequest) (cons (requirementEveryPropertyProved) (cons (requirementEveryRequestAnswered) (cons (requirementEveryVectorReplays) (cons (requirementExamplesAnsweredAsStated) (cons (requirementNoNoiseBandWin) (nil Foundation.Qual::QualityRequirement)))))))))
}
definition{
name: measureRecords,
parameters: [],
result: (List Foundation.Qual::QualityMeasure),
body: (cons (measureExampleMismatches) (cons (measureFailedVectors) (cons (measureGuestAllocationBytes) (cons (measureNoiseBandPasses) (cons (measureRequestBytesRead) (cons (measureSeedsRequired) (cons (measureUnansweredRequests) (cons (measureUnprovedProperties) (nil Foundation.Qual::QualityMeasure)))))))))
}
definition{
name: namesNumbered,
parameters: [position : Nat, names : (List Named)],
result: Bool,
body: (match names
| List.nil => true
| List.cons item rest => (((project item index) =? position) && (namesNumbered (position + 1) rest))),
recursive_argument: names
}
definition{
name: parentsKnown,
parameters: [count : Nat, records : (List Foundation.Qual::QualitySubcharacteristic)],
result: Bool,
body: (match records
| List.nil => true
| List.cons item rest => (((project item characteristicIndex) <? count) && (parentsKnown count rest))),
recursive_argument: records
}
definition{
name: requirementsKnown,
parameters: [count : Nat, records : (List Foundation.Qual::QualityRequirement)],
result: Bool,
body: (match records
| List.nil => true
| List.cons item rest => (((project item subcharacteristicIndex) <? count) && (requirementsKnown count rest))),
recursive_argument: records
}
definition{
name: measuresKnown,
parameters: [count : Nat, records : (List Foundation.Qual::QualityMeasure)],
result: Bool,
body: (match records
| List.nil => true
| List.cons item rest => (((project item requirementIndex) <? count) && (measuresKnown count rest))),
recursive_argument: records
}
definition{
name: thresholdOf,
parameters: [wanted : Nat, records : (List Foundation.Qual::QualityMeasure)],
result: Nat,
body: (match records
| List.nil => 0
| List.cons head rest => (if ((project head index) =? wanted) then (project head threshold) else (thresholdOf wanted rest))),
recursive_argument: records
}
definition{
name: qualityValid,
parameters: [],
result: Bool,
body: ((namesNumbered 0 (characteristicNames)) && ((namesNumbered 0 (subcharacteristicNames)) && ((namesNumbered 0 (requirementNames)) && ((namesNumbered 0 (measureNames)) && ((parentsKnown 4 (subcharacteristicRecords)) && ((requirementsKnown 6 (requirementRecords)) && (measuresKnown 8 (measureRecords))))))))
}
theorem{
name: qualityModelHolds,
parameters: [],
statement: ((qualityValid) = true),
proof: decide{}
}
theorem{
name: measureExampleMismatchesThreshold,
parameters: [],
statement: ((thresholdOf 0 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureFailedVectorsThreshold,
parameters: [],
statement: ((thresholdOf 1 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureGuestAllocationBytesThreshold,
parameters: [],
statement: ((thresholdOf 2 (measureRecords)) = 272),
proof: decide{}
}
theorem{
name: measureNoiseBandPassesThreshold,
parameters: [],
statement: ((thresholdOf 3 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureRequestBytesReadThreshold,
parameters: [],
statement: ((thresholdOf 4 (measureRecords)) = 136),
proof: decide{}
}
theorem{
name: measureSeedsRequiredThreshold,
parameters: [],
statement: ((thresholdOf 5 (measureRecords)) = 2),
proof: decide{}
}
theorem{
name: measureUnansweredRequestsThreshold,
parameters: [],
statement: ((thresholdOf 6 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureUnprovedPropertiesThreshold,
parameters: [],
statement: ((thresholdOf 7 (measureRecords)) = 0),
proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Security.lex.tex 537 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 := 6})
}
definition{
name: assetModelSource,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 1, componentIndex := 5})
}
definition{
name: assetPublishedHolo,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 2, componentIndex := 7})
}
definition{
name: assetRequestBytes,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 3, componentIndex := 6})
}
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: threatGrantedCapability,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 3})
}
definition{
name: threatMalformedRequest,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 4})
}
definition{
name: threatOversizedRequest,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 5})
}
definition{
name: threatSealedPanelScoredEarly,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 6})
}
definition{
name: threatSingleSeedWinReported,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 7})
}
definition{
name: threatSubstitutedHolo,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 8})
}
definition{
name: threatSubstitutedHost,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 9})
}
definition{
name: threatTamperedModel,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 10})
}
definition{
name: threatTargetBelowTheNoiseFloor,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 11})
}
definition{
name: riskAnswerThatBreaksINV001,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 0, assetIndex := 0, threatIndex := 0, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskAnswerThatBreaksINV002,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 1, assetIndex := 0, threatIndex := 1, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskAnswerThatBreaksINV003,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 2, assetIndex := 0, threatIndex := 2, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskGrantedCapability,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 3, assetIndex := 0, threatIndex := 3, 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 := 4, assetIndex := 3, threatIndex := 4, 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 := 5, assetIndex := 3, threatIndex := 5, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.minor)})
}
definition{
name: riskSealedPanelScoredEarly,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 6, assetIndex := 1, threatIndex := 6, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskSingleSeedWinReported,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 7, assetIndex := 0, threatIndex := 7, likelihood := (ctor Foundation.Sec::Likelihood.high), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskSubstitutedHolo,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 8, assetIndex := 2, threatIndex := 8, 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 := 9, assetIndex := 2, threatIndex := 9, 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 := 10, assetIndex := 1, threatIndex := 10, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskTargetBelowTheNoiseFloor,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 11, assetIndex := 3, threatIndex := 11, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: controlBothSeedsBar,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 0, riskIndex := 7})
}
definition{
name: controlBoundedRequest,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 1, riskIndex := 5})
}
definition{
name: controlFingerprintAndProvenance,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 2, riskIndex := 8})
}
definition{
name: controlNoCapabilityGranted,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 3, riskIndex := 3})
}
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: controlRegeneratedFromThePrompt,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 7, riskIndex := 10})
}
definition{
name: controlStrictDecoder,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 8, riskIndex := 4})
}
definition{
name: controlSet,
parameters: [],
result: Production.ThreatModel::ControlSet,
body: (record Production.ThreatModel::ControlSet {title := "Two-seed bar security controls", text := "Two-seed bar answers one request with one answer in a Core-Wasm guest granted no capability. Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread).", 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 pass, trails-unigram, trails-t2, split, inside-band, 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 136 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 pass although seed1 is below target, which matters because a seed below the target is not a pass.", 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 pass although seed2 is below target, which matters because a seed below the target is not a pass.", 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 pass although seed1 is at most unigram, which matters because a model that does not beat word frequency has learned nothing.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
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 136 bytes makes the guest parse or allocate without bound.", category := (ctor Production.ThreatModel::Stride.denialOfService)})
}
definition{
name: modeledThreatSealedPanelScoredEarly,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSealedPanelScoredEarly", name := "Sealed panel scored early", text := "The fresh panel is scored before the DEV decision, so the pass is not a confirmation.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
definition{
name: modeledThreatSingleSeedWinReported,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSingleSeedWinReported", name := "Single-seed win reported", text := "One seed's score above the target is reported as a pass while the other seed misses it.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatSubstitutedHolo,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSubstitutedHolo", name := "Substituted holo", text := "A holo other than the one the build verified is served under the app address.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}
definition{
name: modeledThreatSubstitutedHost,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSubstitutedHost", name := "Substituted host", text := "Something other than the repository Pages workflow serves pages under its address.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}
definition{
name: modeledThreatTamperedModel,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatTamperedModel", name := "Tampered model", text := "The model the holo is built from differs from the reviewed prompt and spec.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
definition{
name: modeledThreatTargetBelowTheNoiseFloor,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatTargetBelowTheNoiseFloor", name := "Target below the noise floor", text := "A caller sends a target below T2 plus 24, so a noise-level gain passes.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
definition{
name: modeledControlBothSeedsBar,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBothSeedsBar", name := "Both seeds bar", text := "Each seed must reach the target.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "R4SeedGateProofs::inv001Holds"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "R4SeedGateProofs::inv002Holds"}) (nil Production.ThreatModel::Evidence)))})
}
definition{
name: modeledControlBoundedRequest,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBoundedRequest", name := "Bounded request", text := "dispatch answers invalid for a request over 136 bytes before reading a field, and the guest allocates at most 272.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlFingerprintAndProvenance,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlFingerprintAndProvenance", name := "Fingerprint and provenance", text := "The page verifies the holo digests before it runs, and the build signs its provenance as the repository workflow.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "actions/attest-build-provenance in the pages workflow"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prism-code check of the holo identities in the page"}) (nil Production.ThreatModel::Evidence)))})
}
definition{
name: 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 pass when seed1 is below target. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "R4SeedGateProofs::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 pass when seed2 is below target. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "R4SeedGateProofs::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 pass when seed1 is at most unigram. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "R4SeedGateProofs::inv003Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlRegeneratedFromThePrompt,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlRegeneratedFromThePrompt", name := "Regenerated from the prompt", text := "The model is written from the prompt by the builder, and the build checks every theorem and replays every vector in the pinned SDK.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prismpm verify in the SDK image prismpm.lock pins"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "app/prompt.json"}) (nil Production.ThreatModel::Evidence)))})
}
definition{
name: modeledControlStrictDecoder,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlStrictDecoder", name := "Strict decoder", text := "Every field is decoded exactly: choices from their list, numbers as plain decimal digits within their bounds, single spaces between fields; anything else is invalid.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: mappingSingleSeedWinReported,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatSingleSeedWinReported", controls := (cons "Security::controlBothSeedsBar" (nil String))})
}
definition{
name: mappingOversizedRequest,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatOversizedRequest", controls := (cons "Security::controlBoundedRequest" (nil String))})
}
definition{
name: mappingSubstitutedHolo,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatSubstitutedHolo", controls := (cons "Security::controlFingerprintAndProvenance" (nil String))})
}
definition{
name: mappingGrantedCapability,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatGrantedCapability", controls := (cons "Security::controlNoCapabilityGranted" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV001,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV001", controls := (cons "Security::controlProofOfINV001" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV002,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV002", controls := (cons "Security::controlProofOfINV002" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV003,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV003", controls := (cons "Security::controlProofOfINV003" (nil String))})
}
definition{
name: mappingTamperedModel,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatTamperedModel", controls := (cons "Security::controlRegeneratedFromThePrompt" (nil String))})
}
definition{
name: mappingMalformedRequest,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatMalformedRequest", controls := (cons "Security::controlStrictDecoder" (nil String))})
}
definition{
name: acceptedSealedPanelScoredEarly,
parameters: [],
result: Production.ThreatModel::AcceptedRisk,
body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatSealedPanelScoredEarly", rationale := "refuse_sealed_fresh_source in the scorer guards the seal; this app only classifies counts."})
}
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."})
}
definition{
name: acceptedTargetBelowTheNoiseFloor,
parameters: [],
result: Production.ThreatModel::AcceptedRisk,
body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatTargetBelowTheNoiseFloor", rationale := "The target is computed by the pre-registered gate sheet before scoring; the app compares against the target it is given."})
}
\end{semanticmodule}
\end{lexlean}
app/src/R4SeedGate.lex.tex 269 lines
\begin{lexlean}{R4SeedGate}
\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: answerPass, parameters: [], result: Nat, body: 0}
definition{name: answerTrailsUnigram, parameters: [], result: Nat, body: 1}
definition{name: answerTrailsT2, parameters: [], result: Nat, body: 2}
definition{name: answerSplit, parameters: [], result: Nat, body: 3}
definition{name: answerInsideBand, parameters: [], result: Nat, body: 4}
structure{
name: Request,
type_parameters: [],
parameters: [],
fields: [
{name: seed1, type: Nat},
{name: seed2, type: Nat},
{name: unigram, type: Nat},
{name: t2, type: Nat},
{name: target, 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: parseSeed1,
parameters: [value : Bytes],
result: (Option Nat),
body: (match (parseNumber value)
| Option.none => (ctor Option.none [Nat])
| Option.some parsed => (if (10000000 <? parsed) then (ctor Option.none [Nat]) else (ctor Option.some [Nat] parsed))),
axioms: [Quot.sound, propext]
}
definition{
name: parseSeed2,
parameters: [value : Bytes],
result: (Option Nat),
body: (match (parseNumber value)
| Option.none => (ctor Option.none [Nat])
| Option.some parsed => (if (10000000 <? parsed) then (ctor Option.none [Nat]) else (ctor Option.some [Nat] parsed))),
axioms: [Quot.sound, propext]
}
definition{
name: parseUnigram,
parameters: [value : Bytes],
result: (Option Nat),
body: (match (parseNumber value)
| Option.none => (ctor Option.none [Nat])
| Option.some parsed => (if (10000000 <? parsed) then (ctor Option.none [Nat]) else (ctor Option.some [Nat] parsed))),
axioms: [Quot.sound, propext]
}
definition{
name: parseT2,
parameters: [value : Bytes],
result: (Option Nat),
body: (match (parseNumber value)
| Option.none => (ctor Option.none [Nat])
| Option.some parsed => (if (10000000 <? parsed) then (ctor Option.none [Nat]) else (ctor Option.some [Nat] parsed))),
axioms: [Quot.sound, propext]
}
definition{
name: parseTarget,
parameters: [value : Bytes],
result: (Option Nat),
body: (match (parseNumber value)
| Option.none => (ctor Option.none [Nat])
| Option.some parsed => (if (10000000 <? parsed) then (ctor Option.none [Nat]) else (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: decodeField5,
parameters: [s : Bytes, start : Nat, v1 : Nat, v2 : Nat, v3 : Nat, v4 : Nat],
result: (Option Request),
body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseTarget (sliceOf s start (prim subtract e start : Nat)))
| Option.none => (ctor Option.none [Request])
| Option.some v5 => (if (e =? (Foundation.Bytes::byteLength s)) then (ctor Option.some [Request] (record Request {seed1 := v1, seed2 := v2, unigram := v3, t2 := v4, target := v5})) else (ctor Option.none [Request])))),
axioms: [Quot.sound, propext]
}
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 (parseT2 (sliceOf s start (prim subtract e start : Nat)))
| Option.none => (ctor Option.none [Request])
| Option.some v4 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField5 s (e + 1) v1 v2 v3 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 (parseUnigram (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 (parseSeed2 (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 (parseSeed1 (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 seed1) <=? (project request unigram))
}
definition{
name: rule2,
parameters: [request : Request],
result: Bool,
body: ((project request seed2) <=? (project request unigram))
}
definition{
name: rule3,
parameters: [request : Request],
result: Bool,
body: (((project request seed1) <? (project request t2)) && ((project request seed2) <? (project request t2)))
}
definition{
name: rule4,
parameters: [request : Request],
result: Bool,
body: (((project request target) <=? (project request seed1)) && ((project request seed2) <? (project request target)))
}
definition{
name: rule5,
parameters: [request : Request],
result: Bool,
body: (((project request target) <=? (project request seed2)) && ((project request seed1) <? (project request target)))
}
definition{
name: rule6,
parameters: [request : Request],
result: Bool,
body: ((project request seed1) <? (project request target))
}
definition{
name: judge,
parameters: [request : Request],
result: Nat,
body: (if (rule1 request) then (answerTrailsUnigram) else (if (rule2 request) then (answerTrailsUnigram) else (if (rule3 request) then (answerTrailsT2) else (if (rule4 request) then (answerSplit) else (if (rule5 request) then (answerSplit) else (if (rule6 request) then (answerInsideBand) else (answerPass)))))))
}
definition{
name: encodeAnswer,
parameters: [code : Nat],
result: Bytes,
body: (if (code =? (answerPass)) then 0x70617373 else (if (code =? (answerTrailsUnigram)) then 0x747261696c732d756e696772616d else (if (code =? (answerTrailsT2)) then 0x747261696c732d7432 else (if (code =? (answerSplit)) then 0x73706c6974 else (if (code =? (answerInsideBand)) then 0x696e736964652d62616e64 else 0x696e76616c6964)))))
}
definition{
name: dispatch,
parameters: [value : Bytes],
result: Bytes,
body: (if (136 <? (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 := "Two-seed bar", cargoName := "prism-r4-seed-gate", cargoVersion := "0.1.0", cargoDescription := "Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread).", cargoRepository := "https://github.com/UOR-Foundation/PrismPM", cargoHomepage := "https://github.com/UOR-Foundation/PrismPM", libraryRoots := (cons "PrismR4SeedGate.R4SeedGate.dispatch" (nil String)), acceptanceVectors := (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x373030322037303031203132323620363330302036333234, response := 0x70617373}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x32373238363720323334383932203230303030302032353636363020323934363335, response := 0x696e736964652d62616e64}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x34353520333731203132323620363330302036333834, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x353030392035303030203132323620363330302036333234, response := 0x747261696c732d7432}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x363430302036333330203132323620363330302036333730, response := 0x73706c6974}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020302030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020302031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020312030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020312031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020302030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020302031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020302032, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020312030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020312031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020312032, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020322030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020322031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203020322032, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203120302031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203120312030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203120312031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203120312032, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031203120322031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x312030203020302030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x312030203020302031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x312030203020302032, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x312030203020312030, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x312030203020312031, response := 0x747261696c732d756e696772616d}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x312030203020312032, response := 0x747261696c732d756e696772616d}) (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 := 0x30203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020302030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30202030202030202030202030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30372030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x2d312030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x2b312030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x313030303030303030303030303030303030302030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0xd9a12030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x782030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x31303030303030312030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203037203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30202d31203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30202b31203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302031303030303030303030303030303030303030203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020d9a1203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302078203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203130303030303031203020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020303720302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030202d3120302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030202b3120302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203130303030303030303030303030303030303020302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020d9a120302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030207820302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020313030303030303120302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020302030372030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020302030202d312030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020302030202b312030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020313030303030303030303030303030303030302030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020d9a12030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020782030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020302031303030303030312030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020302030203037, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020302030202d31, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020302030202b31, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020302031303030303030303030303030303030303030, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020302030203020d9a1, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302030203020302078, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30203020302030203130303030303031, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x78787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (nil Foundation.View.Text.V1.Model::AcceptanceVector))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))), entryRoot := "PrismR4SeedGate.R4SeedGate.dispatch", coreContract := "hologram:guest/core-wasm@1", requestMaximum := (136 : UInt32), responseMaximum := (64 : UInt32), guestAllocationMaximum := (272 : UInt32), capabilitiesEmpty := true, fatArchive := true, primaryLayer := (0 : UInt8), viewLayer := (1 : UInt8), view := (record Foundation.View.Text.V1.Model::TextView {title := "Two-seed bar", heading := "Two-seed bar", inputLabel := "Request: seed1 seed2 unigram t2 target", submitLabel := "Decide", outputLabel := "Answer", inputError := "Invalid request", responseError := "Invalid response"})})
}
\end{semanticmodule}
\end{lexlean}
app/src/R4SeedGateProofs.lex.tex 102 lines
\begin{lexlean}{R4SeedGateProofs}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{R4SeedGate}
\title{Text application model}
\begin{semanticmodule}
definition{
name: breaksInv001,
parameters: [request : R4SeedGate::Request],
result: Bool,
body: ((((((((project request seed1) <=? 10000000) && ((project request seed2) <=? 10000000)) && ((project request unigram) <=? 10000000)) && ((project request t2) <=? 10000000)) && ((project request target) <=? 10000000)) && ((project request seed1) <? (project request target))) && ((R4SeedGate::judge request) =? (R4SeedGate::answerPass)))
}
theorem{
name: inv001Holds,
parameters: [request : R4SeedGate::Request],
statement: ((breaksInv001 request) = false),
proof: linear_arithmetic{
definitions: [
R4SeedGate::answerInsideBand,
R4SeedGate::answerPass,
R4SeedGate::answerSplit,
R4SeedGate::answerTrailsT2,
R4SeedGate::answerTrailsUnigram,
R4SeedGate::judge,
R4SeedGate::rule1,
R4SeedGate::rule2,
R4SeedGate::rule3,
R4SeedGate::rule4,
R4SeedGate::rule5,
R4SeedGate::rule6,
breaksInv001
]
},
axioms: [Quot.sound, propext]
}
definition{
name: breaksInv002,
parameters: [request : R4SeedGate::Request],
result: Bool,
body: ((((((((project request seed1) <=? 10000000) && ((project request seed2) <=? 10000000)) && ((project request unigram) <=? 10000000)) && ((project request t2) <=? 10000000)) && ((project request target) <=? 10000000)) && ((project request seed2) <? (project request target))) && ((R4SeedGate::judge request) =? (R4SeedGate::answerPass)))
}
theorem{
name: inv002Holds,
parameters: [request : R4SeedGate::Request],
statement: ((breaksInv002 request) = false),
proof: linear_arithmetic{
definitions: [
R4SeedGate::answerInsideBand,
R4SeedGate::answerPass,
R4SeedGate::answerSplit,
R4SeedGate::answerTrailsT2,
R4SeedGate::answerTrailsUnigram,
R4SeedGate::judge,
R4SeedGate::rule1,
R4SeedGate::rule2,
R4SeedGate::rule3,
R4SeedGate::rule4,
R4SeedGate::rule5,
R4SeedGate::rule6,
breaksInv002
]
},
axioms: [Classical.choice, Quot.sound, propext]
}
definition{
name: breaksInv003,
parameters: [request : R4SeedGate::Request],
result: Bool,
body: ((((((((project request seed1) <=? 10000000) && ((project request seed2) <=? 10000000)) && ((project request unigram) <=? 10000000)) && ((project request t2) <=? 10000000)) && ((project request target) <=? 10000000)) && ((project request seed1) <=? (project request unigram))) && ((R4SeedGate::judge request) =? (R4SeedGate::answerPass)))
}
theorem{
name: inv003Holds,
parameters: [request : R4SeedGate::Request],
statement: ((breaksInv003 request) = false),
proof: linear_arithmetic{
definitions: [
R4SeedGate::answerInsideBand,
R4SeedGate::answerPass,
R4SeedGate::answerSplit,
R4SeedGate::answerTrailsT2,
R4SeedGate::answerTrailsUnigram,
R4SeedGate::judge,
R4SeedGate::rule1,
R4SeedGate::rule2,
R4SeedGate::rule3,
R4SeedGate::rule4,
R4SeedGate::rule5,
R4SeedGate::rule6,
breaksInv003
]
},
axioms: [Quot.sound, propext]
}
\end{semanticmodule}
\end{lexlean}
app/lexlean.toml 43 lines
spec = "lexlean/project/1"
name = "prism-r4-seed-gate"
language = "1.2"
module_prefix = "PrismR4SeedGate"
source_roots = ["src"]
entrypoints = ["src/Architecture.lex.tex", "src/Compliance.lex.tex", "src/Design.lex.tex", "src/Features.lex.tex", "src/Quality.lex.tex", "src/R4SeedGate.lex.tex", "src/R4SeedGateProofs.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 355 lines
{
"schema": "prism/prompt/1",
"pattern": "decisionTable",
"goal": "Decide if a two-seed UOR-R4 run beats its baselines, so a result inside the noise is never called a win.",
"repository": "UOR-Foundation/uor-r4",
"license": "MIT",
"app": {
"name": "r4-seed-gate",
"title": "Two-seed bar",
"purpose": "Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread).",
"fields": [
{
"name": "seed1",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the seed 1 artifact gets right"
},
{
"name": "seed2",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the seed 2 artifact gets right"
},
{
"name": "unigram",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the unigram table gets right"
},
{
"name": "t2",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "rows the T2 previous-word table gets right"
},
{
"name": "target",
"kind": "number",
"min": 0,
"max": 10000000,
"means": "the required target: T2 plus max(24, the absolute difference of the two seeds)"
}
],
"outcomes": [
"pass",
"trails-unigram",
"trails-t2",
"split",
"inside-band"
],
"meanings": {
"pass": "both seeds beat the unigram table and reach the target",
"trails-unigram": "a seed does not beat the unigram table",
"trails-t2": "both seeds score below T2",
"split": "one seed reaches the target and the other does not",
"inside-band": "both seeds miss the target, at least one at or above T2: inside the noise band, not a win"
},
"rules": [
{
"when": [
{
"field": "seed1",
"op": "<=",
"value": {
"field": "unigram"
}
}
],
"then": "trails-unigram",
"why": "docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed"
},
{
"when": [
{
"field": "seed2",
"op": "<=",
"value": {
"field": "unigram"
}
}
],
"then": "trails-unigram",
"why": "docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed"
},
{
"when": [
{
"field": "seed1",
"op": "<",
"value": {
"field": "t2"
}
},
{
"field": "seed2",
"op": "<",
"value": {
"field": "t2"
}
}
],
"then": "trails-t2",
"why": "README.md: the first human-text runs trail the baselines"
},
{
"when": [
{
"field": "seed1",
"op": ">=",
"value": {
"field": "target"
}
},
{
"field": "seed2",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "split",
"why": "README.md: one seed ahead and one behind is not a win; the bar holds at both seeds"
},
{
"when": [
{
"field": "seed2",
"op": ">=",
"value": {
"field": "target"
}
},
{
"field": "seed1",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "split",
"why": "README.md: one seed ahead and one behind is not a win; the bar holds at both seeds"
},
{
"when": [
{
"field": "seed1",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "inside-band",
"why": "docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: >= T2 + max(24, |s1 - s2|); README.md: the 6 Nov best run is inside the noise band, not a win"
}
],
"otherwise": "pass",
"otherwiseWhy": "docs/labs/m1-close-saved-model/README.md bar (d): both seeds beat Unigram and reach the T2 target, as 7,002 and 7,001 against 6,324 did",
"properties": [
{
"kind": "never",
"when": [
{
"field": "seed1",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "pass",
"why": "a seed below the target is not a pass"
},
{
"kind": "never",
"when": [
{
"field": "seed2",
"op": "<",
"value": {
"field": "target"
}
}
],
"then": "pass",
"why": "a seed below the target is not a pass"
},
{
"kind": "never",
"when": [
{
"field": "seed1",
"op": "<=",
"value": {
"field": "unigram"
}
}
],
"then": "pass",
"why": "a model that does not beat word frequency has learned nothing"
}
],
"examples": [
{
"request": "7002 7001 1226 6300 6324",
"response": "pass"
},
{
"request": "272867 234892 200000 256660 294635",
"response": "inside-band"
},
{
"request": "455 371 1226 6300 6384",
"response": "trails-unigram"
},
{
"request": "5009 5000 1226 6300 6324",
"response": "trails-t2"
},
{
"request": "6400 6330 1226 6300 6370",
"response": "split"
}
]
},
"stakeholders": [
{
"name": "Researcher",
"text": "Runs training experiments and needs each two-seed result classified by the pre-registered bar, negative results included.",
"concerns": [
"Correct answers",
"Proved guarantees"
]
},
{
"name": "Reviewer",
"text": "Reads the research notebook and needs no result inside the noise band or at one seed reported as a win.",
"concerns": [
"Proved guarantees",
"Refused malformed requests"
]
}
],
"components": [
{
"name": "d11-scorer",
"text": "The artifact scorer that counts each seed's top-1 rows on a panel.",
"kind": "cliAdapter"
},
{
"name": "Research notebook",
"text": "docs/research/notebook, where every result is one row.",
"kind": "externalSystem"
}
],
"threats": [
{
"name": "Single-seed win reported",
"text": "One seed's score above the target is reported as a pass while the other seed misses it.",
"stride": "repudiation",
"asset": "answer",
"likelihood": "high",
"impact": "major",
"control": {
"name": "Both seeds bar",
"text": "Each seed must reach the target.",
"evidence": [
{
"kind": "proof",
"reference": "R4SeedGateProofs::inv001Holds"
},
{
"kind": "proof",
"reference": "R4SeedGateProofs::inv002Holds"
}
]
}
},
{
"name": "Target below the noise floor",
"text": "A caller sends a target below T2 plus 24, so a noise-level gain passes.",
"stride": "tampering",
"asset": "request",
"likelihood": "medium",
"impact": "major",
"accepted": "The target is computed by the pre-registered gate sheet before scoring; the app compares against the target it is given."
},
{
"name": "Sealed panel scored early",
"text": "The fresh panel is scored before the DEV decision, so the pass is not a confirmation.",
"stride": "tampering",
"asset": "source",
"likelihood": "low",
"impact": "major",
"accepted": "refuse_sealed_fresh_source in the scorer guards the seal; this app only classifies counts."
}
],
"quality": [
{
"characteristic": "Functional suitability",
"subcharacteristic": "Functional correctness",
"requirement": "Both seeds required",
"text": "A pass needs both of the two seeds to reach the target.",
"measure": "Seeds required",
"measureText": "Seeds that must reach the target before pass.",
"threshold": 2
},
{
"characteristic": "Reliability",
"subcharacteristic": "Faultlessness",
"requirement": "No noise-band win",
"text": "No result with a seed below the target is answered pass.",
"measure": "Noise-band passes",
"measureText": "Acceptance vectors with a seed below the target answered pass.",
"threshold": 0
}
],
"journeys": [
{
"stakeholder": "Researcher",
"steps": [
"REQ-001",
"REQ-003",
"REQ-006",
"otherwise"
]
},
{
"stakeholder": "Reviewer",
"steps": [
"REQ-004",
"REQ-005",
"INV-001",
"INV-002",
"INV-003",
"refuse"
]
}
],
"axioms": {
"inv002Holds": [
"Classical.choice",
"Quot.sound",
"propext"
]
},
"concerns": []
}
model/ids.toml 59 lines
# model/ids.toml --- the conformance ID register.
#
# Every ID this repository claims, in one place, so that nothing is referenced
# without being defined. `CONFORMANCE.md` is generated from this file. A test
# whose name ends in an ID not listed here fails `check-model`, and an ID listed
# here with no scenario and no test fails it too (CM-02).
#
# `level` is the honesty level (R2):
# some-true a fact reproduced from an authority; not established here
# build constructed here and validated against its oracle
# open measured and reported, never asserted
#
# Every row here has a scenario in `features/suites/` and a test whose name ends
# in the ID, lowercased with underscores (R3, CM-02). There is no "pending"
# state: a capability that is not built does not get a row, and every row in this
# file is built.
#
# The first row is the template's own Prism application in `app/` (TC-01).
# A capability starts with a row here; `just new-capability` writes the row,
# its scenario and its failing test in the order `AGENTS.md` sets out.
spec = "template/1"
[[id]]
id = "RS-01"
level = "build"
suite = "r4_seed_gate"
statement = "The app never answers pass when seed1 is below target"
[[id]]
id = "RS-02"
level = "build"
suite = "r4_seed_gate"
statement = "The app never answers pass when seed2 is below target"
[[id]]
id = "RS-03"
level = "build"
suite = "r4_seed_gate"
statement = "The app never answers pass when seed1 is at most unigram"
[[id]]
id = "RS-04"
level = "build"
suite = "r4_seed_gate"
statement = "The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references"
[[id]]
id = "RS-05"
level = "build"
suite = "r4_seed_gate"
statement = "The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared"
[[id]]
id = "RS-06"
level = "build"
suite = "r4_seed_gate"
statement = "Every compliance obligation is numbered in order and names its evidence"
features/suites/r4_seed_gate.feature 38 lines
Feature: r4_seed_gate
This repository's Prism application, in app/, generated by prism-code from its
spec: Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread).
@RS-01 @build
Scenario: The app never answers pass when seed1 is below target
Given the model in app/src/R4SeedGate.lex.tex
When the Lean kernel checks inv001Holds during prismpm verify
Then no request meets breaksInv001
@RS-02 @build
Scenario: The app never answers pass when seed2 is below target
Given the model in app/src/R4SeedGate.lex.tex
When the Lean kernel checks inv002Holds during prismpm verify
Then no request meets breaksInv002
@RS-03 @build
Scenario: The app never answers pass when seed1 is at most unigram
Given the model in app/src/R4SeedGate.lex.tex
When the Lean kernel checks inv003Holds during prismpm verify
Then no request meets breaksInv003
@RS-04 @build
Scenario: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
Given the model in app/src/Architecture.lex.tex
When the Lean kernel checks architectureDescriptionHolds during prismpm verify
Then the architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
@RS-05 @build
Scenario: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
Given the model in app/src/Quality.lex.tex
When the Lean kernel checks qualityModelHolds during prismpm verify
Then the ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
@RS-06 @build
Scenario: Every compliance obligation is numbered in order and names its evidence
Given the model in app/src/Compliance.lex.tex
When the Lean kernel checks everyObligationEvidenced during prismpm verify
Then every compliance obligation is numbered in order and names its evidence
crates/conformance/tests/r4_seed_gate.rs 122 lines
//! The `r4_seed_gate` suite: one test per scenario in `features/suites/r4_seed_gate.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/R4SeedGateProofs.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"
);
}
/// `RS-01`: The app never answers pass when seed1 is below target
#[test]
fn r4_seed_gate_rs_01() {
pinned(
"breaksInv001",
"body: ((((((((project request seed1) <=? 10000000) && ((project request seed2) <=? 10000000)) && ((project request unigram) <=? 10000000)) && ((project request t2) <=? 10000000)) && ((project request target) <=? 10000000)) && ((project request seed1) <? (project request target))) && ((R4SeedGate::judge request) =? (R4SeedGate::answerPass)))",
"inv001Holds",
);
}
/// `RS-02`: The app never answers pass when seed2 is below target
#[test]
fn r4_seed_gate_rs_02() {
pinned(
"breaksInv002",
"body: ((((((((project request seed1) <=? 10000000) && ((project request seed2) <=? 10000000)) && ((project request unigram) <=? 10000000)) && ((project request t2) <=? 10000000)) && ((project request target) <=? 10000000)) && ((project request seed2) <? (project request target))) && ((R4SeedGate::judge request) =? (R4SeedGate::answerPass)))",
"inv002Holds",
);
}
/// `RS-03`: The app never answers pass when seed1 is at most unigram
#[test]
fn r4_seed_gate_rs_03() {
pinned(
"breaksInv003",
"body: ((((((((project request seed1) <=? 10000000) && ((project request seed2) <=? 10000000)) && ((project request unigram) <=? 10000000)) && ((project request t2) <=? 10000000)) && ((project request target) <=? 10000000)) && ((project request seed1) <=? (project request unigram))) && ((R4SeedGate::judge request) =? (R4SeedGate::answerPass)))",
"inv003Holds",
);
}
/// `RS-04`: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
#[test]
fn r4_seed_gate_rs_04() {
holds(
"app/src/Architecture.lex.tex",
"architectureDescriptionHolds",
"((architectureValid) = true)",
);
}
/// `RS-05`: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
#[test]
fn r4_seed_gate_rs_05() {
holds(
"app/src/Quality.lex.tex",
"qualityModelHolds",
"((qualityValid) = true)",
);
}
/// `RS-06`: Every compliance obligation is numbered in order and names its evidence
#[test]
fn r4_seed_gate_rs_06() {
holds(
"app/src/Compliance.lex.tex",
"everyObligationEvidenced",
"((obligationsEvidenced 0 (obligations)) = true)",
);
}
site/app.json 104 lines
{
"name": "Two-seed bar",
"shortName": "Two-seed",
"live": "https://uor-foundation.github.io/uor-r4/",
"purpose": "Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread). Send seed1, seed2, unigram, t2 or target, separated by spaces; it answers pass, trails-unigram, trails-t2, split or inside-band, and invalid request for anything else.",
"inputLabel": "Request: seed1 seed2 unigram t2 target",
"placeholder": "7002 7001 1226 6300 6324",
"submitLabel": "Decide",
"outputLabel": "Answer",
"answers": {
"positive": [
"pass"
],
"negative": [
"trails-unigram",
"trails-t2",
"split",
"inside-band"
],
"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": "RS-01: the app never answers pass when seed1 is below target. RS-02: the app never answers pass when seed2 is below target. RS-03: the app never answers pass when seed1 is at most unigram.",
"proposition": {
"name": "judge",
"text": "judge request :=\n seed1 is at most unigram → trails-unigram\n seed2 is at most unigram → trails-unigram\n seed1 is below t2 and seed2 is below t2 → trails-t2\n seed1 is at least target and seed2 is below target → split\n seed2 is at least target and seed1 is below target → split\n seed1 is below target → inside-band\n otherwise → pass",
"plain": "Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread)."
},
"theorems": [
{
"name": "inv001Holds",
"statement": "no request meets breaksInv001: the app never answers pass when seed1 is below target",
"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/R4SeedGateProofs.lex.tex"
},
{
"name": "inv002Holds",
"statement": "no request meets breaksInv002: the app never answers pass when seed2 is below target",
"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/R4SeedGateProofs.lex.tex"
},
{
"name": "inv003Holds",
"statement": "no request meets breaksInv003: the app never answers pass when seed1 is at most unigram",
"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/R4SeedGateProofs.lex.tex"
}
],
"pinned": [
{
"name": "r4_seed_gate_rs_01",
"what": "RS-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/r4_seed_gate.rs"
},
{
"name": "r4_seed_gate_rs_02",
"what": "RS-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/r4_seed_gate.rs"
},
{
"name": "r4_seed_gate_rs_03",
"what": "RS-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/r4_seed_gate.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/uor-r4/actions/workflows/bootstrap.yml"
},
"build": {
"id": "printed by prismpm verify in every pages run",
"url": "https://github.com/UOR-Foundation/uor-r4/actions/workflows/pages.yml"
}
},
"repository": "https://github.com/UOR-Foundation/uor-r4",
"report": "https://github.com/UOR-Foundation/uor-r4/blob/main/TEMPLATE-VERIFICATION.md"
}
openspec/specs/r4-seed-gate/spec.md 183 lines
# r4-seed-gate Specification
<!-- Generated by Prism from prism/spec.json. Change the app through your agent with /prism, not by editing this file. -->
## Purpose
Two-seed bar: Decide whether a saved UOR-R4 model passes the two-seed bar on a test panel, from each seed's top-1 rows right, the unigram baseline and the required target T2 plus max(24, the seeds' spread).
## Requirements
### Requirement: Never pass when seed1 is below target
The app SHALL NOT answer `pass` when seed1 is below target, because a seed below the target is not a pass.
Verified: to be proved by Lean for every request (INV-001, theorem `inv001Holds`).
#### Scenario: INV-001 holds
- **WHEN** the request is `272867 234892 200000 256660 294635` (an acceptance example)
- **THEN** the answer SHALL NOT be `pass`
- **AND** the app answers `inside-band`, decided by REQ-006
### Requirement: Never pass when seed2 is below target
The app SHALL NOT answer `pass` when seed2 is below target, because a seed below the target is not a pass.
Verified: to be proved by Lean for every request (INV-002, theorem `inv002Holds`).
#### Scenario: INV-002 holds
- **WHEN** the request is `272867 234892 200000 256660 294635` (an acceptance example)
- **THEN** the answer SHALL NOT be `pass`
- **AND** the app answers `inside-band`, decided by REQ-006
### Requirement: Never pass when seed1 is at most unigram
The app SHALL NOT answer `pass` when seed1 is at most unigram, because a model that does not beat word frequency has learned nothing.
Verified: to be proved by Lean for every request (INV-003, theorem `inv003Holds`).
#### Scenario: INV-003 holds
- **WHEN** the request is `455 371 1226 6300 6384` (an acceptance example)
- **THEN** the answer SHALL NOT be `pass`
- **AND** the app answers `trails-unigram`, decided by REQ-001
### Requirement: REQ-001 trails-unigram when seed1 is at most unigram
The app SHALL answer `trails-unigram` when seed1 is at most unigram, because docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed.
Verified: tested by the acceptance vectors (`rule1`).
#### Scenario: REQ-001 decides
- **WHEN** the request is `455 371 1226 6300 6384` (an acceptance example)
- **THEN** the answer SHALL be `trails-unigram`, decided by REQ-001
### Requirement: REQ-002 trails-unigram when seed2 is at most unigram
The app SHALL answer `trails-unigram` when seed2 is at most unigram and no earlier rule matches, because docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: d11_top1 > unigram for each seed.
Verified: tested by the acceptance vectors (`rule2`).
#### Scenario: REQ-002 decides
- **WHEN** the request is `1 0 0 0 0`
- **THEN** the answer SHALL be `trails-unigram`, decided by REQ-002
### Requirement: REQ-003 trails-t2 when seed1 is below t2 and seed2 is below t2
The app SHALL answer `trails-t2` when seed1 is below t2 and seed2 is below t2 and no earlier rule matches, because README.md: the first human-text runs trail the baselines.
Verified: tested by the acceptance vectors (`rule3`).
#### Scenario: REQ-003 decides
- **WHEN** the request is `5009 5000 1226 6300 6324` (an acceptance example)
- **THEN** the answer SHALL be `trails-t2`, decided by REQ-003
### Requirement: REQ-004 split when seed1 is at least target and seed2 is below target
The app SHALL answer `split` when seed1 is at least target and seed2 is below target and no earlier rule matches, because README.md: one seed ahead and one behind is not a win; the bar holds at both seeds.
Verified: tested by the acceptance vectors (`rule4`).
#### Scenario: REQ-004 decides
- **WHEN** the request is `6400 6330 1226 6300 6370` (an acceptance example)
- **THEN** the answer SHALL be `split`, decided by REQ-004
### Requirement: REQ-005 split when seed2 is at least target and seed1 is below target
The app SHALL answer `split` when seed2 is at least target and seed1 is below target and no earlier rule matches, because README.md: one seed ahead and one behind is not a win; the bar holds at both seeds.
Verified: tested by the acceptance vectors (`rule5`).
#### Scenario: REQ-005 decides
- **WHEN** the request is `1 2 0 0 2`
- **THEN** the answer SHALL be `split`, decided by REQ-005
### Requirement: REQ-006 inside-band when seed1 is below target
The app SHALL answer `inside-band` when seed1 is below target and no earlier rule matches, because docs/research/notebook/m1-discrete-attention.md G-Fresh-Gate: >= T2 + max(24, |s1 - s2|); README.md: the 6 Nov best run is inside the noise band, not a win.
Verified: tested by the acceptance vectors (`rule6`).
#### Scenario: REQ-006 decides
- **WHEN** the request is `272867 234892 200000 256660 294635` (an acceptance example)
- **THEN** the answer SHALL be `inside-band`, decided by REQ-006
### Requirement: Otherwise pass
The app SHALL answer `pass` when no rule matches, because docs/labs/m1-close-saved-model/README.md bar (d): both seeds beat Unigram and reach the T2 target, as 7,002 and 7,001 against 6,324 did.
Verified: tested by the acceptance vectors.
#### Scenario: No rule matches
- **WHEN** the request is `7002 7001 1226 6300 6324` (an acceptance example)
- **THEN** the answer SHALL be `pass`
### Requirement: The first matching rule decides
The app SHALL try REQ-001, REQ-002, REQ-003, REQ-004, REQ-005, REQ-006 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 `455 371 1226 6300 6384` (an acceptance example)
- **THEN** the answer SHALL be `trails-unigram`, decided by REQ-001, the earlier rule
### Requirement: Request and answers
The app SHALL read one request as one line of 5 fields separated by single spaces, in this order, and SHALL answer exactly one of `pass`, `trails-unigram`, `trails-t2`, `split`, `inside-band`, or `invalid` for anything else.
| Field | Accepts | Means |
| --- | --- | --- |
| `seed1` | whole number from 0 up to 10000000 | rows the seed 1 artifact gets right |
| `seed2` | whole number from 0 up to 10000000 | rows the seed 2 artifact gets right |
| `unigram` | whole number from 0 up to 10000000 | rows the unigram table gets right |
| `t2` | whole number from 0 up to 10000000 | rows the T2 previous-word table gets right |
| `target` | whole number from 0 up to 10000000 | the required target: T2 plus max(24, the absolute difference of the two seeds) |
| Answer | Means |
| --- | --- |
| `pass` | both seeds beat the unigram table and reach the target |
| `trails-unigram` | a seed does not beat the unigram table |
| `trails-t2` | both seeds score below T2 |
| `split` | one seed reaches the target and the other does not |
| `inside-band` | both seeds miss the target, at least one at or above T2: inside the noise band, not a win |
| `invalid` | the request is malformed |
Verified: reading a request is tested, not proved.
#### Scenario: A malformed request is invalid
- **WHEN** the request is not 5 fields in this order
- **THEN** the answer SHALL be `invalid`
## Examples
- `7002 7001 1226 6300 6324` gives `pass`
- `272867 234892 200000 256660 294635` gives `inside-band`
- `455 371 1226 6300 6384` gives `trails-unigram`
- `5009 5000 1226 6300 6324` gives `trails-t2`
- `6400 6330 1226 6300 6370` gives `split`
## 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/R4SeedGate.lex.tex` is the LexLean model generated from it. It is the single source of the app.
Words on this page 7
- 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.
- UOR
- Universal Object Reference: the UOR Foundation's framework for naming any object by its content.
- decision table
- A table of rules, as in OMG DMN 1.5: each row says which inputs lead to which outcome.