nickh007 commited on
Commit
a307e3d
·
verified ·
1 Parent(s): 51567c9

Initial public release

Browse files
Files changed (4) hide show
  1. LICENSE +205 -0
  2. README.md +190 -0
  3. corpus_meta.json +66 -0
  4. pqc_formal_corpus.jsonl +122 -0
LICENSE ADDED
@@ -0,0 +1,205 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+
2
+ Apache License
3
+ Version 2.0, January 2004
4
+ http://www.apache.org/licenses/
5
+
6
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
7
+
8
+ 1. Definitions.
9
+
10
+ "License" shall mean the terms and conditions for use, reproduction,
11
+ and distribution as defined by Sections 1 through 9 of this document.
12
+
13
+ "Licensor" shall mean the copyright owner or entity authorized by
14
+ the copyright owner that is granting the License.
15
+
16
+ "Legal Entity" shall mean the union of the acting entity and all
17
+ other entities that control, are controlled by, or are under common
18
+ control with that entity. For the purposes of this definition,
19
+ "control" means (i) the power, direct or indirect, to cause the
20
+ direction or management of such entity, whether by contract or
21
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
22
+ outstanding shares, or (iii) beneficial ownership of such entity.
23
+
24
+ "You" (or "Your") shall mean an individual or Legal Entity
25
+ exercising permissions granted by this License.
26
+
27
+ "Source" form shall mean the preferred form for making modifications,
28
+ including but not limited to software source code, documentation
29
+ source, and configuration files.
30
+
31
+ "Object" form shall mean any form resulting from mechanical
32
+ transformation or translation of a Source form, including but
33
+ not limited to compiled object code, generated documentation,
34
+ and conversions to other media types.
35
+
36
+ "Work" shall mean the work of authorship, whether in Source or
37
+ Object form, made available under the License, as indicated by a
38
+ copyright notice that is included in or attached to the work
39
+ (an example is provided in the Appendix below).
40
+
41
+ "Derivative Works" shall mean any work, whether in Source or Object
42
+ form, that is based on (or derived from) the Work and for which the
43
+ editorial revisions, annotations, elaborations, or other modifications
44
+ represent, as a whole, an original work of authorship. For the purposes
45
+ of this License, Derivative Works shall not include works that remain
46
+ separable from, or merely link (or bind by name) to the interfaces of,
47
+ the Work and Derivative Works thereof.
48
+
49
+ "Contribution" shall mean any work of authorship, including
50
+ the original version of the Work and any modifications or additions
51
+ to that Work or Derivative Works thereof, that is intentionally
52
+ submitted to Licensor for inclusion in the Work by the copyright owner
53
+ or by an individual or Legal Entity authorized to submit on behalf of
54
+ the copyright owner. For the purposes of this definition, "submitted"
55
+ means any form of electronic, verbal, or written communication sent
56
+ to the Licensor or its representatives, including but not limited to
57
+ communication on electronic mailing lists, source code control systems,
58
+ and issue tracking systems that are managed by, or on behalf of, the
59
+ Licensor for the purpose of discussing and improving the Work, but
60
+ excluding communication that is conspicuously marked or otherwise
61
+ designated in writing by the copyright owner as "Not a Contribution."
62
+
63
+ "Contributor" shall mean Licensor and any individual or Legal Entity
64
+ on behalf of whom a Contribution has been received by Licensor and
65
+ subsequently incorporated within the Work.
66
+
67
+ 2. Grant of Copyright License. Subject to the terms and conditions of
68
+ this License, each Contributor hereby grants to You a perpetual,
69
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
70
+ copyright license to reproduce, prepare Derivative Works of,
71
+ publicly display, publicly perform, sublicense, and distribute the
72
+ Work and such Derivative Works in Source or Object form.
73
+
74
+ 3. Grant of Patent License. Subject to the terms and conditions of
75
+ this License, each Contributor hereby grants to You a perpetual,
76
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
77
+ (except as stated in this section) patent license to make, have made,
78
+ use, offer to sell, sell, import, and otherwise transfer the Work,
79
+ where such license applies only to those patent claims licensable
80
+ by such Contributor that are necessarily infringed by their
81
+ Contribution(s) alone or by combination of their Contribution(s)
82
+ with the Work to which such Contribution(s) was submitted. If You
83
+ institute patent litigation against any entity (including a
84
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
85
+ or a Contribution incorporated within the Work constitutes direct
86
+ or contributory patent infringement, then any patent licenses
87
+ granted to You under this License for that Work shall terminate
88
+ as of the date such litigation is filed.
89
+
90
+ 4. Redistribution. You may reproduce and distribute copies of the
91
+ Work or Derivative Works thereof in any medium, with or without
92
+ modifications, and in Source or Object form, provided that You
93
+ meet the following conditions:
94
+
95
+ (a) You must give any other recipients of the Work or
96
+ Derivative Works a copy of this License; and
97
+
98
+ (b) You must cause any modified files to carry prominent notices
99
+ stating that You changed the files; and
100
+
101
+ (c) You must retain, in the Source form of any Derivative Works
102
+ that You distribute, all copyright, patent, trademark, and
103
+ attribution notices from the Source form of the Work,
104
+ excluding those notices that do not pertain to any part of
105
+ the Derivative Works; and
106
+
107
+ (d) If the Work includes a "NOTICE" text file as part of its
108
+ distribution, then any Derivative Works that You distribute must
109
+ include a readable copy of the attribution notices contained
110
+ within such NOTICE file, excluding those notices that do not
111
+ pertain to any part of the Derivative Works, in at least one
112
+ of the following places: within a NOTICE text file distributed
113
+ as part of the Derivative Works; within the Source form or
114
+ documentation, if provided along with the Derivative Works; or,
115
+ within a display generated by the Derivative Works, if and
116
+ wherever such third-party notices normally appear. The contents
117
+ of the NOTICE file are for informational purposes only and
118
+ do not modify the License. You may add Your own attribution
119
+ notices within Derivative Works that You distribute, alongside
120
+ or as an addendum to the NOTICE text from the Work, provided
121
+ that such additional attribution notices cannot be construed
122
+ as modifying the License.
123
+
124
+ You may add Your own copyright statement to Your modifications and
125
+ may provide additional or different license terms and conditions
126
+ for use, reproduction, or distribution of Your modifications, or
127
+ for any such Derivative Works as a whole, provided Your use,
128
+ reproduction, and distribution of the Work otherwise complies with
129
+ the conditions stated in this License.
130
+
131
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
132
+ any Contribution intentionally submitted for inclusion in the Work
133
+ by You to the Licensor shall be under the terms and conditions of
134
+ this License, without any additional terms or conditions.
135
+ Notwithstanding the above, nothing herein shall supersede or modify
136
+ the terms of any separate license agreement you may have executed
137
+ with Licensor regarding such Contributions.
138
+
139
+ 6. Trademarks. This License does not grant permission to use the trade
140
+ names, trademarks, service marks, or product names of the Licensor,
141
+ except as required for reasonable and customary use in describing the
142
+ origin of the Work and reproducing the content of the NOTICE file.
143
+
144
+ 7. Disclaimer of Warranty. Unless required by applicable law or
145
+ agreed to in writing, Licensor provides the Work (and each
146
+ Contributor provides its Contributions) on an "AS IS" BASIS,
147
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
148
+ implied, including, without limitation, any warranties or conditions
149
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
150
+ PARTICULAR PURPOSE. You are solely responsible for determining the
151
+ appropriateness of using or redistributing the Work and assume any
152
+ risks associated with Your exercise of permissions under this License.
153
+
154
+ 8. Limitation of Liability. In no event and under no legal theory,
155
+ whether in tort (including negligence), contract, or otherwise,
156
+ unless required by applicable law (such as deliberate and grossly
157
+ negligent acts) or agreed to in writing, shall any Contributor be
158
+ liable to You for damages, including any direct, indirect, special,
159
+ incidental, or consequential damages of any character arising as a
160
+ result of this License or out of the use or inability to use the
161
+ Work (including but not limited to damages for loss of goodwill,
162
+ work stoppage, computer failure or malfunction, or any and all
163
+ other commercial damages or losses), even if such Contributor
164
+ has been advised of the possibility of such damages.
165
+
166
+ 9. Accepting Warranty or Additional Liability. While redistributing
167
+ the Work or Derivative Works thereof, You may choose to offer,
168
+ and charge a fee for, acceptance of support, warranty, indemnity,
169
+ or other liability obligations and/or rights consistent with this
170
+ License. However, in accepting such obligations, You may act only
171
+ on Your own behalf and on Your sole responsibility, not on behalf
172
+ of any other Contributor, and only if You agree to indemnify,
173
+ defend, and hold each Contributor harmless for any liability
174
+ incurred by, or claims asserted against, such Contributor by reason
175
+ of your accepting any such warranty or additional liability.
176
+
177
+ END OF TERMS AND CONDITIONS
178
+
179
+ APPENDIX: How to apply the Apache License to your work.
180
+
181
+ To apply the Apache License to your work, attach the following
182
+ boilerplate notice, with the fields enclosed by brackets "[]"
183
+ replaced with your own identifying information. (Don't include
184
+ the brackets!) The text should be enclosed in the appropriate
185
+ comment syntax for the file format. We also recommend that a
186
+ file or class name and description of purpose be included on the
187
+ same "printed page" as the copyright notice for easier
188
+ identification within third-party archives.
189
+
190
+ Copyright [yyyy] [name of copyright owner]
191
+
192
+ Licensed under the Apache License, Version 2.0 (the "License");
193
+ you may not use this file except in compliance with the License.
194
+ You may obtain a copy of the License at
195
+
196
+ http://www.apache.org/licenses/LICENSE-2.0
197
+
198
+ Unless required by applicable law or agreed to in writing, software
199
+ distributed under the License is distributed on an "AS IS" BASIS,
200
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
201
+ See the License for the specific language governing permissions and
202
+ limitations under the License.
203
+
204
+ Copyright 2026 PQC Migration Safety Lab
205
+
README.md ADDED
@@ -0,0 +1,190 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ ---
2
+ license: apache-2.0
3
+ task_categories:
4
+ - text-classification
5
+ - tabular-classification
6
+ tags:
7
+ - formal-methods
8
+ - theorem-proving
9
+ - post-quantum
10
+ - cryptography
11
+ - protocol-verification
12
+ pretty_name: "PQC Formal Corpus: named results from a post-quantum verification effort"
13
+ size_categories:
14
+ - n<1K
15
+ configs:
16
+ - config_name: default
17
+ data_files: pqc_formal_corpus.jsonl
18
+ ---
19
+
20
+ # Dataset Card — PQC Formal Corpus
21
+
22
+ ## Summary
23
+
24
+ **122 named formal results** — theorems, lemmas, goals, queries and invariants — from a
25
+ single sustained effort to mechanically verify a post-quantum authenticated key exchange,
26
+ spread across **6 prover dialects**.
27
+
28
+ Each row records *what was named and where*, plus two derived index fields. It is a map of
29
+ what has been mechanically established about one PQC migration: usable as an index, a
30
+ teaching aid, or a target list for independent re-derivation.
31
+
32
+ - **Rows:** 122
33
+ - **Provers:** 6 (Lean, EasyCrypt, Tamarin, TLA+, CryptoVerif, Squirrel)
34
+ - **Format:** JSON Lines, one result per line
35
+ - **Licence:** Apache-2.0
36
+
37
+ ## Schema
38
+
39
+ | Field | Type | Description |
40
+ |---|---|---|
41
+ | `prover` | string | dialect the result lives in: `lean`, `easycrypt`, `tamarin`, `tla`, `cryptoverif`, `squirrel` |
42
+ | `name` | string | identifier the result is proven under, e.g. `no_key_reinstall` |
43
+ | `kind` | string | `theorem` · `lemma` · `goal` · `query` · `invariant` |
44
+ | `module` | string | source module stem, no path, e.g. `MerkleBeacon` |
45
+ | `category` | string | **derived** subject bucket, e.g. `downgrade`, `resource-bound` |
46
+ | `polarity` | string | **derived** role: `safety` · `reachability` · `reduction` · `control` · `bound` · `security-property` · `structural` · `other` |
47
+
48
+ ### Distribution
49
+
50
+ | prover | results |
51
+ |---|--:|
52
+ | easycrypt | 51 |
53
+ | tamarin | 35 |
54
+ | lean | 20 |
55
+ | tla | 14 |
56
+ | cryptoverif | 1 |
57
+ | squirrel | 1 |
58
+
59
+ | polarity | results |
60
+ |---|--:|
61
+ | safety | 32 |
62
+ | reachability | 15 |
63
+ | structural | 15 |
64
+ | bound | 14 |
65
+ | reduction | 14 |
66
+ | security-property | 13 |
67
+ | other | 15 |
68
+ | control | 4 |
69
+
70
+ ## ⚠️ `category` and `polarity` are heuristics, not ground truth
71
+
72
+ Both are derived **from the identifier string alone** by substring matching, not from the
73
+ proof body or any semantic analysis. They exist to make 122 rows browsable. They are
74
+ useful for filtering and wrong often enough that you should not build a claim on them.
75
+
76
+ Two known behaviours, documented rather than hidden:
77
+
78
+ - **Controls are checked before safety properties.** A control is typically named for the
79
+ property it deliberately *fails* to uphold (`naive_forgery_is_free`), so testing safety
80
+ first would file it as the property itself. There is a test asserting this ordering.
81
+ - **15 rows land in `polarity: other`** and 7 in `category: other`. Those are rows whose
82
+ names carry no signal the heuristic recognises, not rows that mean nothing.
83
+
84
+ `prover`, `name`, `kind` and `module` are extracted directly and carry no interpretation.
85
+
86
+ ## What is NOT in this dataset
87
+
88
+ **No proof bodies. No tactic scripts. No model source.**
89
+
90
+ A name plus its provenance is an index. The mechanised argument stays in the closed tree,
91
+ because several of these proofs encode repair mechanisms directly, and publishing the
92
+ argument would publish the repair.
93
+
94
+ Two tests enforce this. One greps the shipped file for proof syntax (`:=`, `by omega`,
95
+ `qed`, `Proof.`, `sorry`, `admit`) and fails if any appears. The other asserts that every
96
+ row carries *exactly* the six documented fields and nothing else, so no internal annotation
97
+ can ride along with an identifier.
98
+
99
+ **Prover builtins are excluded.** `attacker` is a ProVerif builtin predicate, not a lemma.
100
+ Before the denylist it was extracted as the sole "ProVerif result" — which would have made
101
+ the corpus quietly wrong. ProVerif therefore contributes **zero** rows: its models are
102
+ query-driven in a form this extractor does not treat as named results. That is a real
103
+ limitation, not an omission.
104
+
105
+ ## How it was produced
106
+
107
+ One regex per dialect over the committed prover sources, then:
108
+
109
+ 1. drop identifiers shorter than 5 characters (they collide with ordinary language);
110
+ 2. drop anything in the builtin denylist;
111
+ 3. deduplicate on `(prover, name)`;
112
+ 4. derive `category` and `polarity` from the name;
113
+ 5. sort by `(prover, name)` so the output is byte-stable across runs.
114
+
115
+ ```bash
116
+ python -m pqc_formal_corpus.build <formal-models-root> \
117
+ src/pqc_formal_corpus/data/pqc_formal_corpus.jsonl
118
+ ```
119
+
120
+ ## Usage
121
+
122
+ ```python
123
+ from pqc_formal_corpus import load, by_prover, by_category
124
+
125
+ results = load()
126
+ len(results) # 122
127
+ by_prover(results) # {'cryptoverif': 1, 'easycrypt': 51, ...}
128
+
129
+ safety = [r for r in results if r.polarity == "safety"]
130
+ [r.name for r in safety][:3]
131
+ # ['no_safe_policy_skips_gate', 'no_third_option', 'no_eap_method_downgrade']
132
+
133
+ # every result about resource bounds, whichever prover proved it
134
+ [r.name for r in results if r.category == "resource-bound"]
135
+ # ['bounded', 'bounded_at_canonical', 'naive_unbounded', 'separation',
136
+ # 'window_admits_and_bounded', 'window_nonempty']
137
+ ```
138
+
139
+ Note `no_third_option` in that safety list: it is really a *dichotomy* result, filed as
140
+ `safety` because the heuristic matches the `no_` prefix first. That is the imprecision the
141
+ warning above describes, shown rather than hidden.
142
+
143
+ ```python
144
+ # Hugging Face
145
+ from datasets import load_dataset
146
+ ds = load_dataset("nickharris808/pqc-formal-corpus")
147
+ ```
148
+
149
+ ## Intended use
150
+
151
+ - **An index** into what one PQC migration has actually proven, and in which prover.
152
+ - **A re-derivation target list** — every row names something a third party could
153
+ independently formalise and check against.
154
+ - **Research on verification practice**: how effort distributes across provers, how many
155
+ results are controls versus properties, what a multi-prover corpus looks like in shape.
156
+
157
+ ## Out of scope
158
+
159
+ - **Not the proofs.** You cannot check these results from this dataset; it names them.
160
+ - **Not a benchmark.** There is no task, no split, no metric. For a scorable benchmark see
161
+ [PQC-MFB](https://github.com/nickharris808/pqc-mfb).
162
+ - **Not a completeness claim.** These are the results this effort named. A property nobody
163
+ named is absent, and absence here says nothing about the protocol.
164
+ - **Not a vulnerability disclosure.**
165
+
166
+ ## Limitations and biases
167
+
168
+ - **One effort, one protocol family.** Everything derives from a single verification push
169
+ on post-quantum Wi-Fi authentication. Category proportions reflect that effort's
170
+ priorities, not the field's.
171
+ - **Extraction is regex-based**, so a result declared in an unusual syntactic form is
172
+ missed. ProVerif contributing zero rows is the clearest instance.
173
+ - **`easycrypt` dominates at 51/122**, which reflects where the computational proofs live,
174
+ not that EasyCrypt results matter more.
175
+ - **Derived fields are heuristic** — see the warning above.
176
+
177
+ ## Citation
178
+
179
+ ```bibtex
180
+ @misc{pqcformalcorpus2026,
181
+ title = {PQC Formal Corpus: named results from a post-quantum verification effort},
182
+ author = {{PQC Migration Safety Lab}},
183
+ year = {2026},
184
+ note = {122 named results across 6 prover dialects}
185
+ }
186
+ ```
187
+
188
+ ## Contact
189
+
190
+ Issues via the repository. For the closed core, open a GitHub Discussion or an issue.
corpus_meta.json ADDED
@@ -0,0 +1,66 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "by_category": {
3
+ "admission-control": 7,
4
+ "authentication": 10,
5
+ "bound": 1,
6
+ "capability-binding": 3,
7
+ "composition": 6,
8
+ "credential": 3,
9
+ "dichotomy": 4,
10
+ "downgrade": 10,
11
+ "epoch": 1,
12
+ "error-correction": 1,
13
+ "fragmentation": 1,
14
+ "hardness-assumption": 2,
15
+ "hybrid-combiner": 3,
16
+ "kem-reduction": 8,
17
+ "key-installation": 2,
18
+ "lower-bound": 4,
19
+ "multi-link": 3,
20
+ "non-mergeability": 4,
21
+ "other": 7,
22
+ "password": 14,
23
+ "policy-binding": 3,
24
+ "qrom": 8,
25
+ "quantum-adversary": 2,
26
+ "resource-bound": 6,
27
+ "roaming": 4,
28
+ "secrecy": 2,
29
+ "transcript-binding": 3
30
+ },
31
+ "by_polarity": {
32
+ "bound": 14,
33
+ "control": 4,
34
+ "other": 15,
35
+ "reachability": 15,
36
+ "reduction": 14,
37
+ "safety": 32,
38
+ "security-property": 13,
39
+ "structural": 15
40
+ },
41
+ "by_prover": {
42
+ "cryptoverif": 1,
43
+ "easycrypt": 51,
44
+ "lean": 20,
45
+ "squirrel": 1,
46
+ "tamarin": 35,
47
+ "tla": 14
48
+ },
49
+ "excluded": [
50
+ "proof bodies",
51
+ "tactic scripts",
52
+ "model source"
53
+ ],
54
+ "fields": [
55
+ "prover",
56
+ "name",
57
+ "kind",
58
+ "module",
59
+ "category",
60
+ "polarity"
61
+ ],
62
+ "n_provers": 6,
63
+ "n_results": 122,
64
+ "name": "pqc-formal-corpus",
65
+ "schema_version": 1
66
+ }
pqc_formal_corpus.jsonl ADDED
@@ -0,0 +1,122 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {"category": "other", "kind": "query", "module": "sae_online", "name": "guessed", "polarity": "other", "prover": "cryptoverif"}
2
+ {"category": "authentication", "kind": "lemma", "module": "MerkleBeacon", "name": "beacon_forge_reduces_to_euf_cma", "polarity": "reduction", "prover": "easycrypt"}
3
+ {"category": "authentication", "kind": "lemma", "module": "TranscriptForge", "name": "bound_blocks_free_substitution", "polarity": "bound", "prover": "easycrypt"}
4
+ {"category": "authentication", "kind": "lemma", "module": "TranscriptForge", "name": "bound_blocks_role_confusion", "polarity": "bound", "prover": "easycrypt"}
5
+ {"category": "hybrid-combiner", "kind": "lemma", "module": "Combiner", "name": "combiner_robust", "polarity": "other", "prover": "easycrypt"}
6
+ {"category": "password", "kind": "lemma", "module": "SAE_PAKE", "name": "commit_hides_pw", "polarity": "security-property", "prover": "easycrypt"}
7
+ {"category": "password", "kind": "lemma", "module": "SAE_PAKE", "name": "commit_is_uniform", "polarity": "security-property", "prover": "easycrypt"}
8
+ {"category": "composition", "kind": "lemma", "module": "EnvelopeAKM", "name": "composition_union", "polarity": "structural", "prover": "easycrypt"}
9
+ {"category": "composition", "kind": "lemma", "module": "Composition", "name": "composition_union_pr", "polarity": "structural", "prover": "easycrypt"}
10
+ {"category": "composition", "kind": "lemma", "module": "EnvelopeAKM", "name": "envelope_composable", "polarity": "structural", "prover": "easycrypt"}
11
+ {"category": "composition", "kind": "lemma", "module": "EnvelopeSSP", "name": "envelope_concrete_multi", "polarity": "other", "prover": "easycrypt"}
12
+ {"category": "composition", "kind": "lemma", "module": "EnvelopeSSP", "name": "envelope_concrete_negl", "polarity": "other", "prover": "easycrypt"}
13
+ {"category": "hardness-assumption", "kind": "lemma", "module": "MLKEM_IND_CCA", "name": "envelope_grounded_in_mlwe", "polarity": "structural", "prover": "easycrypt"}
14
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO", "name": "envelope_grounded_via_qrom", "polarity": "structural", "prover": "easycrypt"}
15
+ {"category": "composition", "kind": "lemma", "module": "EnvelopeAKM", "name": "envelope_pq_when_components_pq", "polarity": "other", "prover": "easycrypt"}
16
+ {"category": "hardness-assumption", "kind": "lemma", "module": "MLKEM_IND_CCA", "name": "envelope_secure_under_mlwe", "polarity": "other", "prover": "easycrypt"}
17
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO_Concrete", "name": "fo_loss_baseline_derived", "polarity": "reduction", "prover": "easycrypt"}
18
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO_Concrete", "name": "fo_loss_ge0", "polarity": "other", "prover": "easycrypt"}
19
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO", "name": "fo_reduction_structured", "polarity": "reduction", "prover": "easycrypt"}
20
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO_Concrete", "name": "fo_reduction_structured_concrete", "polarity": "reduction", "prover": "easycrypt"}
21
+ {"category": "policy-binding", "kind": "lemma", "module": "PolicyInevitability", "name": "forall_policy_implies_gate", "polarity": "other", "prover": "easycrypt"}
22
+ {"category": "kem-reduction", "kind": "lemma", "module": "ForwardSecrecy", "name": "fs_reduces_to_ephemeral_cpa", "polarity": "reduction", "prover": "easycrypt"}
23
+ {"category": "kem-reduction", "kind": "lemma", "module": "FtRoamFS", "name": "ft_roam_fs_reduces_to_ephemeral_cpa", "polarity": "reduction", "prover": "easycrypt"}
24
+ {"category": "authentication", "kind": "lemma", "module": "TranscriptForge", "name": "injective_partnering", "polarity": "security-property", "prover": "easycrypt"}
25
+ {"category": "kem-reduction", "kind": "lemma", "module": "KdfKeySecrecy", "name": "kdf_secrecy_is_prf_over_kem", "polarity": "security-property", "prover": "easycrypt"}
26
+ {"category": "kem-reduction", "kind": "lemma", "module": "MLKEM_IND_CCA", "name": "kem_grounded_in_mlwe", "polarity": "structural", "prover": "easycrypt"}
27
+ {"category": "kem-reduction", "kind": "lemma", "module": "KemKeySecrecyCCA", "name": "ks_cca_reduces_to_kem_ror_cca", "polarity": "reduction", "prover": "easycrypt"}
28
+ {"category": "kem-reduction", "kind": "lemma", "module": "KemKeySecrecy", "name": "ks_reduces_to_kem_ror", "polarity": "reduction", "prover": "easycrypt"}
29
+ {"category": "authentication", "kind": "lemma", "module": "SigForge", "name": "ma_reduces_to_euf_cma", "polarity": "reduction", "prover": "easycrypt"}
30
+ {"category": "password", "kind": "lemma", "module": "OCAKE_noIC", "name": "mask_hides_pw", "polarity": "security-property", "prover": "easycrypt"}
31
+ {"category": "password", "kind": "lemma", "module": "OCAKE_noIC", "name": "masked_is_uniform", "polarity": "security-property", "prover": "easycrypt"}
32
+ {"category": "kem-reduction", "kind": "lemma", "module": "MloKeyHierarchy", "name": "mlo_link_key_independence_reduces_to_prf", "polarity": "reduction", "prover": "easycrypt"}
33
+ {"category": "other", "kind": "lemma", "module": "MerkleBeacon", "name": "naive_bare_root_replay_is_free", "polarity": "control", "prover": "easycrypt"}
34
+ {"category": "authentication", "kind": "lemma", "module": "TranscriptForge", "name": "naive_forgery_is_free", "polarity": "control", "prover": "easycrypt"}
35
+ {"category": "authentication", "kind": "lemma", "module": "TranscriptForge", "name": "naive_role_confusion_is_free", "polarity": "control", "prover": "easycrypt"}
36
+ {"category": "policy-binding", "kind": "lemma", "module": "PolicyInevitability", "name": "no_safe_policy_skips_gate", "polarity": "safety", "prover": "easycrypt"}
37
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO_Concrete", "name": "o2h_bound_derived", "polarity": "reduction", "prover": "easycrypt"}
38
+ {"category": "password", "kind": "lemma", "module": "OCAKE_noIC", "name": "ocake_noic_offline_resistance", "polarity": "security-property", "prover": "easycrypt"}
39
+ {"category": "password", "kind": "lemma", "module": "OCAKE_offline", "name": "ocake_offline_resistance", "polarity": "security-property", "prover": "easycrypt"}
40
+ {"category": "password", "kind": "lemma", "module": "SAE_PAKE", "name": "offline_hiding_derived", "polarity": "reduction", "prover": "easycrypt"}
41
+ {"category": "kem-reduction", "kind": "lemma", "module": "PostCompromise", "name": "pcs_reduces_to_prf", "polarity": "reduction", "prover": "easycrypt"}
42
+ {"category": "other", "kind": "lemma", "module": "Composition", "name": "pr_or_le", "polarity": "bound", "prover": "easycrypt"}
43
+ {"category": "password", "kind": "lemma", "module": "RunningCodeLink", "name": "ptk_binds_committed_object", "polarity": "structural", "prover": "easycrypt"}
44
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO", "name": "qrom_secure_under_mlwe", "polarity": "other", "prover": "easycrypt"}
45
+ {"category": "qrom", "kind": "lemma", "module": "Qrom_FO_Concrete", "name": "qrom_secure_under_mlwe_concrete", "polarity": "other", "prover": "easycrypt"}
46
+ {"category": "dichotomy", "kind": "lemma", "module": "Qrom_FO", "name": "recovers_import", "polarity": "reachability", "prover": "easycrypt"}
47
+ {"category": "password", "kind": "lemma", "module": "SAE_PAKE", "name": "sae_offline_resistance", "polarity": "security-property", "prover": "easycrypt"}
48
+ {"category": "password", "kind": "lemma", "module": "SAE_PAKE", "name": "sae_online_only_bound", "polarity": "other", "prover": "easycrypt"}
49
+ {"category": "password", "kind": "lemma", "module": "SAE_PAKE", "name": "sae_pfs_bound", "polarity": "other", "prover": "easycrypt"}
50
+ {"category": "authentication", "kind": "lemma", "module": "TranscriptForge", "name": "subst_reduces_to_euf_cma", "polarity": "reduction", "prover": "easycrypt"}
51
+ {"category": "hybrid-combiner", "kind": "lemma", "module": "Combiner", "name": "survives_one_break", "polarity": "reachability", "prover": "easycrypt"}
52
+ {"category": "transcript-binding", "kind": "lemma", "module": "RunningCodeLink", "name": "transcript_binding", "polarity": "structural", "prover": "easycrypt"}
53
+ {"category": "bound", "kind": "theorem", "module": "AuthEntropy", "name": "advantage_exceeds_target", "polarity": "bound", "prover": "lean"}
54
+ {"category": "non-mergeability", "kind": "theorem", "module": "NonMergeability", "name": "af_ag_not_mergeable", "polarity": "structural", "prover": "lean"}
55
+ {"category": "resource-bound", "kind": "theorem", "module": "Bound", "name": "bounded", "polarity": "bound", "prover": "lean"}
56
+ {"category": "resource-bound", "kind": "theorem", "module": "Bound", "name": "bounded_at_canonical", "polarity": "bound", "prover": "lean"}
57
+ {"category": "dichotomy", "kind": "theorem", "module": "ReassemblyFloor", "name": "buffer_all_covers", "polarity": "structural", "prover": "lean"}
58
+ {"category": "lower-bound", "kind": "theorem", "module": "AuthEntropy", "name": "deception_floor", "polarity": "bound", "prover": "lean"}
59
+ {"category": "non-mergeability", "kind": "theorem", "module": "NonMergeability", "name": "disjoint_epoch_families_not_mergeable", "polarity": "structural", "prover": "lean"}
60
+ {"category": "lower-bound", "kind": "theorem", "module": "AuthEntropy", "name": "floor_achievable", "polarity": "bound", "prover": "lean"}
61
+ {"category": "lower-bound", "kind": "theorem", "module": "Bound", "name": "floor_necessary", "polarity": "bound", "prover": "lean"}
62
+ {"category": "dichotomy", "kind": "theorem", "module": "ReassemblyFloor", "name": "gate_covers", "polarity": "structural", "prover": "lean"}
63
+ {"category": "other", "kind": "theorem", "module": "Bound", "name": "gated_le_naive", "polarity": "bound", "prover": "lean"}
64
+ {"category": "non-mergeability", "kind": "theorem", "module": "NonMergeability", "name": "idempotent_advances_neither_coord", "polarity": "structural", "prover": "lean"}
65
+ {"category": "non-mergeability", "kind": "theorem", "module": "NonMergeability", "name": "idempotent_not_strict", "polarity": "structural", "prover": "lean"}
66
+ {"category": "lower-bound", "kind": "theorem", "module": "AuthEntropy", "name": "movable_but_irreducible", "polarity": "bound", "prover": "lean"}
67
+ {"category": "resource-bound", "kind": "theorem", "module": "Bound", "name": "naive_unbounded", "polarity": "control", "prover": "lean"}
68
+ {"category": "dichotomy", "kind": "theorem", "module": "ReassemblyFloor", "name": "no_third_option", "polarity": "safety", "prover": "lean"}
69
+ {"category": "epoch", "kind": "theorem", "module": "NonMergeability", "name": "oneshot_fold_cannot_close_epoch_family", "polarity": "other", "prover": "lean"}
70
+ {"category": "resource-bound", "kind": "theorem", "module": "Bound", "name": "separation", "polarity": "bound", "prover": "lean"}
71
+ {"category": "resource-bound", "kind": "theorem", "module": "Bound", "name": "window_admits_and_bounded", "polarity": "bound", "prover": "lean"}
72
+ {"category": "resource-bound", "kind": "theorem", "module": "Bound", "name": "window_nonempty", "polarity": "bound", "prover": "lean"}
73
+ {"category": "authentication", "kind": "goal", "module": "envelope_kex", "name": "confirmation_key_secret", "polarity": "security-property", "prover": "squirrel"}
74
+ {"category": "quantum-adversary", "kind": "lemma", "module": "quantum", "name": "classical_secret_under_quantum", "polarity": "other", "prover": "tamarin"}
75
+ {"category": "roaming", "kind": "lemma", "module": "pqc_akm_core", "name": "e_roam_reachable", "polarity": "reachability", "prover": "tamarin"}
76
+ {"category": "admission-control", "kind": "lemma", "module": "pqc_akm_core2", "name": "f_puzzle_reachable", "polarity": "reachability", "prover": "tamarin"}
77
+ {"category": "roaming", "kind": "lemma", "module": "pqc_akm", "name": "ft_roam_reachable", "polarity": "reachability", "prover": "tamarin"}
78
+ {"category": "admission-control", "kind": "lemma", "module": "pqc_akm", "name": "gate_then_expensive_reachable", "polarity": "reachability", "prover": "tamarin"}
79
+ {"category": "multi-link", "kind": "lemma", "module": "pqc_akm_core", "name": "h_linkb_reachable", "polarity": "reachability", "prover": "tamarin"}
80
+ {"category": "capability-binding", "kind": "lemma", "module": "pqc_akm_core", "name": "i_cap_reachable", "polarity": "reachability", "prover": "tamarin"}
81
+ {"category": "policy-binding", "kind": "lemma", "module": "pqc_akm_core", "name": "j_policy_reachable", "polarity": "reachability", "prover": "tamarin"}
82
+ {"category": "other", "kind": "lemma", "module": "pqc_akm_core2", "name": "k_method_reachable", "polarity": "reachability", "prover": "tamarin"}
83
+ {"category": "credential", "kind": "lemma", "module": "pqc_akm_core2", "name": "l_cred_reachable", "polarity": "reachability", "prover": "tamarin"}
84
+ {"category": "other", "kind": "lemma", "module": "envelope_necessity", "name": "legit_reachable", "polarity": "reachability", "prover": "tamarin"}
85
+ {"category": "error-correction", "kind": "lemma", "module": "pqc_akm_core2", "name": "m_fec_reachable", "polarity": "reachability", "prover": "tamarin"}
86
+ {"category": "password", "kind": "lemma", "module": "pqc_akm_offline", "name": "masking_secret_secret", "polarity": "security-property", "prover": "tamarin"}
87
+ {"category": "downgrade", "kind": "lemma", "module": "pqc_akm_core2", "name": "no_eap_method_downgrade", "polarity": "safety", "prover": "tamarin"}
88
+ {"category": "downgrade", "kind": "lemma", "module": "pqc_akm", "name": "no_eap_suite_downgrade", "polarity": "safety", "prover": "tamarin"}
89
+ {"category": "admission-control", "kind": "lemma", "module": "pqc_akm", "name": "no_expensive_before_gate", "polarity": "safety", "prover": "tamarin"}
90
+ {"category": "downgrade", "kind": "lemma", "module": "pqc_akm_core2", "name": "no_fec_downgrade", "polarity": "safety", "prover": "tamarin"}
91
+ {"category": "other", "kind": "lemma", "module": "pqc_akm", "name": "no_ft_fs_extension", "polarity": "safety", "prover": "tamarin"}
92
+ {"category": "downgrade", "kind": "lemma", "module": "pqc_akm", "name": "no_indcca_downgrade", "polarity": "safety", "prover": "tamarin"}
93
+ {"category": "key-installation", "kind": "lemma", "module": "envelope", "name": "no_key_reinstall", "polarity": "safety", "prover": "tamarin"}
94
+ {"category": "multi-link", "kind": "lemma", "module": "pqc_akm_core", "name": "no_mlo_key_crosslink", "polarity": "safety", "prover": "tamarin"}
95
+ {"category": "password", "kind": "lemma", "module": "pqc_akm_offline", "name": "no_offline_dictionary", "polarity": "safety", "prover": "tamarin"}
96
+ {"category": "transcript-binding", "kind": "lemma", "module": "envelope", "name": "no_partial_transcript", "polarity": "safety", "prover": "tamarin"}
97
+ {"category": "downgrade", "kind": "lemma", "module": "pqc_akm_core", "name": "no_policy_downgrade", "polarity": "safety", "prover": "tamarin"}
98
+ {"category": "admission-control", "kind": "lemma", "module": "pqc_akm_core2", "name": "no_puzzle_replay", "polarity": "safety", "prover": "tamarin"}
99
+ {"category": "roaming", "kind": "lemma", "module": "pqc_akm_core", "name": "no_replay_roaming_epoch", "polarity": "safety", "prover": "tamarin"}
100
+ {"category": "downgrade", "kind": "lemma", "module": "envelope", "name": "no_silent_downgrade", "polarity": "safety", "prover": "tamarin"}
101
+ {"category": "credential", "kind": "lemma", "module": "pqc_akm_core2", "name": "no_stale_credential", "polarity": "safety", "prover": "tamarin"}
102
+ {"category": "capability-binding", "kind": "lemma", "module": "pqc_akm_core", "name": "no_unauth_capability", "polarity": "safety", "prover": "tamarin"}
103
+ {"category": "authentication", "kind": "lemma", "module": "pqc_akm_offline", "name": "online_confirm_reachable", "polarity": "reachability", "prover": "tamarin"}
104
+ {"category": "quantum-adversary", "kind": "lemma", "module": "pqc_akm", "name": "pqc_secret_under_quantum", "polarity": "other", "prover": "tamarin"}
105
+ {"category": "secrecy", "kind": "lemma", "module": "envelope", "name": "ptk_secrecy", "polarity": "security-property", "prover": "tamarin"}
106
+ {"category": "hybrid-combiner", "kind": "lemma", "module": "quantum", "name": "quantum_break_reachable", "polarity": "reachability", "prover": "tamarin"}
107
+ {"category": "fragmentation", "kind": "lemma", "module": "envelope_necessity", "name": "splice_succeeds_without_binding", "polarity": "structural", "prover": "tamarin"}
108
+ {"category": "secrecy", "kind": "lemma", "module": "pqc_akm", "name": "z_payload_secret", "polarity": "security-property", "prover": "tamarin"}
109
+ {"category": "downgrade", "kind": "invariant", "module": "EaptlsCapsule", "name": "NoEapMethodDowngrade", "polarity": "safety", "prover": "tla"}
110
+ {"category": "admission-control", "kind": "invariant", "module": "AntiClogging", "name": "NoExpensiveWorkBeforeGateUnderLoad", "polarity": "safety", "prover": "tla"}
111
+ {"category": "downgrade", "kind": "invariant", "module": "AdaptiveFec", "name": "NoFecDowngrade", "polarity": "safety", "prover": "tla"}
112
+ {"category": "key-installation", "kind": "invariant", "module": "InstallID", "name": "NoKeyReinstall", "polarity": "safety", "prover": "tla"}
113
+ {"category": "admission-control", "kind": "invariant", "module": "TailBound", "name": "NoLegitStarvation", "polarity": "safety", "prover": "tla"}
114
+ {"category": "multi-link", "kind": "invariant", "module": "MloKeyHierarchy", "name": "NoMloKeyCrosslink", "polarity": "safety", "prover": "tla"}
115
+ {"category": "password", "kind": "invariant", "module": "PqcPake", "name": "NoOfflineDictionary", "polarity": "safety", "prover": "tla"}
116
+ {"category": "transcript-binding", "kind": "invariant", "module": "FragmentRoot", "name": "NoPartialTranscriptAccept", "polarity": "safety", "prover": "tla"}
117
+ {"category": "downgrade", "kind": "invariant", "module": "PolicyBind", "name": "NoPolicyDowngrade", "polarity": "safety", "prover": "tla"}
118
+ {"category": "admission-control", "kind": "invariant", "module": "AntiClogPuzzle", "name": "NoPuzzleReplay", "polarity": "safety", "prover": "tla"}
119
+ {"category": "roaming", "kind": "invariant", "module": "RoamEpoch", "name": "NoReplayRoamingEpoch", "polarity": "safety", "prover": "tla"}
120
+ {"category": "downgrade", "kind": "invariant", "module": "DowngradeFirewall", "name": "NoSilentDowngrade", "polarity": "safety", "prover": "tla"}
121
+ {"category": "credential", "kind": "invariant", "module": "CredCache", "name": "NoStaleCredential", "polarity": "safety", "prover": "tla"}
122
+ {"category": "capability-binding", "kind": "invariant", "module": "BeaconAuth", "name": "NoUnauthCapability", "polarity": "safety", "prover": "tla"}