PrismDevRelOpen the app
Examples: Rule 30 cell

Overview

Example apps

Decision tables

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

Policy decisions

Open policyNamespace authorizationAxiom policyGNAF claim wordingEmporous admissionPortal publication

State machines

MCP task lifecycleContainer lifecycleAtlas walk controlsVault escrow lifecycleRelease lifecycleOrganization lifecycle

// example · Decision tables

Rule 30 cell

Find the next state of one Rule 30 cell from its neighbours, so every row of the pattern can be replayed and checked.

Inspired by afflom/rule30 (live). LexLean and Lean 4 formalization of Wolfram's Rule 30 with verified artifacts.

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

What the Rule 30 cell app does1. Request: left, center, right 2. 3 rules: the first that matches wins 3. Answer: off, on 4. Proved: 2 theorems, 19 tests01Requestleft, center,right023 rulesthe first thatmatches wins03Answeroff, on04Proved2 theorems, 19testsWhat the Rule 30 cell app does1. Request: left, center, right 2. 3 rules: the first that matches wins 3. Answer: off, on 4. Proved: 2 theorems, 19 tests01Requestleft, center, right023 rulesthe first that matches wins03Answeroff, on04Proved2 theorems, 19 tests
What the Rule 30 cell app does. A request goes in, the rules decide, and the Lean kernel has already proved what the rules promise.
The data in this figure
StepWhat happens
1. Requestleft, center, right
2. 3 rulesthe first that matches wins
3. Answeroff, on
4. Proved2 theorems, 19 tests
Fingerprint
eca1f4f622046d7be3ffd5a691eff31348096b18576de16e86ef3d7e528749b3
Acceptance vectors
19
Claims
5

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 298 lines
{
  "schema": "prism/prompt/1",
  "goal": "Find the next state of one Rule 30 cell from its neighbours, so every row of the pattern can be replayed and checked.",
  "pattern": "decisionTable",
  "repository": "afflom/rule30",
  "license": "MIT",
  "app": {
    "name": "rule-thirty-cell",
    "title": "Rule 30 cell",
    "purpose": "Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour.",
    "fields": [
      {
        "name": "left",
        "kind": "choice",
        "values": [
          "off",
          "on"
        ],
        "means": "the left neighbour now"
      },
      {
        "name": "center",
        "kind": "choice",
        "values": [
          "off",
          "on"
        ],
        "means": "the cell now"
      },
      {
        "name": "right",
        "kind": "choice",
        "values": [
          "off",
          "on"
        ],
        "means": "the right neighbour now"
      }
    ],
    "outcomes": [
      "off",
      "on"
    ],
    "meanings": {
      "on": "the cell is black in the next row",
      "off": "the cell is white in the next row"
    },
    "rules": [
      {
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "on"
          },
          {
            "field": "center",
            "op": "is",
            "value": "off"
          },
          {
            "field": "right",
            "op": "is",
            "value": "off"
          }
        ],
        "then": "on",
        "why": "rule30-lexlean/src/Core.lex.tex: rule a b c = bxor a (b || c), so 100 gives 1"
      },
      {
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "off"
          },
          {
            "field": "center",
            "op": "is",
            "value": "on"
          }
        ],
        "then": "on",
        "why": "rule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 010 and 011 give 1"
      },
      {
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "off"
          },
          {
            "field": "right",
            "op": "is",
            "value": "on"
          }
        ],
        "then": "on",
        "why": "rule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 001 gives 1"
      }
    ],
    "otherwise": "off",
    "otherwiseWhy": "rule30-lexlean/src/Core.lex.tex: bxor a (b || c) is 0 for 000, 101, 110 and 111",
    "properties": [
      {
        "kind": "never",
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "on"
          },
          {
            "field": "center",
            "op": "is",
            "value": "on"
          }
        ],
        "then": "on",
        "why": "Core.lex.tex: with a and b on, bxor true true is false, so 110 and 111 give 0"
      },
      {
        "kind": "always",
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "off"
          },
          {
            "field": "center",
            "op": "is",
            "value": "off"
          },
          {
            "field": "right",
            "op": "is",
            "value": "off"
          }
        ],
        "then": "off",
        "why": "a white neighbourhood stays white, the background of the Rule 30 diagram"
      }
    ],
    "examples": [
      {
        "request": "off off off",
        "response": "off"
      },
      {
        "request": "off off on",
        "response": "on"
      },
      {
        "request": "off on off",
        "response": "on"
      },
      {
        "request": "off on on",
        "response": "on"
      },
      {
        "request": "on off off",
        "response": "on"
      },
      {
        "request": "on off on",
        "response": "off"
      },
      {
        "request": "on on off",
        "response": "off"
      },
      {
        "request": "on on on",
        "response": "off"
      }
    ]
  },
  "stakeholders": [
    {
      "name": "Researcher",
      "text": "Studies the Rule 30 sequence for Prize Problem 1 and needs every cell of every row to be the one the rule gives.",
      "concerns": [
        "Correct answers",
        "Proved guarantees"
      ]
    },
    {
      "name": "Proof engineer",
      "text": "Extends the LexLean and Lean 4 formalization and needs the cell rule to stay the one Core.lex.tex and the prize kit define.",
      "concerns": [
        "Agreement with the prize kit",
        "Proved guarantees"
      ]
    }
  ],
  "concerns": [
    {
      "name": "Agreement with the prize kit",
      "text": "The local rule is the one Rule30PrizeKit defines, as rule30-bridge/Rule30Bridge.lean connects every paper theorem to Ruliology.CellularAutomata.Rule30Prize.",
      "model": "component"
    }
  ],
  "components": [
    {
      "name": "Rule30PrizeKit",
      "text": "The Rule 30 Prize kit, Ruliology.CellularAutomata.Rule30Prize, whose definitions the bridge module ties the LexLean theorems to.",
      "kind": "externalSystem"
    },
    {
      "name": "r30 command surface",
      "text": "bin/r30: status, frontier, theorem add, check, verify and axioms, also served as an MCP server.",
      "kind": "cliAdapter"
    }
  ],
  "threats": [
    {
      "name": "Rule drifts from the prize kit",
      "text": "The cell table differs from the Rule 30 the prize kit defines, so a replayed row is not the automaton the prize asks about.",
      "stride": "tampering",
      "asset": "source",
      "likelihood": "low",
      "impact": "critical",
      "control": {
        "name": "Bridged to the prize kit",
        "text": "Rule30Bridge.lean proves every LexLean paper theorem against the kit definition, and all eight neighbourhoods are acceptance examples.",
        "evidence": [
          {
            "kind": "review",
            "reference": "rule30-bridge/Rule30Bridge.lean"
          },
          {
            "kind": "gate",
            "reference": "make check-research"
          }
        ]
      }
    },
    {
      "name": "Classical choice in a proof",
      "text": "A proof of the rule depends on Classical.choice, which the repository forbids in its authored proof surfaces.",
      "stride": "tampering",
      "asset": "source",
      "likelihood": "low",
      "impact": "major",
      "control": {
        "name": "Choice forbidden",
        "text": "The kernel axiom audit accepts only propext and Quot.sound, and a source check rejects classical constants.",
        "evidence": [
          {
            "kind": "gate",
            "reference": "scripts/check_no_choice.py"
          },
          {
            "kind": "gate",
            "reference": "make check-research"
          }
        ]
      }
    },
    {
      "name": "Boundary cells guessed",
      "text": "A caller asks about a cell at the edge of a finite row and supplies a neighbour that is not in the row.",
      "stride": "tampering",
      "asset": "request",
      "likelihood": "medium",
      "impact": "minor",
      "accepted": "The app answers one neighbourhood exactly; the convention for cells beyond a finite row belongs to the caller that builds the row."
    }
  ],
  "quality": [
    {
      "characteristic": "Maintainability",
      "subcharacteristic": "Testability",
      "requirement": "Whole truth table pinned",
      "text": "Each of the eight neighbourhoods of three cells is an acceptance example, so the table is checked row by row against Core.lex.tex.",
      "measure": "Neighbourhoods without an example",
      "measureText": "Of the eight three-cell neighbourhoods, those no example states.",
      "threshold": 0
    }
  ],
  "journeys": [
    {
      "stakeholder": "Researcher",
      "steps": [
        "REQ-001",
        "REQ-002",
        "REQ-003",
        "otherwise",
        "INV-001",
        "INV-002"
      ]
    }
  ],
  "axioms": {}
}

