Repository navigation
Expand file tree
/
Copy pathchallenges.json
More file actions
202 lines (202 loc) · 7.52 KB
/
Copy pathchallenges.json
File metadata and controls
202 lines (202 loc) · 7.52 KB
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
{
"name": "ots.golf",
"contract": {
"version": "ots-v1-draft",
"statement": "formal/OptimalOTS/Model.lean",
"pin_file": "verifier/protected.sha256",
"cost_model": "one compression per started 512-bit block of the input"
},
"permitted_axioms": [
"propext",
"Quot.sound",
"Classical.choice"
],
"protected": [
"challenges.json",
"formal/lean-toolchain",
"formal/lakefile.lean",
"formal/lake-manifest.json",
"formal/OptimalOTS.lean",
"formal/OptimalOTS/Model.lean",
"formal/OptimalOTS/Dag.lean",
"verifier/comparator-lower-generality-1.json",
"formal/OptimalOTS/Challenge/LowerGenerality1.lean.in",
"formal/OptimalOTS/OracleAlgorithm.lean",
"formal/OptimalOTS/WholeWords.lean",
"formal/OptimalOTS/Challenge/UpperCompressions.lean.in",
"verifier/comparator-upper-compressions.json",
"formal/OptimalOTS/RiscvMachine.lean",
"formal/OptimalOTS/Riscv.lean",
"formal/OptimalOTS/Challenge/UpperRiscv.lean.in",
"verifier/comparator-upper-riscv.json",
"formal/OptimalOTS/LeanIsaMachine.lean",
"formal/OptimalOTS/LeanIsa.lean",
"formal/OptimalOTS/Challenge/UpperLeanIsa.lean.in",
"verifier/comparator-upper-leanisa.json",
"formal/OptimalOTS/RiscvHint.lean",
"formal/OptimalOTS/Challenge/UpperRiscvHint.lean.in",
"verifier/comparator-upper-riscv-hint.json"
],
"limits": {
"wall_clock_seconds": 1200,
"memory_bytes": 25769803776,
"max_files": 200,
"max_file_bytes": 8388608,
"max_total_bytes": 16777216,
"max_claim": 1000000
},
"tracks": [
{
"slug": "lower-generality-1",
"title": "Lower bound",
"framework": "generality-1",
"kind": "lower",
"direction": "+",
"submission_root": "formal/Submissions/LowerGenerality1",
"module_prefix": "Submissions.LowerGenerality1",
"solution_module": "Submissions.LowerGenerality1.Solution",
"challenge_template": "formal/OptimalOTS/Challenge/LowerGenerality1.lean.in",
"challenge_file": "formal/OptimalOTS/Challenge/LowerGenerality1.lean",
"challenge_module": "OptimalOTS.Challenge.LowerGenerality1",
"comparator_config": "verifier/comparator-lower-generality-1.json",
"allowed_import_prefixes": [
"Mathlib",
"VCVio",
"OptimalOTS.Model",
"OptimalOTS.Dag",
"OptimalOTS.WholeWords"
]
},
{
"slug": "upper-compressions",
"title": "Upper bound",
"framework": "oracle-algorithm",
"kind": "upper",
"direction": "-",
"focus": "compressions",
"tab_label": "Compressions",
"submission_root": "formal/Submissions/UpperCompressions",
"module_prefix": "Submissions.UpperCompressions",
"solution_module": "Submissions.UpperCompressions.Solution",
"challenge_template": "formal/OptimalOTS/Challenge/UpperCompressions.lean.in",
"challenge_file": "formal/OptimalOTS/Challenge/UpperCompressions.lean",
"challenge_module": "OptimalOTS.Challenge.UpperCompressions",
"comparator_config": "verifier/comparator-upper-compressions.json",
"allowed_import_prefixes": [
"Mathlib",
"VCVio",
"OptimalOTS.Model",
"OptimalOTS.Dag",
"OptimalOTS.OracleAlgorithm"
]
},
{
"slug": "upper-riscv",
"title": "RISC-V upper bound",
"framework": "oracle-algorithm",
"kind": "upper",
"direction": "-",
"cost_unit": "cycles",
"focus": "RISC-V cycles",
"tab_label": "RISC-V cycles",
"cycles_per_compression": 1,
"submission_root": "formal/Submissions/UpperRiscv",
"module_prefix": "Submissions.UpperRiscv",
"solution_module": "Submissions.UpperRiscv.Solution",
"challenge_template": "formal/OptimalOTS/Challenge/UpperRiscv.lean.in",
"challenge_file": "formal/OptimalOTS/Challenge/UpperRiscv.lean",
"challenge_module": "OptimalOTS.Challenge.UpperRiscv",
"comparator_config": "verifier/comparator-upper-riscv.json",
"allowed_import_prefixes": [
"Mathlib",
"VCVio",
"OptimalOTS.Model",
"OptimalOTS.Dag",
"OptimalOTS.OracleAlgorithm",
"OptimalOTS.RiscvMachine",
"OptimalOTS.Riscv"
]
},
{
"slug": "upper-leanisa",
"title": "leanISA upper bound",
"framework": "oracle-algorithm",
"kind": "upper",
"direction": "-",
"cost_unit": "cycles",
"focus": "leanISA cycles",
"tab_label": "leanISA cycles",
"cost_note": "leanVM's memory is committed before execution, so the 6016-bit public statement is re-derived inside the machine: 12 BLAKE2S compressions at 10 cycles each. 120 cycles of every leanISA claim are that fixed rehashing of the public input, which no RISC-V claim pays.",
"submission_root": "formal/Submissions/UpperLeanIsa",
"module_prefix": "Submissions.UpperLeanIsa",
"solution_module": "Submissions.UpperLeanIsa.Solution",
"challenge_template": "formal/OptimalOTS/Challenge/UpperLeanIsa.lean.in",
"challenge_file": "formal/OptimalOTS/Challenge/UpperLeanIsa.lean",
"challenge_module": "OptimalOTS.Challenge.UpperLeanIsa",
"comparator_config": "verifier/comparator-upper-leanisa.json",
"allowed_import_prefixes": [
"Mathlib",
"VCVio",
"LeanerVM.Parameters.Field",
"LeanerVM.Parameters.Generator",
"LeanerVM.Parameters.Isa",
"LeanerVM.Parameters.Blake2s",
"LeanerVM.Semantics.Memory",
"LeanerVM.Semantics.Instruction",
"LeanerVM.Semantics.Blake2s",
"LeanerVM.Semantics.Step",
"LeanerVM.Semantics.Execution",
"OptimalOTS.Model",
"OptimalOTS.Dag",
"OptimalOTS.OracleAlgorithm",
"OptimalOTS.LeanIsaMachine",
"OptimalOTS.LeanIsa"
]
},
{
"slug": "upper-riscv-hint",
"title": "Hinted RISC-V upper bound",
"framework": "oracle-algorithm",
"kind": "upper",
"direction": "-",
"cost_unit": "cycles",
"focus": "hinted RISC-V cycles",
"tab_label": "Hinted RISC-V",
"cost_note": "The machine reads a prover-chosen view of the signature in place of the raw signature, and the claim bounds every accepting execution over every view. Rejecting runs are not charged, so hinted and deterministic RISC-V totals bound different sets of executions.",
"submission_root": "formal/Submissions/UpperRiscvHint",
"module_prefix": "Submissions.UpperRiscvHint",
"solution_module": "Submissions.UpperRiscvHint.Solution",
"challenge_template": "formal/OptimalOTS/Challenge/UpperRiscvHint.lean.in",
"challenge_file": "formal/OptimalOTS/Challenge/UpperRiscvHint.lean",
"challenge_module": "OptimalOTS.Challenge.UpperRiscvHint",
"comparator_config": "verifier/comparator-upper-riscv-hint.json",
"allowed_import_prefixes": [
"Mathlib",
"VCVio",
"OptimalOTS.Model",
"OptimalOTS.Dag",
"OptimalOTS.OracleAlgorithm",
"OptimalOTS.RiscvMachine",
"OptimalOTS.Riscv",
"OptimalOTS.RiscvHint"
]
}
],
"upper_tracks": [
"upper-compressions",
"upper-riscv",
"upper-leanisa",
"upper-riscv-hint"
],
"lean_root": "formal",
"frameworks": [
{
"slug": "generality-1",
"title": "Whole-word DAGs",
"status": "active",
"lower_track": "lower-generality-1",
"description": "DAGs built from independent 128-bit secrets, fixed public 128-bit words, 256-bit hashes, fixed output halves and concatenation. Inputs and disclosures contain only whole words.",
"word_bits": 128
}
]
}