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
|
Require Import Coq.Init.Nat.
Require Import Coq.ZArith.ZArith.
Require Import Coq.Lists.List.
Local Open Scope Z_scope.
Require Import Crypto.Tactics.Algebra_syntax.Nsatz.
Require Import Crypto.NewBaseSystem.
Require Import Crypto.Util.LetIn Crypto.Util.CPSUtil.
Require Import Crypto.Util.Tuple Crypto.Util.ListUtil Crypto.Util.Tactics.
Local Notation "A ^ n" := (tuple A n) : type_scope.
(***
Arithmetic on bignums that handles carry bits; this is useful for
saturated limbs. Compatible with mixed-radix bases.
***)
Module Columns.
Section Columns.
Context {weight : nat->Z}
{weight_0 : weight 0%nat = 1}
{weight_nonzero : forall i, weight i <> 0}
{weight_multiples : forall i, weight (S i) mod weight i = 0}
(* add_get_carry takes in a number at which to split output *)
{add_get_carry: Z ->Z -> Z -> (Z * Z)}
{add_get_carry_correct : forall s x y,
fst (add_get_carry s x y) = x + y - s * snd (add_get_carry s x y)}
.
Definition eval {n} (x : (list Z)^n) : Z :=
B.Positional.eval weight (Tuple.map sum x).
Definition eval_from {n} (offset:nat) (x : (list Z)^n) : Z :=
B.Positional.eval (fun i => weight (i+offset)) (Tuple.map sum x).
Lemma eval_from_0 {n} x : @eval_from n 0 x = eval x.
Proof. cbv [eval_from eval]. auto using B.Positional.eval_wt_equiv. Qed.
Lemma eval_from_S {n}: forall i (inp : (list Z)^(S n)),
eval_from i inp = eval_from (S i) (tl inp) + weight i * sum (hd inp).
Proof.
intros; cbv [eval_from].
replace inp with (append (hd inp) (tl inp))
by (simpl in *; destruct n; destruct inp; reflexivity).
rewrite map_append, B.Positional.eval_step, hd_append, tl_append.
autorewrite with natsimplify; ring_simplify; rewrite Group.cancel_left.
apply B.Positional.eval_wt_equiv; intros; f_equal; omega.
Qed.
(* Sums a list of integers using carry bits.
Output : next index, carry, sum
*)
Fixpoint compact_digit_cps n (digit : list Z) {T} (f:Z * Z->T) :=
match digit with
| nil => f (0, 0)
| x :: nil => f (0, x)
| x :: tl =>
compact_digit_cps n tl (fun rec =>
dlet sum_carry := add_get_carry (weight (S n) / weight n) x (snd rec) in
dlet carry' := (fst rec + snd sum_carry)%RT in
f (carry', fst sum_carry))
end.
Definition compact_digit n digit := compact_digit_cps n digit id.
Lemma compact_digit_id n digit: forall {T} f,
@compact_digit_cps n digit T f = f (compact_digit n digit).
Proof.
induction digit; intros; cbv [compact_digit]; [reflexivity|];
simpl compact_digit_cps; break_match; [reflexivity|].
rewrite !IHdigit; reflexivity.
Qed.
Hint Opaque compact_digit : uncps.
Hint Rewrite compact_digit_id : uncps.
Definition compact_step_cps (index:nat) (carry:Z) (digit: list Z)
{T} (f:Z * Z->T) :=
compact_digit_cps index (carry::digit) f.
Definition compact_step i c d := compact_step_cps i c d id.
Lemma compact_step_id i c d T f :
@compact_step_cps i c d T f = f (compact_step i c d).
Proof. cbv [compact_step_cps compact_step]; autorewrite with uncps; reflexivity. Qed.
Hint Opaque compact_step : uncps.
Hint Rewrite compact_step_id : uncps.
Definition compact_cps {n} (xs : (list Z)^n) {T} (f:Z * Z^n->T) :=
mapi_with_cps compact_step_cps 0 xs f.
Definition compact {n} xs := @compact_cps n xs _ id.
Lemma compact_id {n} xs {T} f : @compact_cps n xs T f = f (compact xs).
Proof. cbv [compact_cps compact]; autorewrite with uncps; reflexivity. Qed.
Lemma compact_digit_correct i (xs : list Z) :
snd (compact_digit i xs) = sum xs - (weight (S i) / weight i) * (fst (compact_digit i xs)).
Proof.
induction xs; cbv [compact_digit]; simpl compact_digit_cps;
cbv [Let_In];
repeat match goal with
| _ => rewrite add_get_carry_correct
| _ => progress (rewrite ?sum_cons, ?sum_nil in * )
| _ => progress (autorewrite with uncps push_id in * )
| _ => progress (autorewrite with cancel_pair in * )
| _ => progress break_match; try discriminate
| _ => progress ring_simplify
| _ => reflexivity
| _ => nsatz
end.
Qed.
Definition compact_invariant n i (starter rem:Z) (inp : tuple (list Z) n) (out : tuple Z n) :=
B.Positional.eval_from weight i out + weight (i + n) * (rem)
= eval_from i inp + weight i*starter.
Lemma compact_invariant_holds n i starter rem inp out :
compact_invariant n (S i) (fst (compact_step_cps i starter (hd inp) id)) rem (tl inp) out ->
compact_invariant (S n) i starter rem inp (append (snd (compact_step_cps i starter (hd inp) id)) out).
Proof.
cbv [compact_invariant B.Positional.eval_from]; intros.
repeat match goal with
| _ => rewrite B.Positional.eval_step
| _ => rewrite eval_from_S
| _ => rewrite sum_cons
| _ => rewrite weight_multiples
| _ => rewrite Nat.add_succ_l in *
| _ => rewrite Nat.add_succ_r in *
| _ => (rewrite fst_fst_compact_step in * )
| _ => progress ring_simplify
| _ => rewrite ZUtil.Z.mul_div_eq_full by apply weight_nonzero
| _ => cbv [compact_step_cps] in *;
autorewrite with uncps push_id;
rewrite compact_digit_correct
| _ => progress (autorewrite with natsimplify in * )
end.
rewrite B.Positional.eval_wt_equiv with (wtb := fun i0 => weight (i0 + S i)) by (intros; f_equal; try omega).
nsatz.
Qed.
Lemma compact_invariant_base i rem : compact_invariant 0 i rem rem tt tt.
Proof. cbv [compact_invariant]. simpl. repeat (f_equal; try omega). Qed.
Lemma compact_invariant_end {n} start (input : (list Z)^n):
compact_invariant n 0%nat start (fst (mapi_with_cps compact_step_cps start input id)) input (snd (mapi_with_cps compact_step_cps start input id)).
Proof.
autorewrite with uncps push_id.
apply (mapi_with_invariant _ compact_invariant
compact_invariant_holds compact_invariant_base).
Qed.
Lemma eval_compact {n} (xs : tuple (list Z) n) :
B.Positional.eval weight (snd (compact xs)) + (weight n * fst (compact xs)) = eval xs.
Proof.
pose proof (compact_invariant_end 0 xs) as Hinv.
cbv [compact_invariant] in Hinv.
simpl in Hinv. autorewrite with zsimplify natsimplify in Hinv.
rewrite eval_from_0, B.Positional.eval_from_0 in Hinv; apply Hinv.
Qed.
Definition cons_to_nth_cps {n} i (x:Z) (t:(list Z)^n)
{T} (f:(list Z)^n->T) :=
@on_tuple_cps _ _ nil (update_nth_cps i (cons x)) n n t _ f.
Definition cons_to_nth {n} i x t := @cons_to_nth_cps n i x t _ id.
Lemma cons_to_nth_id {n} i x t T f :
@cons_to_nth_cps n i x t T f = f (cons_to_nth i x t).
Proof.
cbv [cons_to_nth_cps cons_to_nth].
assert (forall xs : list (list Z), length xs = n ->
length (update_nth_cps i (cons x) xs id) = n) as Hlen.
{ intros. autorewrite with uncps push_id distr_length. assumption. }
rewrite !on_tuple_cps_correct with (H:=Hlen)
by (intros; autorewrite with uncps push_id; reflexivity). reflexivity.
Qed.
Hint Opaque cons_to_nth : uncps.
Hint Rewrite @cons_to_nth_id : uncps.
Lemma map_sum_update_nth l : forall i x,
List.map sum (update_nth i (cons x) l) =
update_nth i (Z.add x) (List.map sum l).
Proof.
induction l; intros; destruct i; simpl; rewrite ?IHl; reflexivity.
Qed.
Lemma cons_to_nth_add_to_nth n i x t :
map sum (@cons_to_nth n i x t) = B.Positional.add_to_nth i x (map sum t).
Proof.
cbv [B.Positional.add_to_nth B.Positional.add_to_nth_cps cons_to_nth cons_to_nth_cps on_tuple_cps].
induction n; [simpl; rewrite !update_nth_cps_correct; reflexivity|].
specialize (IHn (tl t)). autorewrite with uncps push_id in *.
apply to_list_ext. rewrite <-!map_to_list.
erewrite !from_list_default_eq, !to_list_from_list.
rewrite map_sum_update_nth. reflexivity.
Unshelve.
distr_length.
distr_length.
Qed.
Lemma eval_cons_to_nth n i x t : (i < n)%nat ->
eval (@cons_to_nth n i x t) = weight i * x + eval t.
Proof.
cbv [eval]; intros. rewrite cons_to_nth_add_to_nth.
auto using B.Positional.eval_add_to_nth.
Qed.
Hint Rewrite eval_cons_to_nth using omega : push_basesystem_eval.
Definition nils n : (list Z)^n := Tuple.repeat nil n.
Lemma map_sum_nils n : map sum (nils n) = B.Positional.zeros n.
Proof.
cbv [nils B.Positional.zeros]; induction n; [reflexivity|].
change (repeat nil (S n)) with (@nil Z :: repeat nil n).
rewrite map_repeat, sum_nil. reflexivity.
Qed.
Lemma eval_nils n : eval (nils n) = 0.
Proof. cbv [eval]. rewrite map_sum_nils, B.Positional.eval_zeros. reflexivity. Qed. Hint Rewrite eval_nils : push_basesystem_eval.
Definition from_associational_cps n (p:list B.limb)
{T} (f:(list Z)^n -> T) :=
fold_right_cps
(fun t st =>
B.Positional.place_cps weight t (pred n)
(fun p=> cons_to_nth_cps (fst p) (snd p) st id))
(nils n) p f.
Definition from_associational n p := from_associational_cps n p id.
Lemma from_associational_id n p T f :
@from_associational_cps n p T f = f (from_associational n p).
Proof.
cbv [from_associational_cps from_associational].
autorewrite with uncps push_id; reflexivity.
Qed.
Hint Opaque from_associational : uncps.
Hint Rewrite from_associational_id : uncps.
Lemma eval_from_associational n p (n_nonzero:n<>0%nat):
eval (from_associational n p) = B.Associational.eval p.
Proof.
cbv [from_associational_cps from_associational]; induction p;
autorewrite with uncps push_id push_basesystem_eval; [reflexivity|].
pose proof (B.Positional.weight_place_cps weight weight_0 weight_nonzero a (pred n)).
pose proof (B.Positional.place_cps_in_range weight a (pred n)).
rewrite Nat.succ_pred in * by assumption. simpl.
autorewrite with uncps push_id push_basesystem_eval in *.
rewrite eval_cons_to_nth by omega. nsatz.
Qed.
Definition mul_cps {n m} (p q : Z^n) {T} (f : (list Z)^m->T) :=
B.Positional.to_associational_cps weight p
(fun P => B.Positional.to_associational_cps weight q
(fun Q => B.Associational.mul_cps P Q
(fun PQ => from_associational_cps m PQ f))).
Definition add_cps {n} (p q : Z^n) {T} (f : (list Z)^n->T) :=
B.Positional.to_associational_cps weight p
(fun P => B.Positional.to_associational_cps weight q
(fun Q => from_associational_cps n (P++Q) f)).
End Columns.
End Columns.
(*
(* Just some pretty-printing *)
Local Notation "fst~ a" := (let (x,_) := a in x) (at level 40, only printing).
Local Notation "snd~ a" := (let (_,y) := a in y) (at level 40, only printing).
(* Simple example : base 10, multiply two bignums and compact them *)
Definition base10 i := Eval compute in 10^(Z.of_nat i).
Eval cbv -[runtime_add runtime_mul Let_In] in
(fun adc a0 a1 a2 b0 b1 b2 =>
Columns.mul_cps (weight := base10) (n:=3) (a2,a1,a0) (b2,b1,b0) (fun ab => Columns.compact (n:=5) (add_get_carry:=adc) (weight:=base10) ab)).
(* More complex example : base 2^56, 8 limbs *)
Definition base2pow56 i := Eval compute in 2^(56*Z.of_nat i).
Time Eval cbv -[runtime_add runtime_mul Let_In] in
(fun adc a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 =>
Columns.mul_cps (weight := base2pow56) (n:=8) (a7,a6,a5,a4,a3,a2,a1,a0) (b7,b6,b5,b4,b3,b2,b1,b0) (fun ab => Columns.compact (n:=15) (add_get_carry:=adc) (weight:=base2pow56) ab)). (* Finished transaction in 151.392 secs *)
(* Mixed-radix example : base 2^25.5, 10 limbs *)
Definition base2pow25p5 i := Eval compute in 2^(25*Z.of_nat i + ((Z.of_nat i + 1) / 2)).
Time Eval cbv -[runtime_add runtime_mul Let_In] in
(fun adc a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 =>
Columns.mul_cps (weight := base2pow25p5) (n:=10) (a9,a8,a7,a6,a5,a4,a3,a2,a1,a0) (b9,b8,b7,b6,b5,b4,b3,b2,b1,b0) (fun ab => Columns.compact (n:=19) (add_get_carry:=adc) (weight:=base2pow25p5) ab)). (* Finished transaction in 97.341 secs *)
*)
|
