|
8 | 8 |
|
9 | 9 | ## What This Formalizes |
10 | 10 |
|
11 | | -This repository provides machine-checked proofs of properties in the Exchange Protocol: |
12 | | - |
13 | | -1. **Core Types** (`Core.lean`) |
14 | | - - RecordEnvelope with attestations, timestamps, CTags |
15 | | - - Entity records with multiple identifier schemes |
16 | | - - Relationship records (bilateral/multilateral) |
17 | | - - Exchange records with provenance chains |
18 | | - |
19 | | -2. **Graph Structures** (`Graphs.lean`) |
20 | | - - CEP graphs of entities, relationships, exchanges |
21 | | - - Well-formedness predicates |
22 | | - - Provenance chain extraction |
23 | | - - Theorems: finite chains, resolvable references |
24 | | - |
25 | | -3. **Attestation Properties** (`Attestations.lean`) |
26 | | - - Multi-party attestation |
27 | | - - Temporal ordering of attestations |
28 | | - - Theorems: well-formed records have attestations |
29 | | - |
30 | | -4. **Context Tags** (`CTags.lean`) |
31 | | - - Interpretive metadata without identity changes |
32 | | - - GDPR-relevant properties (human review, disputed facts) |
33 | | - - Theorems: CTags preserve canonical identity |
34 | | - |
35 | | -## Key Theorems |
36 | | -```lean |
37 | | --- Every exchange has traceable provenance |
38 | | -theorem exchange_has_provenance |
39 | | -
|
40 | | --- Exchange chains are finite (no infinite loops) |
41 | | -axiom exchange_chain_finite |
42 | | -
|
43 | | --- Well-formed records have attestations |
44 | | -theorem wellformed_has_attestation |
45 | | -
|
46 | | --- CTags preserve canonical identity |
47 | | -axiom ctags_preserve_identity |
48 | | -``` |
| 11 | +This repository provides a Lean 4 formalization |
| 12 | +of the structural core of the Exchange Protocol, |
| 13 | +including canonical record schemas for |
| 14 | +entities, relationships, and exchanges; |
| 15 | +a shared RecordEnvelope; |
| 16 | +retention-policy data shapes; |
| 17 | +and basic graph-oriented data structures. |
| 18 | +The code machine-checks the well-formedness and |
| 19 | +typing of these structures and verifies that |
| 20 | +the protocol's core representations are |
| 21 | +internally consistent and composable, |
| 22 | +without embedding causal, normative, or policy interpretations. |
49 | 23 |
|
50 | 24 | ## Build and Run |
51 | 25 |
|
|
0 commit comments