aver-cert 0.1.2

Independent artifact certificate engine and verifier for Aver WebAssembly
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
/// Post-order (callees-before-callers) topological order of a composition
/// closure, starting the DFS at the caller so the caller comes last. Every
/// closure is an acyclic user-call DAG (enforced by `collect_closure`).
fn compose_topo_order(caller_idx: u32, closure: &[ClosureEntry]) -> Vec<u32> {
    let by_idx: std::collections::HashMap<u32, &ClosureEntry> =
        closure.iter().map(|e| (e.self_idx, e)).collect();
    let mut order = Vec::new();
    let mut seen = std::collections::HashSet::new();
    fn dfs(
        idx: u32,
        by_idx: &std::collections::HashMap<u32, &ClosureEntry>,
        seen: &mut std::collections::HashSet<u32>,
        order: &mut Vec<u32>,
    ) {
        if !seen.insert(idx) {
            return;
        }
        if let Some(e) = by_idx.get(&idx)
            && let LeafShape::Chain { calls } = &e.shape
        {
            for c in calls {
                dfs(*c, by_idx, seen, order);
            }
        }
        order.push(idx);
    }
    dfs(caller_idx, &by_idx, &mut seen, &mut order);
    order
}

fn composition_member_claim_lean_value(entry: &ClosureEntry) -> String {
    format!(
        "({{ exportNameBytes := {}, exportName := {}, \
         plan := AverCert.Plans.{}CompositionPlan }} : \
         AverCert.AcceptedArtifact.CompositionMemberClaim)",
        render_byte_list(entry.name.as_bytes()),
        lean_str(&entry.name),
        entry.name,
    )
}

fn composition_members_lean_value(closure: &[ClosureEntry]) -> String {
    format!(
        "[{}]",
        closure
            .iter()
            .map(composition_member_claim_lean_value)
            .collect::<Vec<_>>()
            .join(", ")
    )
}

fn composition_claim_lean_value(c: &Cert, add_idx: u32) -> String {
    let Cert::Composition {
        name,
        carrier,
        closure,
        ..
    } = c.inner()
    else {
        unreachable!()
    };
    let member_names = closure
        .iter()
        .map(|entry| lean_str(&entry.name))
        .collect::<Vec<_>>()
        .join(", ");
    format!(
        "({{ exportName := {}, carrier := {carrier}, hostTable := {}, \
         memberNames := [{member_names}], obligation := AverCert.{name}Ob }} : \
         AverCert.AcceptedArtifact.CompositionClaim)",
        lean_str(name),
        composition_host_table_lean_value(add_idx),
    )
}