What the app claims

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

Pattern

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

PatternStandardAnswers
Decision tableOMG DMN 1.5, hit policy FIRSToff, on
Rules for each answeroff: 0 rules; on: 3 rulesoff0 + defaulton3
Rules for each answer. Each bar counts the rules that give one answer. When no rule matches, the answer is off.
The data in this figure
rules
off0
on3

Behavior

A request is left, center, right, separated by spaces. The first rule that matches decides. If none matches, the answer is off. A request over 88 bytes, or in any other form, is answered invalid.

RuleWhenAnswerWhy
REQ-001left is on and center is off and right is offonrule30-lexlean/src/Core.lex.tex: rule a b c = bxor a (b || c), so 100 gives 1
REQ-002left is off and center is ononrule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 010 and 011 give 1
REQ-003left is off and right is ononrule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 001 gives 1
otherwiseno rule matchesoffrule30-lexlean/src/Core.lex.tex: bxor a (b || c) is 0 for 000, 101, 110 and 111

Properties Lean proves

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

PropertyStatementTheoremWhy
INV-001It never answers on when left is on and center is on.RuleThirtyCellProofs::inv001HoldsCore.lex.tex: with a and b on, bxor true true is false, so 110 and 111 give 0
INV-002It always answers off when left is off and center is off and right is off.RuleThirtyCellProofs::inv002Holdsa white neighbourhood stays white, the background of the Rule 30 diagram

Architecture

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

StakeholderWho they areConcerns
Proof engineerExtends the LexLean and Lean 4 formalization and needs the cell rule to stay the one Core.lex.tex and the prize kit define.Agreement with the prize kit, Proved guarantees
ResearcherStudies the Rule 30 sequence for Prize Problem 1 and needs every cell of every row to be the one the rule gives.Correct answers, Proved guarantees
VerifierAnyone who loads the holo, checks its fingerprint and replays its acceptance vectors before trusting an answer.Integrity of the published app, Refused malformed requests, Proved guarantees

Concerns

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

ConcernWhat it meansModel
Agreement with the prize kitThe local rule is the one Rule30PrizeKit defines, as rule30-bridge/Rule30Bridge.lean connects every paper theorem to Ruliology.CellularAutomata.Rule30Prize.component
Correct answersEvery well-formed request is answered by the first rule that matches it, or off when none does, as the spec states.quality
Integrity of the published appWhat a visitor runs is the holo the build verified, with its fingerprint and signed provenance beside it.security
Proved guaranteesEach of the 2 properties of the spec holds for every request, proved by the Lean kernel.quality
Refused malformed requestsA request that is not the 3 fields in order, or is longer than 88 bytes, is answered invalid and never guessed.security

Components

8 components and 11 edges between them.

ComponentKindWhat it is
BrowserexternalSystemThe visitor's web browser, which loads the page and runs the Rule 30 cell guest.
GitHub PagesexternalSystemServes the page and the holo from the repository Pages workflow.
Prism buildcliAdapterprismpm verify in the SDK image prismpm.lock pins: it checks every theorem, builds the guest and replays every vector.
r30 command surfacecliAdapterbin/r30: status, frontier, theorem add, check, verify and axioms, also served as an MCP server.
Rule 30 cell guestserviceThe Core-Wasm guest built from the model: it answers one request of at most 88 bytes with one answer of at most 64.
Rule 30 cell pagestaticSiteThe page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors.
Rule30PrizeKitexternalSystemThe Rule 30 Prize kit, Ruliology.CellularAutomata.Rule30Prize, whose definitions the bridge module ties the LexLean theorems to.
Source repositoryexternalSystemThe repository that holds the prompt, the model and its gate.

Design views

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

ViewDiagramViewpoint
Deciding a Rule 30 cell requestopmObjectProcessResearcher: Correct answers
Components of Rule 30 cellumlComponentVerifier: Integrity of the published app
Answering a Rule 30 cell requestumlSequenceResearcher: Correct answers
States of the Rule 30 cell guestumlStateMachineVerifier: Refused malformed requests

Features and journeys

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

Features and journeys 7 rows
FeatureCallsAccepted by
When left is on and center is off and right is off, the answer is on.RuleThirtyCell::rule1, RuleThirtyCell::judgeRuleThirtyCell::application
When left is off and center is on, the answer is on.RuleThirtyCell::rule2, RuleThirtyCell::judgeRuleThirtyCell::application
When left is off and right is on, the answer is on.RuleThirtyCell::rule3, RuleThirtyCell::judgeRuleThirtyCell::application
When no rule matches, the answer is off.RuleThirtyCell::judgeRuleThirtyCell::application
A request that is not left, center, right in order, separated by single spaces, or is over 88 bytes, is answered invalid.RuleThirtyCell::dispatch, RuleThirtyCell::decodeField1RuleThirtyCell::application
It never answers on when left is on and center is on.RuleThirtyCell::judgeRuleThirtyCellProofs::inv001Holds
It always answers off when left is off and center is off and right is off.RuleThirtyCell::judgeRuleThirtyCellProofs::inv002Holds

Journeys

The ordered features each stakeholder takes.

StakeholderSteps
Proof engineerREQ-001 → REQ-002 → REQ-003 → otherwise
ResearcherREQ-001 → REQ-002 → REQ-003 → otherwise → INV-001 → INV-002
Verifierrefuse → INV-001 → INV-002

Security and threat model

11 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 11 rows
ThreatSTRIDEAssetRiskAnswered by
Answer that breaks INV-001repudiationAnswermedium likelihood, critical impactProof of INV-001: proof RuleThirtyCellProofs::inv001Holds
Answer that breaks INV-002repudiationAnswermedium likelihood, critical impactProof of INV-002: proof RuleThirtyCellProofs::inv002Holds
Boundary cells guessedtamperingRequest bytesmedium likelihood, minor impactaccepted: The app answers one neighbourhood exactly; the convention for cells beyond a finite row belongs to the caller that builds the row.
Classical choice in a prooftamperingModel sourcelow likelihood, major impactChoice forbidden: gate scripts/check_no_choice.py; gate make check-research
Granted capabilityinformationDisclosureAnswerlow likelihood, major impactNo capability granted: gate prism-code check refuses an ungranted guest import
Malformed requesttamperingRequest byteshigh likelihood, major impactStrict decoder: gate malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify
Oversized requestdenialOfServiceRequest bytesmedium likelihood, minor impactBounded request: gate acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify
Rule drifts from the prize kittamperingModel sourcelow likelihood, critical impactBridged to the prize kit: review rule30-bridge/Rule30Bridge.lean; gate make check-research
Substituted holospoofingPublished hololow likelihood, critical impactFingerprint and provenance: gate actions/attest-build-provenance in the pages workflow; gate prism-code check of the holo identities in the page
Substituted hostspoofingPublished hololow likelihood, critical impactaccepted: A page cannot defend against its own host. The holo carries signed build provenance a visitor can check, and the app can be rebuilt from its prompt.
Tampered modeltamperingModel sourcelow likelihood, major impactRegenerated from the prompt: gate prismpm verify in the SDK image prismpm.lock pins; review app/prompt.json

