Repository navigation
Expand file tree
/
Copy pathR2Exec.lean
More file actions
289 lines (265 loc) · 15.1 KB
/
Copy pathR2Exec.lean
File metadata and controls
289 lines (265 loc) · 15.1 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
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
import FeProofs.Precompiles.Modexp.R2
import FeProofs.Precompiles.Modexp.Small
import FeProofs.Precompiles.Modexp.Clz
import FeProofs.Precompiles.LimbArray
/-!
# Modexp: the exported `Small<L>::r2` is `r2`
Each copy `Small_r2_1` … `Small_r2_4` is `pure` of `r2` at its `L`, for a modulus whose top limb is
not zero: the top bit by `leading_zeros` (`clz`), the doubling loop (`Small_r2_L.loop`), the six
squarings (`Small_r2_L.loop.loop_1`). The loop lemmas are stated and proved once per copy by the
same text.
-/
open Ethereum Fe Fe.EVM Reasoning.Theory
namespace FeProofs.Modexp
open FeProofs.Precompiles
open Precompiles.Exported.Shared Precompiles.Exported.Modexp
theorem has0_eq (N : ℕ) (hN : N < 2 ^ 256) {k : ℕ} (hk : k < 2 ^ 256) :
Lib.Range_has_0 ⟨(), UInt256.ofNat N⟩ (UInt256.ofNat k) = pure (decide (0 ≤ k ∧ k < N)) := by
simp only [Lib.Range_has_0, range_has_eq (lo := 0) hk (by norm_num) hN, bind_pure]
theorem has06_eq (r : Lib.Range_Known_0_Known_6) {k : ℕ} (hk : k < 2 ^ 256) :
Lib.Range_has_0_6 r (UInt256.ofNat k) = pure (decide (0 ≤ k ∧ k < 6)) := by
simp only [Lib.Range_has_0_6, range_has_eq (lo := 0) (hi := 6) hk (by norm_num) (by norm_num),
bind_pure]
/-- The position of the top bit of a nonzero limb, as `Small::r2` computes it. -/
theorem shift_eq (x : Limb) (hx : 0 < x.val) :
UInt256.ofNat 255 - IntTy.leadingZeros (.u 256) x.w = UInt256.ofNat x.val.log2 := by
have hl := log2_lt64 x
rw [leadingZeros_eq_clz, UInt256.clz, Limb.toNat_w, ite_eq_right (by omega)]
apply word_eq_of_toNat
rw [show UInt256.ofNat 255 - UInt256.ofNat (255 - x.val.log2) = UInt256.sub _ _ from rfl,
usub_toNat (by rw [toNat_lit (by omega), toNat_lit (by omega)]; omega),
toNat_lit (by omega), toNat_lit (by omega), toNat_lit (by omega)]
omega
theorem shl64_bit {s : ℕ} (hs : s < 64) :
IntTy.shl (.u 64) (UInt256.ofNat 1) (UInt256.ofNat s) = (bitL s hs).w := by
simp only [IntTy.shl, val_u, toNat_lit (show 1 < 2 ^ 256 by norm_num),
toNat_lit (show s < 2 ^ 256 by omega), show (256 ≤ s) = False by simp; omega, ite_false]
rw [show ((1 : ℕ) : ℤ) * 2 ^ s = ((2 ^ s : ℕ) : ℤ) by push_cast; ring, wrap_u_nat]
simp only [bitL, Limb.w]
rw [Nat.mod_eq_of_lt (Nat.pow_lt_pow_right (by norm_num) hs)]
theorem sub64_eq {s : ℕ} (hs : s < 64) :
IntTy.subW (.u 64) (UInt256.ofNat 64) (UInt256.ofNat s) = UInt256.ofNat (64 - s) := by
have := subW64_eq ⟨64, by norm_num⟩ ⟨s, by omega⟩
simp only [Limb.w, subMod] at this
rw [this, show (64 + 2 ^ 64 - s) % 2 ^ 64 = 64 - s by omega]
/-- Reduces the exporter's `if L == k` branches at a constant `L`. -/
macro "lbranch" : tactic => `(tactic| (
simp only [ne12, ne13, ne14, ne21, ne23, ne24, ne31, ne32, ne34, ne41, ne42, ne43,
decide_false, decide_true, Bool.false_eq_true, ite_false, ite_true]))
theorem r2_sq1 (m : L4) (inv : Limb) (r1 : Lib.Range_Known_0_Unknown) (r2 : Wide)
(r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r4 r5 : Wide), i + n = 6 →
Small_r2_1.loop.loop_1 ⟨toW m, inv.w⟩ (toW x) r1 r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 1 m inv)^[n] x))
| 0, i, x, r4, r5, h => by
rw [Small_r2_1.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = False from eq_false (by omega),
decide_false]
rfl
| n + 1, i, x, r4, r5, h => by
rw [Small_r2_1.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0_6, Lib.Range_next_0_6, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, smul1_eq]
rw [Function.iterate_succ_apply]
exact r2_sq1 m inv r1 r2 r3 n (i + 1) _ _ _ (by omega)
theorem r2_dbl1 (m : L4) (inv : Limb) (N : ℕ) (hN : N < 2 ^ 256) (r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r2 r4 r5 : Wide), i + n = N →
Small_r2_1.loop ⟨toW m, inv.w⟩ (toW x) ⟨(), UInt256.ofNat N⟩ r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 1 m inv)^[6] ((sdouble m)^[n] x)))
| 0, i, x, r2, r4, r5, h => by
rw [Small_r2_1.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = False from eq_false (by omega),
decide_false, Bool.false_eq_true, ite_false, Lib.Range_start_0_6, pure_bind]
exact r2_sq1 m inv _ _ _ 6 0 x _ _ rfl
| n + 1, i, x, r2, r4, r5, h => by
rw [Small_r2_1.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0, Lib.Range_next_0, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, sdouble1_eq]
rw [Function.iterate_succ_apply (sdouble m)]
exact r2_dbl1 m inv N hN r3 n (i + 1) _ _ _ _ (by omega)
/-- **`Small<1>::r2`** for a nonzero top limb. -/
theorem r2_1_eq (m : L4) (inv : Limb) (htop : 0 < (topLimb 1 m).val) :
Small_r2_1 ⟨toW m, inv.w⟩ = pure (toW (r2 1 m inv)) := by
have hs := log2_lt64 (topLimb 1 m)
have ht : topLimb 1 m = m.l0 := by simp [topLimb]
rw [ht] at htop hs
simp only [Small_r2_1]
lbranch
simp only [toW, shift_eq _ htop,
downcast_truncate_u256_u64_eq, toNat_lit (show m.l0.val.log2 < 2 ^ 256 by omega),
Nat.mod_eq_of_lt (show m.l0.val.log2 < 2 ^ 64 by omega), pure_bind, shl64_bit hs,
sub64_eq hs, downcast_u64_usize, Fe.EVM.ofNat_add_ofNat (show 64 - m.l0.val.log2 + 1 <
UInt256.size by unfold UInt256.size; omega), Lib.Range_start_0]
have e : (Wide.mk (bitL _ hs).w (UInt256.ofNat 0) (UInt256.ofNat 0) (UInt256.ofNat 0)) = toW (r2start 1 m) := by simp [toW, r2start, topLimb, zero_w]
rw [e]
have := r2_dbl1 m inv (64 - m.l0.val.log2 + 1) (by omega) default (64 - m.l0.val.log2 + 1) 0
(r2start 1 m) default default default (by omega)
have hr : r2 1 m inv = (ssq 1 m inv)^[6] ((sdouble m)^[64 - m.l0.val.log2 + 1] (r2start 1 m)) := by
rw [r2, ht]
simp only [toW] at this ⊢
rw [this, hr]
theorem r2_sq2 (m : L4) (inv : Limb) (r1 : Lib.Range_Known_0_Unknown) (r2 : Wide)
(r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r4 r5 : Wide), i + n = 6 →
Small_r2_2.loop.loop_1 ⟨toW m, inv.w⟩ (toW x) r1 r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 2 m inv)^[n] x))
| 0, i, x, r4, r5, h => by
rw [Small_r2_2.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = False from eq_false (by omega),
decide_false]
rfl
| n + 1, i, x, r4, r5, h => by
rw [Small_r2_2.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0_6, Lib.Range_next_0_6, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, smul2_eq]
rw [Function.iterate_succ_apply]
exact r2_sq2 m inv r1 r2 r3 n (i + 1) _ _ _ (by omega)
theorem r2_dbl2 (m : L4) (inv : Limb) (N : ℕ) (hN : N < 2 ^ 256) (r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r2 r4 r5 : Wide), i + n = N →
Small_r2_2.loop ⟨toW m, inv.w⟩ (toW x) ⟨(), UInt256.ofNat N⟩ r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 2 m inv)^[6] ((sdouble m)^[n] x)))
| 0, i, x, r2, r4, r5, h => by
rw [Small_r2_2.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = False from eq_false (by omega),
decide_false, Bool.false_eq_true, ite_false, Lib.Range_start_0_6, pure_bind]
exact r2_sq2 m inv _ _ _ 6 0 x _ _ rfl
| n + 1, i, x, r2, r4, r5, h => by
rw [Small_r2_2.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0, Lib.Range_next_0, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, sdouble2_eq]
rw [Function.iterate_succ_apply (sdouble m)]
exact r2_dbl2 m inv N hN r3 n (i + 1) _ _ _ _ (by omega)
/-- **`Small<2>::r2`** for a nonzero top limb. -/
theorem r2_2_eq (m : L4) (inv : Limb) (htop : 0 < (topLimb 2 m).val) :
Small_r2_2 ⟨toW m, inv.w⟩ = pure (toW (r2 2 m inv)) := by
have hs := log2_lt64 (topLimb 2 m)
have ht : topLimb 2 m = m.l1 := by simp [topLimb]
rw [ht] at htop hs
simp only [Small_r2_2]
lbranch
simp only [toW, shift_eq _ htop,
downcast_truncate_u256_u64_eq, toNat_lit (show m.l1.val.log2 < 2 ^ 256 by omega),
Nat.mod_eq_of_lt (show m.l1.val.log2 < 2 ^ 64 by omega), pure_bind, shl64_bit hs,
sub64_eq hs, downcast_u64_usize, Fe.EVM.ofNat_add_ofNat (show 64 - m.l1.val.log2 + 2 <
UInt256.size by unfold UInt256.size; omega), Lib.Range_start_0]
have e : (Wide.mk (UInt256.ofNat 0) (bitL _ hs).w (UInt256.ofNat 0) (UInt256.ofNat 0)) = toW (r2start 2 m) := by simp [toW, r2start, topLimb, zero_w]
rw [e]
have := r2_dbl2 m inv (64 - m.l1.val.log2 + 2) (by omega) default (64 - m.l1.val.log2 + 2) 0
(r2start 2 m) default default default (by omega)
have hr : r2 2 m inv = (ssq 2 m inv)^[6] ((sdouble m)^[64 - m.l1.val.log2 + 2] (r2start 2 m)) := by
rw [r2, ht]
simp only [toW] at this ⊢
rw [this, hr]
theorem r2_sq3 (m : L4) (inv : Limb) (r1 : Lib.Range_Known_0_Unknown) (r2 : Wide)
(r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r4 r5 : Wide), i + n = 6 →
Small_r2_3.loop.loop_1 ⟨toW m, inv.w⟩ (toW x) r1 r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 3 m inv)^[n] x))
| 0, i, x, r4, r5, h => by
rw [Small_r2_3.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = False from eq_false (by omega),
decide_false]
rfl
| n + 1, i, x, r4, r5, h => by
rw [Small_r2_3.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0_6, Lib.Range_next_0_6, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, smul3_eq]
rw [Function.iterate_succ_apply]
exact r2_sq3 m inv r1 r2 r3 n (i + 1) _ _ _ (by omega)
theorem r2_dbl3 (m : L4) (inv : Limb) (N : ℕ) (hN : N < 2 ^ 256) (r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r2 r4 r5 : Wide), i + n = N →
Small_r2_3.loop ⟨toW m, inv.w⟩ (toW x) ⟨(), UInt256.ofNat N⟩ r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 3 m inv)^[6] ((sdouble m)^[n] x)))
| 0, i, x, r2, r4, r5, h => by
rw [Small_r2_3.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = False from eq_false (by omega),
decide_false, Bool.false_eq_true, ite_false, Lib.Range_start_0_6, pure_bind]
exact r2_sq3 m inv _ _ _ 6 0 x _ _ rfl
| n + 1, i, x, r2, r4, r5, h => by
rw [Small_r2_3.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0, Lib.Range_next_0, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, sdouble3_eq]
rw [Function.iterate_succ_apply (sdouble m)]
exact r2_dbl3 m inv N hN r3 n (i + 1) _ _ _ _ (by omega)
/-- **`Small<3>::r2`** for a nonzero top limb. -/
theorem r2_3_eq (m : L4) (inv : Limb) (htop : 0 < (topLimb 3 m).val) :
Small_r2_3 ⟨toW m, inv.w⟩ = pure (toW (r2 3 m inv)) := by
have hs := log2_lt64 (topLimb 3 m)
have ht : topLimb 3 m = m.l2 := by simp [topLimb]
rw [ht] at htop hs
simp only [Small_r2_3]
lbranch
simp only [toW, shift_eq _ htop,
downcast_truncate_u256_u64_eq, toNat_lit (show m.l2.val.log2 < 2 ^ 256 by omega),
Nat.mod_eq_of_lt (show m.l2.val.log2 < 2 ^ 64 by omega), pure_bind, shl64_bit hs,
sub64_eq hs, downcast_u64_usize, Fe.EVM.ofNat_add_ofNat (show 64 - m.l2.val.log2 + 3 <
UInt256.size by unfold UInt256.size; omega), Lib.Range_start_0]
have e : (Wide.mk (UInt256.ofNat 0) (UInt256.ofNat 0) (bitL _ hs).w (UInt256.ofNat 0)) = toW (r2start 3 m) := by simp [toW, r2start, topLimb, zero_w]
rw [e]
have := r2_dbl3 m inv (64 - m.l2.val.log2 + 3) (by omega) default (64 - m.l2.val.log2 + 3) 0
(r2start 3 m) default default default (by omega)
have hr : r2 3 m inv = (ssq 3 m inv)^[6] ((sdouble m)^[64 - m.l2.val.log2 + 3] (r2start 3 m)) := by
rw [r2, ht]
simp only [toW] at this ⊢
rw [this, hr]
theorem r2_sq4 (m : L4) (inv : Limb) (r1 : Lib.Range_Known_0_Unknown) (r2 : Wide)
(r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r4 r5 : Wide), i + n = 6 →
Small_r2_4.loop.loop_1 ⟨toW m, inv.w⟩ (toW x) r1 r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 4 m inv)^[n] x))
| 0, i, x, r4, r5, h => by
rw [Small_r2_4.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = False from eq_false (by omega),
decide_false]
rfl
| n + 1, i, x, r4, r5, h => by
rw [Small_r2_4.loop.loop_1.eq_1]
simp only [has06_eq r3 (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < 6) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0_6, Lib.Range_next_0_6, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, smul4_eq]
rw [Function.iterate_succ_apply]
exact r2_sq4 m inv r1 r2 r3 n (i + 1) _ _ _ (by omega)
theorem r2_dbl4 (m : L4) (inv : Limb) (N : ℕ) (hN : N < 2 ^ 256) (r3 : Lib.Range_Known_0_Known_6) :
∀ n i (x : L4) (r2 r4 r5 : Wide), i + n = N →
Small_r2_4.loop ⟨toW m, inv.w⟩ (toW x) ⟨(), UInt256.ofNat N⟩ r2 r3 r4 r5 (UInt256.ofNat i) =
pure (toW ((ssq 4 m inv)^[6] ((sdouble m)^[n] x)))
| 0, i, x, r2, r4, r5, h => by
rw [Small_r2_4.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = False from eq_false (by omega),
decide_false, Bool.false_eq_true, ite_false, Lib.Range_start_0_6, pure_bind]
exact r2_sq4 m inv _ _ _ 6 0 x _ _ rfl
| n + 1, i, x, r2, r4, r5, h => by
rw [Small_r2_4.loop.eq_1]
simp only [has0_eq N hN (show i < 2 ^ 256 by omega), show (0 ≤ i ∧ i < N) = True from eq_true (by omega),
decide_true, ite_true, Lib.Range_at_0, Lib.Range_next_0, next_eq (show i + 1 < 2 ^ 256 by omega),
pure_bind, sdouble4_eq]
rw [Function.iterate_succ_apply (sdouble m)]
exact r2_dbl4 m inv N hN r3 n (i + 1) _ _ _ _ (by omega)
/-- **`Small<4>::r2`** for a nonzero top limb. -/
theorem r2_4_eq (m : L4) (inv : Limb) (htop : 0 < (topLimb 4 m).val) :
Small_r2_4 ⟨toW m, inv.w⟩ = pure (toW (r2 4 m inv)) := by
have hs := log2_lt64 (topLimb 4 m)
have ht : topLimb 4 m = m.l3 := by simp [topLimb]
rw [ht] at htop hs
simp only [Small_r2_4]
lbranch
simp only [toW, shift_eq _ htop,
downcast_truncate_u256_u64_eq, toNat_lit (show m.l3.val.log2 < 2 ^ 256 by omega),
Nat.mod_eq_of_lt (show m.l3.val.log2 < 2 ^ 64 by omega), pure_bind, shl64_bit hs,
sub64_eq hs, downcast_u64_usize, Fe.EVM.ofNat_add_ofNat (show 64 - m.l3.val.log2 + 4 <
UInt256.size by unfold UInt256.size; omega), Lib.Range_start_0]
have e : (Wide.mk (UInt256.ofNat 0) (UInt256.ofNat 0) (UInt256.ofNat 0) (bitL _ hs).w) = toW (r2start 4 m) := by simp [toW, r2start, topLimb, zero_w]
rw [e]
have := r2_dbl4 m inv (64 - m.l3.val.log2 + 4) (by omega) default (64 - m.l3.val.log2 + 4) 0
(r2start 4 m) default default default (by omega)
have hr : r2 4 m inv = (ssq 4 m inv)^[6] ((sdouble m)^[64 - m.l3.val.log2 + 4] (r2start 4 m)) := by
rw [r2, ht]
simp only [toW] at this ⊢
rw [this, hr]
end FeProofs.Modexp