/// Render the companion `{name}_compositionClaimAccepted` acceptance as a SPLIT
/// proof, mirroring `render_composition_claim_bundles` in `render_project.rs`.
///
/// Returns `(declarations, aggregate_proof)`: the per-member witness `def`s and
/// leaf theorems to emit before the aggregate theorem, and the aggregate proof
/// term the theorem's `exact` uses. This bridge module re-proves acceptance in a
/// standalone file, so it carried the same monolithic member tuple the artifact
/// root did; naming each member's body/code-entry/binding and hoisting the
/// member `modBytes` walks into leaves keeps the module's per-claim peak bounded.
fn composition_bridge_claim_accepted(c: &Cert, strict: FragHostTable) -> (String, String) {
    let Cert::Composition {
        name,
        carrier,
        closure,
        ..
    } = c.inner()
    else {
        unreachable!()
    };
    let plans = composition_plans_from_cert(c, strict)
        .expect("audited composition has byte-derived member plans");
    let add_idx = strict
        .add_idx
        .expect("plan-backed composition has strict add host");
    let host_table = composition_host_table_lean_value(add_idx);
    let funcs = composition_func_table(closure);
    let host_types = format!("{name}CompositionHostTypes");
    // Shared host-table type pin; one leaf serves the claim and every member.
    let mut declarations = format!(
        "-- Claim-level host-table declared-function-type pin, shared by the claim\n\
         -- and every member (a `modBytes` type-section walk).\n\
         theorem {host_types} :\n  \
           AverCert.WasmSlice.hostTableFuncTypesMatch AverCert.ArtifactBytes.modBytes AverCert.ArtifactBytes.modLen {carrier} {host_table} = true := by\n  \
           rfl\n\n"
    );
    let mut named_proof = "trivial".to_string();
    for (member_index, (entry, plan)) in plans.iter().enumerate().rev() {
        let body = render_ops_value(
            &lower_composition_plan(plan, add_idx, &funcs)
                .expect("composition member lowers against closure table"),
        );
        let code_entry = render_byte_list(
            &composition_code_entry_bytes(plan, *carrier, add_idx, &funcs)
                .expect("composition member byte-lowers against closure table"),
        );
        let export_name_bytes = render_byte_list(entry.name.as_bytes());
        let body_def = format!("{name}CompositionMember{member_index}Body");
        let code_def = format!("{name}CompositionMember{member_index}CodeEntry");
        let binding_def = format!("{name}CompositionMember{member_index}Binding");
        let func_binding = format!("{name}CompositionMember{member_index}FuncBinding");
        let func_type = format!("{name}CompositionMember{member_index}FuncType");
        declarations = format!(
            "-- Member `{member_index}` witness data as named constants.\n\
             def {body_def} : List CertPrelude.WInstr := {body}\n\n\
             def {code_def} : AverCert.WasmSlice.ByteSeq := {code_entry}\n\n\
             def {binding_def} : AverCert.WasmSlice.FuncBinding :=\n  \
               {{ funcIdx := {self_idx}, typeIdx := {type_idx}, codeEntry := {code_def} }}\n\n\
             theorem {func_binding} :\n  \
               AverCert.WasmSlice.exactFuncBindingForExport AverCert.ArtifactBytes.modBytes AverCert.ArtifactBytes.modLen {export_name_bytes} {code_def} = some {binding_def} := by\n  \
               rfl\n\n\
             theorem {func_type} :\n  \
               AverCert.WasmSlice.funcTypeMatches AverCert.ArtifactBytes.modBytes AverCert.ArtifactBytes.modLen {binding_def}.typeIdx 1 {carrier} = true := by\n  \
               rfl\n\n{declarations}",
            self_idx = entry.self_idx,
            type_idx = entry.type_idx,
        );
        let member_proof = format!(
            "⟨rfl, ⟨{body_def}, {code_def}, {binding_def}, rfl, rfl, {func_binding}, {func_type}, {host_types}, rfl⟩⟩"
        );
        named_proof = format!("⟨{member_proof}, {named_proof}⟩");
    }
    let aggregate_proof = format!(
        "⟨rfl, ⟨rfl, ⟨rfl, ⟨{host_types}, ⟨rfl, ⟨rfl, ⟨rfl, {named_proof}⟩⟩⟩⟩⟩⟩⟩"
    );
    (declarations, aggregate_proof)
}