Quality

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

Quality 7 rows
RequirementCharacteristicMeasureThreshold
Bounded allocation: The guest allocates at most 176 bytes for one request.Performance efficiency: Resource utilizationGuest allocation bytes176
Bounded request: A request over 88 bytes is refused before any field is read.Performance efficiency: Time behaviourRequest bytes read88
Every property proved: All 2 properties are theorems the Lean kernel checks.Security: IntegrityUnproved properties0
Every request answered: Every request gets an answer: a rule, off otherwise, or invalid.Functional suitability: Functional completenessUnanswered requests0
Every vector replays: All 19 acceptance vectors replay in the compiled guest, the shortest 0 bytes long.Reliability: FaultlessnessFailed vectors0
Examples answered as stated: Every one of the 8 examples of the spec is answered as it states.Functional suitability: Functional correctnessExample mismatches0
Whole truth table pinned: Each of the eight neighbourhoods of three cells is an acceptance example, so the table is checked row by row against Core.lex.tex.Maintainability: TestabilityNeighbourhoods without an example0

Compliance

One obligation per standard, each naming its evidence.

StandardSubjectEvidence
ISO/IEC/IEEE 42010:2022Architecture descriptionArchitecture::architectureDescriptionHolds
ISO/PAS 19450:2015 and OMG UML 2.5.1Design viewsDesign::viewOpmDecide, Design::viewUmlComponents, Design::viewUmlRequest, Design::viewUmlStates
ISO/IEC 25010:2023Product qualityQuality::qualityModelHolds
ISO/IEC 27034-1:2011 and ISO/IEC 27005:2022Application security and riskSecurity::controlSet
OMG DMN 1.5, hit policy FIRSTDecision tableRuleThirtyCell::judge
OpenSpecRequirementsRuleThirtyCell::application
SPDX MITLicensingRuleThirtyCell::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 Rule 30 cell request
Viewpoint: Architecture::viewpointResearcherCorrectAnswers
Notation: ISO/PAS 19450:2015 OPM, Prism OPL profile

componentBrowser is an object.
componentRule30CellGuest is an object.
componentRule30CellGuest can be stateDeciding or stateIdle.
processDecide is a process.
processEncodeAnswer is a process.
processJudge is a process.
processParseRequest is a process.
componentRule30CellGuest 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 Rule 30 cell
component "componentBrowser" as c0
component "componentGitHubPages" as c1
component "componentPrismBuild" as c2
component "componentR30CommandSurface" as c3
component "componentRule30CellGuest" as c4
component "componentRule30CellPage" as c5
component "componentRule30PrizeKit" as c6
component "componentSourceRepository" as c7
c0 --> c4 : edgeBrowserToRule30CellGuest
c1 --> c0 : edgeGitHubPagesToBrowser
c2 --> c4 : edgePrismBuildToRule30CellGuest
c2 --> c5 : edgePrismBuildToRule30CellPage
c3 --> c4 : edgeR30CommandSurfaceToRule30CellGuest
c4 --> c0 : edgeRule30CellGuestToBrowser
c4 --> c3 : edgeRule30CellGuestToR30CommandSurface
c4 --> c6 : edgeRule30CellGuestToRule30PrizeKit
c5 --> c1 : edgeRule30CellPageToGitHubPages
c6 --> c4 : edgeRule30PrizeKitToRule30CellGuest
c7 --> c2 : edgeSourceRepositoryToPrismBuild
@enduml
design/Design.viewUmlRequest.puml
@startuml
' UML 2.5.1 sequence diagram
' view: Design::viewUmlRequest
' viewpoint: Architecture::viewpointResearcherCorrectAnswers
title Answering a Rule 30 cell request
participant "componentBrowser" as p0
participant "componentRule30CellGuest" as p1
p0 -> p1 : processDecide
p1 --> p0 : processDecide
@enduml
design/Design.viewUmlStates.puml
@startuml
' UML 2.5.1 state machine diagram
' view: Design::viewUmlStates
' viewpoint: Architecture::viewpointVerifierRefusedMalformedRequests
title States of the Rule 30 cell guest
state "stateAnsweredOff" as s0
state "stateAnsweredOn" as s1
state "stateDeciding" as s2
state "stateIdle" as s3
state "stateRefused" as s4
[*] --> s3
s3 --> s2 : processParseRequest
s3 --> s4 : processParseRequest
s2 --> s1 : processRule1
s2 --> s1 : processRule2
s2 --> s1 : processRule3
s2 --> s0 : processOtherwise
s0 --> s3 : processEncodeAnswer
s1 --> s3 : processEncodeAnswer
s4 --> s3 : 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 413 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: stakeholderProofEngineer,
  parameters: [],
  result: Foundation.Arch::Stakeholder,
  body: (record Foundation.Arch::Stakeholder {index := 0, name := "Proof engineer", text := "Extends the LexLean and Lean 4 formalization and needs the cell rule to stay the one Core.lex.tex and the prize kit define."})
}

definition{
  name: stakeholderResearcher,
  parameters: [],
  result: Foundation.Arch::Stakeholder,
  body: (record Foundation.Arch::Stakeholder {index := 1, name := "Researcher", text := "Studies the Rule 30 sequence for Prize Problem 1 and needs every cell of every row to be the one the rule gives."})
}

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: concernAgreementWithThePrizeKit,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 0, name := "Agreement with the prize kit", text := "The local rule is the one Rule30PrizeKit defines, as rule30-bridge/Rule30Bridge.lean connects every paper theorem to Ruliology.CellularAutomata.Rule30Prize."})
}

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

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

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

definition{
  name: concernRefusedMalformedRequests,
  parameters: [],
  result: Foundation.Arch::Concern,
  body: (record Foundation.Arch::Concern {index := 4, name := "Refused malformed requests", text := "A request that is not the 3 fields in order, or is longer than 88 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 Rule 30 cell guest."})
}

definition{
  name: componentGitHubPages,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 1, 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 := 2, 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: componentR30CommandSurface,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 3, kind := (ctor Foundation.Arch::ComponentKind.cliAdapter), name := "r30 command surface", text := "bin/r30: status, frontier, theorem add, check, verify and axioms, also served as an MCP server."})
}

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

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

definition{
  name: componentRule30PrizeKit,
  parameters: [],
  result: Foundation.Arch::Component,
  body: (record Foundation.Arch::Component {index := 6, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Rule30PrizeKit", text := "The Rule 30 Prize kit, Ruliology.CellularAutomata.Rule30Prize, whose definitions the bridge module ties the LexLean theorems to."})
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 (componentGitHubPages) (cons (componentPrismBuild) (cons (componentR30CommandSurface) (cons (componentRule30CellGuest) (cons (componentRule30CellPage) (cons (componentRule30PrizeKit) (cons (componentSourceRepository) (nil Foundation.Arch::Component)))))))))
}

