re-introduced extra field isomorphism layer for 8.4 compatibility and better organization of reasoning.

1 files changed, 71 insertions, 0 deletions

diff --git a/src/ModularArithmetic/ModularBaseSystemField.v b/src/ModularArithmetic/ModularBaseSystemField.v
new file mode 100644
index 000000000..f5bedd644
--- /dev/null
+++ b/src/ModularArithmetic/ModularBaseSystemField.v
@@ -0,0 +1,71 @@
+Require Import Crypto.ModularArithmetic.PrimeFieldTheorems.
+Require Import Crypto.ModularArithmetic.PseudoMersenneBaseParams.
+Require Import Crypto.ModularArithmetic.ModularBaseSystem.
+Require Import Crypto.ModularArithmetic.ModularBaseSystemProofs.
+Require Import Crypto.ModularArithmetic.ModularBaseSystemOpt.
+Require Import Coq.ZArith.ZArith.
+Require Import Crypto.Algebra. Import Field.
+Require Import Crypto.Util.Tuple Crypto.Util.Notations.
+Local Open Scope Z_scope.
+
+Section ModularBaseSystemField.
+  Context `{prm : PseudoMersenneBaseParams} {sc : SubtractionCoefficient modulus prm}
+    (k_ c_ : Z) (k_subst : k = k_) (c_subst : c = c_).
+  Local Notation base := (Pow2Base.base_from_limb_widths limb_widths).
+  Local Notation digits := (tuple Z (length limb_widths)).
+
+  Lemma add_decode : forall a b : digits,
+    decode (add_opt a b) = (decode a + decode b)%F.
+  Proof.
+    intros; rewrite add_opt_correct by assumption.
+    apply add_rep; apply decode_rep.
+  Qed.
+
+  Lemma sub_decode : forall a b : digits,
+    decode (sub_opt a b) = (decode a - decode b)%F.
+  Proof.
+    intros; rewrite sub_opt_correct by assumption.
+    apply sub_rep; auto using coeff_mod, decode_rep.
+  Qed.
+
+  Lemma mul_decode : forall a b : digits,
+    decode (carry_mul_opt k_ c_ a b) = (decode a * decode b)%F.
+  Proof.
+    intros; rewrite carry_mul_opt_correct by assumption.
+    apply carry_mul_rep; apply decode_rep.
+  Qed.
+
+  Lemma zero_neq_one : eq zero one -> False.
+  Proof.
+   cbv [eq zero one]. erewrite !encode_rep. intro A.
+   eapply (PrimeFieldTheorems.Fq_1_neq_0 (prime_q := prime_modulus)).
+   congruence.
+  Qed.
+
+  Lemma modular_base_system_field :
+    @field digits eq zero one opp add_opt sub_opt (carry_mul_opt k_ c_) inv div.
+  Proof.
+    eapply (Field.isomorphism_to_subfield_field (phi := decode) (fieldR := PrimeFieldTheorems.field_modulo  (prime_q := prime_modulus))).
+    Grab Existential Variables.
+    + intros; eapply encode_rep.
+    + intros; eapply encode_rep.
+    + intros; eapply encode_rep.
+    + intros; eapply encode_rep.
+    + intros; eapply mul_decode.
+    + intros; eapply sub_decode.
+    + intros; eapply add_decode.
+    + intros; eapply encode_rep.
+    + cbv [eq zero one]. erewrite !encode_rep. intro A.
+      eapply (PrimeFieldTheorems.Fq_1_neq_0 (prime_q := prime_modulus)).
+      congruence.
+    + trivial.
+    + repeat intro. cbv [div]. congruence.
+    + repeat intro. cbv [inv]. congruence.
+    + repeat intro. cbv [eq]. erewrite !mul_decode. congruence.
+    + repeat intro. cbv [eq]. erewrite !sub_decode. congruence.
+    + repeat intro. cbv [eq]. erewrite !add_decode. congruence.
+    + repeat intro. cbv [opp]. congruence.
+    + cbv [eq]. auto using ModularArithmeticTheorems.F_eq_dec.
+  Qed.
+
+End ModularBaseSystemField.
\ No newline at end of file