From 6c3c953d836ac43a8acff1975d73eb3204902ef2 Mon Sep 17 00:00:00 2001
From: jadep <jade.philipoom@gmail.com>
Date: Mon, 25 Apr 2016 19:07:38 -0400
Subject: Reorganization and revision of Encoding code and redefinition of
 sign_bit function.

---
 src/Spec/Encoding.v | 56 +----------------------------------------------------
 1 file changed, 1 insertion(+), 55 deletions(-)

(limited to 'src/Spec/Encoding.v')

diff --git a/src/Spec/Encoding.v b/src/Spec/Encoding.v
index 14cf9d9d9..9a2d5e5ed 100644
--- a/src/Spec/Encoding.v
+++ b/src/Spec/Encoding.v
@@ -1,61 +1,7 @@
-Require Import Coq.ZArith.ZArith Coq.ZArith.Zpower Coq.ZArith.ZArith.
-Require Import Coq.Numbers.Natural.Peano.NPeano.
-Require Import Crypto.ModularArithmetic.PrimeFieldTheorems Crypto.ModularArithmetic.ModularArithmeticTheorems.
-Require Import Bedrock.Word.
-Require Import Crypto.Tactics.VerdiTactics.
-Require Import Crypto.Util.NatUtil.
-Require Import Crypto.Util.WordUtil.
-
 Class Encoding (T B:Type) := {
   enc : T -> B ;
   dec : B -> option T ;
   encoding_valid : forall x, dec (enc x) = Some x
 }.
-Notation "'encoding' 'of' T 'as' B" := (Encoding T B) (at level 50).
-
-Local Open Scope nat_scope.
-
-Section ModularWordEncoding.
-  Context {m : Z} {sz : nat} {m_pos : (0 < m)%Z} {bound_check : Z.to_nat m < 2 ^ sz}.
-
-  Definition Fm_enc (x : F m) : word sz := natToWord sz (Z.to_nat (FieldToZ x)).
-
-  Definition Fm_dec (x_ : word sz) : option (F m) :=
-    let z := Z.of_nat (wordToNat (x_)) in
-    if Z_lt_dec z m
-      then Some (ZToField z)
-      else None
-  .
-
-  Lemma bound_check_N : forall x : F m, (N.of_nat (Z.to_nat x) < Npow2 sz)%N.
-  Proof.
-    intro.
-    pose proof (FieldToZ_range x m_pos) as x_range.
-    rewrite <- Nnat.N2Nat.id.
-    rewrite Npow2_nat.
-    apply (Nat2N_inj_lt (Z.to_nat x) (pow2 sz)).
-    rewrite Zpow_pow2.
-    destruct x_range as [x_low x_high].
-    apply Z2Nat.inj_lt in x_high; try omega.
-    rewrite <- ZUtil.pow_Z2N_Zpow by omega.
-    replace (Z.to_nat 2) with 2%nat by auto.
-    omega.
-  Qed.
-
-  Lemma Fm_encoding_valid : forall x, Fm_dec (Fm_enc x) = Some x.
-  Proof.
-    unfold Fm_dec, Fm_enc; intros.
-    pose proof (FieldToZ_range x m_pos).
-    rewrite wordToNat_natToWord_idempotent by apply bound_check_N.
-    rewrite Z2Nat.id by omega.
-    rewrite ZToField_idempotent.
-    break_if; auto; omega.
-  Qed.
-
-  Instance modular_word_encoding : encoding of F m as word sz := {
-    enc := Fm_enc;
-    dec := Fm_dec;
-    encoding_valid := Fm_encoding_valid
-  }.
 
-End ModularWordEncoding.
+Notation "'encoding' 'of' T 'as' B" := (Encoding T B) (at level 50).
\ No newline at end of file
-- 
cgit v1.2.3