definition{
  name: edgeRecords,
  parameters: [],
  result: (List Foundation.Arch::Edge),
  body: (cons (edgeBrowserToRule30CellGuest) (cons (edgeGitHubPagesToBrowser) (cons (edgePrismBuildToRule30CellGuest) (cons (edgePrismBuildToRule30CellPage) (cons (edgeR30CommandSurfaceToRule30CellGuest) (cons (edgeRule30CellGuestToBrowser) (cons (edgeRule30CellGuestToR30CommandSurface) (cons (edgeRule30CellGuestToRule30PrizeKit) (cons (edgeRule30CellPageToGitHubPages) (cons (edgeRule30PrizeKitToRule30CellGuest) (cons (edgeSourceRepositoryToPrismBuild) (nil Foundation.Arch::Edge))))))))))))
}

definition{
  name: viewpointRecords,
  parameters: [],
  result: (List Foundation.Arch::Viewpoint),
  body: (cons (viewpointProofEngineerAgreementWithThePrizeKit) (cons (viewpointProofEngineerProvedGuarantees) (cons (viewpointResearcherCorrectAnswers) (cons (viewpointResearcherProvedGuarantees) (cons (viewpointVerifierIntegrityOfThePublishedApp) (cons (viewpointVerifierProvedGuarantees) (cons (viewpointVerifierRefusedMalformedRequests) (nil Foundation.Arch::Viewpoint))))))))
}

definition{
  name: viewRecords,
  parameters: [],
  result: (List Foundation.Arch::View),
  body: (cons (viewProofEngineerAgreementWithThePrizeKit) (cons (viewProofEngineerProvedGuarantees) (cons (viewResearcherCorrectAnswers) (cons (viewResearcherProvedGuarantees) (cons (viewVerifierIntegrityOfThePublishedApp) (cons (viewVerifierProvedGuarantees) (cons (viewVerifierRefusedMalformedRequests) (nil Foundation.Arch::View))))))))
}

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

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

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

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

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

theorem{
  name: architectureDescriptionHolds,
  parameters: [],
  statement: ((architectureValid) = true),
  proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Compliance.lex.tex 56 lines
\begin{lexlean}{Compliance}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Architecture}
\importmodule{Design}
\importmodule{Quality}
\importmodule{Security}
\importmodule{RuleThirtyCell}
\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 3 rules are tried in order and the first that matches gives the answer; otherwise off.", evidence := (cons "RuleThirtyCell::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 "RuleThirtyCell::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 "RuleThirtyCell::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 514 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::componentRule30CellGuest"})
}

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

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

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

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::componentRule30CellGuest"})
}

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

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

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

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

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

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

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

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

definition{
  name: viewOpmDecide,
  parameters: [],
  result: Foundation.Arch::DesignView,
  body: (record Foundation.Arch::DesignView {title := "Deciding a Rule 30 cell 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 Rule 30 cell", 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 Rule 30 cell 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 Rule 30 cell guest", viewpoint := "Architecture::viewpointVerifierRefusedMalformedRequests", diagram := (ctor Foundation.Arch::DesignDiagram.umlStateMachine)})
}

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

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

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::componentRule30CellGuest", state := "Design::stateIdle"})
}

definition{
  name: opmGuestDeciding,
  parameters: [],
  result: Foundation.Arch::OpmState,
  body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentRule30CellGuest", 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::componentRule30CellGuest", 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: 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: umlR30CommandSurface,
  parameters: [],
  result: Foundation.Arch::UmlComponent,
  body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentR30CommandSurface"})
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

definition{
  name: seqRule30CellGuest,
  parameters: [],
  result: Foundation.Arch::UmlLifeline,
  body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentRule30CellGuest", 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::componentRule30CellGuest", 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::componentRule30CellGuest", 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: stAnsweredOff,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredOff", initial := false})
}

definition{
  name: stAnsweredOn,
  parameters: [],
  result: Foundation.Arch::UmlState,
  body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredOn", 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::stateAnsweredOn", 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::stateAnsweredOn", 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::stateAnsweredOn", trigger := "Design::processRule3"})
}

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

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

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

definition{
  name: trResetRefused,
  parameters: [],
  result: Foundation.Arch::UmlTransition,
  body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 8, source := "Design::stateRefused", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
\end{semanticmodule}
\end{lexlean}
app/src/Features.lex.tex 95 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{RuleThirtyCell}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{feature}
\begin{semanticmodule}
definition{
  name: acceptINV001,
  parameters: [],
  result: String,
  body: "RuleThirtyCellProofs::inv001Holds"
}

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

definition{
  name: featureRule1,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When left is on and center is off and right is off, the answer is on.", calls := (cons "RuleThirtyCell::rule1" (cons "RuleThirtyCell::judge" (nil String))), acceptance := (cons "RuleThirtyCell::application" (nil String))})
}

definition{
  name: featureRule2,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When left is off and center is on, the answer is on.", calls := (cons "RuleThirtyCell::rule2" (cons "RuleThirtyCell::judge" (nil String))), acceptance := (cons "RuleThirtyCell::application" (nil String))})
}

definition{
  name: featureRule3,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "When left is off and right is on, the answer is on.", calls := (cons "RuleThirtyCell::rule3" (cons "RuleThirtyCell::judge" (nil String))), acceptance := (cons "RuleThirtyCell::application" (nil String))})
}

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

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

definition{
  name: featureINV001,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "It never answers on when left is on and center is on.", calls := (cons "RuleThirtyCell::judge" (nil String)), acceptance := (cons "Features::acceptINV001" (nil String))})
}

definition{
  name: featureINV002,
  parameters: [],
  result: Foundation.Arch::Feature,
  body: (record Foundation.Arch::Feature {statement := "It always answers off when left is off and center is off and right is off.", calls := (cons "RuleThirtyCell::judge" (nil String)), acceptance := (cons "Features::acceptINV002" (nil String))})
}

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

definition{
  name: journeyResearcher,
  parameters: [],
  result: Foundation.Arch::Journey,
  body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderResearcher", steps := (cons "Features::featureRule1" (cons "Features::featureRule2" (cons "Features::featureRule3" (cons "Features::featureOtherwise" (cons "Features::featureINV001" (cons "Features::featureINV002" (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" (nil String))))})
}
\end{semanticmodule}
\end{lexlean}
app/src/Quality.lex.tex 361 lines
\begin{lexlean}{Quality}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\useglossary{prism.qual@1.0.0}
\importmodule{Foundation.Qual}
\title{quality measure}
\begin{semanticmodule}
structure{
  name: Named,
  type_parameters: [],
  parameters: [],
  fields: [{name: index, type: Nat}, {name: name, type: String}, {name: text, type: String}]
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

definition{
  name: characteristicNames,
  parameters: [],
  result: (List Named),
  body: (cons (record Named {index := 0, name := "Functional suitability", text := "Functional suitability, as ISO/IEC 25010:2023 defines it, for Rule 30 cell."}) (cons (record Named {index := 1, name := "Maintainability", text := "Maintainability, as ISO/IEC 25010:2023 defines it, for Rule 30 cell."}) (cons (record Named {index := 2, name := "Performance efficiency", text := "Performance efficiency, as ISO/IEC 25010:2023 defines it, for Rule 30 cell."}) (cons (record Named {index := 3, name := "Reliability", text := "Reliability, as ISO/IEC 25010:2023 defines it, for Rule 30 cell."}) (cons (record Named {index := 4, name := "Security", text := "Security, as ISO/IEC 25010:2023 defines it, for Rule 30 cell."}) (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 := "Testability", text := "Maintainability: Testability."}) (cons (record Named {index := 6, name := "Time behaviour", text := "Performance efficiency: Time behaviour."}) (nil Named))))))))
}