/// Option-(b) composition bridge. Root glue is discharged by the audited
/// generic; generated lemmas remain only for the non-root member semantics
/// that the generic deliberately consumes through `MemberFact`.
fn render_composition_semantic_bridge(
    c: &Cert,
    analysis: &Analysis,
    model_info: &ModelInfo,
) -> String {
    let Cert::Composition {
        name,
        self_idx,
        carrier,
        closure,
        ..
    } = c.inner()
    else {
        unreachable!()
    };
    // Qualified model identifiers: the root and every closure member.
    // `model_citation_gate` covers a composition's root AND its whole closure,
    // and both `analyze` and `write_project` enforce it, so each resolves.
    let member_model = |entry: &ClosureEntry| -> String {
        model_info
            .model_lean_name(&entry.name)
            .expect("model-citing certificate passed the qualified-name gate")
    };
    let root_model = c.model_lean_name(model_info);
    let add_idx = analysis
        .frag_host_table
        .add_idx
        .expect("composition bridge has strict add host");
    let by_idx: std::collections::HashMap<u32, &ClosureEntry> =
        closure.iter().map(|e| (e.self_idx, e)).collect();
    let root = by_idx[self_idx];
    let LeafShape::Chain { calls: root_calls } = &root.shape else {
        unreachable!("composition root is a chain")
    };
    let callees = root_calls
        .iter()
        .map(|idx| lean_str(&by_idx[idx].name))
        .collect::<Vec<_>>();
    let callees_lean = format!("[{}]", callees.join(", "));
    let lemma_name = |idx: u32| -> String { format!("{name}__compositionMember_{idx}") };
    let model_name = format!("{name}CompositionModel");
    let sig = |concl_model: &str| -> String {
        format!(
            "    (S : CarrierSpec {carrier}) (add sub : List WVal → Option WVal)\n\
             \x20   (hadd : ∀ a b va vb w, S.Repr a va → S.Repr b vb → add [va, vb] = some w → S.Repr (a + b) w)\n\
             \x20   (hsub : ∀ a b va vb w, S.Repr a va → S.Repr b vb → sub [va, vb] = some w → S.Repr (a - b) w) :\n\
             \x20   ∀ (fuel : Nat) (x : Int) (v w : WVal), S.Repr x v →\n\
             \x20     wFuncN {name}Code ({name}Host add sub) fuel {{IDX}} [v] = some w → S.Repr ({concl_model}) w"
        )
    };

    let mut s = format!(
        "/-! ### {name} — option-(b) composition semantic bridge (carrier type {carrier}) -/\n\n"
    );
    s.push_str(&format!(
        "def {model_name} (member : String) (x : Int) : Int :=\n  {}\n\n",
        closure
            .iter()
            .map(|entry| format!(
                "if member = {} then {} x else",
                lean_str(&entry.name),
                member_model(entry)
            ))
            .chain(std::iter::once("x".to_string()))
            .collect::<Vec<_>>()
            .join(" ")
    ));
    let model_simp = closure
        .iter()
        .map(&member_model)
        .collect::<Vec<_>>()
        .join(", ");

    for idx in compose_topo_order(*self_idx, closure) {
        if idx == *self_idx {
            continue;
        }
        let e = by_idx[&idx];
        let head = format!(
            "theorem {}\n{}",
            lemma_name(idx),
            sig(&format!("{model_name} {} x", lean_str(&e.name)))
        )
        .replace("{IDX}", &idx.to_string());
        match &e.shape {
            LeafShape::SelfSum { .. } => {
                s.push_str(&format!(
                    "-- callee `{ename}`: self-sum leaf, over the shared closure table.\n{head} := by\n  \
                     intro fuel x v w hv hrun\n  \
                     cases fuel with\n  \
                     | zero => simp only [wFuncN, reduceCtorEq] at hrun\n  \
                     | succ f =>\n      \
                     rcases hc : add [v, v] with _ | r <;>\n        \
                     simp [wFuncN, wRunF, {name}Code, {name}Host, boxRef, popArgs, initLocals, hc] at hrun\n      \
                     subst hrun\n      \
                     simpa [{model_name}, {model_simp}] using hadd x x v v r hv hv hc\n\n",
                    ename = e.name,
                ));
            }
            LeafShape::Chain { calls } => {
                let mut body = String::new();
                // one `rcases … <;> simp … at hrun` per call site (threading m1, m2, …).
                for (i, c_idx) in calls.iter().enumerate() {
                    let arg = if i == 0 {
                        "[v]".to_string()
                    } else {
                        format!("[m{i}]")
                    };
                    body.push_str(&format!(
                        "      rcases h{h} : wFuncN {name}Code ({name}Host add sub) f {c_idx} {arg} with _ | m{h} <;>\n        \
                         simp [wFuncN, wRunF, {name}Code, {name}Host, popArgs, initLocals, h{h}] at hrun\n",
                        h = i + 1,
                    ));
                }
                body.push_str("      subst hrun\n");
                // cite the callee simulation lemma at each site, threading the model.
                let mut model_arg = "x".to_string();
                for (i, c_idx) in calls.iter().enumerate() {
                    let (vin, hrepr) = if i == 0 {
                        ("v".to_string(), "hv".to_string())
                    } else {
                        (format!("m{i}"), format!("r{i}"))
                    };
                    body.push_str(&format!(
                        "      have r{h} := {lem} S add sub hadd hsub f ({model_arg}) {vin} m{h} {hrepr} h{h}\n",
                        h = i + 1,
                        lem = lemma_name(*c_idx),
                    ));
                    model_arg = format!(
                        "{model_name} {} ({model_arg})",
                        lean_str(&by_idx[c_idx].name)
                    );
                }
                body.push_str(&format!(
                    "      simpa [{model_name}, {model_simp}] using r{}\n\n",
                    calls.len()
                ));
                s.push_str(&format!(
                    "-- callee `{ename}`: unary user-call chain; cites each member lemma.\n{head} := by\n  \
                     intro fuel x v w hv hrun\n  \
                     cases fuel with\n  \
                     | zero => simp only [wFuncN, reduceCtorEq] at hrun\n  \
                     | succ f =>\n{body}",
                    ename = e.name,
                ));
            }
        }
    }

    let members = composition_members_lean_value(closure);
    let all_members = format!(
        "[{}]",
        composition_member_plans(analysis)
            .iter()
            .map(|(entry, _)| composition_member_claim_lean_value(entry))
            .collect::<Vec<_>>()
            .join(", ")
    );
    let claim = composition_claim_lean_value(c, add_idx);
    let (claim_decls, acceptance) =
        composition_bridge_claim_accepted(c, analysis.frag_host_table);
    s.push_str(&format!(
        "def {name}CompositionMembers : List AverCert.AcceptedArtifact.CompositionMemberClaim :=\n  \
         {members}\n\n\
         def {name}CompositionClaim : AverCert.AcceptedArtifact.CompositionClaim :=\n  \
         {claim}\n\n\
         {claim_decls}\
         theorem {name}_compositionClaimAccepted :\n    \
         AverCert.AcceptedArtifact.compositionClaimAccepted\n      \
         AverCert.ArtifactBytes.modBytes AverCert.ArtifactBytes.modLen\n      \
         {name}CompositionMembers {name}CompositionClaim := by\n  \
         dsimp [{name}CompositionMembers, {name}CompositionClaim,\n    \
         AverCert.AcceptedArtifact.compositionClaimAccepted,\n    \
         AverCert.AcceptedArtifact.compositionFuncTable,\n    \
         AverCert.AcceptedArtifact.compositionMemberBinding,\n    \
         AverCert.AcceptedArtifact.compositionNamedMembersAccepted,\n    \
         AverCert.AcceptedArtifact.compositionMemberPlanAccepted,\n    \
         AverCert.AcceptedArtifact.compositionMemberForName,\n    \
         AverCert.AcceptedArtifact.compositionClosureBound,\n    \
         AverCert.AcceptedArtifact.compositionEdges,\n    \
         AverCert.AcceptedArtifact.compositionPlanCallees,\n    \
         AverCert.AcceptedArtifact.compositionEdgesDescend,\n    \
         AverCert.AcceptedArtifact.compositionReachClosure,\n    \
         AverCert.AcceptedArtifact.compositionReachStep,\n    \
         AverCert.AcceptedArtifact.stringListNodup,\n    \
         AverCert.AcceptedArtifact.stringListSetEq]\n  \
         exact {acceptance}\n\n"
    ));

    let direct_callee = by_idx[root_calls
        .first()
        .expect("composition root has a direct callee")];
    let direct_member = composition_member_claim_lean_value(direct_callee);
    let direct_plan = composition_plan_for_entry(
        direct_callee,
        &closure
            .iter()
            .map(|entry| (entry.self_idx, entry.name.clone()))
            .collect(),
    )
    .expect("direct composition member has a plan");
    let funcs = composition_func_table(closure);
    let direct_body = render_ops_value(
        &lower_composition_plan(&direct_plan, add_idx, &funcs)
            .expect("direct composition member lowers"),
    );
    let direct_code_entry = render_byte_list(
        &composition_code_entry_bytes(&direct_plan, *carrier, add_idx, &funcs)
            .expect("direct composition member byte-lowers"),
    );
    let direct_binding = format!(
        "({{ funcIdx := {}, typeIdx := {}, codeEntry := {} }} : \
         AverCert.WasmSlice.FuncBinding)",
        direct_callee.self_idx,
        direct_callee.type_idx,
        direct_code_entry,
    );
    s.push_str(&format!(
        "theorem {name}_compositionSemanticBridge :\n    \
         AcceptanceSoundness.compositionClaimSemanticBridge\n      \
         ({{ modBytes := AverCert.ArtifactBytes.modBytes,\n         \
         modLen := AverCert.ArtifactBytes.modLen, manifest := AverCert.manifest,\n         \
         symFragmentClaims := [], stringEqClaims := [], stringConcatClaims := [],\n         \
         constructClaims := [], recursionClaims := [], mutualRecursionClaims := [],\n         \
         verbatimClaims := [], intDispatchClaims := [], fieldProjectionClaims := [],\n         \
         compositionMembers := {all_members},\n         \
         compositionClaims := [{name}CompositionClaim], closureFuel := 0,\n         \
         closureClaim := {{ roots := [], helpers := [], admitted := [] }} }} :\n        \
         AverCert.AcceptedArtifact.ArtifactData)\n      \
         {name}CompositionClaim {callees_lean} := by\n  \
         refine ⟨rfl, ?_⟩\n  \
         intro S add sub mul stringEq stringConcat toIndex cmp eq\n    \
         hAdd hSub hMul hStringEq hStringConcat _hToIndex _hCmp _hEq ns vs hDom\n  \
         dsimp [{name}CompositionClaim, AverCert.{name}Ob] at ns vs hDom ⊢\n  \
         rcases hDom with ⟨hRepr, hLen⟩\n  \
         cases hRepr with\n  \
         | nil => simp at hLen\n  \
         | cons hv htail =>\n      \
         rename_i n v ns' vs'\n      \
         cases htail with\n      \
         | cons _ _ => simp at hLen\n      \
         | nil =>\n          \
         refine ⟨n, v, {model_name}, {root_model}, rfl, hv, ?_, ?_, ?_⟩\n          \
         · intro input\n            \
         simp [{model_name}, CompositionSoundness.evalCompositionCalls, {model_simp}]\n          \
         · intro w hw\n            \
         simpa [AverCert.Schema.intRepr] using hw\n          \
         · intro funcTable hTable member hMember\n            \
         have hMember' : member = {} := by simpa using hMember\n            \
         subst member\n            \
         exact ⟨⟨\n              \
         {direct_member},\n              \
         by rfl,\n              \
         {},\n              \
         AcceptanceSoundness.compositionFuncIdx_eq_binding\n                \
         AverCert.ArtifactBytes.modBytes AverCert.ArtifactBytes.modLen\n                \
         {all_members} funcTable {} {direct_member}\n                \
         {direct_binding} hTable (by rfl) (by rfl),\n              \
         by simp [CertModule.{name}Host],\n              \
         {direct_body},\n              \
         by rfl,\n              \
         {} S add sub hAdd hSub\n            \
         ⟩⟩\n\n\
         #print axioms {name}_compositionSemanticBridge\n",
        lean_str(&direct_callee.name),
        direct_callee.self_idx,
        lean_str(&direct_callee.name),
        lemma_name(direct_callee.self_idx),
    ));

    s
}