definition{
  name: requirementNames,
  parameters: [],
  result: (List Named),
  body: (cons (record Named {index := 0, name := "Bounded allocation", text := "The guest allocates at most 176 bytes for one request."}) (cons (record Named {index := 1, name := "Bounded request", text := "A request over 88 bytes is refused before any field is read."}) (cons (record Named {index := 2, name := "Every property proved", text := "All 2 properties are theorems the Lean kernel checks."}) (cons (record Named {index := 3, name := "Every request answered", text := "Every request gets an answer: a rule, off otherwise, or invalid."}) (cons (record Named {index := 4, name := "Every vector replays", text := "All 19 acceptance vectors replay in the compiled guest, the shortest 0 bytes long."}) (cons (record Named {index := 5, name := "Examples answered as stated", text := "Every one of the 8 examples of the spec is answered as it states."}) (cons (record Named {index := 6, name := "Whole truth table pinned", text := "Each of the eight neighbourhoods of three cells is an acceptance example, so the table is checked row by row against Core.lex.tex."}) (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 := "Neighbourhoods without an example", text := "Of the eight three-cell neighbourhoods, those no example states."}) (cons (record Named {index := 4, name := "Request bytes read", text := "Longest request the guest decodes, in bytes."}) (cons (record Named {index := 5, name := "Unanswered requests", text := "Acceptance vectors the guest does not answer."}) (cons (record Named {index := 6, name := "Unproved properties", text := "Properties of the spec without a checked theorem."}) (nil Named))))))))
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

definition{
  name: threatRuleDriftsFromThePrizeKit,
  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: 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: riskBoundaryCellsGuessed,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 2, assetIndex := 3, threatIndex := 2, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.minor)})
}

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

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

definition{
  name: riskMalformedRequest,
  parameters: [],
  result: Foundation.Sec::Risk,
  body: (record Foundation.Sec::Risk {index := 5, assetIndex := 3, threatIndex := 5, 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 := 6, assetIndex := 3, threatIndex := 6, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.minor)})
}

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

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: controlBoundedRequest,
  parameters: [],
  result: Foundation.Sec::ApplicationSecurityControl,
  body: (record Foundation.Sec::ApplicationSecurityControl {index := 0, riskIndex := 6})
}

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

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

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

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

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

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

definition{
  name: 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 := 5})
}

definition{
  name: controlSet,
  parameters: [],
  result: Production.ThreatModel::ControlSet,
  body: (record Production.ThreatModel::ControlSet {title := "Rule 30 cell security controls", text := "Rule 30 cell answers one request with one answer in a Core-Wasm guest granted no capability. Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour.", 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 off, on, 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 88 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 on although left is on and center is on, which matters because Core.lex.tex: with a and b on, bxor true true is false, so 110 and 111 give 0.", 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 off not when left is off and center is off and right is off, which matters because a white neighbourhood stays white, the background of the Rule 30 diagram.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}

definition{
  name: modeledThreatBoundaryCellsGuessed,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatBoundaryCellsGuessed", name := "Boundary cells guessed", text := "A caller asks about a cell at the edge of a finite row and supplies a neighbour that is not in the row.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

definition{
  name: modeledThreatClassicalChoiceInAProof,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatClassicalChoiceInAProof", name := "Classical choice in a proof", text := "A proof of the rule depends on Classical.choice, which the repository forbids in its authored proof surfaces.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

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

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

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

definition{
  name: modeledThreatRuleDriftsFromThePrizeKit,
  parameters: [],
  result: Production.ThreatModel::ModeledThreat,
  body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatRuleDriftsFromThePrizeKit", name := "Rule drifts from the prize kit", text := "The cell table differs from the Rule 30 the prize kit defines, so a replayed row is not the automaton the prize asks about.", category := (ctor Production.ThreatModel::Stride.tampering)})
}

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

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

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

definition{
  name: modeledControlBoundedRequest,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBoundedRequest", name := "Bounded request", text := "dispatch answers invalid for a request over 88 bytes before reading a field, and the guest allocates at most 176.", 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: modeledControlBridgedToThePrizeKit,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBridgedToThePrizeKit", name := "Bridged to the prize kit", text := "Rule30Bridge.lean proves every LexLean paper theorem against the kit definition, and all eight neighbourhoods are acceptance examples.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "rule30-bridge/Rule30Bridge.lean"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "make check-research"}) (nil Production.ThreatModel::Evidence)))})
}

definition{
  name: modeledControlChoiceForbidden,
  parameters: [],
  result: Production.ThreatModel::ModeledControl,
  body: (record Production.ThreatModel::ModeledControl {control := "Security::controlChoiceForbidden", name := "Choice forbidden", text := "The kernel axiom audit accepts only propext and Quot.sound, and a source check rejects classical constants.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "scripts/check_no_choice.py"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "make check-research"}) (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 on when left is on and center is on. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "RuleThirtyCellProofs::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 always answers off when left is off and center is off and right is off. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "RuleThirtyCellProofs::inv002Holds"}) (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: mappingOversizedRequest,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatOversizedRequest", controls := (cons "Security::controlBoundedRequest" (nil String))})
}

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

definition{
  name: mappingClassicalChoiceInAProof,
  parameters: [],
  result: Production.ThreatModel::ThreatMapping,
  body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatClassicalChoiceInAProof", controls := (cons "Security::controlChoiceForbidden" (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: 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: acceptedBoundaryCellsGuessed,
  parameters: [],
  result: Production.ThreatModel::AcceptedRisk,
  body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatBoundaryCellsGuessed", rationale := "The app answers one neighbourhood exactly; the convention for cells beyond a finite row belongs to the caller that builds the row."})
}

definition{
  name: acceptedSubstitutedHost,
  parameters: [],
  result: Production.ThreatModel::AcceptedRisk,
  body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatSubstitutedHost", rationale := "A page cannot defend against its own host. The holo carries signed build provenance a visitor can check, and the app can be rebuilt from its prompt."})
}
\end{semanticmodule}
\end{lexlean}
app/src/RuleThirtyCell.lex.tex 199 lines
\begin{lexlean}{RuleThirtyCell}
\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: leftOff, parameters: [], result: Nat, body: 0}

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

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

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

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

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

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

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

structure{
  name: Request,
  type_parameters: [],
  parameters: [],
  fields: [{name: left, type: Nat}, {name: center, type: Nat}, {name: right, 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: parseLeft,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (if (prim equal value 0x6f6666 : Bool) then (ctor Option.some [Nat] (leftOff)) else (if (prim equal value 0x6f6e : Bool) then (ctor Option.some [Nat] (leftOn)) else (ctor Option.none [Nat])))
}

definition{
  name: parseCenter,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (if (prim equal value 0x6f6666 : Bool) then (ctor Option.some [Nat] (centerOff)) else (if (prim equal value 0x6f6e : Bool) then (ctor Option.some [Nat] (centerOn)) else (ctor Option.none [Nat])))
}

definition{
  name: parseRight,
  parameters: [value : Bytes],
  result: (Option Nat),
  body: (if (prim equal value 0x6f6666 : Bool) then (ctor Option.some [Nat] (rightOff)) else (if (prim equal value 0x6f6e : Bool) then (ctor Option.some [Nat] (rightOn)) else (ctor Option.none [Nat])))
}

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

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

definition{
  name: 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 (parseRight (sliceOf s start (prim subtract e start : Nat)))
    | Option.none => (ctor Option.none [Request])
    | Option.some v3 => (if (e =? (Foundation.Bytes::byteLength s)) then (ctor Option.some [Request] (record Request {left := v1, center := v2, right := 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 (parseCenter (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 (parseLeft (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 left) =? (leftOn)) && ((project request center) =? (centerOff))) && ((project request right) =? (rightOff)))
}

definition{
  name: rule2,
  parameters: [request : Request],
  result: Bool,
  body: (((project request left) =? (leftOff)) && ((project request center) =? (centerOn)))
}

definition{
  name: rule3,
  parameters: [request : Request],
  result: Bool,
  body: (((project request left) =? (leftOff)) && ((project request right) =? (rightOn)))
}

definition{
  name: judge,
  parameters: [request : Request],
  result: Nat,
  body: (if (rule1 request) then (answerOn) else (if (rule2 request) then (answerOn) else (if (rule3 request) then (answerOn) else (answerOff))))
}

definition{
  name: encodeAnswer,
  parameters: [code : Nat],
  result: Bytes,
  body: (if (code =? (answerOff)) then 0x6f6666 else (if (code =? (answerOn)) then 0x6f6e else 0x696e76616c6964))
}

definition{
  name: dispatch,
  parameters: [value : Bytes],
  result: Bytes,
  body: (if (88 <? (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 := "Rule 30 cell", cargoName := "prism-rule-thirty-cell", cargoVersion := "0.1.0", cargoDescription := "Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour.", cargoRepository := "https://github.com/UOR-Foundation/PrismPM", cargoHomepage := "https://github.com/UOR-Foundation/PrismPM", libraryRoots := (cons "PrismRuleThirtyCell.RuleThirtyCell.dispatch" (nil String)), acceptanceVectors := (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6666206f6666206f6666, response := 0x6f6666}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6666206f6666206f6e, response := 0x6f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6666206f6e206f6666, response := 0x6f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6666206f6e206f6e, response := 0x6f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6e206f6666206f6666, response := 0x6f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6e206f6666206f6e, response := 0x6f6666}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6e206f6e206f6666, response := 0x6f6666}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6e206f6e206f6e, response := 0x6f6666}) (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 := 0x6f6666206f6666, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6666206f6666206f6666206f6666, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f666620206f666620206f6666, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x756e6b6e6f776e206f6666206f6666, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f666620756e6b6e6f776e206f6666, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x6f6666206f666620756e6b6e6f776e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x78787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (nil Foundation.View.Text.V1.Model::AcceptanceVector)))))))))))))))))))), entryRoot := "PrismRuleThirtyCell.RuleThirtyCell.dispatch", coreContract := "hologram:guest/core-wasm@1", requestMaximum := (88 : UInt32), responseMaximum := (64 : UInt32), guestAllocationMaximum := (176 : UInt32), capabilitiesEmpty := true, fatArchive := true, primaryLayer := (0 : UInt8), viewLayer := (1 : UInt8), view := (record Foundation.View.Text.V1.Model::TextView {title := "Rule 30 cell", heading := "Rule 30 cell", inputLabel := "Request: left center right", submitLabel := "Decide", outputLabel := "Answer", inputError := "Invalid request", responseError := "Invalid response"})})
}
\end{semanticmodule}
\end{lexlean}
app/src/RuleThirtyCellProofs.lex.tex 71 lines
\begin{lexlean}{RuleThirtyCellProofs}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{RuleThirtyCell}
\title{Text application model}
\begin{semanticmodule}
definition{
  name: breaksInv001,
  parameters: [request : RuleThirtyCell::Request],
  result: Bool,
  body: (((((((project request left) <? 2) && ((project request center) <? 2)) && ((project request right) <? 2)) && ((project request left) =? (RuleThirtyCell::leftOn))) && ((project request center) =? (RuleThirtyCell::centerOn))) && ((RuleThirtyCell::judge request) =? (RuleThirtyCell::answerOn)))
}

theorem{
  name: inv001Holds,
  parameters: [request : RuleThirtyCell::Request],
  statement: ((breaksInv001 request) = false),
  proof: linear_arithmetic{
    definitions: [
      RuleThirtyCell::answerOff,
      RuleThirtyCell::answerOn,
      RuleThirtyCell::centerOff,
      RuleThirtyCell::centerOn,
      RuleThirtyCell::judge,
      RuleThirtyCell::leftOff,
      RuleThirtyCell::leftOn,
      RuleThirtyCell::rightOff,
      RuleThirtyCell::rightOn,
      RuleThirtyCell::rule1,
      RuleThirtyCell::rule2,
      RuleThirtyCell::rule3,
      breaksInv001
    ]
  },
  axioms: [Quot.sound, propext]
}

definition{
  name: breaksInv002,
  parameters: [request : RuleThirtyCell::Request],
  result: Bool,
  body: ((((((((project request left) <? 2) && ((project request center) <? 2)) && ((project request right) <? 2)) && ((project request left) =? (RuleThirtyCell::leftOff))) && ((project request center) =? (RuleThirtyCell::centerOff))) && ((project request right) =? (RuleThirtyCell::rightOff))) && (not ((RuleThirtyCell::judge request) =? (RuleThirtyCell::answerOff))))
}

theorem{
  name: inv002Holds,
  parameters: [request : RuleThirtyCell::Request],
  statement: ((breaksInv002 request) = false),
  proof: linear_arithmetic{
    definitions: [
      RuleThirtyCell::answerOff,
      RuleThirtyCell::answerOn,
      RuleThirtyCell::centerOff,
      RuleThirtyCell::centerOn,
      RuleThirtyCell::judge,
      RuleThirtyCell::leftOff,
      RuleThirtyCell::leftOn,
      RuleThirtyCell::rightOff,
      RuleThirtyCell::rightOn,
      RuleThirtyCell::rule1,
      RuleThirtyCell::rule2,
      RuleThirtyCell::rule3,
      breaksInv002
    ]
  },
  axioms: [Quot.sound, propext]
}
\end{semanticmodule}
\end{lexlean}
app/lexlean.toml 43 lines
spec = "lexlean/project/1"
name = "prism-rule-thirty-cell"
language = "1.2"
module_prefix = "PrismRuleThirtyCell"
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/RuleThirtyCell.lex.tex", "src/RuleThirtyCellProofs.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 299 lines
{
  "schema": "prism/prompt/1",
  "goal": "Find the next state of one Rule 30 cell from its neighbours, so every row of the pattern can be replayed and checked.",
  "pattern": "decisionTable",
  "repository": "afflom/rule30",
  "license": "MIT",
  "app": {
    "name": "rule-thirty-cell",
    "title": "Rule 30 cell",
    "purpose": "Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour.",
    "fields": [
      {
        "name": "left",
        "kind": "choice",
        "values": [
          "off",
          "on"
        ],
        "means": "the left neighbour now"
      },
      {
        "name": "center",
        "kind": "choice",
        "values": [
          "off",
          "on"
        ],
        "means": "the cell now"
      },
      {
        "name": "right",
        "kind": "choice",
        "values": [
          "off",
          "on"
        ],
        "means": "the right neighbour now"
      }
    ],
    "outcomes": [
      "off",
      "on"
    ],
    "meanings": {
      "on": "the cell is black in the next row",
      "off": "the cell is white in the next row"
    },
    "rules": [
      {
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "on"
          },
          {
            "field": "center",
            "op": "is",
            "value": "off"
          },
          {
            "field": "right",
            "op": "is",
            "value": "off"
          }
        ],
        "then": "on",
        "why": "rule30-lexlean/src/Core.lex.tex: rule a b c = bxor a (b || c), so 100 gives 1"
      },
      {
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "off"
          },
          {
            "field": "center",
            "op": "is",
            "value": "on"
          }
        ],
        "then": "on",
        "why": "rule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 010 and 011 give 1"
      },
      {
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "off"
          },
          {
            "field": "right",
            "op": "is",
            "value": "on"
          }
        ],
        "then": "on",
        "why": "rule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 001 gives 1"
      }
    ],
    "otherwise": "off",
    "otherwiseWhy": "rule30-lexlean/src/Core.lex.tex: bxor a (b || c) is 0 for 000, 101, 110 and 111",
    "properties": [
      {
        "kind": "never",
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "on"
          },
          {
            "field": "center",
            "op": "is",
            "value": "on"
          }
        ],
        "then": "on",
        "why": "Core.lex.tex: with a and b on, bxor true true is false, so 110 and 111 give 0"
      },
      {
        "kind": "always",
        "when": [
          {
            "field": "left",
            "op": "is",
            "value": "off"
          },
          {
            "field": "center",
            "op": "is",
            "value": "off"
          },
          {
            "field": "right",
            "op": "is",
            "value": "off"
          }
        ],
        "then": "off",
        "why": "a white neighbourhood stays white, the background of the Rule 30 diagram"
      }
    ],
    "examples": [
      {
        "request": "off off off",
        "response": "off"
      },
      {
        "request": "off off on",
        "response": "on"
      },
      {
        "request": "off on off",
        "response": "on"
      },
      {
        "request": "off on on",
        "response": "on"
      },
      {
        "request": "on off off",
        "response": "on"
      },
      {
        "request": "on off on",
        "response": "off"
      },
      {
        "request": "on on off",
        "response": "off"
      },
      {
        "request": "on on on",
        "response": "off"
      }
    ]
  },
  "stakeholders": [
    {
      "name": "Researcher",
      "text": "Studies the Rule 30 sequence for Prize Problem 1 and needs every cell of every row to be the one the rule gives.",
      "concerns": [
        "Correct answers",
        "Proved guarantees"
      ]
    },
    {
      "name": "Proof engineer",
      "text": "Extends the LexLean and Lean 4 formalization and needs the cell rule to stay the one Core.lex.tex and the prize kit define.",
      "concerns": [
        "Agreement with the prize kit",
        "Proved guarantees"
      ]
    }
  ],
  "concerns": [
    {
      "name": "Agreement with the prize kit",
      "text": "The local rule is the one Rule30PrizeKit defines, as rule30-bridge/Rule30Bridge.lean connects every paper theorem to Ruliology.CellularAutomata.Rule30Prize.",
      "model": "component"
    }
  ],
  "components": [
    {
      "name": "Rule30PrizeKit",
      "text": "The Rule 30 Prize kit, Ruliology.CellularAutomata.Rule30Prize, whose definitions the bridge module ties the LexLean theorems to.",
      "kind": "externalSystem"
    },
    {
      "name": "r30 command surface",
      "text": "bin/r30: status, frontier, theorem add, check, verify and axioms, also served as an MCP server.",
      "kind": "cliAdapter"
    }
  ],
  "threats": [
    {
      "name": "Rule drifts from the prize kit",
      "text": "The cell table differs from the Rule 30 the prize kit defines, so a replayed row is not the automaton the prize asks about.",
      "stride": "tampering",
      "asset": "source",
      "likelihood": "low",
      "impact": "critical",
      "control": {
        "name": "Bridged to the prize kit",
        "text": "Rule30Bridge.lean proves every LexLean paper theorem against the kit definition, and all eight neighbourhoods are acceptance examples.",
        "evidence": [
          {
            "kind": "review",
            "reference": "rule30-bridge/Rule30Bridge.lean"
          },
          {
            "kind": "gate",
            "reference": "make check-research"
          }
        ]
      }
    },
    {
      "name": "Classical choice in a proof",
      "text": "A proof of the rule depends on Classical.choice, which the repository forbids in its authored proof surfaces.",
      "stride": "tampering",
      "asset": "source",
      "likelihood": "low",
      "impact": "major",
      "control": {
        "name": "Choice forbidden",
        "text": "The kernel axiom audit accepts only propext and Quot.sound, and a source check rejects classical constants.",
        "evidence": [
          {
            "kind": "gate",
            "reference": "scripts/check_no_choice.py"
          },
          {
            "kind": "gate",
            "reference": "make check-research"
          }
        ]
      }
    },
    {
      "name": "Boundary cells guessed",
      "text": "A caller asks about a cell at the edge of a finite row and supplies a neighbour that is not in the row.",
      "stride": "tampering",
      "asset": "request",
      "likelihood": "medium",
      "impact": "minor",
      "accepted": "The app answers one neighbourhood exactly; the convention for cells beyond a finite row belongs to the caller that builds the row."
    }
  ],
  "quality": [
    {
      "characteristic": "Maintainability",
      "subcharacteristic": "Testability",
      "requirement": "Whole truth table pinned",
      "text": "Each of the eight neighbourhoods of three cells is an acceptance example, so the table is checked row by row against Core.lex.tex.",
      "measure": "Neighbourhoods without an example",
      "measureText": "Of the eight three-cell neighbourhoods, those no example states.",
      "threshold": 0
    }
  ],
  "journeys": [
    {
      "stakeholder": "Researcher",
      "steps": [
        "REQ-001",
        "REQ-002",
        "REQ-003",
        "otherwise",
        "INV-001",
        "INV-002"
      ]
    }
  ],
  "axioms": {}
}
model/ids.toml 53 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 = "RT-01"
level = "build"
suite = "rule_thirty_cell"
statement = "The app never answers on when left is on and center is on"

[[id]]
id = "RT-02"
level = "build"
suite = "rule_thirty_cell"
statement = "The app always answers off when left is off and center is off and right is off"

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

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

[[id]]
id = "RT-05"
level = "build"
suite = "rule_thirty_cell"
statement = "Every compliance obligation is numbered in order and names its evidence"
features/suites/rule_thirty_cell.feature 32 lines
Feature: rule_thirty_cell

  This repository's Prism application, in app/, generated by prism-code from its
  spec: Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour.

  @RT-01 @build
  Scenario: The app never answers on when left is on and center is on
    Given the model in app/src/RuleThirtyCell.lex.tex
    When the Lean kernel checks inv001Holds during prismpm verify
    Then no request meets breaksInv001

  @RT-02 @build
  Scenario: The app always answers off when left is off and center is off and right is off
    Given the model in app/src/RuleThirtyCell.lex.tex
    When the Lean kernel checks inv002Holds during prismpm verify
    Then no request meets breaksInv002
  @RT-03 @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
  @RT-04 @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
  @RT-05 @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/rule_thirty_cell.rs 112 lines
//! The `rule_thirty_cell` suite: one test per scenario in `features/suites/rule_thirty_cell.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/RuleThirtyCellProofs.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"
    );
}

/// `RT-01`: The app never answers on when left is on and center is on
#[test]
fn rule_thirty_cell_rt_01() {
    pinned(
        "breaksInv001",
        "body: (((((((project request left) <? 2) && ((project request center) <? 2)) && ((project request right) <? 2)) && ((project request left) =? (RuleThirtyCell::leftOn))) && ((project request center) =? (RuleThirtyCell::centerOn))) && ((RuleThirtyCell::judge request) =? (RuleThirtyCell::answerOn)))",
        "inv001Holds",
    );
}

/// `RT-02`: The app always answers off when left is off and center is off and right is off
#[test]
fn rule_thirty_cell_rt_02() {
    pinned(
        "breaksInv002",
        "body: ((((((((project request left) <? 2) && ((project request center) <? 2)) && ((project request right) <? 2)) && ((project request left) =? (RuleThirtyCell::leftOff))) && ((project request center) =? (RuleThirtyCell::centerOff))) && ((project request right) =? (RuleThirtyCell::rightOff))) && (not ((RuleThirtyCell::judge request) =? (RuleThirtyCell::answerOff))))",
        "inv002Holds",
    );
}

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

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

/// `RT-05`: Every compliance obligation is numbered in order and names its evidence
#[test]
fn rule_thirty_cell_rt_05() {
    holds(
        "app/src/Compliance.lex.tex",
        "everyObligationEvidenced",
        "((obligationsEvidenced 0 (obligations)) = true)",
    );
}
site/app.json 90 lines
{
  "name": "Rule 30 cell",
  "shortName": "Rule",
  "live": "https://afflom.github.io/rule30/",
  "purpose": "Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour. Send left, center or right, separated by spaces; it answers off or on, and invalid request for anything else.",
  "inputLabel": "Request: left center right",
  "placeholder": "off off off",
  "submitLabel": "Decide",
  "outputLabel": "Answer",
  "answers": {
    "positive": [
      "off"
    ],
    "negative": [
      "on"
    ],
    "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": "RT-01: the app never answers on when left is on and center is on. RT-02: the app always answers off when left is off and center is off and right is off.",
  "proposition": {
    "name": "judge",
    "text": "judge request :=\n  left is on and center is off and right is off → on\n  left is off and center is on → on\n  left is off and right is on → on\n  otherwise → off",
    "plain": "Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour."
  },
  "theorems": [
    {
      "name": "inv001Holds",
      "statement": "no request meets breaksInv001: the app never answers on when left is on and center is on",
      "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/RuleThirtyCellProofs.lex.tex"
    },
    {
      "name": "inv002Holds",
      "statement": "no request meets breaksInv002: the app always answers off when left is off and center is off and right is off",
      "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/RuleThirtyCellProofs.lex.tex"
    }
  ],
  "pinned": [
    {
      "name": "rule_thirty_cell_rt_01",
      "what": "RT-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/rule_thirty_cell.rs"
    },
    {
      "name": "rule_thirty_cell_rt_02",
      "what": "RT-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/rule_thirty_cell.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/afflom/rule30/actions/workflows/bootstrap.yml"
    },
    "build": {
      "id": "printed by prismpm verify in every pages run",
      "url": "https://github.com/afflom/rule30/actions/workflows/pages.yml"
    }
  },
  "repository": "https://github.com/afflom/rule30",
  "report": "https://github.com/afflom/rule30/blob/main/TEMPLATE-VERIFICATION.md"
}
openspec/specs/rule-thirty-cell/spec.md 136 lines
# rule-thirty-cell Specification

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

## Purpose

Rule 30 cell: Decide the next state of a Rule 30 cell from its left neighbour, itself and its right neighbour.

## Requirements

### Requirement: Never on when left is on and center is on

The app SHALL NOT answer `on` when left is on and center is on, because Core.lex.tex: with a and b on, bxor true true is false, so 110 and 111 give 0.

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

#### Scenario: INV-001 holds

- **WHEN** the request is `on on off` (an acceptance example)
- **THEN** the answer SHALL NOT be `on`
- **AND** the app answers `off`, decided by the fallback

### Requirement: Always off when left is off and center is off and right is off

The app SHALL answer `off` when left is off and center is off and right is off, because a white neighbourhood stays white, the background of the Rule 30 diagram.

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

#### Scenario: INV-002 holds

- **WHEN** the request is `off off off` (an acceptance example)
- **THEN** the answer SHALL be `off`
- **AND** the app answers `off`, decided by the fallback

### Requirement: REQ-001 on when left is on and center is off and right is off

The app SHALL answer `on` when left is on and center is off and right is off, because rule30-lexlean/src/Core.lex.tex: rule a b c = bxor a (b || c), so 100 gives 1.

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

#### Scenario: REQ-001 decides

- **WHEN** the request is `on off off` (an acceptance example)
- **THEN** the answer SHALL be `on`, decided by REQ-001

### Requirement: REQ-002 on when left is off and center is on

The app SHALL answer `on` when left is off and center is on and no earlier rule matches, because rule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 010 and 011 give 1.

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

#### Scenario: REQ-002 decides

- **WHEN** the request is `off on off` (an acceptance example)
- **THEN** the answer SHALL be `on`, decided by REQ-002

### Requirement: REQ-003 on when left is off and right is on

The app SHALL answer `on` when left is off and right is on and no earlier rule matches, because rule30-lexlean/src/Core.lex.tex: with a off, rule is b || c, so 001 gives 1.

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

#### Scenario: REQ-003 decides

- **WHEN** the request is `off off on` (an acceptance example)
- **THEN** the answer SHALL be `on`, decided by REQ-003

### Requirement: Otherwise off

The app SHALL answer `off` when no rule matches, because rule30-lexlean/src/Core.lex.tex: bxor a (b || c) is 0 for 000, 101, 110 and 111.

Verified: tested by the acceptance vectors.

#### Scenario: No rule matches

- **WHEN** the request is `off off off` (an acceptance example)
- **THEN** the answer SHALL be `off`

### Requirement: The first matching rule decides

The app SHALL try REQ-001, REQ-002, REQ-003 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 `off on on` (an acceptance example)
- **THEN** the answer SHALL be `on`, decided by REQ-002, the earlier rule

### Requirement: Request and answers

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

| Field | Accepts | Means |
| --- | --- | --- |
| `left` | `off`, `on` | the left neighbour now |
| `center` | `off`, `on` | the cell now |
| `right` | `off`, `on` | the right neighbour now |

| Answer | Means |
| --- | --- |
| `off` | the cell is white in the next row |
| `on` | the cell is black in the next row |
| `invalid` | the request is malformed |

Verified: reading a request is tested, not proved.

#### Scenario: A malformed request is invalid

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

## Examples

- `off off off` gives `off`
- `off off on` gives `on`
- `off on off` gives `on`
- `off on on` gives `on`
- `on off off` gives `on`
- `on off on` gives `off`
- `on on off` gives `off`
- `on on on` gives `off`

## 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/RuleThirtyCell.lex.tex` is the LexLean model generated from it. It is the single source of the app.

how-to guideBuildexampleMarkdown

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.
LexLean
The language Prism models are written in. It reads like LaTeX and compiles to Lean 4.
Lean kernel
The small checker at the heart of the Lean prover. It accepts a proof only if every step follows the rules.
theorem
A statement about the model that the Lean kernel has checked, so it holds for every input, not only the ones tested.
SDK
Software development kit. Here, the PrismPM container image that builds, checks and verifies Prism models.
stakeholder
A person or group with an interest in the system, as ISO/IEC/IEEE 42010 defines it.
decision table
A table of rules, as in OMG DMN 1.5: each row says which inputs lead to which outcome.