import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Nat renaming mod_eq_of_lt->γ,two_pow_pos->θ,zero_add->ι,pow_le_pow_right->κ,mul_le_mul_right->μ,shiftRight_eq_div_pow->ν,shiftLeft_eq->ο,pow_add->ρ,div_eq_of_lt->Α,add_comm->Δ,mod_lt->Ζ,add_mul->Η,and_two_pow_sub_one_eq_mod->Θ,add_mul_div_right->Ι,zero_mul->Λ,mul_lt_mul_of_lt_of_le->Μ,one_mul->Ξ,mul_zero->Ρ,add_mul_mod_self_right->Φ,pos_of_ne_zero->Χ,le_mul_of_pos_right->Ω,div_lt_iff_lt_mul->ϋ,lt_succ_iff->ό,lt_or_eq_of_le->ύ,mul_pos->Ϗ,lt_log2_self->ϐ,log2_self_le->ϑ,mul_assoc->ϒ,log2_eq_iff->ϔ,add_assoc->ϕ,mul_lt_mul_of_pos_right->ϖ,eq_zero_or_pos->ϗ,le_div_iff_mul_le->ϙ,mul_eq_zero->ϛ,le_add_right->ϝ,pos_iff_ne_zero->Ϣ,div_mul_le_self->Ϧ,add_lt_add_left->ϧ,lt_or_ge->Ϩ,div_div_eq_div_mul->ϩ,mul_comm->Ϫ,log2_lt->ϭ,toUInt64_eq->Ϯ,add_zero->ϯ,le_mul_of_pos_left->ϰ,div_lt_of_lt_mul->ϳ,div_add_mod'->ϴ,lt_of_le_of_ne->Ϸ,lt_of_le_of_lt->ϸ,div_add_mod->Ϲ,cast_sub->ϻ,lt_of_lt_of_le->Ad,lt_trans->Ae,le_trans->Am,le_one_iff_eq_zero_or_eq_one->AC,mul_le_mul->AG,shiftLeft_add_eq_or_of_lt->AI,div_le_self->AL,le_add_left->AM,and_two_pow_sub_one_of_lt_two_pow->AU,pos_of_mul_pos_left->Ba,testBit_eq_decide_div_mod_eq->Be,sub_zero->Bf,toUInt32_eq->Bm,add_eq_zero_iff->Bo,succ_mul->Bq,one_le_two_pow->Bw,mod_mul_right_div_self->Bx,add_sub_cancel->By,add_div_right->BE,reduceMod->BI,pos_of_mul_pos_right->BJ,lt_add_of_pos_right->BM,one_le_iff_ne_zero->BQ,sub_le_iff_le_add'->BR,mul_mod_mul_right->Cd,cast_ofNat->Cl,and_mod_two_pow->Cp,and_div_two_pow->Cq,add_le_add_left->Cr,add_one_ne_zero->Cs,lt_irrefl->Cu,and_one_is_mod->Cw,cast_pow->CC,div_self->CD,add_left_comm->CE,mul_lt_mul''->CG,and_le_right->CH,mul_one->CJ,mul_ne_zero->CM,add_le_add->CU,sub_add_eq->CV,reducePow->CY,pow_succ'->CZ,reduceDiv->Da,cast_add->Dd,cast_mul->De,mod_self->Df,and_zero->Dg,succ_pos->Dh,zero_le->Dl,mul_add->Dm,mod_one->Dn,not_lt->Dp open UInt64 renaming toNat_add->δ,toNat_inj->ε,toNat_sub_of_le->ξ,lt_iff_toNat_lt->ς,le_iff_toNat_le->σ,toNat_shiftRight->τ,toNat_shiftLeft->χ,toNat_sub->ω,toNat_lt_size->Κ,toNat_toUInt32->Τ,toNat_zero->Ψ,toNat->ϟ,toNat_ofNat'->ϥ,toNat_mul->Ϭ,toNat_and->AW,add_assoc->Bj,toNat_not->BO,le_trans->Cb,or_eq_zero_iff->Ci,reduceToNat->CB,toNat_or->CS open USize renaming lt_iff_toNat_lt->ζ,le_size->π,toNat_one->Β,toNat_inj->ώ,toNat_lt_size->ϱ,size->ϲ,le_iff_toNat_le->Ak,toNat_sub_of_le->Ao,toNat_mul->Bn,toNat_zero->BP,toNat_add->Cc open Bool renaming false_eq_true->η,xor->ψ,and_eq_true->Ε,eq_iff_iff->ϊ,or_eq_true->Ϟ,not_eq_true'->AD,and_assoc->CW,and_self->Db open UInt32 renaming toNat_inj->φ,toNat_toUInt64->Γ,toNat_lt_size->Ν,ofNat->Υ,toNat_shiftRight->Ϙ,toNat_ofNat'->Ϛ,lt_iff_toNat_lt->Ϡ,le_iff_toNat_le->ϡ,toNat_and->ϣ,toNat_sub_of_le->Bi,toNat_shiftLeft->BV,size->CK,toNat->Dk open Int renaming add_emod->Ο,negSucc->Ϥ,natAbs_natCast->BC,sub_emod->BT,ModEq->Co,emod_nonneg->CP,zero_add->Dj open Array renaming replicate->ϫ,ofFn->Aa,mkEmpty->Aj,size_ofFn->Al,emptyWithCapacity->Bb,toList_push->Bh,getElem_ofFn->BA,ext'->BB,all_eq_true->BG,getElem_push_lt->Cf,getElem_push_eq->Cg,range->Cm,toList_ofFn->CF,ext->CI,size_push->CO open List renaming foldl_cons->Ϻ,range->Ac,ext_getElem->Ap,getElem_ofFn->Aq,length_ofFn->As,range'->Av,range'_succ->AA,getElem_cons_zero->AK,length_singleton->AN,append_assoc->AP,drop_of_length_le->Bg,ofFn->Bt,flatMap_cons->BF,length_cons->BN,getElem_cons_succ->BS,nil_append->Ca,singleton_append->Ce,map_add_range'->Ct,length_append->Cx,length_nil->CN,map_map->Di open Model renaming roundDyadicGeneral->Ag,roundDyadicGeneral_eq_roundDyadic->Ah,isNaN_eq_false_of_toDyadic?_some->Ai,addDyadic->Ar,isInf_eq_false_of_toDyadic?_some->Au,toReal->Ay,roundDyadic->AO,ofUInt32->AQ,isFinite->AR,packRoundedSubnormal->AS,div->AT,isZero->Bd,signBit->Bk,add->Bs,zero->Bv,maximum->BH,packRoundedNormal->BL,nativeOverflow->Ck,fma->Cn,toNatBits->CL,ofFields->CT,pow2->Do open Or renaming inl->AJ,inr->Bz open Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->Bu,finiteDotSlice->Ch,finiteDot->Cv open Model.Reduction.Internal renaming State->AH,dotStateLoop->AV,dotState->Bc,dotState_exact_toRat->BK open FloatLib.Numerics.Dyadic renaming cast_toRat->AX,add_toRat->AZ,toRat_eq_zero_iff->BU,addFields->Cy,mul_toRat->Cz,mulFields->CA,add->CQ,mul->CR open FloatLib.Numerics.FixedWord renaming roundShiftRightEven_toNat->Ax,roundShiftRightEven->AE open FloatLib.Numerics renaming shiftRightJam->Af,roundShiftRightEven->An,or_one_eq->Az,roundShiftRightEven_shiftRightJam->AB,roundShiftRightEven_le_succ->AF,Dyadic->AY,roundShiftRightEven_mul_two_pow_of_le->Bl,roundShiftRightEven_eq_guard_sticky->Bp,div_two_pow_le_roundShiftRightEven->Br,roundShiftRightEven_mul_two_pow->BD,shiftRightJam_ne_zero->Cj open Int64 renaming ofInt->Aw open ConvShape renaming ho->BX,wo->BY open Prod.Lex renaming right->CX,left->Dc open Fin renaming coe_cast->BZ local notation:max x:max "˥"=>UInt64.toNat (x :) local notation:max x:max "܅"=>USize.toNat (x :) local notation:max x:max "؆"=>UInt32.toNat (x :) local notation:max x:max "؈"=>Nat.log2 (x :) local notation:max x:max "؛"=>Nat.toUSize (x :) local notation:max x:max "؝"=>Array.size (x :) local notation:max x:max "؞"=>Fin.val (x :) local notation:max x:max "؟"=>ExactRuntime.ConvShape.stride (x :) local notation:max x:max "۾"=>UInt64.toNat_lt (x :) local notation:max x:max "܀"=>FloatLib.Floats.Formats.BinaryInterchange.FloatFormat.fracWidth (x :) local notation:max x:max "܁"=>Int.toNat (x :) local notation:max x:max "׆"=>Array.toList (x :) local notation:max x:max "׳"=>Nat.toUInt64 (x :) local notation:max x:max "،"=>UInt32.toUInt64 (x :) local notation:max x:max "؍"=>UInt64.toUInt32 (x :) structure Acc where pos:Array Nat neg:Array Nat special:Bool negZero:Bool def Acc.empty:Acc:=⟨ϫ 18 0,ϫ 18 0,false,true⟩ def Acc.total (acc:Acc):Int:=(limbVal acc.pos.toList:Int)-limbVal acc.neg.toList @[inline] def Acc.add (acc:Acc) (m idx:Nat) (neg:Bool):Acc := match acc with | ⟨pos,ng,sp,nz⟩ => if m=0 then ⟨pos,ng,sp,nz&&neg⟩ else if neg then ⟨pos,addLimbs64 ng m.toUInt64 idx,sp,false⟩ else ⟨addLimbs64 pos m.toUInt64 idx,ng,sp,false⟩ @[inline] def Acc.markSpecial (acc:Acc):Acc := match acc with | ⟨pos,ng,_,nz⟩=>⟨pos,ng,true,nz⟩ lemma Acc.add_spec (a:Acc) (m d:Nat) (b:Bool) (e:a.pos.size=18) (f:a.neg.size=18) (g:m<2^64) (h:d/32+1<18) : (a.add m d b).pos.size=18/\(a.add m d b).neg.size=18 /\ (a.add m d b).special=a.special /\ (a.add m d b).negZero=(a.negZero&&(decide (m=0)&&b)) /\ (a.add m d b).total=a.total+(if b then -(m:Int) else m)*2^d:=by obtain⟨pos,k,l,n⟩:=a;simp only at e f;by_cases j:m=0 . simp[Acc.add,Acc.total,j,e,f] . cases b . refine⟨by simp[Acc.add,j,addLimbs64_size,e],by simp[Acc.add,j,f],by simp[Acc.add,j],by simp[Acc.add,j],?_⟩ simp only[Acc.add,j,ite_false,η,addLimbs64_eq _ _ _ g,Acc.total];rw[addLimbs_val _ _ _ (by omega)];push_cast;ring . refine⟨by simp[Acc.add,j,e],by simp[Acc.add,j,addLimbs64_size,f],by simp[Acc.add,j],by simp[Acc.add,j],?_⟩ simp only[Acc.add,j,ite_false,ite_true,addLimbs64_eq _ _ _ g,Acc.total];rw[addLimbs_val _ _ _ (by omega)];push_cast;ring lemma Acc.total_empty:Acc.empty.total=0:=by decide section open FloatLib.Numerics lemma ZbF (s:Bool) (m:Nat) (e:Int) (j:Nat) (h:j+25<=m؈):AO Fmt ⟨s,shiftRightJam m j,e+j⟩=AO Fmt ⟨s,m,e⟩:=by have d:m≠0:=by rintro rfl;simp at h have f:2^m؈<=m:=ϑ d;have b:2^(j+1)<=m:=le_trans (κ (by norm_num) (by omega)) f have g:(shiftRightJam m j)؈=m؈-j:=log2_shiftRightJam m j b;have q:shiftRightJam m j≠0:=shiftRightJam_ne_zero m j (le_trans (κ (by norm_num) (by omega)) b) rw[<- Ah,<- Ah];unfold Ag;simp only[beq_iff_eq,ite_false,g];have r:((m؈-j:Nat):Int)+(e+j)=(m؈:Int)+e:=by omega have k:Fmt܀=23:=rfl;have l:Fmt.minSubnormalExponent = -149:=rfl;have n:Fmt.minNormalExponent = -126:=rfl;rw[k,l,n];split_ifs with t u v w<;>try omega . rfl . congr 1;obtain⟨a,o⟩:∃ a:Nat,e - -149=Ϥ a:=⟨(-(e+149)-1)܁,by omega⟩ have p:e+j - -149=Ϥ (a-j):=by omega rw[o,p];dsimp only;rw[show a-j+1=(a+1)-j by omega] exact roundShiftRightEven_shiftRightJam m j (a+1) (by omega) . congr 1;rw[show m؈-j-23=(m؈-23)-j by omega];exact roundShiftRightEven_shiftRightJam m j _ (by omega) def Yg (a:Array Nat) (i:Nat):Nat -> Nat | 0=>0 | k+1=>a[i]! + 2^32*Yg a (i+1) k lemma Zv (a:Array Nat) (i k m:Nat):Yg a i (k+m)=Yg a i k+2^(32*k)*Yg a (i+k) m:=by induction k generalizing i with | zero=>simp[Yg] | succ k b=>rw[show k+1+m=(k+m)+1 by omega,Yg,Yg,b,show i+1+k=i+(k+1) by omega];ring lemma ZbG (a b:Array Nat) (i j k:Nat) (h:∀ t,t a[i+t]! = b[j+t]!):Yg a i k=Yg b j k:=by induction k generalizing i j with | zero=>rfl | succ k d=>rw[Yg,Yg,d (i+1) (j+1) (λ t e=>by rw[show i+1+t=i+(t+1) by omega,show j+1+t=j+(t+1) by omega];exact h (t+1) (by omega)),show a[i]! = b[j]! from by simpa using h 0 (by omega)] lemma Zw (a:Array Nat) (i k:Nat):Yg a i k=0↔∀ t,t a[i+t]! = 0:=by induction k generalizing i with | zero=>simp[Yg] | succ k d => rw[Yg,Bo,ϛ,d (i+1)];have e:(2:ℕ)^32≠0:=by simp constructor . rintro ⟨f,b | b⟩ t g . exact absurd b e . rcases t with _ | t . simpa using f . rw[show i+(t+1)=i+1+t by omega];exact b t (by omega) . intro h;refine⟨by simpa using h 0 (by omega),Bz λ t g=>?_⟩ rw[show i+1+t=i+(t+1) by omega];exact h (t+1) (by omega) lemma ZbH (a:Array Nat) (i k:Nat) (h:∀ t,t a[i+t]! < 2^32):Yg a i k<2^(32*k):=by induction k generalizing i with | zero=>simp[Yg] | succ k b => have d:=h 0 (by omega);have e:=b (i+1) (λ t f=>by rw[show i+1+t=i+(t+1) by omega];exact h (t+1) (by omega)) simp at d;rw[Yg,show 32*(k+1)=32+32*k by ring,pow_add];linarith lemma Zav (a:Array Nat) (t:Nat) (h:a؝<=t):a[t]! = 0:=by simp_all lemma ZbI (a:Array Nat) (i k:Nat) (h:a؝<=i+k):Yg a i k=limbVal (a׆.drop i):=by induction k generalizing i with | zero=>simp[Yg,Bg (by simpa using h:a.toList.length<=i),limbVal] | succ k b => rw[Yg,b (i+1) (by omega)];by_cases d:i a[t]! = 0) (e:∀ t,b+n<=t -> a[t]! = 0) : limbVal a׆=2^(32*b)*Yg a b n:=by rw[<- List.drop_zero (l:=a׆),<- ZbI a 0 (b+(n+a؝)) (by omega),Zv,Zv] rw[(Zw a 0 b).2 (λ t f=>by simpa using d t f),(Zw a (0+b+n) a؝).2 (λ t _=>e _ (by omega))] simp def YP (a b:Array Nat) (i ca cb br:Nat) (out:Array Nat) : Nat -> Array Nat × Nat × Nat × Nat | 0=>(out,ca,cb,br) | k+1 => let ta:=a[i]! + ca let tb:=b[i]! + cb let t:=ta%4294967296+4294967296-tb%4294967296-br YP a b (i+1) (ta/4294967296) (tb/4294967296) (1-t/4294967296) (out.push (t%4294967296)) k lemma Zaw (a b:Array Nat) (i f g e:Nat) (d:Array Nat) (k:Nat) (j:e<=1) (h:∀ t,t d[t]! < 2^32) : let r:=YP a b i f g e d k r.1.size=d؝+k/\(∀ t,t r.1[t]! < 2^32) /\ (Yg r.1 0 r.1.size:Int)+2^(32*(d؝+k))*(r.2.1-r.2.2.1-r.2.2.2:Int)=Yg d 0 d؝+2^(32*d؝)*((Yg a i k:Int)-Yg b i k+f-g-e):=by induction k generalizing i f g e d with | zero=>exact⟨by simp[YP],by simpa [YP] using h,by simp[YP,Yg]⟩ | succ k q => simp only[YP];set n:=a[i]! + f;set o:=b[i]! + g;set t:=n%4294967296+4294967296-o%4294967296-e;have u:t%4294967296<2^32:=by omega have v:∀ s,s < (d.push (t%4294967296))؝ -> (d.push (t%4294967296))[s]! < 2^32:=by intro s l;simp only[CO]at l;rcases ύ (ό.mp l) with l | rfl . rw[getElem!_pos _ s (by simp;omega),Cf l,<- getElem!_pos d s l];exact h s l . rw[getElem!_pos _ _ (by simp),Cg];exact u obtain⟨w,x,p⟩:=q (i+1) (n/4294967296) (o/4294967296) (1-t/4294967296) (d.push (t%4294967296)) (by omega) v refine⟨by simp[w];omega,x,?_⟩;have y:Yg (d.push (t%4294967296)) 0 (d؝+1)=Yg d 0 d؝+2^(32*d؝)*(t%4294967296):=by rw[Zv,ZbG _ d 0 0 d؝ (λ s l=>by rw[getElem!_pos _ _ (by simp;omega),Cf (by omega),<- getElem!_pos d _ (by omega)])] simp only[Yg,ι,Ρ,ϯ];rw[getElem!_pos _ _ (by simp),Cg] simp only[CO]at p ⊢;rw[show d؝+(k+1)=d؝+1+k by omega];rw[p,y,Yg,Yg];have z:((t%4294967296:Nat):Int)+4294967296*((n/4294967296:Nat)-(o/4294967296:Nat)-(1-t/4294967296:Nat))=(a[i]! : Int)-b[i]! + f-g-e:=by have A:(1-t/4294967296:Nat)=1-(t/4294967296:Int):=by omega omega simp only[Dd,De,CC,Cl];linear_combination (2:Int)^(32*d؝)*z def YW (r:Array Nat):Nat -> Option Nat | 0=>none | k+1=>if r[k]! != 0 then some k else YW r k def YX (r:Array Nat):Nat -> Bool | 0=>false | k+1=>r[k]! != 0||YX r k lemma ZbK (r:Array Nat) (k:Nat) (h:YW r k=none):∀ t,t r[t]! = 0:=by induction k with | zero=>intro t a;omega | succ k b => simp only[YW]at h;split at h . cases h . rename_i d;intro t a;rcases ύ (ό.mp a) with a | rfl . exact b h t a . simpa using d lemma Zax (r:Array Nat) (k h:Nat) (d:YW r k=some h):h t r[t]! = 0:=by induction k with | zero=>simp[YW]at d | succ k j => simp only[YW]at d;split at d . rename_i f;cases d;exact⟨by omega,by simpa using f,λ t g e=>by omega⟩ . rename_i f;obtain⟨a,b,c⟩:=j d;refine⟨by omega,b,λ t g e=>?_⟩;rcases ύ (ό.mp e) with e | rfl . exact c t g e . simpa using f lemma Zay (r:Array Nat) (k:Nat):YX r k=false↔∀ t,t r[t]! = 0:=by induction k with | zero=>simp[YX] | succ k b => simp only[YX,Bool.or_eq_false_iff,bne_eq_false_iff_eq,b];constructor . rintro ⟨d,e⟩ t a;rcases ύ (ό.mp a) with a | rfl . exact e t a . exact d . intro h;exact⟨h k (by omega),λ t a=>h t (by omega)⟩ lemma ZbL (r:Array Nat) (k:Nat):YX r k=(Yg r 0 k != 0):=by have a:=Zw r 0 k;simp at a;cases h:YX r k . rw[a.2 ((Zay r k).1 h)];rfl . have:Yg r 0 k≠0:=λ b=>by have:=(Zay r k).2 (a.1 b);simp_all simp[this] lemma ZbM (a x y h:Nat) (b:a<2^(32*h)):shiftRightJam (a+2^(32*h)*(x+2^32*y)) (32*h+2)=if x%4 != 0||a != 0 then (y*1073741824+x/4)|||1 else y*1073741824+x/4:=by have k:2^(32*h+2)=4*2^(32*h):=by grind have q:x%4<4:=Ζ x (by norm_num) have f:a+2^(32*h)*(x%4)<4*2^(32*h):=by nlinarith have l:a+2^(32*h)*(x+2^32*y)=(a+2^(32*h)*(x%4))+4*2^(32*h)*(y*1073741824+x/4):=by have n:=Nat.mod_add_div x 4;conv_lhs=>rw[<- n] ring have g:a+2^(32*h)*(x%4)=0↔¬(x%4≠0\/a≠0):=by constructor . intro d;have o:=Nat.eq_zero_of_add_eq_zero d;rcases ϛ.mp o.2 with p | p<;>omega . intro d;simp at d;simp[d.1,d.2] unfold shiftRightJam;dsimp only;rw[k,l,Nat.add_mul_div_left _ _ (by omega),Α f,ι,Nat.add_mul_mod_self_left,γ f] by_cases j:x%4≠0\/a≠0 . have:¬ (a+2^(32*h)*(x%4)=0):=λ d=>g.mp d j;have e:(x%4 != 0||a != 0)=true:=by grind simp only[beq_iff_eq,this,ite_false,e,ite_true] . have:a+2^(32*h)*(x%4)=0:=g.mpr j;have e:(x%4 != 0||a != 0)=false:=by grind simp only[beq_iff_eq,this,ite_true,e];rfl def Yas (neg:Bool) (r:Array Nat) (e:Int) (negZero:Bool):UInt32 := match YW r r.size with | none=>finishWord 0 e negZero | some 0=>finishWord (if neg then -(r[0]! : Int) else r[0]!) e negZero | some (h+1) => let x:=r[h]! let v:=r[h+1]! * 1073741824+x/4 let m:=if x%4 != 0||YX r h then v|||1 else v toWord (AO Fmt ⟨neg,m,e+((32*h+2:Nat):Int)⟩) lemma ZbN (b:Bool) (R:Nat) (e:Int) (a:Bool) (d:R≠0):finishWord (if b then -(R:Int) else R) e a=toWord (AO Fmt ⟨b,R,e⟩):=by have f:(0:Int)simp[finishWord,ofIntDyadic,d,not_lt.mpr f.le,Χ d] lemma Zaz (b:Bool) (r:Array Nat) (e:Int) (a:Bool) (d:∀ t,t r[t]! < 2^32) : Yas b r e a=finishWord (if b then -(Yg r 0 r؝:Int) else Yg r 0 r؝) e a:=by unfold Yas;split . rename_i o;rw[(Zw r 0 r؝).2 (λ t f=>by simpa using ZbK r _ o t f)];simp . rename_i g;obtain⟨p,j,k⟩:=Zax r _ 0 g;rw[show r؝=1+(r؝-1) by omega,Zv,(Zw r (0+1) (r؝-1)).2 (λ t f=>k _ (by omega) (by omega))] simp[Yg] . rename_i h g;obtain⟨p,j,k⟩:=Zax r _ (h+1) g;have l:Yg r 0 r؝=Yg r 0 h+2^(32*h)*(r[h]! + 2^32*r[h+1]!):=by rw[show r؝=h+(2+(r؝-h-2)) by omega,Zv,Zv,(Zw r (0+h+2) _).2 (λ t f=>k _ (by omega) (by omega))] simp[Yg] have q:Yg r 0 h<2^(32*h):=ZbH r 0 h (λ t f=>d _ (by omega));have n:Yg r 0 r؝≠0:=by rw[l];have:0<2^(32*h)*(r[h]! + 2^32*r[h+1]!):=by have:=Χ j;positivity omega have s:32*h+2+25<=(Yg r 0 r؝)؈:=by rw[Nat.le_log2 n,l];have:1<=r[h+1]! := Χ j;calc 2^(32*h+2+25)<=2^(32*h)*2^32:=by rw[<- pow_add];exact κ (by norm_num) (by omega) _<=2^(32*h)*(r[h]! + 2^32*r[h+1]!):=by gcongr;linarith _<=_:=by omega rw[ZbN b _ e a n,<- ZbF b _ e _ s,l,ZbM _ _ _ h q,ZbL] def Yab (pos neg:Array Nat):Nat -> Nat | 0=>0 | k+1=>if pos[k]! != 0||neg[k]! != 0 then k+1 else Yab pos neg k lemma ZbO (a b:Array Nat) (k:Nat):∀ t,Yab a b k<=t -> t a[t]! = 0/\b[t]! = 0:=by induction k with | zero=>intro t _ h;omega | succ k f => intro t d e;simp only[Yab]at d;split at d . omega . rename_i g;rcases ύ (ό.mp e) with e | rfl . exact f t d e . simpa [Ϟ,bne_iff_ne,not_or] using g def YaL (pos neg:Array Nat) (e:Int) (negZero:Bool):UInt32 := let lo:=lowLimb pos neg pos.size 0 let n:=Yab pos neg (max pos.size neg.size)+1-lo let e':=e+((32*lo:Nat):Int) let d:=YP pos neg lo 0 0 0 (Bb n) n if d.2.1=0/\d.2.2.1=0/\d.2.2.2=0 then Yas false d.1 e' negZero else let d':=YP neg pos lo 0 0 0 (Bb n) n if d'.2.1=0/\d'.2.2.1=0/\d'.2.2.2=0 then Yas true d'.1 e' negZero else finishLimbs pos neg e negZero lemma ZaA (b d:Array Nat) (e:Int) (f:Bool):YaL b d e f=finishWord ((limbVal b׆:Int)-limbVal d׆) e f:=by unfold YaL;dsimp only;set g:=lowLimb b d b؝ 0;set n:=Yab b d (max b؝ d؝)+1-g;have p:=lowLimb_zero b d b؝ 0;have q:=ZbO b d (max b؝ d؝);have r (a:Array Nat) (h:a=b\/a=d):limbVal a׆=2^(32*g)*Yg a g n:=by apply ZbJ a g n . intro t j;rcases h with rfl | rfl . exact(p t (by omega) j).1 . exact(p t (by omega) j).2 . intro t j;by_cases s:t < max b؝ d؝ . rcases h with rfl | rfl . exact(q t (by omega) s).1 . exact(q t (by omega) s).2 . rcases h with rfl | rfl<;>exact Zav _ t (by omega) have u:=r b (AJ rfl);have v:=r d (Bz rfl);rw[show(Bb n:Array Nat)=#[] from rfl];have w:=Zaw b d g 0 0 0 #[] n (by omega) (by simp);have x:=Zaw d b g 0 0 0 #[] n (by omega) (by simp);have z:Yg (#[]:Array Nat) 0 0=0:=rfl;simp only[List.size_toArray,CN,Ρ,pow_zero,one_mul,z,Nat.cast_zero,zero_add]at w x obtain⟨-,A,y⟩:=w;obtain⟨-,B,k⟩:=x;split_ifs with l o . rw[Zaz false _ _ _ A,finishWord_scale,u,v];simp;congr 1;rw[l.1,l.2.1,l.2.2]at y;linear_combination (2:Int)^(32*g)*y . rw[Zaz true _ _ _ B,finishWord_scale,u,v];simp;congr 1;rw[o.1,o.2.1,o.2.2]at k;push_cast at k ⊢;linear_combination (-(2:Int)^(32*g))*k . exact finishLimbs_eq b d e f end @[inline] def Yy (acc:Acc) (wa wb:UInt32):Acc := if expOf wa=255\/expOf wb=255 then acc.markSpecial else acc.add (mantOf wa*mantOf wb) (idxOf wa+idxOf wb) (ψ (signOf wa) (signOf wb)) @[specialize] def Yw (fa fb:Nat -> UInt32) (pos neg:Array Nat) (sp nz:Bool) (index:Nat):Nat -> Acc | 0=>⟨pos,neg,sp,nz⟩ | count+1 => match Yy ⟨pos,neg,sp,nz⟩ (fa index) (fb index) with | ⟨p,n,s,z⟩=>Yw fa fb p n s z (index+1) count @[inline] def Yn (n:Nat) (fa fb:Nat -> UInt32):UInt32 := let acc:=Yw fa fb (ϫ 18 0) (ϫ 18 0) false true 0 n if acc.special then dotSpec (Aa (n:=n) λ i=>fa i) (Aa (n:=n) λ i=>fb i) else YaL acc.pos acc.neg (-298) (n≠0&&acc.negZero) lemma Zn (a b:UInt32):(if ψ (signOf a) (signOf b) then -((mantOf a*mantOf b:Nat):Int) else ((mantOf a*mantOf b:Nat):Int))=sv a*sv b:=by unfold sv;cases signOf a<;>cases signOf b<;>simp lemma ZbP (g h:Nat -> UInt32) (d e:Array Nat) (f:Bool) (a b:Nat):(Yw g h d e true f a b).special=true:=by induction b generalizing d e f a with | zero=>rfl | succ b k => rw[Yw];have j:(Yy ⟨d,e,true,f⟩ (g a) (h a)).special=true:=by unfold Yy Acc.markSpecial Acc.add;split_ifs<;>rfl generalize Yy ⟨d,e,true,f⟩ (g a) (h a)=r at j ⊢;obtain⟨p,q,s,z⟩:=r;subst j;exact k .. lemma ZaB (e f:Nat -> UInt32) (A B:Array UInt32) (n:Nat) (j:∀ k,k A[k]! = e k) (l:∀ k,k B[k]! = f k) (d:Acc) (a b:Nat) (h:a+b<=n) (o:d.pos.size=18) (t:d.neg.size=18) (g:(Yw e f d.pos d.neg d.special d.negZero a b).special =false) : d.special=false /\ (∀ k,a<=k -> k < a+b -> expOf A[k]! ≠ 255/\expOf B[k]! ≠ 255) /\ (Yw e f d.pos d.neg d.special d.negZero a b).total=d.total+dsum A B a b /\ (Yw e f d.pos d.neg d.special d.negZero a b).negZero=(d.negZero&&dallNZ A B a b):=by induction b generalizing d a with | zero=>obtain⟨p,n,s,z⟩:=d;simp_all[Yw,dsum,dallNZ] | succ count D => obtain⟨p,q,s,z⟩:=d;have v:=j a (by omega);have w:=l a (by omega);by_cases x:expOf (e a)=255\/expOf (f a)=255 . exfalso;rw[Yw]at g;have u:(Yy ⟨p,q,s,z⟩ (e a) (f a)).special=true:=by simp[Yy,x,Acc.markSpecial] generalize Yy ⟨p,q,s,z⟩ (e a) (f a)=r at u g;obtain⟨N,O,P,Q⟩:=r;subst u;rw[ZbP]at g;exact Bool.noConfusion g . have y:=not_or.mp x obtain⟨E,F,G,H,I⟩:=Acc.add_spec ⟨p,q,s,z⟩ (mantOf (e a)*mantOf (f a)) (idxOf (e a)+idxOf (f a)) (ψ (signOf (e a)) (signOf (f a))) o t (mul_mant_lt _ _) (by have:=idxOf_le _ y.1;have:=idxOf_le _ y.2;omega) have J:Yy ⟨p,q,s,z⟩ (e a) (f a)=Acc.add ⟨p,q,s,z⟩ (mantOf (e a)*mantOf (f a)) (idxOf (e a)+idxOf (f a)) (ψ (signOf (e a)) (signOf (f a))):=by simp[Yy,x] rw[Yw,J]at g ⊢;obtain⟨u,K,L,M⟩:=D _ (a+1) (by omega) E F g;refine⟨by rw[<- G,u],?_,?_,?_⟩ . intro k R S;rcases Ϩ k (a+1) with C | C . have:k=a:=by omega subst this;rw[v,w];exact y . exact K k C (by omega) . rw[L,I,dsum,v,w,Zn];ring . rw[M,H,dallNZ,v,w];simp[CW] lemma Ze (n:Nat) (f:Nat -> UInt32) (k:Nat) (a:kf i؞)[k]! = f k:=by simp_all lemma Z5 (n:Nat) (a b:Nat -> UInt32):Yn n a b=dotSpec (Aa (n:=n) λ i=>a i) (Aa (n:=n) λ i=>b i):=by unfold Yn;set A:=Aa (n:=n) λ i=>a i with C;set B:=Aa (n:=n) λ i=>b i with D;set d:=Yw a b (ϫ 18 0) (ϫ 18 0) false true 0 n with O;by_cases E:d.special=true . simp[E] . have v:d.special=false:=by grind obtain⟨-,g,l,o⟩:=ZaB a b A B n (Ze n a) (Ze n b) Acc.empty 0 n (by omega) (by simp[Acc.empty]) (by simp[Acc.empty]) v have l:d.total=dsum A B 0 n:=by have:=l;simp only[Acc.total_empty,Dj]at this;exact this have o:d.negZero=dallNZ A B 0 n:=by have:=o;exact this simp only[v,η,ite_false];rw[ZaA,show((limbVal d.pos.toList:Int)-limbVal d.neg.toList)=d.total from rfl] have w:A.size=n:=by simp[C] have x:B.size=n:=by simp[D] set L:=A.map (AQ (fmt:=Fmt)) with f set R:=B.map (AQ (fmt:=Fmt)) with F have e:L.size=R.size:=by grind have y:L.size=n:=by grind have p:∀ k (q:ka[i؞]!)=a:=by subst h;apply CI (by simp);intro i d b;rw[BA,getElem!_pos a i b] lemma ZbQ (n:Nat) (c:UInt32):(Aa (n:=n) λ _=>c)=ϫ n c:=by apply CI (by simp);simp def YaM (a b:Array UInt32):UInt32 := if a.size=b.size then Yn a.size (λ i=>a[i]!) (λ i=>b[i]!) else dotSpec a b def YaN (x:Array UInt32):UInt32:=Yn x.size (λ i=>x[i]!) (λ _=>oneW) lemma ZbR (a b:Array UInt32):YaM a b=dotSpec a b:=by unfold YaM;split . rename_i h;rw[Z5,Z6 a _ rfl,Z6 b _ h] . rfl lemma ZbS (x:Array UInt32):YaN x=sumSpec x:=by rw[YaN,Z5,Z6 x _ rfl,ZbQ,sumSpec] lemma Zi:Yn=dotOf:=funext λ n=>funext λ a=>funext λ b=>Z5 n a b lemma ZaC (w:Word):toWord (ofW w)=w:=by apply φ.mp;simp only[toWord,ofW,CL,ofUInt32_bits];exact γ w.toBitVec.isLt lemma ZaD (z:Model Fmt):ofW (toWord z)=z:=by have h:z.toNatBits<2^32:=Model.toNatBits_lt_two_pow z;simp only[ofW,toWord,AQ,Ϛ,γ h];exact Model.ofNatBits_toNatBits z @[inline] def Yz (w:Word):Int := if signOf w then -((mantOf w<<simp[ο] lemma Zx (w:Word):(decodeD w).toReal=(Yz w:ℝ)*2^(-149:Int):=by rw[<- AX,decodeD_toRat,ZbT];push_cast;rw[zpow_sub₀ two_ne_zero,zpow_natCast];ring lemma ZH (w:UInt32):(expOf w)؆=w؆/2^23%256:=by simp only[expOf,ϣ,Ϙ,ν];exact Θ _ 8 lemma ZR (w:UInt32):(fracOf w)؆=w؆%2^23:=by exact Θ _ 23 @[inline] def Yac (w:Word):Int:=let m:Int:=(w.toNat%2147483648:Nat);if signOf w then -m else m def mg (n:Nat):Nat:=if n/2^23%256=0 then n%2^23 else (2^23+n%2^23)*2^(n/2^23%256-1) lemma mxs (w:Word):mantOf w<<simp lemma ZS (a b:Nat) (h:a%2^31nlinarith [Bw (n:=A-1)] lemma ZbU (a b:Word):compare (Yac a) (Yac b)=compare (Yz a) (Yz b):=by have e:∀ a b:Nat,a%2^31=b%2^31 -> mg a=mg b:=λ a b h=>by unfold mg;rw[show a/2^23%256=b/2^23%256 by omega,show a%2^23=b%2^23 by omega] have:=ZS a؆ b؆;have:=ZS b؆ a؆;have:=e a؆ b؆;have:=ZS 0 b؆;have:=e a؆ 0;have:=e b؆ 0;have:mg 0=0:=rfl;unfold Yac Yz;rw[mxs,mxs];simp only[compare,compareOfLessAndEq];split_ifs<;>first|rfl|omega lemma ZbV (a:Word) (b:expOf a≠255):ofW a=(if Bd (ofW a)&&Bd (ofW a) then Bv Fmt (Bk (ofW a)&&Bk (ofW a)) else ofW a):=by simp only[Db];split . rename_i d;obtain⟨e,f⟩:=(Model.isZero_iff_fields_of_isFinite (by simp[ofW,isFinite_ofUInt32,b])).1 d conv_lhs=>rw[<- Model.ofFields_signBit_expField_fracField (ofW a),e,f] cases Bk (ofW a)<;>decide . rfl @[inline] def YQ (a b:Word):Word := if expOf a=255\/expOf b=255 then toWord (BH (ofW a) (ofW b)) else match compare (Yac a) (Yac b) with | .lt=>b | .gt=>a | .eq=>if a=b then a else toWord (if Bd (ofW a)&&Bd (ofW b) then Bv Fmt (Bk (ofW a)&&Bk (ofW b)) else ofW a) lemma ZbW (a b:Word):Model.cmpDyadic (decodeD a) (decodeD b)=compare (Yz a) (Yz b):=by have d:(0:ℝ)<2^(-149:Int):=zpow_pos two_pos _;cases h:compare (Yz a) (Yz b) . rw[Model.cmpDyadic_lt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_lt_iff_lt.mp h) d . rw[Model.cmpDyadic_eq_iff,Zx,Zx,compare_eq_iff_eq.mp h] . rw[Model.cmpDyadic_gt_iff,Zx,Zx];exact mul_lt_mul_of_pos_right (by exact_mod_cast compare_gt_iff_gt.mp h) d lemma ZbX (a b:Word):ofW (YQ a b)=BH (ofW a) (ofW b):=by unfold YQ;split . exact ZaD _ . rename_i d;rw[ZbU];have e:=toDyadic_ofUInt32 a (λ h=>d (AJ h));have f:=toDyadic_ofUInt32 b (λ h=>d (Bz h));have j:=Ai e;have k:=Ai f;have g:Model.compare (ofW a) (ofW b)=some _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e f;rw[ZbW]at g;have l:Model.chooseNaN2 (ofW a) (ofW b)=none:=(Model.chooseNaN2_eq_none_iff _ _).2 ⟨j,k⟩;unfold BH;rw[Model.withNaNSelection_of_none _ _ l];rw[Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ g];cases compare (Yz a) (Yz b)<;>simp only[ZaD,apply_ite ofW];by_cases h:a=b . subst h;rw[if_pos rfl];exact ZbV a (λ h=>d (AJ h)) . rw[if_neg h] def Yad (c h w k:Nat) (inp:Array Word):Array Word := Aa (n:=c*(h/k*(w/k))) λ q => let ch:=q.val/(h/k*(w/k)) let y:=q.val/(w/k)%(h/k) let x:=q.val%(w/k) (Ac (k*k)).foldl (λ acc t=>YQ acc (poolAt h w k inp ch y x t)) (poolAt h w k inp ch y x 0) lemma ZbY (p:Nat -> Word) (l:List Nat) (b:Word):l.foldl (λ m t=>BH m (ofW (p t))) (ofW b)=ofW (l.foldl (λ a t=>YQ a (p t)) b):=by induction l generalizing b with | nil=>rfl | cons t l d=>simp only[Ϻ,<- ZbX,d] lemma ZaF:Yad=maxpoolSpec:=by funext c h w k a;simp only[Yad,maxpoolSpec,ZbY,ZaC] def kernels0:Kernels where core:=⟨YaN,YaM⟩ dense:=⟨linearWith Yn,gemmWith Yn⟩ conv:=⟨conv2dWith Yn,depthwiseWith Yn⟩ elem:=⟨avgpoolWith Yn,Yad,addReluSpec,scaleShiftSpec⟩ norm:=⟨rmsnormWith Yn,layernormWith Yn⟩ lemma ZbZ:Obligation kernels0:=by simp only[Obligation,kernels0,specKernels,specCore,specDense,specConv,specElem,specNorm,linearSpec,gemmSpec,conv2dSpec,depthwiseSpec,avgpoolSpec,rmsnormSpec,layernormSpec,ZaF,Zi,funext ZbS,funext λ a=>funext (ZbR a)] def Yo (fa fb:Nat -> UInt32) (i:Nat):Nat -> Int | 0=>0 | r+1=>sv (fa i)*sv (fb i)*2^(idxOf (fa i)+idxOf (fb i))+Yo fa fb (i+1) r def Yq (fa fb:Nat -> UInt32) (i:Nat):Nat -> Bool | 0=>true | r+1=>(decide (mantOf (fa i)*mantOf (fb i)=0)&&ψ (signOf (fa i)) (signOf (fb i))) && Yq fa fb (i+1) r lemma Zb0 (n:Nat) (a b:Nat -> UInt32) (i r:Nat) (h:i+r<=n):dsum (Aa (n:=n) λ k=>a k؞) (Aa (n:=n) λ k=>b k؞) i r=Yo a b i r:=by induction r generalizing i with | zero=>rfl | succ r d=>rw[dsum,Yo,Ze n a i (by omega),Ze n b i (by omega),d (i+1) (by omega)] lemma Zb1 (n:Nat) (a b:Nat -> UInt32) (i r:Nat) (h:i+r<=n):dallNZ (Aa (n:=n) λ k=>a k؞) (Aa (n:=n) λ k=>b k؞) i r=Yq a b i r:=by induction r generalizing i with | zero=>rfl | succ r d=>rw[dallNZ,Yq,Ze n a i (by omega),Ze n b i (by omega),d (i+1) (by omega)] lemma Zb2 (f g:Nat -> UInt32) (d e:Array Nat) (j:Bool) (a b:Nat) (l:∀ k,a<=k -> k < a+b -> expOf (f k)≠255/\expOf (g k)≠255) : (Yw f g d e false j a b).special=false:=by induction b generalizing d e j a with | zero=>rfl | succ count t => rw[Yw];have n:=l a le_rfl (by omega);have o:(Yy ⟨d,e,false,j⟩ (f a) (g a)).special=false:=by have u:¬(expOf (f a)=255\/expOf (g a)=255):=by rintro (h | h) . exact n.1 h . exact n.2 h unfold Yy;unfold Acc.add;split_ifs<;>rfl generalize Yy ⟨d,e,false,j⟩ (f a) (g a)=r at o ⊢;obtain⟨p,q,s,z⟩:=r;subst o;exact t _ _ _ _ (λ k v w=>l k (by omega) (by omega)) lemma Zy (n:Nat) (a b:Nat -> UInt32) (d:∀ k,k expOf (a k)≠255/\expOf (b k)≠255) : dotOf n a b=finishWord (Yo a b 0 n) (-298) (decide (n≠0)&&Yq a b 0 n):=by rw[<- Zi];unfold Yn;set A:=Aa (n:=n) λ i=>a i؞ with o;set B:=Aa (n:=n) λ i=>b i؞ with p;set e:=Yw a b (ϫ 18 0) (ϫ 18 0) false true 0 n with q;have f:e.special=false:=Zb2 a b _ _ true 0 n (λ k _ r=>d k (by omega)) obtain⟨-,-,g,h⟩:=ZaB a b A B n (Ze n a) (Ze n b) Acc.empty 0 n (by omega) (by simp[Acc.empty]) (by simp[Acc.empty]) f have j:e.total=Yo a b 0 n:=by have:=g;simp only[Acc.total_empty,Dj]at this;rw[<- Zb0 n a b 0 n (by omega)];exact this have l:e.negZero=Yq a b 0 n:=by have:=h;rw[<- Zb1 n a b 0 n (by omega)];exact this simp only[f,η,ite_false];rw[ZaA,show((limbVal e.pos.toList:Int)-limbVal e.neg.toList)=e.total from rfl,j,l] def YC (w2 w1 w0:UInt64):Int := ((w2.toNat*2^128+w1.toNat*2^64+w0.toNat:Nat):Int) - (if w2.toNat<2^63 then 0 else 2^192) def Ym (w:UInt64):Int:=(w.toNat:Int)-(if w.toNat<2^63 then 0 else 2^64) lemma Zb3 (s:Bool) (E F:Nat) (b:E<256) (a:F<2^23):(CT Fmt s E F).toNatBits=(if s then 2^31 else 0)+E*2^23+F:=by rw[Model.ofFields_eq_ofFieldsImpl];simp only[Model.ofFieldsImpl,Model.mkBitsImpl,Model.ofBits,CL,BitVec.toNat_ofNatLT];have d:E&&&Fmt.expAllOnesNat=E:=AU (n:=8) b;have e:F&&&Fmt.fracMaskNat=F:=AU (n:=23) a;rw[d,e,show E.shiftLeft Fmt܀=E<<<23 from rfl,Nat.or_assoc,<- AI a] have f:E<<<23+F<2^31:=by omega cases s . simp[ο] . simp only[ite_true];rw[show Nat.shiftLeft 1 (Fmt.expWidth+Fmt܀)=1<<<31 from rfl,<- AI f];simp;omega @[inline] def Yv (neg:Bool) (E F:UInt32):UInt32:=(if neg then (0x80000000:UInt32) else 0)+(E<<<23)+F lemma ZT (a:Bool) (E F:UInt32) (b:E؆<256) (d:F؆<2^23):Yv a E F=toWord (CT Fmt a E؆ F؆):=by unfold toWord;rw[Zb3 a _ _ b d];apply φ.mp;unfold Yv;cases a<;>simp<;>omega lemma ZaG (a:Bool):Yv a 255 0=toWord (Ck Fmt a):=by rw[Model.nativeOverflow_eq_signedInf_of_isIEEE Fmt (by decide)];cases a<;>decide lemma Zb4 (a:Bool):Yv a 0 0=toWord (Bv Fmt a):=by cases a<;>decide @[inline] def YH (x r d:UInt64):UInt64:=if x>>>(r+d) != 0 then r+d else r @[inline] def Yj (x:UInt64):UInt64 := YH x (YH x (YH x (YH x (YH x (YH x 0 32) 16) 8) 4) 2) 1 lemma Zz (x r d:UInt64) (D:Nat) (a:d˥=D) (f:1<=D) (g:r˥+2*D<=64) (b:2^r˥<=x˥) (e:x˥<2^(r˥+2*D)) : (YH x r d)˥+D<=64/\2^(YH x r d)˥<=x˥ /\ x˥<2^((YH x r d)˥+D):=by subst a;have k:(r+d)˥=r˥+d˥:=by rw[δ];omega have l:(x>>>(r+d))˥=x˥/2^(r˥+d˥):=by rw[τ,k,γ (by omega),ν] unfold YH;by_cases j:x>>>(r+d) != 0 . simp only[j,ite_true,k];have:x˥/2^(r˥+d˥)≠0:=by intro h;apply(bne_iff_ne.mp j);apply ε.mp;rw[l,h];rfl refine⟨by omega,?_,by rw[show r˥+d˥+d˥=r˥+2*d˥ by omega];exact e⟩;exact(ϙ (θ _)).mp (BQ.mpr this) |>.trans' (by simp) . simp only[j,ite_false,η];have n:x>>>(r+d)=0:=by grind have:x˥/2^(r˥+d˥)=0:=by rw[<- l,n];rfl refine⟨by omega,b,?_⟩ exact(Nat.div_eq_zero_iff_lt (θ _)).mp this lemma Zj (x:UInt64) (a:x≠0):(Yj x)˥=x˥؈:=by have b:1<=x˥:=BQ.mpr λ h=>a (ε.mp (by simpa using h));have d:=x۾;obtain⟨t,e,f⟩:=Zz x 0 32 32 rfl (by decide) (by decide) (by simpa using b) (by simpa using d);obtain⟨u,g,j⟩:=Zz x _ 16 16 rfl (by decide) (by omega) e (by simpa using f);obtain⟨v,k,l⟩:=Zz x _ 8 8 rfl (by decide) (by omega) g (by simpa using j);obtain⟨w,n,o⟩:=Zz x _ 4 4 rfl (by decide) (by omega) k (by simpa using l);obtain⟨y,p,q⟩:=Zz x _ 2 2 rfl (by decide) (by omega) n (by simpa using o);obtain⟨z,r,s⟩:=Zz x _ 1 1 rfl (by decide) (by omega) p (by simpa using q);exact((ϔ (by omega)).mpr ⟨r,s⟩).symm @[inline] def Ybm (m:UInt64) (e:Int):UInt64 := match e+149 with | .ofNat k=>m<<AE m (k+1) @[inline] def YaO (neg:Bool) (m:UInt64) (e:Int):UInt32 := let fr:=Ybm m e if fr==0 then Yv neg 0 0 else if (0x800000:UInt64)<=fr then Yv neg 1 0 else Yv neg 0 fr.toUInt32 lemma Zb5 (a:Bool) (m:UInt64) (e:Int) (b:m˥≠0) (h:(m˥؈:Int)+e < -126) : YaO a m e=toWord (AS Fmt a (Bv Fmt a) (match e-Fmt.minSubnormalExponent with | Int.ofNat shift=>m˥<<An m˥ (shift+1))):=by have j:m˥<2^(m˥؈+1):=ϐ;rw[show e-Fmt.minSubnormalExponent=e+149 by rw[show Fmt.minSubnormalExponent = -149 from rfl];omega];unfold YaO Ybm;generalize o:e+149=s;suffices H:∀ (d:UInt64) (F:Nat),d˥=F -> F<=2^23 -> (if d==0 then Yv a 0 0 else if (0x800000:UInt64)<=d then Yv a 1 0 else Yv a 0 d؍)=toWord (AS Fmt a (Bv Fmt a) F) by cases s with | ofNat k => have l:(k:Int)=e+149:=by grind have t:m˥*2^k<2^23:=by calc m˥*2^k<2^(m˥؈+1)*2^k:=ϖ j (θ k) _=2^(m˥؈+1+k):=by rw[<- ρ] _<=2^23:=κ (by norm_num) (by omega) apply H _ (m˥<< have l:Ϥ k=e+149:=by rw[o] apply H _ _ (Ax m (k+1));have u:m˥/2^(k+1)<2^23:=by rw[ϋ (θ _)];calc m˥<2^(m˥؈+1):=j _<=2^(23+(k+1)):=κ (by norm_num) (by rw[Int.negSucc_eq]at l;omega) _=2^23*2^(k+1):=by rw[ρ] have:=AF m˥ (k+1);omega intro d F q v;subst q;unfold AS;by_cases g:d=0 . subst g;exact Zb4 a have r:(d˥==0)=false:=by simpa using λ h=>g (ε.mp (by simpa using h)) simp only[show(d==0)=false by simpa using g,r,η,ite_false];by_cases f:d˥>=2^23 . have:(0x800000:UInt64)<=d:=by rw[σ];simpa using f simp only[this,ite_true,show d˥>=Do Fmt܀ from f] exact ZT a 1 0 (by decide) (by decide) . have:¬ (0x800000:UInt64)<=d:=by rw[σ];simpa using f simp only[this,ite_false,show ¬ d˥>=Do Fmt܀ from f] have n:d؍؆=d˥:=by rw[Τ];omega rw[ZT a 0 _ (by decide) (by rw[n];omega),n];rfl @[inline] def YK (m L:UInt64):UInt64 := if 23<=L then AE m (L-23).toNat else m<<<(23-L) @[inline] def Yae (neg:Bool) (m L:UInt64) (t:Int):UInt32 := let rm:=YK m L if rm==0x1000000 then (if t+1>127 then Yv neg 255 0 else Yv neg (t+128).toNat.toUInt32 0) else Yv neg (t+127).toNat.toUInt32 (rm.toUInt32-0x800000) lemma Z7 (m:UInt64) (a:m≠0):(YK m (Yj m))˥=(if Fmt܀<=m˥؈ then An m˥ (m˥؈-Fmt܀) else m˥<<<(Fmt܀-m˥؈)) /\ 2^23<=(YK m (Yj m))˥/\(YK m (Yj m))˥<=2^24:=by have j:m˥≠0:=λ h=>a (ε.mp (by simpa using h));have b:=Zj m a;have f:2^m˥؈<=m˥:=ϑ j;have g:m˥<2^(m˥؈+1):=ϐ;rw[show Fmt܀=23 from rfl];unfold YK;generalize Yj m=L at b ⊢;generalize n:m˥؈=N at * by_cases h:23<=N . have d:(23:UInt64)<=L:=by rw[σ,b];simp;omega have e:(L-23)˥=N-23:=by simp_all simp only[d,ite_true,h,e,Ax];have o:2^23<=m˥/2^(N-23):=by rw[ϙ (θ _),<- ρ,show 23+(N-23)=N by omega] exact f have p:m˥/2^(N-23)<2^24:=by rw[ϋ (θ _),<- ρ,show 24+(N-23)=N+1 by omega];exact g have:=Br m˥ (N-23);have:=AF m˥ (N-23);refine⟨trivial,by omega,by omega⟩ . have d:¬ (23:UInt64)<=L:=by rw[σ,b];simp;omega have e:(23-L)˥=23-N:=by rw[ξ _ _ (by rw[σ,b];simp;omega),b];rfl simp only[d,ite_false,h];have k:2^23<=m˥*2^(23-N):=by calc 2^23=2^N*2^(23-N):=by rw[<- ρ];congr 1;omega _<=m˥*2^(23-N):=μ _ f have q:m˥*2^(23-N)<2^24:=by calc m˥*2^(23-N)<2^(N+1)*2^(23-N):=ϖ g (θ _) _=2^24:=by rw[<- ρ];congr 1;omega have l:(m<<<(23-L))˥=m˥*2^(23-N):=by rw[χ,e,γ (show 23-N<64 by omega),ο];exact γ (by omega) rw[l,ο];exact⟨rfl,k,by omega⟩ lemma Zb6 (a:Bool) (m:UInt64) (e:Int) (b:m≠0) (d:¬ ((m˥؈:Int)+e>127)) (f:¬ ((m˥؈:Int)+e < -126)) : Yae a m (Yj m) ((m˥؈:Int)+e)=toWord (BL Fmt a (Ck Fmt a) (↑m˥؈+e) (if Fmt܀<=m˥؈ then An m˥ (m˥؈-Fmt܀) else m˥<<<(Fmt܀-m˥؈))):=by obtain⟨q,r,s⟩:=Z7 m b;rw[<- q];unfold Yae BL;generalize YK m (Yj m)=g at r s ⊢;generalize (m˥؈:Int)+e=t at d f ⊢;simp only[Model.pow2_eq_two_pow,show Fmt܀=23 from rfl,show Fmt.maxNormalExponent=127 from rfl,show Fmt.exponentBias=127 from rfl,show Fmt.maxFiniteExpField=254 from rfl,show Fmt.maxFiniteFracField=8388607 from rfl,CY,Nat.reduceAdd,Int.ofNat_eq_natCast,Cl] by_cases k:g˥=16777216 . have l:(g==0x1000000)=true:=by rw[beq_iff_eq];apply ε.mp;rw[k];rfl simp only[l,ite_true,k,BEq.rfl,Nat.reduceSub];by_cases o:t+1>127 . simp only[o,ite_true];exact ZaG a . simp only[o,ite_false];have j:((t+128)܁.toUInt32)؆=(t+1+127)܁:=by rw[Bm,Ϛ,γ (by omega)];omega have n:((t+1+127)܁>254||((t+1+127)܁==254&&decide (0>8388607)))=false:=by grind simp only[n,η,ite_false];rw[ZT a _ 0 (by rw[j];omega) (by decide),j];rfl . have l:(g==0x1000000)=false:=by rw[beq_eq_false_iff_ne];intro h;apply k;rw[h];rfl have u:(g˥==16777216)=false:=by grind simp only[l,u,η,ite_false,show ¬ t>127 by omega] have j:((t+127)܁.toUInt32)؆=(t+127)܁:=by rw[Bm,Ϛ,γ (by omega)] have p:(g؍-0x800000)؆=g˥-8388608:=by rw[Bi _ _ (by rw[ϡ,Τ];simp;omega),Τ];simp;omega have n:((t+127)܁>254||((t+127)܁==254&&decide (g˥-8388608>8388607)))=false:=by grind simp only[n,η,ite_false];rw[ZT a _ _ (by rw[j];omega) (by rw[p];omega),j,p] @[inline] def YA (neg:Bool) (m:UInt64) (e:Int):UInt32 := let L:=Yj m let t:Int:=(L.toNat:Int)+e if t>127 then Yv neg 255 0 else if t < -126 then YaO neg m e else Yae neg m L t lemma ZU (a:Bool) (m:UInt64) (e:Int) (b:m≠0):YA a m e=toWord (Ag Fmt ⟨a,m˥,e⟩):=by have g:m˥≠0:=λ h=>b (ε.mp (by simpa using h));have j:=Zj m b;unfold YA Ag;simp only[show(m˥==0)=false by simpa using g,η,ite_false,j,show Fmt.maxNormalExponent=127 from rfl,show Fmt.minNormalExponent = -126 from rfl] by_cases f:(m˥؈:Int)+e>127 . simp only[f,ite_true];exact ZaG a . simp only[f,ite_false];by_cases d:(m˥؈:Int)+e < -126 . simp only[d,ite_true];exact Zb5 a m e g d . simp only[d,ite_false];exact Zb6 a m e b f d @[noinline] def Ybn (neg:Bool) (m:UInt64) (e:Int):UInt32:=YA neg m e @[noinline] def Yat (neg:Bool) (m:UInt64) (e:Int) (L c:UInt64):UInt32 := YA neg m (e+((L.toNat+c.toNat:Nat):Int)) @[inline] def YY (n:UInt64):UInt64 := let q:=n>>>40 q+(((n&&&0xFFFFFFFFFF)+0x7FFFFFFFFF+(q&&&1))>>>40) lemma Zb7 (n:UInt64):(YY n)˥=An n˥ 40:=by rw[Bp _ _ (by decide)];have b:(n>>>40)˥=n˥/2^40:=by rw[τ,ν];rfl have d:(n&&&0xFFFFFFFFFF)˥=n˥%2^40:=by rw[AW,show(0xFFFFFFFFFF: UInt64 )˥=2^40-1 from rfl,Θ] have e:((n>>>40)&&&1)˥=n˥/2^40%2:=(by simp_all);have f:n˥/2^(40-1)%2=n˥%2^40/2^39:=by rw[((by norm_num):(2: Nat )^40=2^39*2),Bx] have g:n˥%2^(40-1)=n˥%2^40%2^39:=by rw[((by norm_num):(2: Nat )^40=2^39*2),Nat.mod_mul_right_mod] have k:=Ζ n˥ (θ 40);have l:n˥/2^40<2^24:=(ϋ (by decide)).2 n۾ unfold YY;simp only[δ,τ,d,e,Be,f,g];clear b d e f g;generalize n˥%2^40=R at*;simp only[CB,ν]at*;split<;>rename_i h<;>simp at h<;>generalize n˥/1099511627776=Q at*<;>rw[γ (a:=R+549755813887) (by omega),γ (a:=R+549755813887+Q%2) (by omega)]<;>[rw[((by omega):(R+549755813887+Q%2)/1099511627776=1)];rw[((by omega):(R+549755813887+Q%2)/1099511627776=0)]]<;>exact γ (by omega) lemma Z8 (a:Bool) (E F:UInt32) (h:E؆*2^23+F؆<2^31):(Yv a E F)؆=(if a then 2^31 else 0)+E؆*2^23+F؆:=by unfold Yv;cases a<;>simp<;>omega @[inline] def YZ (neg:Bool) (u n:UInt64):UInt32 := (if neg then (0x80000000:UInt32) else 0)+((u<<<23)+YY n).toUInt32 lemma Zb8 (a:Bool) (u n:UInt64) (b:u˥<=253) (d:(YY n)˥<=2^24):(YZ a u n)؆=(if a then 2^31 else 0)+u˥*2^23+(YY n)˥:=by have e:(u<<<23)˥=u˥*2^23:=by rw[χ];simp;omega unfold YZ;cases a<;>simp<;>omega lemma ZaH (a:Bool) (m:UInt64) (e:Int) (u:UInt64) (b:m≠0) (d:(u˥:Int)=(m˥؈:Int)+e+126) (f:u˥<=253) : YZ a u (m<<<(63-Yj m))=YA a m e:=by have k:=Zj m b;obtain⟨o,p,q⟩:=Z7 m b;have j:m˥؈<64:=(ϭ λh=>b (ε.mp h)).mpr m۾;have l:(YY (m<<<(63-Yj m)))˥=(YK m (Yj m))˥:=by rw[Zb7,o,(by rw[χ,(by rw[ω,k];simp;clear*-j;omega:(63-Yj m)˥=63-m˥؈),γ (by clear*-;omega:63-m˥؈<64),ο];exact γ ((ϖ ϐ (θ _)).trans_eq (by rw[<-ρ,(by clear*-j;omega:m˥؈+1+(63-m˥؈)=64)])):(m<<<(63-Yj m))˥=m˥*2^(63-m˥؈)),show ExactRuntime.Fmt܀=23 from rfl];split<;>rename_i g;rw[(by clear*-g j;omega:(40: Nat )=m˥؈-23+(63-m˥؈)),BD];rw[Bl _ _ _ (by clear*-g j;omega),ο,(by clear*-;omega:63-m˥؈-40=23-m˥؈)] simp only[YA,k,show¬(m˥؈+e>127)by clear*-d f;omega,show¬(m˥؈+e< -126)by clear*-d f;omega, ite_false ];apply φ.mp;rw[Zb8 a u _ f (by clear*-l p q;omega),l];unfold Yae;generalize YK m (Yj m)=n at l p q⊢;generalize (m˥؈: Int )+e=t at d⊢;clear b k o j;by_cases g:n˥=16777216;simp only[show(n==0x1000000)=true by simp[<-ε,g], ite_true ];by_cases v:t+1>127<;>simp only[v, ite_true , ite_false ]<;>rw[Z8 a _ _ (by simp<;>omega)]<;>simp<;>omega;simp only[show(n==0x1000000)=false by simp[<-ε,g],η, ite_false ];rw[Z8 a _ _ (by simp[UInt32.toNat_sub];omega)];simp[UInt32.toNat_sub];omega lemma ZaI (a:Bool) (n:UInt64) (E:Int) (u:UInt64) (b:2^63<=n˥) (e:(u˥:Int)=E+189) (d:u˥<=253) : YZ a u n=YA a n E:=by have f:n˥≠0:=Ϣ.mp (lt_of_lt_of_le (θ 63) b);have g:n≠0:=λ h=>f (by rw[h];rfl);have j:n˥؈=63:=(ϔ f).mpr ⟨b,n۾⟩;have k:Yj n=63:=ε.mp (by rw[Zj n g,j];rfl);have:=ZaH a n E u g (by rw[j];push_cast;omega) d;rw[k,show n<<<(63-63:UInt64)=n from ε.mp (by rw[χ];simp only[UInt64.reduceSub,Nat.zero_mod,Nat.shiftLeft_zero];exact γ n۾)]at this exact this lemma Zb9 (e:Int) (c:UInt64) (b:c˥<2^62) (h:(Aw e).toInt=e) (a:((Aw e).toUInt64+c)˥<=253) : (((Aw e).toUInt64+c)˥:Int)=e+c˥:=by have d:=Int64.toInt_lt (Aw e);have f:=Int64.le_toInt (Aw e);have g:((Aw e).toUInt64˥:Int)=e%2^64:=by simp;exact Int.toNat_of_nonneg (CP _ (by decide)) rw[δ]at a ⊢;omega def Y0 (e:Int) (ok:Bool) (B:UInt64):Prop := ∀ c:UInt64,c.toNat<2^62 -> ok=true -> (B+c).toNat<=253 -> ((B+c).toNat:Int)=e+c.toNat lemma ZaJ (e:Int):Y0 e ((Aw e).toInt==e) (Aw e).toUInt64:=λ c a b d=>Zb9 e c a (beq_iff_eq.mp b) d @[inline] def Yau (neg:Bool) (m:UInt64) (e:Int) (ok:Bool) (b:UInt64):UInt32 := let L:=Yj m let u:=b+L+126 if ok&&u<=253 then YZ neg u (m<<<(63-L)) else Ybn neg m e lemma ZaK (a:Bool) (m:UInt64) (e:Int) (d:Bool) (B:UInt64) (b:m≠0) (f:Y0 e d B):Yau a m e d B=YA a m e:=by have k:m˥≠0:=λ h=>b (ε.mp (by simpa using h));have l:=Zj m b;have q:m˥؈<64:=(ϭ k).mpr m۾;unfold Yau Ybn;dsimp only;split . rename_i h;simp at h;obtain⟨n,g⟩:=h;have o:(Yj m+126)˥=m˥؈+126:=by rw[δ,l];simp;omega rw[Bj]at g ⊢;have j:(B+(Yj m+126))˥<=253:=by have:=σ.mp g;simpa using this have p:=f _ (by rw[o];omega) n j;exact ZaH a m e _ b (by rw[p];push_cast;omega) j . rfl @[inline] def YaP (w:UInt64) (e:Int) (negZero ok:Bool) (B:UInt64):UInt32 := if w=0 then (if negZero then 0x80000000 else 0) else let neg:=w>>>63 != 0 Yau neg (if neg then 0-w else w) e ok B lemma Zca (w:UInt64) (e:Int) (a b:Bool) (B:UInt64) (d:Y0 e b B):YaP w e a b B=finishWord (Ym w) e a:=by unfold YaP finishWord;by_cases f:w=0 . subst f;simp[Ym] . have r:w˥≠0:=λ h=>f (ε.mp (by simpa using h)) have s:=w۾;have t:(w>>>63)˥=w˥/2^63:=by rw[τ,ν];rfl obtain⟨k,l,n⟩:(w>>>63 != 0)=decide (Ym w<0) /\ (if (w>>>63 != 0)=true then 0-w else w)˥=(Ym w).natAbs/\Ym w≠0:=by by_cases h:w˥<2^63 . have g:Ym w=(w˥:Int):=by unfold Ym;omega have o:(w>>>63 != 0)=false:=by simp;apply ε.mp;simp;omega rw[g,o];simp only[η,ite_false,BC];refine⟨by simp,trivial,by omega⟩ . have g:Ym w=(w˥:Int)-2^64:=by unfold Ym;simp only[h,ite_false] have p:(w>>>63 != 0)=true:=by simp;intro e;have:=congrArg ϟ e;simp at this;omega have q:(0-w)˥=2^64-w˥:=by rw[ω];simp;omega rw[g,p];simp only[ite_true,q];refine⟨by simp;omega,by omega,by omega⟩ simp only[f,ite_false,n];rw[<- Ah];have j:(if (w>>>63 != 0)=true then 0-w else w)≠0:=by grind rw[ZaK _ _ _ _ _ j d,ZU _ _ _ j,l,k];rfl def YaQ (w:UInt64) (e:Int) (negZero:Bool):UInt32 := YaP w e negZero ((Aw e).toInt==e) (Aw e).toUInt64 lemma ZaL (w:UInt64) (e:Int) (a:Bool):YaQ w e a=finishWord (Ym w) e a := Zca w e a _ _ (ZaJ e) lemma Zcb (V s:Nat) (h:s+25<=V؈):(Af V s)؈=V؈-s:=by have d:V≠0:=by intro e;subst e;simp at h have f:2^V؈<=V:=ϑ d;have g:V<2^(V؈+1):=ϐ;have a:2^(V؈-s)<=V/2^s:=by rw[ϙ (θ _),<- ρ,show V؈-s+s=V؈ by omega];exact f have b:V/2^s<2^(V؈-s+1):=by rw[ϋ (θ _),<- ρ,show V؈-s+1+s=V؈+1 by omega];exact g unfold Af;simp only;split . exact(ϔ (by omega)).mpr ⟨a,b⟩ . rw[Az];split . rename_i _ j;apply(ϔ (by omega)).mpr omega . exact(ϔ (by omega)).mpr ⟨a,b⟩ lemma ZaM (b:Bool) (V s:Nat) (e:Int) (h:s+25<=V؈):Ag Fmt ⟨b,Af V s,e+s⟩=Ag Fmt ⟨b,V,e⟩:=by have d:V≠0:=by intro j;subst j;simp at h have k:2^s<=V:=le_trans (κ (by norm_num) (by omega)) (ϑ d) have l:Af V s≠0:=Cj V s k;have n:=Zcb V s h;unfold Ag;simp only[show(Af V s==0)=false by simpa using l,show(V==0)=false by simpa using d,η,ite_false,n] have o:((V؈-s:Nat):Int)+(e+s)=V؈+e:=by omega rw[o];split . rfl . split . rename_i _ f;have t:Fmt.minSubnormalExponent = -149:=rfl;have u:(V؈:Int)+e < -126:=lt_of_lt_of_eq f rfl;obtain⟨a,g⟩:∃ a:Nat,e-Fmt.minSubnormalExponent=Ϥ a/\s+2<=a+1:=by refine⟨(-(e+149)-1)܁,?_,by omega⟩;omega have p:e+(s:Int)-Fmt.minSubnormalExponent=Ϥ (a-s):=by omega rw[g.1,p];simp only;rw[show a-s+1=a+1-s by omega,AB V s (a+1) g.2] . rename_i _ f;have q:Fmt܀<=V؈-s:=by rw[show Fmt܀=23 from rfl];omega have r:Fmt܀<=V؈:=by omega simp only[q,r,ite_true];rw[show Fmt܀=23 from rfl,show V؈-s-23=V؈-23-s by omega,AB V s (V؈-23) (by omega)] lemma Z9 (b a d:UInt64) (L:Nat) (f:d˥=L) (j:L<=63) (g:b˥<2^(L+1)):((b<<<(63-d))|||((a>>>d)>>>1))˥=(b˥*2^64+a˥)/2^(L+1) /\ ((a<<<(63-d)) != 0)=decide ((b˥*2^64+a˥)%2^(L+1)≠0):=by have n:(63-d)˥=63-L:=by rw[ξ _ _ (by rw[σ,f];simp;omega),f];rfl have k:(2:Nat)^64=2^(63-L)*2^(L+1):=by rw[<- ρ];congr 1;omega have q:(b<<<(63-d))˥=b˥*2^(63-L):=by rw[χ,n,γ (show 63-L<64 by omega),ο] apply γ;calc b˥*2^(63-L)<2^(L+1)*2^(63-L):=ϖ g (θ _) _=2^64:=by rw[<- ρ];congr 1;omega have r:((a>>>d)>>>1)˥=a˥/2^(L+1):=by rw[τ,τ,f,γ (show L<64 by omega)];simp only[CB,BI,ν,ϩ,<- Nat.pow_succ] have s:a˥/2^(L+1)<2^(63-L):=by rw[ϋ (θ _),<- k];exact a۾ have t:(b˥*2^64+a˥)/2^(L+1)=b˥*2^(63-L)+a˥/2^(L+1):=by rw[k,<- ϒ,Δ,Ι _ _ (θ _),Δ] have u:(b˥*2^64+a˥)%2^(L+1)=a˥%2^(L+1):=by rw[k,<- ϒ,Δ,Φ] refine⟨?_,?_⟩ . rw[CS,q,r,t,<- ο,<- AI s] . rw[u];have o:(a<<<(63-d))˥=a˥%2^(L+1)*2^(63-L):=by rw[χ,n,γ (show 63-L<64 by omega),ο,k,Ϫ (2^(63-L)),Cd] have v:0<2^(63-L):=θ _;by_cases l:a˥%2^(L+1)=0 . have:a<<<(63-d)=0:=ε.mp (by rw[o,l,Ψ];simp);simp[this,l] . have:a<<<(63-d)≠0:=λ e=>by have p:=congrArg ϟ e;rw[o,Ψ]at p;rcases ϛ.mp p with h | h . exact l h . exact absurd h (Ϣ.mp v) simp[this,l] @[inline] def Yav (w0:UInt64):UInt64 := ~~~w0+1 @[inline] def Yaw (w1 w0:UInt64):UInt64 := ~~~w1+(if w0==0 then 1 else 0) @[inline] def Yax (w2 w1 w0:UInt64):UInt64 := ~~~w2+(if w1==0&&w0==0 then 1 else 0) lemma Zcc (d b a:UInt64) (h:d˥*2^128+b˥*2^64+a˥≠0):(Yax d b a)˥*2^128+(Yaw b a)˥*2^64+(Yav a)˥=2^192-(d˥*2^128+b˥*2^64+a˥):=by have n:=d۾;have o:=b۾;have p:=a۾;unfold Yax Yaw Yav;by_cases e:a=0 . have f:a˥=0:=by simp_all by_cases l:b=0 . have g:b˥=0:=by grind simp only[e,l,Db,ite_true,BO]at *;simp at *;omega . have j:(b==0)=false:=by grind have g:b˥≠0:=λ h=>l (ε.mp (by rw[h];rfl)) simp only[e,j,beq_self_eq_true,Bool.false_and,η,ite_false,ite_true,δ,BO]at *;simp at *;omega . have k:(a==0)=false:=by grind have f:a˥≠0:=λ h=>e (ε.mp (by rw[h];rfl)) simp only[k,Bool.and_false,η,ite_false,δ,BO]at *;simp at *;omega @[inline] def Yaf (neg:Bool) (m2 m1 m0:UInt64) (e:Int):UInt32 := let L:=Yj m2 let x:=(m2<<<(63-L))|||((m1>>>L)>>>1) let st:=(m1<<<(63-L)) != 0||m0 != 0 YA neg (if st then x|||1 else x) (e+((L.toNat+65:Nat):Int)) @[inline] def Yag (neg:Bool) (m1 m0:UInt64) (e:Int):UInt32 := let L:=Yj m1 let x:=(m1<<<(63-L))|||((m0>>>L)>>>1) let st:=(m0<<<(63-L)) != 0 YA neg (if st then x|||1 else x) (e+((L.toNat+1:Nat):Int)) @[inline] def Yay (neg:Bool) (m2 m1 m0:UInt64) (e:Int):UInt32 := if m2 != 0 then Yaf neg m2 m1 m0 e else if m1 != 0 then Yag neg m1 m0 e else YA neg m0 e lemma ZaN (x:UInt64) (a:Bool) (Q R:Nat) (b:x˥=Q) (d:a=decide (R≠0)) (e:2<=Q):(if a then x|||1 else x)˥=(if R==0 then Q else Q|||1):=by subst b d;by_cases f:R=0 . simp[f] . simp[f] lemma Zcd (d:Bool) (a b:UInt64) (e:Int) (f:a≠0):Yag d a b e=toWord (Ag Fmt ⟨d,a˥*2^64+b˥,e⟩):=by have v:=b۾;unfold Yag;have l:a˥≠0:=λ h=>f (ε.mp (by rw[h];rfl)) have g:=Zj a f;generalize k:a˥؈=K at g;have s:K<=63:=by rw[<- k];have:=(ϭ l).mpr a۾;omega have n:a˥<2^(K+1):=by rw[<- k];exact ϐ have o:2^K<=a˥:=by rw[<- k];exact ϑ l obtain⟨p,q⟩:=Z9 a b (Yj a) K g s n;generalize Yj a=L at g p q ⊢;have t:2<=(a˥*2^64+b˥)/2^(K+1):=by rw[ϙ (θ _)];calc 2*2^(K+1)=2^K*2^2:=by rw[<- ρ,<- CZ] _<=a˥*2^64:=AG o (κ (by norm_num) (by norm_num)) _<=_:=ϝ _ _ have r:=ZaN _ _ _ _ p q t;have u:(if ((b<<<(63-L)) != 0)=true then ((a<<<(63-L))|||((b>>>L)>>>1))|||1 else (a<<<(63-L))|||((b>>>L)>>>1))≠0:=by intro h;have j:=congrArg ϟ h;rw[r,Ψ]at j;split at j . omega . rw[Az]at j;split at j<;>omega rw[ZU _ _ _ u,r,g];have w:(a˥*2^64+b˥)؈=64+K:=by apply(ϔ (by omega)).mpr;constructor . calc 2^(64+K)=2^K*2^64:=by rw[<- ρ,Δ] _<=a˥*2^64:=μ _ o _<=_:=ϝ _ _ . calc a˥*2^64+b˥ < a˥*2^64+2^64:=by omega _=(a˥+1)*2^64:=by ring _<=2^(K+1)*2^64:=μ _ n _=2^(64+K+1):=by rw[<- ρ,Δ (K+1),ϕ] have:=ZaM d (a˥*2^64+b˥) (K+1) e (by omega);unfold Af at this;rw[this] lemma Zce (f:Bool) (a d b:UInt64) (e:Int) (g:a≠0):Yaf f a d b e=toWord (Ag Fmt ⟨f,a˥*2^128+d˥*2^64+b˥,e⟩):=by have y:=d۾;have z:=b۾;unfold Yaf;have n:a˥≠0:=λ h=>g (ε.mp (by rw[h];rfl));have B:a˥*2^128+d˥*2^64+b˥≠0:=by have C:0 < a˥*2^128:=Ϗ (Χ n) (θ _);rw[ϕ];exact Nat.ne_of_gt (Ad C (ϝ _ _)) have j:=Zj a g;generalize o:a˥؈=K at j;have D:K<=63:=by rw[<- o];have:=(ϭ n).mpr a۾;omega have r:a˥<2^(K+1):=by rw[<- o];exact ϐ have s:2^K<=a˥:=by rw[<- o];exact ϑ n obtain⟨k,p⟩:=Z9 a d (Yj a) K j D r;generalize Yj a=L at j k p ⊢;obtain⟨A,q⟩:∃ A,a˥*2^64+d˥=A:=⟨_,rfl⟩;rw[q]at k p;have E:A=A/2^(K+1)*2^(K+1)+A%2^(K+1):=(ϴ A _).symm;have F:A%2^(K+1)<2^(K+1):=Ζ _ (θ _);have t:(2:Nat)^(K+65)=2^(K+1)*2^64:=by grind have u:a˥*2^128+d˥*2^64+b˥=(A%2^(K+1)*2^64+b˥)+A/2^(K+1)*2^(K+65):=by have:a˥*2^128+d˥*2^64=A*2^64:=by rw[<- q];ring rw[this,t];conv_lhs=>rw[E] ring have v:A%2^(K+1)*2^64+b˥<2^(K+65):=by rw[t];calc A%2^(K+1)*2^64+b˥h (ε.mp (by rw[M];rfl));simp[h,this] rw[J];by_cases O:A%2^(K+1)=0<;>by_cases P:b˥=0<;>simp have w:2<=A/2^(K+1):=by rw[ϙ (θ _),<- q];calc 2*2^(K+1)=2^K*2^2:=by rw[<- ρ,<- CZ] _<=a˥*2^64:=AG s (κ (by norm_num) (by norm_num)) _<=_:=ϝ _ _ rw[<- G]at k w;have x:=ZaN _ _ _ _ k I w;have N:(if ((d<<<(63-L) != 0)||(b != 0))=true then ((a<<<(63-L))|||((d>>>L)>>>1))|||1 else (a<<<(63-L))|||((d>>>L)>>>1))≠0:=by intro h;have l:=congrArg ϟ h;rw[x,Ψ]at l;split at l . omega . rw[Az]at l;split at l<;>omega rw[ZU _ _ _ N,x,j];have Q:(a˥*2^128+d˥*2^64+b˥)؈=128+K:=by apply(ϔ B).mpr;constructor . calc 2^(128+K)=2^K*2^128:=by rw[<- ρ,Δ] _<=a˥*2^128:=μ _ s _<=_:=by rw[ϕ];exact ϝ _ _ . have:d˥*2^64+b˥<2^128:=by calc d˥*2^64+b˥ < d˥*2^64+2^64:=ϧ z _ _=(d˥+1)*2^64:=by ring _<=2^64*2^64:=μ _ y calc a˥*2^128+d˥*2^64+b˥ < a˥*2^128+2^128:=by rw[ϕ];exact ϧ this _ _=(a˥+1)*2^128:=by ring _<=2^(K+1)*2^128:=μ _ r _=2^(128+K+1):=by rw[<- ρ,Δ (K+1),ϕ] have:=ZaM f (a˥*2^128+d˥*2^64+b˥) (K+65) e (by omega);unfold Af at this;rw[this] lemma ZaO (a:Bool) (d b f:UInt64) (e:Int) (g:d˥*2^128+b˥*2^64+f˥≠0) : Yay a d b f e=toWord (Ag Fmt ⟨a,d˥*2^128+b˥*2^64+f˥,e⟩):=by unfold Yay;by_cases j:d=0 . subst j;simp only[ite_false,Ψ,Λ,ι]at g ⊢;by_cases k:b=0 . subst k;simp at g ⊢;exact ZU a f e (λ h=>g (by rw[h];rfl)) . simp only[show(b != 0)=true by simpa using k,ite_true];exact Zcd a b f e k . simp only[show(d != 0)=true by simpa using j,ite_true];exact Zce a d b f e j lemma ZaP (a d b:UInt64) (L:Nat) (f:b˥=L) (g:L<=63) (h:a˥<2^(L+1)) (j:2^L<=a˥) (e:Bool) : 2^63<=(if e then ((a<<<(63-b))|||((d>>>b)>>>1))|||1 else (a<<<(63-b))|||((d>>>b)>>>1))˥:=by obtain⟨k,-⟩:=Z9 a d b L f g h;have l:2^63<=(a˥*2^64+d˥)/2^(L+1):=by rw[ϙ (θ _)];calc 2^63*2^(L+1)=2^L*2^64:=by rw[<- ρ,<- ρ,show 63+(L+1)=L+64 by omega] _<=a˥*2^64:=μ _ j _<=_:=ϝ _ _ cases e . simp only[η,ite_false];rw[k];exact l . simp only[ite_true];rw[CS,k,show(1:UInt64)˥=1 from rfl,Az];split<;>omega @[inline] def YaR (neg:Bool) (m1 m0:UInt64) (e:Int) (ok:Bool) (b:UInt64):UInt32 := let L:=Yj m1 let x:=(m1<<<(63-L))|||((m0>>>L)>>>1) let st:=(m0<<<(63-L)) != 0 let x':=if st then x|||1 else x let u:=b+L+190 if ok&&u<=253 then YZ neg u x' else Yat neg x' e L 1 lemma Zjn (a b:UInt64) (h:a≠0):(Yj a)˥=a˥؈/\a˥؈<=63/\∀ g:Bool,2^63<=(if g then ((a<<<(63-Yj a))|||((b>>>Yj a)>>>1))|||1 else (a<<<(63-Yj a))|||((b>>>Yj a)>>>1))˥:=by have d:a˥≠0:=λ e=>h (ε.mp (by rw[e];rfl)) have f:a˥؈<=63:=by have:=(ϭ d).mpr a۾;omega exact⟨Zj a h,f,ZaP a b (Yj a) _ (Zj a h) f ϐ (ϑ d)⟩ lemma Zcf (a:Bool) (b d:UInt64) (e:Int) (f:Bool) (B:UInt64) (g:b≠0) (j:Y0 e f B):YaR a b d e f B=Yag a b d e:=by obtain⟨k,p,l⟩:=Zjn b d g;generalize b˥؈=K at k p;unfold YaR Yag Yat;dsimp only;generalize Yj b=L at k l ⊢;split . rename_i h;simp at h;obtain⟨q,n⟩:=h;have r:(L+190)˥=K+190:=by rw[δ,k];simp;omega rw[Bj]at n ⊢;have o:(B+(L+190))˥<=253:=by have:=σ.mp n;simpa using this have s:=j _ (by rw[r];omega) q o;exact ZaI a _ _ _ (l _) (by rw[s];push_cast;omega) o . rfl @[inline] def YaS (neg:Bool) (m2 m1 m0:UInt64) (e:Int) (ok:Bool) (b:UInt64):UInt32 := let L:=Yj m2 let x:=(m2<<<(63-L))|||((m1>>>L)>>>1) let st:=(m1<<<(63-L)) != 0||m0 != 0 let x':=if st then x|||1 else x let u:=b+L+254 if ok&&u<=253 then YZ neg u x' else Yat neg x' e L 65 lemma Zcg (a:Bool) (b d f:UInt64) (e:Int) (g:Bool) (B:UInt64) (j:b≠0) (k:Y0 e g B):YaS a b d f e g B=Yaf a b d f e:=by obtain⟨l,q,n⟩:=Zjn b d j;generalize b˥؈=K at l q;unfold YaS Yaf Yat;dsimp only;generalize Yj b=L at l n ⊢;split . rename_i h;simp at h;obtain⟨r,o⟩:=h;have s:(L+254)˥=K+254:=by rw[δ,l];simp;omega rw[Bj]at o ⊢;have p:(B+(L+254))˥<=253:=by have:=σ.mp o;simpa using this have t:=k _ (by rw[s];omega) r p;exact ZaI a _ _ _ (n _) (by rw[t];push_cast;omega) p . rfl @[inline] def Yaz (neg:Bool) (m2 m1 m0:UInt64) (e:Int) (ok:Bool) (b:UInt64):UInt32 := if m2 != 0 then YaS neg m2 m1 m0 e ok b else if m1 != 0 then YaR neg m1 m0 e ok b else Yau neg m0 e ok b lemma ZaQ (a:Bool) (d b f:UInt64) (e:Int) (g:Bool) (B:UInt64) (k:d˥*2^128+b˥*2^64+f˥≠0) (j:Y0 e g B) : Yaz a d b f e g B=Yay a d b f e:=by unfold Yaz Yay;by_cases l:d=0 . subst l;by_cases n:b=0 . subst n;exact ZaK a f e g B (λ h=>k (by rw[h];rfl)) j . simp only[show(b != 0)=true by simpa using n,ite_true];exact Zcf a b f e g B n j . simp only[show(d != 0)=true by simpa using l,ite_true];exact Zcg a d b f e g B l j @[inline] def YaT (w2 w1 w0:UInt64) (e:Int) (negZero ok:Bool) (B:UInt64):UInt32 := if w2=0/\w1=0/\w0=0 then (if negZero then 0x80000000 else 0) else if w2>>>63 != 0 then Yaz true (Yax w2 w1 w0) (Yaw w1 w0) (Yav w0) e ok B else Yaz false w2 w1 w0 e ok B lemma Zch (a b d:UInt64) (e:Int) (f g:Bool) (B:UInt64) (h:Y0 e g B):YaT a b d e f g B=finishWord (YC a b d) e f:=by have u:=a۾;have v:=b۾;have w:=d۾;have q:a˥*2^128+b˥*2^64+d˥<2^192:=by have:b˥*2^64+d˥<2^128:=by calc b˥*2^64+d˥>>63)˥=a˥/2^63:=by rw[τ,ν];rfl unfold YaT finishWord;by_cases l:a=0/\b=0/\d=0 . obtain⟨x,y,z⟩:=l;subst x y z;simp[YC] have k:a˥*2^128+b˥*2^64+d˥≠0:=by intro n;apply l;obtain⟨A,C⟩:=Bo.mp n;obtain⟨D,E⟩:=Bo.mp A;have F:a˥=0:=(ϛ.mp D).resolve_right (Ϣ.mp (θ _));have G:b˥=0:=(ϛ.mp E).resolve_right (Ϣ.mp (θ _));exact⟨ε.mp (by rw[F];rfl),ε.mp (by rw[G];rfl),ε.mp (by rw[C];rfl)⟩ simp only[l,ite_false];generalize j:a˥*2^128+b˥*2^64+d˥=N at q k;by_cases r:a˥<2^63 . have o:YC a b d=(N:Int):=by unfold YC;rw[j];simp only[r,ite_true,Int.sub_zero] have n:(a>>>63 != 0)=false:=by simp;apply ε.mp;simp;omega have p:YC a b d≠0:=by omega simp only[n,η,ite_false,p];rw[<- Ah,ZaQ false a b d e _ _ (by rw[j];exact k) h,ZaO false a b d e (by rw[j];exact k),j] unfold ofIntDyadic;rw[o,BC,decide_eq_false (Int.not_lt.mpr (Int.natCast_nonneg N))] . have o:YC a b d=(N:Int)-2^192:=by unfold YC;rw[j];simp only[r,ite_false] have H:(a>>>63 != 0)=true:=by simp;intro e;have:=congrArg ϟ e;simp at this;omega have I:(N:Int)-2^192 = -((2^192-N:Nat):Int):=by omega have p:YC a b d≠0:=by omega have s:=Zcc a b d (by rw[j];exact k);rw[j]at s;have t:(Yax a b d)˥*2^128+(Yaw b d)˥*2^64+(Yav d)˥≠0:=by omega simp only[H,ite_true,p,ite_false];rw[<- Ah,ZaQ true _ _ _ e _ _ t h,ZaO true _ _ _ e t,s];unfold ofIntDyadic;rw[o,I,Int.natAbs_neg,BC,decide_eq_true (Int.neg_neg_of_pos (Int.natCast_pos.mpr (Nat.sub_pos_of_lt q)))] @[inline] def YauT (neg:Bool) (m:UInt64) (e:Unit -> Int) (ok:Bool) (b:UInt64):UInt32 := let L:=Yj m let u:=b+L+126 if ok&&u<=253 then YZ neg u (m<<<(63-L)) else Ybn neg m (e ()) @[inline] def YaRT (neg:Bool) (m1 m0:UInt64) (e:Unit -> Int) (ok:Bool) (b:UInt64):UInt32 := let L:=Yj m1 let x:=(m1<<<(63-L))|||((m0>>>L)>>>1) let st:=(m0<<<(63-L)) != 0 let x':=if st then x|||1 else x let u:=b+L+190 if ok&&u<=253 then YZ neg u x' else Yat neg x' (e ()) L 1 @[inline] def YaST (neg:Bool) (m2 m1 m0:UInt64) (e:Unit -> Int) (ok:Bool) (b:UInt64):UInt32 := let L:=Yj m2 let x:=(m2<<<(63-L))|||((m1>>>L)>>>1) let st:=(m1<<<(63-L)) != 0||m0 != 0 let x':=if st then x|||1 else x let u:=b+L+254 if ok&&u<=253 then YZ neg u x' else Yat neg x' (e ()) L 65 @[inline] def YazT (neg:Bool) (m2 m1 m0:UInt64) (e:Unit -> Int) (ok:Bool) (b:UInt64):UInt32 := if m2 != 0 then YaST neg m2 m1 m0 e ok b else if m1 != 0 then YaRT neg m1 m0 e ok b else YauT neg m0 e ok b @[inline] def YaTT (w2 w1 w0:UInt64) (e:Unit -> Int) (negZero ok:Bool) (B:UInt64):UInt32 := if w2=0/\w1=0/\w0=0 then (if negZero then 0x80000000 else 0) else if w2>>>63 != 0 then YazT true (Yax w2 w1 w0) (Yaw w1 w0) (Yav w0) e ok B else YazT false w2 w1 w0 e ok B @[inline] def YaPT (w:UInt64) (e:Unit -> Int) (negZero ok:Bool) (B:UInt64):UInt32 := if w=0 then (if negZero then 0x80000000 else 0) else let neg:=w>>>63 != 0 YauT neg (if neg then 0-w else w) e ok B lemma YaTTe (a b d:UInt64) (e:Int) (f g:Bool) (B:UInt64):YaTT a b d (λ _=>e) f g B=YaT a b d e f g B:=rfl lemma YaPTe (w:UInt64) (e:Int) (a b:Bool) (B:UInt64):YaPT w (λ _=>e) a b B=YaP w e a b B:=rfl def Ybo (w2 w1 w0:UInt64) (e:Int) (negZero:Bool):UInt32 := YaT w2 w1 w0 e negZero ((Aw e).toInt==e) (Aw e).toUInt64 lemma Zci (b d f:UInt64) (e:Int) (a:Bool):Ybo b d f e a=finishWord (YC b d f) e a := Zch b d f e a _ _ (ZaJ e) @[inline] def Yf (w:UInt32):UInt64 := if expOf w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 @[inline] def Yd (w:UInt32):UInt64 := if expOf w=0 then 0 else (expOf w).toUInt64-1 lemma Zk (w:UInt32):(Yf w)˥=mantOf w:=by have:=fracOf_toNat_lt w;unfold Yf mantOf;split_ifs . simp . simp only[δ];show((fracOf w)؆+8388608)%2^64=2^23+(fracOf w)؆;omega lemma Zf (w:UInt32):(Yd w)˥=idxOf w:=by unfold Yd idxOf;split_ifs with h . rfl . have b:1<=(expOf w)؆:=by rcases ϗ (expOf w)؆ with a | a . exact absurd (φ.mp (by simpa using a)) h . exact a rw[ξ _ _ (by rw[σ];simp;omega)];simp lemma Zc (a b:USize) (h:a܅+b܅<ϲ):(a+b)܅=a܅+b܅:=by exact γ h lemma Zaa (A:Array Word) (a n k:USize) (b:a܅+n܅<=A.size) (d:a܅+n܅<ϲ) (h:k>>1)>>>(63-r))˥=m˥/2^(64-r˥):=by rw[τ,τ,Zcj r a,ν,ν,γ (show 63-r˥<64 by omega),show(1:UInt64)˥%64=1 from rfl,ϩ,<- ρ] congr 2;omega lemma ZaU (m r:Nat) (a:r<64):m*2^r%2^64+m/2^(64-r)*2^64=m*2^r:=by have h:m*2^r/2^64=m/2^(64-r):=by rw[show(2:Nat)^64=2^r*2^(64-r) by rw[<- ρ];congr 1;omega,<- ϩ,Nat.mul_div_cancel _ (θ r)] rw[<- h];exact Nat.mod_add_div' _ _ lemma Zck (m s:UInt64) (a:s˥<64):((m>>>1)>>>(63-(s&&&63)))˥*2^64+(m<<<(s&&&63))˥ =m˥*2^s˥:=by have b:(s&&&63)˥=s˥:=by rw[ZaR];exact γ a rw[ZaS _ _ (by omega),ZaT _ _ (by omega),b] have Zh:=ZaU m˥ s˥ a;omega lemma Zcl (m s:UInt64) (a:64<=s˥) (b:s˥<128):((m>>>1)>>>(63-(s&&&63)))˥*2^128+(m<<<(s&&&63))˥*2^64 =m˥*2^s˥:=by have d:(s&&&63)˥=s˥-64:=by rw[ZaR];omega rw[ZaS _ _ (by omega),ZaT _ _ (by omega),d] have Zh:=ZaU m˥ (s˥-64) (by omega) have e:m˥*2^s˥=m˥*2^(s˥-64)*2^64:=by rw[ϒ,<- ρ];congr 2;omega omega lemma Zcm (m s:UInt64) (a:s˥<128):(if s<64 then (0:UInt64) else (m>>>1)>>>(63-(s&&&63)))˥*2^128 + (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˥*2^64 + (if s<64 then m<<<(s&&&63) else 0)˥=m˥*2^s˥:=by by_cases h:s<64 . rw[if_pos h,if_pos h,if_pos h,Ψ,Λ,ι];exact Zck m s (ς.mp h) . rw[if_neg h,if_neg h,if_neg h,Ψ,ϯ];exact Zcl m s (by have:=ς.not.mp h;simp at this;omega) a lemma Zab (y a:UInt64) (h:a˥<=1):(y^^^(0-a))˥=if a˥=1 then 2^64-1-y˥ else y˥:=by rcases AC.mp h with b | d . have:a=0:=ε.mp (by simpa using b);subst this;simp . have:a=1:=ε.mp (by simpa using d) subst this;show(y.toBitVec^^^BitVec.allOnes 64).toNat=_;rw[BitVec.xor_allOnes,BitVec.toNat_not];simp lemma ZJ (a b:UInt64):(a+b)˥=(a˥+b˥)%2^64 /\ (if a+bomega lemma Zcq (a b d:UInt64):((a|||b|||d)==0)=decide (d˥*2^128+b˥*2^64+a˥=0):=by have e:a=0↔a˥=0:=by rw[<- ε];simp have f:b=0↔b˥=0:=by rw[<- ε];simp have g:d=0↔d˥=0:=by rw[<- ε];simp rw[ϊ,beq_iff_eq,decide_eq_true_iff,Ci,Ci,e,f,g];omega lemma Zcr (a b:UInt32):((a^^^b)>>>31)،˥=if ψ (signOf a) (signOf b) then 1 else 0:=by have n:a؆<2^32:=Ν a;have o:b؆<2^32:=Ν b;have g:signOf a=decide (a؆/2^31=1):=by unfold signOf;have j:(a؆&&&2^31)%2^31=0:=by rw[Cp,Df,Dg] have k:(a؆&&&2^31)/2^31=a؆/2^31%2:=by rw[Cq,CD (θ 31),Cw] have d:(a&&&0x80000000)؆=a؆&&&2^31:=by simp have e:(a&&&0x80000000 != 0)=decide ((a&&&0x80000000)؆≠0):=by rw[ϊ,bne_iff_ne,decide_eq_true_iff,ne_eq,ne_eq,<- φ];simp rw[e,d,ϊ,decide_eq_true_iff,decide_eq_true_iff];omega have l:signOf b=decide (b؆/2^31=1):=by unfold signOf;have j:(b؆&&&2^31)%2^31=0:=by rw[Cp,Df,Dg] have k:(b؆&&&2^31)/2^31=b؆/2^31%2:=by rw[Cq,CD (θ 31),Cw] have d:(b&&&0x80000000)؆=b؆&&&2^31:=by simp have e:(b&&&0x80000000 != 0)=decide ((b&&&0x80000000)؆≠0):=by rw[ϊ,bne_iff_ne,decide_eq_true_iff,ne_eq,ne_eq,<- φ];simp rw[e,d,ϊ,decide_eq_true_iff,decide_eq_true_iff];omega rw[Γ,Ϙ,UInt32.toNat_xor,show(31:UInt32)؆%32=31 from rfl,Nat.shiftRight_xor_distrib,ν,ν,g,l] have:a؆/2^31<=1:=by omega have:b؆/2^31<=1:=by omega rcases AC.mp ‹a.toNat/2^31<=1› with h | h<;>rcases AC.mp ‹b.toNat/2^31<=1› with f | f <;> rw[h,f]<;>decide @[inline] def YL {β:Type} (lo:UInt64) (a b:UInt32) (w2 w1 w0 c:UInt64) (kont:UInt64 -> UInt64 -> UInt64 -> UInt64 -> β):β := let m:=Yf a*Yf b let s:=Yd a+Yd b-lo let rr:=s&&&63 let x0:=m<<>>1)>>>(63-rr) let lowq:=s<64 let y0:=if lowq then x0 else 0 let y1:=if lowq then x1 else x0 let y2:=if lowq then 0 else x1 let ng:=((a^^^b)>>>31).toUInt64 let mk:UInt64:=0-ng let s0:=w0+(y0^^^mk) let k0:UInt64:=if s0>>1)>>>(63-(s&&&63)))˥*2^128 + (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˥*2^64 + (if s<64 then m<<<(s&&&63) else 0)˥=0:=by have b:m=0:=ε.mp (by simpa using a);subst b;split_ifs<;>simp<;>rfl lemma Zg (w:UInt32):idxOf w<=254:=by have:=expOf_toNat_lt w;unfold idxOf;split_ifs<;>omega lemma ZK (a b:UInt32):mantOf a*mantOf b<2^48:=calc mantOf a*mantOf b<2^24*2^24:=CG (mantOf_lt_24 a) (mantOf_lt_24 b) lemma Zr {β:Type} (d:UInt64) (a b:UInt32) (f g h c:UInt64) (e:UInt64 -> UInt64 -> UInt64 -> UInt64 -> β) (k:c˥+1<2^64) (j:mantOf a*mantOf b≠0 -> d˥<=idxOf a+idxOf b/\idxOf a+idxOf b>>31)،=l at p ⊢ . rw[δ];have:l˥<=1:=by rw[p];split_ifs<;>omega -splitDisjunctions omega -splitDisjunctions · have n:(if s<64 then (0:UInt64) else (m>>>1)>>>(63-(s&&&63)))˥*2^128+(if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))˥*2^64 + (if s<64 then m<<<(s&&&63) else 0)˥=mantOf a*mantOf b*2^(idxOf a+idxOf b-d˥):=by by_cases r:mantOf a*mantOf b=0 . rw[r,Λ];exact Zcs m s (by rw[q,r]) . obtain⟨I,J⟩:=j r;have B:s˥=idxOf a+idxOf b-d˥:=by rw[<- A,ξ _ _ (by rw[σ,δ,Zf,Zf];have:=Zg a;have:=Zg b;omega -splitDisjunctions), δ,Zf,Zf] have:=Zg a;have:=Zg b;rw[γ (by omega -splitDisjunctions)] rw[<- q,<- B];exact Zcm m s (by omega) generalize (if s<64 then (0:UInt64) else (m>>>1)>>>(63-(s&&&63)))=t at n ⊢;generalize (if s<64 then (m>>>1)>>>(63-(s&&&63)) else m<<<(s&&&63))=u at n ⊢;generalize (if s<64 then m<<<(s&&&63) else 0)=v at n ⊢;have w:l˥<=1:=by grind have C:=Zab t l w;have D:=Zab u l w;have E:=Zab v l w;have K:t˥<2^64:=Κ t;have L:u˥<2^64:=Κ u;have M:v˥<2^64:=Κ v;unfold Yx;rw[Zcn,δ,γ (a:=c˥+l˥) (by omega -splitDisjunctions),<- Zn] generalize F:mantOf a*mantOf b*2^(idxOf a+idxOf b-d˥)=P at n;have G:(if ψ (signOf a) (signOf b) then -((mantOf a*mantOf b:Nat):Int) else ((mantOf a*mantOf b:Nat):Int))*2^(idxOf a+idxOf b-d˥) = if ψ (signOf a) (signOf b) then -(P:Int) else (P:Int):=by rw[<- F];split_ifs<;>push_cast<;>ring rw[G];split_ifs at p C D E ⊢ with N O<;>omega @[inline] def YD (w2 w1 w0 c:UInt64) (e:Int):UInt64 := let t0:=w0+c let k0:UInt64:=if t0>>23).toNat def YM (a:UInt32):Nat:=((a&&&0x7FFFFFFF)>>>23).toNat lemma Zct (a:UInt32):(a&&&0x7FFFFFFF)؆=(expOf a)؆*2^23+(fracOf a)؆:=by simp only[ϣ,expOf,fracOf,Ϙ];rw[show(0x7FFFFFFF:UInt32)؆=2^31-1 from rfl,show(0xFF:UInt32)؆=2^8-1 from rfl,show(0x7FFFFF:UInt32)؆=2^23-1 from rfl,show(23:UInt32)؆%32=23 from rfl,Θ,Θ,Θ,ν] omega lemma Zb (a:UInt32):YR a<=511/\YM a<=255/\(YM a<255 -> expOf a≠255) /\ (mantOf a≠0 -> YR a<=idxOf a+1/\idxOf a+1<=max (YM a) 1):=by have e:=expOf_toNat_lt a;have f:=fracOf_toNat_lt a;unfold YR YM ExactRuntime.mantOf ExactRuntime.idxOf;simp only[Ϙ,UInt32.toNat_sub,UInt32.reduceToNat,BI,ν,Zct,ne_eq,<-φ];rw[Δ _ (fracOf a)؆,Ι _ _ (θ _),Α f,ι];generalize (ExactRuntime.expOf a)؆=E at*;generalize (fracOf a)؆=F at*;have K:(2^32-1+(F+E*2^23))%2^32/2^23<=E∨E=0∧F=0:=(by omega);refine⟨Nat.le_of_lt_succ (ϳ (Ζ _ (by decide))),Nat.le_of_lt_succ e,Nat.ne_of_lt,λ d=>?_⟩;by_cases b:E=0 . rw[if_pos b]at d⊢;exact⟨(K.resolve_right λ h=>d h.2).trans (Nat.le_succ_of_le b.le),Nat.le_max_right _ _⟩ . rw[if_neg b]at d⊢;rw[Nat.sub_add_cancel (Χ b)];exact⟨K.resolve_right λ h=>b h.1,Nat.le_max_left _ _⟩ def Yah (A:Array Word) (base n:USize) (hA:base.toNat+n.toNat<=A.size) (hs:base.toNat+n.toNat<ϲ) (lo hi:UInt32) (k:USize):UInt32 := if h:k>>23 let kh:=v>>>23 Yah A base n hA hs (if kl t L<=YR A[a܅+t]! /\ YM A[a܅+t]! <= H:=by generalize C:n܅-k܅=d;induction d generalizing k b e with | zero => have p:¬ kby omega⟩ rw[UInt32.toNat_add,BV,show(16:UInt32)؆%32=16 from rfl,ο] have:b؆*2^16<2^32:=by omega omega | succ d s => have p:k>>23)؆=YR w:=rfl;have F:((w&&&0x7FFFFFFF)>>>23)؆=YM w:=rfl;obtain⟨G,I,-,-⟩:=Zb w;obtain⟨L,H,q,r,v,J,K,x⟩:=s (if ((w&&&0x7FFFFFFF)-1)>>>23>>23 else b) (if e < (w&&&0x7FFFFFFF)>>>23 then (w&&&0x7FFFFFFF)>>>23 else e) (k+1) (by omega) (by split_ifs<;>omega) (by split_ifs<;>omega) (by omega) have M:(if ((w&&&0x7FFFFFFF)-1)>>>23>>23 else b)؆<=b؆/\(if ((w&&&0x7FFFFFFF)-1)>>>23>>23 else b)؆<=YR w:=by split_ifs with o . rw[Ϡ]at o;omega . rw[Ϡ]at o;omega have N:e؆<=(if e < (w&&&0x7FFFFFFF)>>>23 then (w&&&0x7FFFFFFF)>>>23 else e)؆/\YM w<=(if e < (w&&&0x7FFFFFFF)>>>23 then (w&&&0x7FFFFFFF)>>>23 else e)؆:=by split_ifs with o . rw[Ϡ]at o;omega . rw[Ϡ]at o;omega refine⟨L,H,q,r,v,by omega,by omega,λ t O y=>?_⟩;rcases Ϩ t (k܅+1) with z | z . have B:t=k܅:=by omega subst B;rw[u];omega . exact x t (by omega) y lemma ZL (a b:UInt32) (d:Nat) (h:mantOf a*mantOf b≠0 -> d<=idxOf a+idxOf b/\idxOf a+idxOf b<=d+122) : -(2^170:Int)<=sv a*sv b*2^(idxOf a+idxOf b-d) /\ sv a*sv b*2^(idxOf a+idxOf b-d)<=2^170:=by rw[<- Zn];have g:=ZK a b;by_cases e:mantOf a*mantOf b=0 . rw[e];split_ifs<;>simp . obtain⟨j,k⟩:=h e;have f:2^(idxOf a+idxOf b-d)<=2^122:=κ (by norm_num) (by omega);have l:mantOf a*mantOf b*2^(idxOf a+idxOf b-d)<=2^170:=calc mantOf a*mantOf b*2^(idxOf a+idxOf b-d)<=2^48*2^122:=AG (by omega) f _=2^170:=by norm_num have Zh:((mantOf a*mantOf b:Nat):Int)*2^(idxOf a+idxOf b-d)=((mantOf a*mantOf b*2^(idxOf a+idxOf b-d):Nat):Int):=by push_cast;ring split_ifs . rw[neg_mul,Zh];omega . rw[Zh];omega lemma ZW (a b:Nat -> UInt32):∀ r k,Yo a b k (r+1)=Yo a b k r+sv (a (k+r))*sv (b (k+r))*2^(idxOf (a (k+r))+idxOf (b (k+r))):=by intro r;induction r with | zero=>intro k;simp[Yo] | succ r d=>intro k;rw[Yo,d (k+1),Yo,show k+1+r=k+(r+1) by omega];ring lemma ZA (a b:UInt32) (d:Nat) (h:mantOf a*mantOf b≠0 -> d<=idxOf a+idxOf b):sv a*sv b*2^(idxOf a+idxOf b)=2^d*(sv a*sv b*2^(idxOf a+idxOf b-d)):=by by_cases e:mantOf a*mantOf b=0 . have:sv a*sv b=0:=by rw[<- Zn,e];split_ifs<;>simp rw[this];ring rw[show idxOf a+idxOf b=d+(idxOf a+idxOf b-d) by omega,pow_add];rw[show d+(idxOf a+idxOf b-d)-d=idxOf a+idxOf b-d by omega];ring @[inline] def Yc (A:Array Word) (inW i:Nat):UInt32 := if h:i*inW+inW<=A.size/\i*inW+inW<=4294967295 then Yah A (i*inW).toUSize inW.toUSize (by rw [Za _ (by omega),Za _ (by omega)];exact h.1) (by rw [Za _ (by omega),Za _ (by omega)];have:=π;omega) 511 0 0 else 0x01FF00FF @[inline] def Yk (k:UInt32):UInt64:=(if k=0 then 0 else k-1).toUInt64 @[inline] def Yp (bx bv bw:UInt32):UInt64 := let lo0:=Yk (bx>>>16)+Yk (bv>>>16) let xb:=Yd oneW+Yd bw if !(Yf bw==0)&&xb Nat -> Word) (ch j:Nat) (acc:Array Word):Array Word := if j Nat -> Word) (ch:Nat) (acc:Array Word):Array Word := if ch Nat -> Word):Array Word:=Yak c hw f 0 (Aj (c*hw)) lemma Zcy (a:Nat) (f:Nat -> Nat -> Word) (b:Nat):∀ k j (d:Array Word),a-j=k -> (Yaj a f b j d)׆=d׆++(Av j (a-j)).map (f b):=by intro k;induction k with | zero=>intro j d h;unfold Yaj;rw[if_neg (by omega)];simp[h] | succ k e=> intro j d h;unfold Yaj;rw[if_pos (by omega),e (j+1) _ (by omega),show a-j=(a-(j+1))+1 by omega,AA];simp lemma Zcz (c a:Nat) (f:Nat -> Nat -> Word):∀ k b (d:Array Word),c-b=k -> (Yak c a f b d)׆=d׆++(Av (b*a) ((c-b)*a)).map (λ i=>f (i/a) (i%a)):=by intro k;induction k with | zero=>intro b d h;unfold Yak;rw[if_neg (by omega)];simp[h] | succ k e=> intro b d h;unfold Yak;rw[if_pos (by omega),e (b+1) _ (by omega),Zcy a f b _ 0 _ rfl,show(c-b)*a=a+(c-(b+1))*a by rw[show c-b=(c-(b+1))+1 by omega,Η,Ξ,Δ],<- List.range'_append,List.map_append,Bq] simp only[AP,Bf];congr 2 . rw[show Av (b*a) a=(Av 0 a).map (b*a+·) by rw[Ct];simp,Di];apply List.map_congr_left;intro j g;rw[List.mem_range'_1]at g;simp only[Function.comp_def,Δ (b*a) j,Ι _ _ (show 0 Nat -> Word):YT c a f=Aa (n:=N) λ i=>f (i؞/a) (i؞%a):=by subst b;apply BB;rw[YT,Zcz c a f _ 0 _ rfl];apply Ap<;>simp lemma Zq (k:UInt32):(Yk k)˥=k؆-1:=by unfold Yk;split_ifs with h . subst h;rfl . rw[Γ,Bi _ _ (by rw[ϡ];have:k؆≠0:=λ a=>h (φ.mp (by simpa using a));show 1<=k؆;omega)] rfl lemma ZM (a:UInt32):(Yd oneW+Yd a)˥=idxOf oneW+idxOf a:=by rw[δ,Zf,Zf];have:=Zg oneW;have:=Zg a;exact γ (by omega) lemma Zad (b d a:UInt32):(Yp b d a)˥<=((b>>>16)؆-1)+((d>>>16)؆-1) /\ (mantOf a≠0 -> (Yp b d a)˥<=idxOf oneW+idxOf a):=by have h:(Yk (b>>>16)+Yk (d>>>16))˥=((b>>>16)؆-1)+((d>>>16)؆-1):=by rw[δ,Zq,Zq];have:(b>>>16)؆<2^32:=Ν _;have:(d>>>16)؆<2^32:=Ν _;exact γ (by omega) have j:=ZM a;have f:(Yf a==0)=decide (mantOf a=0):=by rw[ϊ,beq_iff_eq,decide_eq_true_iff,<- Zk,<- ε];rfl unfold Yp;dsimp only;rw[f];split_ifs with e . simp only[Ε,AD,decide_eq_false_iff_not,decide_eq_true_eq,ς]at e;omega . simp only[Ε,AD,decide_eq_false_iff_not,decide_eq_true_eq,ς,not_and,not_lt]at e;constructor . omega . intro g;have:=e g;omega lemma Zae (b d a:UInt32):((b&&&0xFFFF)؆-1)+((d&&&0xFFFF)؆-1)<=(Yu b d a)˥ /\ (mantOf a≠0 -> idxOf oneW+idxOf a<=(Yu b d a)˥):=by have h:(Yk (b&&&0xFFFF)+Yk (d&&&0xFFFF))˥=((b&&&0xFFFF)؆-1)+((d&&&0xFFFF)؆-1):=by rw[δ,Zq,Zq];have:(b&&&0xFFFF)؆<2^32:=Ν _;have:(d&&&0xFFFF)؆<2^32:=Ν _;exact γ (by omega) have j:=ZM a;have f:(Yf a==0)=decide (mantOf a=0):=by rw[ϊ,beq_iff_eq,decide_eq_true_iff,<- Zk,<- ε];rfl unfold Yu;dsimp only;rw[f];split_ifs with e . simp only[Ε,AD,decide_eq_false_iff_not,decide_eq_true_eq,ς]at e;omega . simp only[Ε,AD,decide_eq_false_iff_not,decide_eq_true_eq,ς,not_and,not_lt]at e;constructor . omega . intro g;have:=e g;omega lemma Zo (a:UInt32) (L H:Nat) (h:a؆=L*2^16+H) (b:H<2^16):(a>>>16)؆=L/\(a&&&0xFFFF)؆=H:=by constructor . rw[Ϙ,show(16:UInt32)؆%32=16 from rfl,ν,h];omega . rw[ϣ,show(0xFFFF:UInt32)؆=2^16-1 from rfl,Θ,h];omega lemma Zp (A:Array Word) (a i:Nat) (b:i*a+a<=A.size) (d:i*a+a<=4294967295) : ∃ L H:Nat,(Yc A a i)؆=L*2^16+H/\L<=511/\H<=255 /\ ∀ t,t < a -> L<=YR A[i*a+t]! /\ YM A[i*a+t]! <= H:=by have f:(i*a)؛܅=i*a:=Za _ (by omega);have g:a؛܅=a:=Za _ (by omega);unfold Yc;rw[dif_pos ⟨b,by omega⟩];obtain⟨L,H,e,h,j,-,-,k⟩:=Zcu A (i*a)؛ a؛ (by rw[f,g];exact b) (by rw[f,g];have:=π;omega) 511 0 0 (by simp) (by decide) (by decide) refine⟨L,H,e,h,j,λ t l=>?_⟩;have:=k t (by simp) (by rw[g];exact l);rwa[f]at this lemma Zfw (S:Int) (a:UInt64) (c:Bool) (b D:Word) (d:b=D) (e:D=finishWord (S*2^a˥) (-298) c) : (if (if S=0 then 4294967296 else (finishWord S ((a˥:Int)-298) false)،)<4294967296 then (if S=0 then 4294967296 else (finishWord S ((a˥:Int)-298) false)،)؍ else b)=D:=by by_cases f:S=0 . rw[if_pos f,if_neg (by decide),d] . rw[if_neg f];have g:(finishWord S ((a˥:Int)-298) false)،<4294967296:=by rw[ς];simpa using Ν (finishWord S ((a˥:Int)-298) false) rw[if_pos g,e,<- finishWord_scale];have h:(finishWord S ((a˥:Int)-298) false)،؍=finishWord S ((a˥:Int)-298) false:=by apply φ.mp;simp rw[h];unfold finishWord;rw[if_neg f,if_neg f,show(-298:Int)+(a˥:Int)=(a˥:Int)-298 by ring] lemma Zh5 (u p:UInt64) (b:¬u122):p˥<=u˥/\u˥-p˥<=122:=by rw[ς]at b;have d:p˥<=u˥:=by omega rw[gt_iff_lt,ς,ξ _ _ (σ.mpr d)]at a;exact⟨d,Dp.mp a⟩ lemma ZaV (x y:AY) (h:(Ar x y).significand=0) : (Ar x y).negative=(x.negative&&y.negative):=by unfold Ar CQ Cy at h ⊢;dsimp only at h ⊢;split_ifs at h ⊢<;>simp_all lemma ZaW (d:AY) (h:d.significand=0):AO Fmt d=Bv Fmt d.negative:=by rw[Model.roundDyadic_eq_roundDyadicImpl];unfold Model.roundDyadicImpl;rw[if_pos (by decide)];unfold Model.ieeeRoundDyadicImpl;rw[if_pos (by simp[h])];cases d.negative<;>rfl lemma ZN (k:Nat):(2:ℚ)^((k:ℤ)-149)=2^k*2^(-149:ℤ):=by rw[sub_eq_add_neg,zpow_add₀ two_ne_zero,zpow_natCast] lemma Zag:(2:ℚ)^(-149:ℤ)*2^(-149:ℤ)=2^(-298:ℤ):=by rw[<- zpow_add₀ two_ne_zero];norm_num lemma ZcD (a b:Word) (d:expOf a≠255) (e:expOf b≠255):toWord (Bs (ofW a) (ofW b))=finishWord (sv a*2^idxOf a+sv b*2^idxOf b) (-149) (signOf a&&signOf b):=by rw[Model.Proof.add_eq_spec];simp only[Model.Spec.add,ofW,toDyadic_ofUInt32 a d,toDyadic_ofUInt32 b e];have h:(Ar (decodeD a) (decodeD b)).toRat=((sv a*2^idxOf a+sv b*2^idxOf b:Int):ℚ)*2^(-149:ℤ):=by rw[Ar,AZ,decodeD_toRat,decodeD_toRat,ZN,ZN];push_cast;ring by_cases f:sv a*2^idxOf a+sv b*2^idxOf b=0 . have g:(Ar (decodeD a) (decodeD b)).significand=0:=by simp_all rw[ZaW _ g,ZaV _ _ g,decodeD_negative,decodeD_negative,f,finishWord_zero] . exact(finishWord_of_ne _ _ _ _ f h).symm lemma ZaX (x y z:Word) (a:expOf x≠255) (b:expOf y≠255) (d:expOf z≠255):toWord (Cn (ofW x) (ofW y) (ofW z))=finishWord (sv x*sv y*2^(idxOf x+idxOf y)+sv z*2^(idxOf z+149)) (-298) (ψ (signOf x) (signOf y)&&signOf z):=by rw[Model.Proof.fma_eq_spec];have e:=toDyadic_ofUInt32 x a;have f:=toDyadic_ofUInt32 y b;have g:=toDyadic_ofUInt32 z d;have o:Model.chooseNaN3 (AQ x:Model Fmt) (AQ y) (AQ z)=none := (Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨Ai e,Ai f,Ai g⟩ simp only[Model.Spec.fma,ofW,o,Au e,Au f,Au g, Bool.or_false,η,ite_false,e,f,g] set P:AY := { negative:=ψ (decodeD x).negative (decodeD y).negative significand:=(decodeD x).significand*(decodeD y).significand exponent:=(decodeD x).exponent+(decodeD y).exponent } with h have p:(Ar P (decodeD z)).toRat=((sv x*sv y*2^(idxOf x+idxOf y)+sv z*2^(idxOf z+149):Int):ℚ)*2^(-298:ℤ):=by have j:=Cz (decodeD x) (decodeD y);simp only[CR,CA]at j;rw[Ar,AZ,h,j,decodeD_toRat,decodeD_toRat,decodeD_toRat,ZN,ZN,ZN,<- Zag] have k:(2:ℚ)^(idxOf z+149)*2^(-298:ℤ)=2^idxOf z*2^(-149:ℤ):=by rw[pow_add,<- Zag,mul_assoc];congr 1 norm_num push_cast;rw[<- Zag]at k;linear_combination (sv z:ℚ)*k by_cases l:sv x*sv y*2^(idxOf x+idxOf y)+sv z*2^(idxOf z+149)=0 . have n:(Ar P (decodeD z)).significand=0:=by simp_all rw[ZaW _ n,ZaV _ _ n,h];rw[decodeD_negative,decodeD_negative,decodeD_negative,l,finishWord_zero] . exact(finishWord_of_ne _ _ _ _ l p).symm lemma ZaY (j:Nat) (a:j<=6):expOf (natW (2^j))≠255/\signOf (natW (2^j))=false /\ mantOf (natW (2^j))=2^23/\idxOf (natW (2^j))=126+j:=by interval_cases j<;>decide lemma Zah (w:UInt32):signOf w=decide (2^31<=w؆):=by have a:=w.toNat_lt_size;have h:(w&&&0x80000000)؆=2^31*(w؆/2^31%2):=by rw[ϣ,show(0x80000000:UInt32)؆=2^31 from rfl,Nat.and_two_pow,Be] have b:w؆/2^31%2<2:=Ζ _ (by norm_num);generalize w؆/2^31%2=q at b ⊢;interval_cases q<;>rfl unfold signOf;rw[ϊ];simp;rw[<- φ,h,show(0:UInt32)؆=0 from rfl];simp only[CK]at a;omega lemma ZcE (s:Word) (j:Nat) (b:j<=6) (a:j < (expOf s)؆):(expOf (s-(Υ j<<<23)))؆=(expOf s)؆-j /\ fracOf (s-(Υ j<<<23))=fracOf s /\ signOf (s-(Υ j<<<23))=signOf s:=by rw[ZH]at a;have e:(Υ j<<<23)؆=j*2^23:=by rw[BV,Ϛ,ο,show(23:UInt32)؆%32=23 from rfl,γ (by omega:j<2^32)] exact γ (by omega) have f:Υ j<<<23<=s:=by rw[ϡ,e];omega have d:(s-(Υ j<<<23))؆=s؆-j*2^23:=by simp_all refine⟨?_,?_,?_⟩ . rw[ZH,ZH,d];omega . apply φ.mp;rw[ZR,ZR,d];omega . rw[Zah,Zah,d];simp;omega lemma ZX (w:Word) (a:expOf w≠255):Ay (ofW w)=(sv w:ℝ)*2^((idxOf w:ℤ)-149):=by rw[Model.toReal_eq];simp only[ofW,toDyadic_ofUInt32 w a];rw[<- AX,decodeD_toRat];push_cast;rfl lemma ZcF (s y:Word) (j:Nat) (f:j<=6) (a:expOf s≠255) (b:j < (expOf s)؆) (d:expOf y≠255) (g:signOf y=false) (e:mantOf y=2^23) (k:idxOf y=126+j) : toWord (AT (ofW s) (ofW y))=s-(Υ j<<<23):=by have A:sv y=2^23:=by unfold sv;rw[g,e];rfl have B:Bd (ofW y)=false:=by rw[ofW,Model.isZero_eq_beq_zero_of_toDyadic?_some (toDyadic_ofUInt32 y d),decodeD_sig_zero,e];decide obtain⟨C,D,E⟩:=ZcE s j f b;set r:=s-(Υ j<<<23) with M;have N:=expOf_toNat_lt s;have l:expOf r≠255:=by intro h;have n:=congrArg Dk h;simp at n;have O:(expOf s)؆≠255:=λ F=>a (φ.mp (by simpa using F));omega have q:expOf r≠0:=by intro h;have n:=congrArg Dk h;simp at n;omega have t:expOf s≠0:=by intro h;rw[h]at b;simp at b have G:sv r=sv s:=by unfold sv mantOf;rw[E,D,if_neg q,if_neg t] have H:(idxOf r:ℤ)=(idxOf s:ℤ)-j:=by unfold idxOf;rw[if_neg q,if_neg t,C];omega have o:AR (ofW s)=true:=by simp[ofW,isFinite_ofUInt32,a] have u:AR (ofW y)=true:=by simp[ofW,isFinite_ofUInt32,d] have v:AR (ofW r)=true:=by simp[ofW,isFinite_ofUInt32,l] have w:Bd (ofW y)=false:=B;have x:Ay (ofW y)=2^j:=by rw[ZX _ d,A,k];push_cast;rw[show((126:ℤ)+j-149)=(j:ℤ)+(-23) by ring,zpow_add₀ two_ne_zero,zpow_natCast] field_simp;norm_num have I:Ay (ofW r)=Ay (ofW s)/2^j:=by rw[ZX _ l,ZX _ a,G,H,show((idxOf s:ℤ)-j-149)=((idxOf s:ℤ)-149) + -(j:ℤ) by ring,zpow_add₀ two_ne_zero,zpow_neg,zpow_natCast] field_simp have J : |Ay (ofW s)/Ay (ofW y)| <= Ay (Model.posMaxFinite Fmt):=by rw[x,abs_div,abs_of_pos (by positivity:(0:ℝ)<2^j)] calc |Ay (ofW s)| / 2^j <= |Ay (ofW s)| := div_le_self (abs_nonneg _) (one_le_pow₀ (by norm_num)) _<=_:=Model.abs_toReal_le_posMaxFinite_of_isIEEE_of_isFinite _ (by decide) o have z:AR (AT (ofW s) (ofW y))=true:=Model.isFinite_div_of_abs_div_le_posMaxFinite _ _ (by decide) o u w J have p:=Model.toReal_div_eq_roundAt _ _ (by decide) o u w z;rw[x,<- I,Model.roundAt_toReal_eq _ v]at p;have K:Ay (AT (ofW s) (ofW y))≠0:=by rw[p,ZX _ l];apply mul_ne_zero _ (zpow_ne_zero _ two_ne_zero);have:sv r≠0:=by unfold sv mantOf;split<;>omega exact_mod_cast this have L:=Model.eq_of_toReal_eq_of_nonzero z v p K;rw[L,ZaC] lemma ZcG (s:Word) (j:Nat) (a:j<=6) (b:expOf s≠255) (d:j < (expOf s)؆) : toWord (AT (ofW s) (ofW (natW (2^j))))=s-(Υ j<<<23):=by obtain⟨e,f,g,h⟩:=ZaY j a;exact ZcF s _ j a b d e f g h lemma ZcH (s y:Word) (a:expOf s=0) (b:fracOf s=0) (d:expOf y≠255) (e:signOf y=false) (f:mantOf y≠0) : toWord (AT (ofW s) (ofW y))=s:=by have n:expOf s≠255:=by grind rw[Model.Proof.div_eq_spec];simp only[Model.Spec.div,ofW,toDyadic_ofUInt32 s n,toDyadic_ofUInt32 _ d];have o:decodeD s=⟨signOf s,0,0⟩:=by simp[decodeD,a,b] have p:((decodeD y).significand==0)=false:=by rw[decodeD_sig_zero];simp[f] rw[o,p,decodeD_negative,e];have q:=s.toNat_lt_size;simp only[CK]at q;have j:=ZH s;have k:=ZR s;rw[a]at j;rw[b]at k;simp at j k;have g:=Zah s;cases l:signOf s . rw[l]at g;have:s؆<2^31:=by simpa using g.symm have h:s=0:=φ.mp (by simp;omega) rw[h];rfl . rw[l]at g;have:2^31<=s؆:=by simpa using g.symm have h:s=0x80000000:=φ.mp (by simp;omega) rw[h];rfl lemma ZcI (s:Word) (j:Nat) (a:j<=6) (b:expOf s=0) (d:fracOf s=0) : toWord (AT (ofW s) (ofW (natW (2^j))))=s:=by obtain⟨e,f,g,-⟩:=ZaY j a;exact ZcH s _ b d e f (by rw[g];norm_num) @[inline] def Yl (w:Word):UInt64 := if expOf w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 lemma Zs (w:Word):(Yl w)˥=mantOf w:=by have a:=fracOf_toNat_lt w;unfold Yl mantOf;split . simp . rw[δ,Γ,show(0x800000:UInt64)˥=2^23 from rfl,γ (by omega)] omega lemma ZcJ (m:UInt64) (a:Bool) (b:m˥<2^63):Ym (if a then 0-m else m)=if a then -(m˥:Int) else (m˥:Int):=by cases a . simp only[η,ite_false,Ym];rw[if_pos b];simp . simp only[ite_true,Ym];rw[ω,show(0:UInt64)˥=0 from rfl];by_cases d:m˥=0 . rw[d];norm_num . have e:(2^64-m˥+0)%2^64=2^64-m˥:=by omega omega lemma ZaZ (x y:UInt64) (a : -2^63<=Ym x+Ym y) (b:Ym x+Ym y<2^63):Ym (x+y)=Ym x+Ym y:=by unfold Ym at a b ⊢;rw[δ];split_ifs at a b ⊢<;>omega lemma ZcL (m:UInt64) (d:Nat) (a:d<64) (h:m˥*2^d<2^64):(m<<simp[h] lemma ZY (m:UInt64) (d:Nat) (a:Bool) (b:d<64) (h:m˥*2^d<2^62) : Ym (if a then 0-(m<<simp[De,CC] lemma Zai (w:Word):(if signOf w then -((Yl w)˥:Int) else ((Yl w)˥:Int))=sv w:=by rw[Zs];rfl lemma ZO:sv oneW=2^23/\idxOf oneW=126:=by decide lemma Za0 (a b:Word) (e:Nat) (h:mantOf a*mantOf b≠0 -> e<128) : -2^175constructor<;>linarith lemma ZcN (S e:Int) (a b:Bool) (h:S≠0):finishWord S e a=finishWord S e b:=by simp[finishWord,h] lemma ZcO (a b p q:UInt64):(a≠0 -> (if a=0 then q else if b=0 then p else if p<=q then p else q)<=p) /\ (b≠0 -> (if a=0 then q else if b=0 then p else if p<=q then p else q)<=q):=by grind @[inline] def Yal (a b c d:Word) (nz:Bool) (slow:Unit -> Word):Word := let p:=Yd a+Yd b let q:=Yd c+Yd d let m1:=Yf a*Yf b let m2:=Yf c*Yf d let lo:=if m1=0 then q else if m2=0 then p else if p<=q then p else q if (m1=0\/p-lo<128)/\(m2=0\/q-lo<128) then YL lo a b 0 0 0 0 λ w2 w1 w0 k => YL lo c d w2 w1 w0 k λ v2 v1 v0 k' => let r:=YD v2 v1 v0 k' ((lo.toNat:Int)-298) if r=0x100000000 then (if nz then 0x80000000 else 0) else r.toUInt32 else slow () lemma Za1 (a b c d:Word) (f:Bool) (e:Unit -> Word) (g:e ()=finishWord (sv a*sv b*2^(idxOf a+idxOf b)+sv c*sv d*2^(idxOf c+idxOf d)) (-298) f) : Yal a b c d f e=finishWord (sv a*sv b*2^(idxOf a+idxOf b)+sv c*sv d*2^(idxOf c+idxOf d)) (-298) f:=by unfold Yal;dsimp only;have T:=Zg a;have U:=Zg b;have V:=Zg c;have id:=Zg d;have B:(Yd a+Yd b)˥=idxOf a+idxOf b:=by rw[δ,Zf,Zf,γ (by omega)] have C:(Yd c+Yd d)˥=idxOf c+idxOf d:=by rw[δ,Zf,Zf,γ (by omega)] have I:(Yf a*Yf b)˥=mantOf a*mantOf b:=by rw[Ϭ,Zk,Zk];exact γ (by have:=ZK a b;omega) have J:(Yf c*Yf d)˥=mantOf c*mantOf d:=by rw[Ϭ,Zk,Zk];exact γ (by have:=ZK c d;omega) have K:Yf a*Yf b=0↔mantOf a*mantOf b=0:=by rw[<- I,<- ε];rfl have L:Yf c*Yf d=0↔mantOf c*mantOf d=0:=by rw[<- J,<- ε];rfl obtain⟨L1,L2⟩:=ZcO (Yf a*Yf b) (Yf c*Yf d) (Yd a+Yd b) (Yd c+Yd d) generalize W:(if Yf a*Yf b=0 then Yd c+Yd d else if Yf c*Yf d=0 then Yd a+Yd b else if Yd a+Yd b<=Yd c+Yd d then Yd a+Yd b else Yd c+Yd d)=j at L1 L2 ⊢ split . rename_i D;have F1:mantOf a*mantOf b≠0 -> j˥<=idxOf a+idxOf b/\idxOf a+idxOf bl (K.mp h);have v:=L1 n;have t:Yd a+Yd b-j<128:=by rcases D.1 with h | h . exact absurd h n . exact h rw[σ,B]at v;rw[ς,ξ _ _ (L1 n),B]at t;simp at t;omega have F2:mantOf c*mantOf d≠0 -> j˥<=idxOf c+idxOf d/\idxOf c+idxOf dl (L.mp h);have v:=L2 n;have t:Yd c+Yd d-j<128:=by rcases D.2 with h | h . exact absurd h n . exact h rw[σ,C]at v;rw[ς,ξ _ _ (L2 n),C]at t;simp at t;omega obtain⟨w,x,y,k,z,M,E⟩:=Zr j a b 0 0 0 0 (λ w x y k=>YL j c d w x y k λ o p q s=>let r:=YD o p q s ((j˥:Int)-298);if r=0x100000000 then (if f then (0x80000000:UInt32) else 0) else r؍) (by simp) F1 rw[z];obtain⟨o,p,q,s,A,X,N⟩:=Zr j c d w x y k (λ o p q s=>let r:=YD o p q s ((j˥:Int)-298);if r=0x100000000 then (if f then (0x80000000:UInt32) else 0) else r؍) (by simp at M;omega) F2 rw[A];have F:=Za0 a b (idxOf a+idxOf b-j˥) (λ l=>by omega) have G:=Za0 c d (idxOf c+idxOf d-j˥) (λ l=>by omega) have O:Yx 0 0 0=0:=rfl;rw[O,show(0:UInt64)˥=0 from rfl]at E;have P:((Yx o p q+s˥:Nat):Int)%2^192=(sv a*sv b*2^(idxOf a+idxOf b-j˥)+sv c*sv d*2^(idxOf c+idxOf d-j˥))%2^192:=by rw[N];rw[Ο,E,<- Ο];simp rw[ZV o p q s _ _ (by linarith [F.1,G.1]) (by linarith [F.2,G.2]) P];have H:sv a*sv b*2^(idxOf a+idxOf b)+sv c*sv d*2^(idxOf c+idxOf d)=(sv a*sv b*2^(idxOf a+idxOf b-j˥)+sv c*sv d*2^(idxOf c+idxOf d-j˥))*2^j˥:=by have z:=ZC (sv a*sv b) (idxOf a+idxOf b) j˥ (by by_cases l:mantOf a*mantOf b=0 . left;rw[<- Zn,l];simp . right;exact(F1 l).1) have A:=ZC (sv c*sv d) (idxOf c+idxOf d) j˥ (by by_cases l:mantOf c*mantOf d=0 . left;rw[<- Zn,l];simp . right;exact(F2 l).1) rw[z,A];ring by_cases u:sv a*sv b*2^(idxOf a+idxOf b-j˥)+sv c*sv d*2^(idxOf c+idxOf d-j˥)=0 . rw[if_pos u,if_pos rfl,H,u,zero_mul];cases f<;>rfl . rw[if_neg u];have Q:(finishWord (sv a*sv b*2^(idxOf a+idxOf b-j˥)+sv c*sv d*2^(idxOf c+idxOf d-j˥)) ((j˥:Int)-298) false)، ≠0x100000000:=by intro h;have R:=congrArg ϟ h;have:=Ν (finishWord (sv a*sv b*2^(idxOf a+idxOf b-j˥)+sv c*sv d*2^(idxOf c+idxOf d-j˥)) ((j˥:Int)-298) false) simp only[CK]at this;simp at R;omega rw[if_neg Q,UInt32.toUInt32_toUInt64,H,show((j˥:Int)-298) = -298+(j˥:Int) by ring,finishWord_scale] apply ZcN;intro h;apply u;have S:(2:Int)^j˥≠0:=pow_ne_zero _ two_ne_zero;exact(mul_eq_zero.mp h).resolve_right S . exact g @[inline] def Y1 (ma mb:UInt64) (ia ib:Nat):Nat := if ma=0 then ib else if mb=0 then ia else min ia ib lemma Za2 (a b:UInt64) (d e:Nat):(a=0\/Y1 a b d e<=d)/\(b=0\/Y1 a b d e<=e):=by unfold Y1;refine⟨?_,?_⟩<;>split_ifs<;>first | (left;assumption) | (right;omega) @[inline] def YaW (sa:Bool) (ma:UInt64) (ia:Nat) (sb:Bool) (mb:UInt64) (ib:Nat) (sh:Int) (nz:Bool) (slow:Unit -> Word):Word := let k:=Y1 ma mb ia ib let da:=ia-k let db:=ib-k if da<=38/\db<=38 then let ta:=ma<< Word) (o:a˥<2^24) (p:b˥<2^24) (q:f ()=finishWord ((if g then -(a˥:Int) else a˥)*2^d+(if j then -(b˥:Int) else b˥)*2^e) l n) : YaW g a d j b e l n f=finishWord ((if g then -(a˥:Int) else a˥)*2^d+(if j then -(b˥:Int) else b˥)*2^e) l n:=by unfold YaW;dsimp only;split . rename_i r;obtain⟨u,v⟩:=Za2 a b d e;set k:=Y1 a b d e;have s:=ZY a (d-k) g (by omega -splitDisjunctions) (by calc a˥*2^(d-k)<2^24*2^38:=Μ o (κ (by norm_num) r.1) (by positivity) _=2^62:=by norm_num) have t:=ZY b (e-k) j (by omega -splitDisjunctions) (by calc b˥*2^(e-k)<2^24*2^38:=Μ p (κ (by norm_num) r.2) (by positivity) _=2^62:=by norm_num) rw[ZaL,ZaZ _ _ ?_ ?_,s,t] . rw[show((k:Int)+l)=l+(k:Int) by ring,finishWord_scale];have w:=ZC (if g then -(a˥:Int) else a˥) d k (by rcases u with h | h . left;subst h;simp . right;exact h) have x:=ZC (if j then -(b˥:Int) else b˥) e k (by rcases v with h | h . left;subst h;simp . right;exact h) rw[w,x];ring . rw[s,t];have y:(a˥*2^(d-k):Int)<2^62:=by exact_mod_cast (by calc a˥*2^(d-k)<2^24*2^38:=Μ o (κ (by norm_num) r.1) (by positivity) _=2^62:=by norm_num) have z:(b˥*2^(e-k):Int)<2^62:=by exact_mod_cast (by calc b˥*2^(e-k)<2^24*2^38:=Μ p (κ (by norm_num) r.2) (by positivity) _=2^62:=by norm_num) have A:(0:Int)<=a˥*2^(d-k):=by simp have B:(0:Int)<=b˥*2^(e-k):=by simp cases g<;>cases j<;>simp<;>linarith . rw[s,t];have y:(a˥*2^(d-k):Int)<2^62:=by exact_mod_cast (by calc a˥*2^(d-k)<2^24*2^38:=Μ o (κ (by norm_num) r.1) (by positivity) _=2^62:=by norm_num) have z:(b˥*2^(e-k):Int)<2^62:=by exact_mod_cast (by calc b˥*2^(e-k)<2^24*2^38:=Μ p (κ (by norm_num) r.2) (by positivity) _=2^62:=by norm_num) have A:(0:Int)<=a˥*2^(d-k):=by simp have B:(0:Int)<=b˥*2^(e-k):=by simp cases g<;>cases j<;>simp<;>linarith . exact q @[inline] def Ge (w A:UInt64) (e:Unit -> Int) (z o:Bool) (B:UInt64):UInt32 := if w=0 then (if z then 0x80000000 else 0) else let n:=w>>>63 != 0;let m:=if n then 0-w else w;let L0:=A-1+(if m>>>A != 0 then 1 else 0);let L:=if m>>>L0==1 then L0&&&63 else Yj m;let u:=B+L+126;if o&&u<=253 then YZ n u (m<<<(63-L)) else Ybn n m (e ()) lemma Gc (w A:UInt64) (e:Unit -> Int) (a b:Bool) (B:UInt64):Ge w A e a b B=YaPT w e a b B:=by have k:∀ m L:UInt64,(if m>>>L==1 then L&&&63 else Yj m)=Yj m:=by intro m L;split<;>rename_i h . have d:=congrArg UInt64.toNat (eq_of_beq h);rw[τ,ν,UInt64.toNat_one]at d;have p:=θ (L˥%64);have f:=Ϧ m˥ (2^(L˥%64));have g:=Nat.lt_div_mul_add (a:=m˥) p;rw[d,Ξ]at f g;apply ε.mp;rw[Zj m (λ h0=>by rw[h0]at f;simp at f),AW,show (63:UInt64)˥=2^6-1 from rfl,Θ];exact((ϔ (by omega)).mpr ⟨f,by rw[Nat.pow_succ];omega⟩).symm . rfl unfold Ge YaPT YauT;simp only[k] lemma Y0p (k:UInt64) (a:k˥<1024):Y0 ((k˥:Int)-149) true (k-149):=by intro c d _ b;rw[δ,ω,show(149:UInt64)˥=149 from rfl]at b ⊢ push_cast at b ⊢;omega @[inline] def YaXo (a b:Word):Word := if expOf a=255\/expOf b=255 then toWord (Bs (ofW a) (ofW b)) else YaW (signOf a) (Yl a) (idxOf a) (signOf b) (Yl b) (idxOf b) (-149) (signOf a&&signOf b) (λ _=>Yal a oneW b oneW (signOf a&&signOf b) (λ _=>toWord (Bs (ofW a) (ofW b)))) lemma ZcQo (a b:Word):YaXo a b=toWord (Bs (ofW a) (ofW b)):=by unfold YaXo;split . rfl . rename_i h;have g:expOf a≠255:=λ e=>h (AJ e);have j:expOf b≠255:=λ e=>h (Bz e);have d:=ZcD a b g j;have f:toWord (Bs (ofW a) (ofW b))=finishWord (sv a*sv oneW*2^(idxOf a+idxOf oneW)+sv b*sv oneW*2^(idxOf b+idxOf oneW)) (-298) (signOf a&&signOf b):=by rw[d,ZO.1,ZO.2,show(-149:Int) = -298+((149:Nat):Int) by norm_num,finishWord_scale] congr 1;ring have k:Yal a oneW b oneW (signOf a&&signOf b) (λ _=>toWord (Bs (ofW a) (ofW b)))=toWord (Bs (ofW a) (ofW b)):=by rw[Za1 _ _ _ _ _ _ f,f] rw[<- Zai a,<- Zai b]at d;rw[ZcP _ _ _ _ _ _ _ _ _ (by rw[Zs];exact mantOf_lt_24 a) (by rw[Zs];exact mantOf_lt_24 b) (by rw[k];exact d),d] @[inline] def YaX (a b:Word):Word := if expOf a=255\/expOf b=255 then toWord (Bs (ofW a) (ofW b)) else let ma:=Yf a let mb:=Yf b let ia:=Yd a let ib:=Yd b let k:=if ma==0 then ib else if mb==0 then ia else if ia<=ib then ia else ib let da:=if k<=ia then ia-k else 0 let db:=if k<=ib then ib-k else 0 if da<=38&&db<=38 then let ta:=ma<<>>31).toUInt64) (λ _=>((k.toNat:Int)-149)) (signOf a&&signOf b) true (k-149) else Yal a oneW b oneW (signOf a&&signOf b) (λ _=>toWord (Bs (ofW a) (ofW b))) lemma YaWe (sa sb:Bool) (ma mb A B:UInt64) (nz:Bool) (s:Unit -> Word) (X:UInt64 -> UInt64) (hA:A.toNat<1024) (hB:B.toNat<1024) : (let k:=if ma==0 then B else if mb==0 then A else if A<=B then A else B let da:=if k<=A then A-k else 0 let db:=if k<=B then B-k else 0 if da<=38&&db<=38 then let ta:=ma<<((k.toNat:Int)-149)) nz true (k-149) else s ())=YaW sa ma A.toNat sb mb B.toNat (-149) nz s:=by unfold YaW;dsimp only have hk:(if ma==0 then B else if mb==0 then A else if A<=B then A else B).toNat=Y1 ma mb A.toNat B.toNat:=by unfold Y1;by_cases h1:ma=0 . simp [h1] . by_cases h2:mb=0 . simp [h1,h2] . simp only [h1,h2,beq_iff_eq,if_false,UInt64.le_iff_toNat_le];split<;>omega have kb:Y1 ma mb A.toNat B.toNat<1024:=by unfold Y1;split_ifs<;>omega generalize (if ma==0 then B else if mb==0 then A else if A<=B then A else B)=K at hk ⊢ generalize Y1 ma mb A.toNat B.toNat=k at hk kb ⊢ have eA:(if K<=A then A-K else 0)=(A.toNat-k).toUInt64:=by apply UInt64.toNat_inj.mp;split<;>rename_i h . rw[UInt64.toNat_sub_of_le _ _ h];simp;omega . simp only [UInt64.le_iff_toNat_le] at h;simp;omega have eB:(if K<=B then B-K else 0)=(B.toNat-k).toUInt64:=by apply UInt64.toNat_inj.mp;split<;>rename_i h . rw[UInt64.toNat_sub_of_le _ _ h];simp;omega . simp only [UInt64.le_iff_toNat_le] at h;simp;omega rw[eA,eB];by_cases h:A.toNat-k<=38/\B.toNat-k<=38 . have c:((A.toNat-k).toUInt64<=38&&(B.toNat-k).toUInt64<=38)=true:=by simp [UInt64.le_iff_toNat_le];omega rw[if_pos c,if_pos h];rw[Gc,YaPTe,Zca _ _ _ _ _ (Y0p K (by omega)),ZaL,hk];congr 1 . have c:((A.toNat-k).toUInt64<=38&&(B.toNat-k).toUInt64<=38)≠true:=by simp [UInt64.le_iff_toNat_le];omega rw[if_neg c,if_neg h] lemma YaXe (a b:Word):YaX a b=YaXo a b:=by unfold YaX YaXo;split;rfl have q:∀ w:Word,(Yd w).toNat<1024:=λ w=>by rw[Zf];unfold idxOf expOf;have:=Nat.and_le_right (n:=w.toNat>>>23) (m:=255);split<;>simp<;>omega rw[← Zf a,← Zf b];dsimp only;exact YaWe (signOf a) (signOf b) (Yf a) (Yf b) (Yd a) (Yd b) (signOf a&&signOf b) (λ _=>Yal a oneW b oneW (signOf a&&signOf b) (λ _=>toWord (Bs (ofW a) (ofW b)))) (λ M=>(24:UInt64)+M-((a^^^b)>>>31).toUInt64) (q a) (q b) lemma ZcQ (a b:Word):YaX a b=toWord (Bs (ofW a) (ofW b)):=by rw[YaXe];exact ZcQo a b @[inline] def YaY (x y z:Word):Word := if expOf x=255\/expOf y=255\/expOf z=255 then toWord (Cn (ofW x) (ofW y) (ofW z)) else let mp:=Yl x*Yl y let mz:=Yl z let p:=idxOf x+idxOf y let q:=idxOf z+149 let k:=Y1 mp mz p q let dp:=p-k let dq:=q-k if dp<=14/\dq<=38 then let neg:=ψ (signOf x) (signOf y) let tp:=mp<<toWord (Cn (ofW x) (ofW y) (ofW z))) lemma ZcR (x y z:Word):YaY x y z=toWord (Cn (ofW x) (ofW y) (ofW z)):=by unfold YaY;split . rfl . rename_i h;have j:expOf x≠255:=λ d=>h (AJ d);have l:expOf y≠255:=λ d=>h (Bz (AJ d));have n:expOf z≠255:=λ d=>h (Bz (Bz d));dsimp only;split . rename_i o;rw[ZaX x y z j l n];have g:(Yl x*Yl y)˥=mantOf x*mantOf y:=by rw[Ϭ,Zs,Zs];exact γ (mul_mant_lt x y) have u:(Yl x*Yl y)˥<2^48:=by rw[g];calc mantOf x*mantOf y<2^24*2^24:=CG (mantOf_lt_24 x) (mantOf_lt_24 y) _=2^48:=by norm_num have v:(Yl z)˥<2^24:=by rw[Zs];exact mantOf_lt_24 z obtain⟨w,A⟩:=Za2 (Yl x*Yl y) (Yl z) (idxOf x+idxOf y) (idxOf z+149);set k:=Y1 (Yl x*Yl y) (Yl z) (idxOf x+idxOf y) (idxOf z+149);set a:=Yl x*Yl y;have B:a˥*2^(idxOf x+idxOf y-k)<2^62:=calc a˥*2^(idxOf x+idxOf y-k)<2^48*2^14:=Μ u (κ (by norm_num) o.1) (by positivity) _=2^62:=by norm_num have C:(Yl z)˥*2^(idxOf z+149-k)<2^62:=calc (Yl z)˥*2^(idxOf z+149-k)<2^24*2^38:=Μ v (κ (by norm_num) o.2) (by positivity) _=2^62:=by norm_num have e:=ZY a (idxOf x+idxOf y-k) (ψ (signOf x) (signOf y)) (by omega) B have f:=ZY (Yl z) (idxOf z+149-k) (signOf z) (by omega) C;have p:(if ψ (signOf x) (signOf y) then -(a˥:Int) else (a˥:Int))=sv x*sv y:=by rw[g,Zn] have q:(if signOf z then -((Yl z)˥:Int) else ((Yl z)˥:Int))=sv z:=Zai z;rw[p]at e;rw[q]at f;have I:(0:Int)<=a˥*2^(idxOf x+idxOf y-k):=by simp have J:(0:Int)<=(Yl z)˥*2^(idxOf z+149-k):=by simp have K:((a˥*2^(idxOf x+idxOf y-k):Nat):Int)<2^62:=by omega have L:(((Yl z)˥*2^(idxOf z+149-k):Nat):Int)<2^62:=by omega have r:(sv x*sv y)*2^(idxOf x+idxOf y-k)=(if ψ (signOf x) (signOf y) then -(a˥:Int) else (a˥:Int))*2^(idxOf x+idxOf y-k):=by rw[p] have s:sv z*2^(idxOf z+149-k)=(if signOf z then -((Yl z)˥:Int) else ((Yl z)˥:Int))*2^(idxOf z+149-k):=by rw[q] have D : -2^63<=sv x*sv y*2^(idxOf x+idxOf y-k)+sv z*2^(idxOf z+149-k):=by rw[r,s];cases ψ (signOf x) (signOf y)<;>cases signOf z<;>simp<;>linarith have E:sv x*sv y*2^(idxOf x+idxOf y-k)+sv z*2^(idxOf z+149-k)<2^63:=by rw[r,s];cases ψ (signOf x) (signOf y)<;>cases signOf z<;>simp<;>linarith rw[ZaL,ZaZ _ _ (by rw[e,f];exact D) (by rw[e,f];exact E),e,f,show((k:Int)-298) = -298+(k:Int) by ring,finishWord_scale] have F:=ZC (sv x*sv y) (idxOf x+idxOf y) k (by rcases w with b | b . left;have:mantOf x*mantOf y=0:=by rw[<- g,b];rfl rw[<- Zn,this];simp . right;exact b) have G:=ZC (sv z) (idxOf z+149) k (by rcases A with b | b . left;have:mantOf z=0:=by rw[<- Zs];simp[b] exact ZcM z this . right;exact b) rw[F,G];ring . have H:=ZaX x y z j l n;have t:toWord (Cn (ofW x) (ofW y) (ofW z))=finishWord (sv x*sv y*2^(idxOf x+idxOf y)+sv z*sv oneW*2^(idxOf z+idxOf oneW)) (-298) (ψ (signOf x) (signOf y)&&signOf z):=by rw[H,ZO.1,ZO.2];ring rw[Za1 _ _ _ _ _ _ t,t] @[inline] def YaA (j:Nat) (s:Word):Word := if expOf s≠255/\j < (expOf s).toNat then s-(Υ j<<<23) else if expOf s=0/\fracOf s=0 then s else toWord (AT (ofW s) (ofW (natW (2^j)))) lemma Za3 (j:Nat) (a:j<=6) (s:Word):YaA j s=toWord (AT (ofW s) (ofW (natW (2^j)))):=by unfold YaA;split . rename_i h;exact(ZcG s j a h.1 h.2).symm . split . rename_i b;exact(ZcI s j a b.1 b.2).symm . rfl @[inline] def YaB (kk:Nat) (s:Word):Word := if kk=4 then YaA 2 s else if kk=64 then YaA 6 s else toWord (AT (ofW s) (ofW (natW kk))) lemma Za4 (a:Nat) (s:Word):YaB a s=toWord (AT (ofW s) (ofW (natW a))):=by unfold YaB;split . rename_i h;subst h;exact Za3 2 (by norm_num) s . split . rename_i h;subst h;exact Za3 6 (by norm_num) s . rfl def YaZ (c h w k:Nat) (inp:Array Word):Array Word := Aa (n:=c*(h/k*(w/k))) λ q => let ch:=q.val/(h/k*(w/k)) let y:=q.val/(w/k)%(h/k) let x:=q.val%(w/k) YaB (k*k) (Yn (k*k) (poolAt h w k inp ch y x) (λ _=>oneW)) lemma ZcS:YaZ=avgpoolSpec:=by funext c h w k a;simp only[YaZ,avgpoolSpec,avgpoolWith,Za4,Zi] @[specialize] def YE (n:USize) (fx fw:(t:USize) -> t Word) (lo:UInt64) (e:Int) (bx bw:UInt32) (w2 w1 w0 c:UInt64) (k:USize):UInt64 := if h:k YE n fx fw lo e bx bw v2 v1 v0 c' (k+1) else YL lo bx bw w2 w1 w0 c λ v2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by n.toNat-k.toNat decreasing_by exact ZI n k h def Yr (fa fb:Nat -> Word) (lo k:Nat):Nat -> Int | 0=>0 | r+1=>sv (fa k)*sv (fb k)*2^(idxOf (fa k)+idxOf (fb k)-lo)+Yr fa fb lo (k+1) r lemma Za5 (n:USize) (l o:(t:USize) -> t Word) (f a:Nat -> Word) (p:∀ t h,l t h=f t܅) (q:∀ t h,o t h=a t܅) (b:UInt64) (e:Int) (g j:UInt32) (s:n܅<2^32) (r:mantOf g*mantOf j≠0 -> b˥<=idxOf g+idxOf j/\idxOf g+idxOf j k܅<=n܅ -> c˥<=k܅ -> (∀ t,k܅<=t -> t mantOf (f t)*mantOf (a t)≠0 -> b˥<=idxOf (f t)+idxOf (a t)/\idxOf (f t)+idxOf (a t) ((Yx y z A+c˥:Nat):Int)%2^192=S0%2^192 -> S=S0+Yr f a b˥ k܅ (n܅-k܅)+sv g*sv j*2^(idxOf g+idxOf j-b˥) -> -2^191<=S -> S<2^191 -> YE n l o b e g j y z A c k=if S=0 then 0x100000000 else (finishWord S e false)،:=by intro d;induction d with | zero => intro k y z A c S0 S I J K B L C D E;have F:¬ kYD u v w x e) (by omega) r rw[G];apply ZV u v w x e S D E;rw[H,C,show n܅-k܅=0 by omega,Yr];omega | succ d N => intro k y z A c S0 S I J K B L C D E;have F:kYE n l o b e g j u v w x (k+1)) (by omega) (B k܅ (le_refl _) (by omega)) rw[G];refine N (k+1) u v w x (S0+sv (f k܅)*sv (a k܅)*2^(idxOf (f k܅)+idxOf (a k܅)-b˥)) S (by omega) (by omega) (by omega) (λ t Q P=>B t (by omega) P) ?_ ?_ D E . rw[H];omega . rw[C,show n܅-k܅=(n܅-(k+1)܅)+1 by omega,Yr,O];ring lemma Zaj (a b:Nat -> Word) (d:Nat):∀ (r k:Nat),(∀ t,k<=t -> t mantOf (a t)*mantOf (b t)≠0 -> d<=idxOf (a t)+idxOf (b t)/\idxOf (a t)+idxOf (b t)<=d+122) -> -((r:Int)*2^170)<=Yr a b d k r/\Yr a b d k r<=(r:Int)*2^170:=by intro r;induction r with | zero=>intro k _;simp[Yr] | succ r e=>intro k h;obtain⟨f,g⟩:=ZL (a k) (b k) d (h k (le_refl _) (by omega));obtain⟨j,l⟩:=e (k+1) (λ t n o=>h t (by omega) (by omega));rw[Yr];push_cast;constructor<;>linarith lemma Za6 (a b:Nat -> Word) (K d:Nat) (e f:UInt32):∀ r k,k+r<=K -> (∀ t,k<=t -> t mantOf (a t)*mantOf (b t)≠0 -> d<=idxOf (a t)+idxOf (b t)) -> Yo (λ t=>if tif tintro k _ _;simp[Yo,Yr] | succ r g=>intro k j h;rw[Yo,Yr,g (k+1) (by omega) (λ t l n=>h t (by omega) (by omega))];simp only[show k t Word) (e a:Nat -> Word) (o:∀ t h,f t h=e t܅) (p:∀ t h,g t h=a t܅) (b:UInt32) (d:UInt64) (v:K<1048576) (q:∀ t,t expOf (e t)≠255) (r:∀ t,t expOf (a t)≠255) (s:expOf b≠255) (l:∀ t,t mantOf (e t)*mantOf (a t)≠0 -> d˥<=idxOf (e t)+idxOf (a t)/\idxOf (e t)+idxOf (a t)<=d˥+122) (j:mantOf oneW*mantOf b≠0 -> d˥<=idxOf oneW+idxOf b/\idxOf oneW+idxOf b<=d˥+122) (n:Word) (u:n=dotOf (K+1) (λ t=>if tif tif tif tl t (by omega) w);have H:=ZL oneW b d˥ j;generalize A:Yr e a d˥ 0 K+sv oneW*sv b*2^(idxOf oneW+idxOf b-d˥)=Srel have B : -2^191<=Srel:=by omega have C:Srel<2^191:=by omega have D:=Za5 K؛ f g e a o p d ((d˥:Int)-298) oneW b (by omega) (λ h=>⟨(j h).1,by have:=(j h).2;omega⟩) K 0 0 0 0 0 0 Srel (by simp[y]) (by simp) (by simp) (λ t _ z w=>by have:=l t (by omega) w;exact⟨this.1,by omega⟩) (by simp[Yx]) (by rw[<- A,y];simp) B C rw[D];have E:∀ k,k expOf ((λ t=>if tif tif tif tif tif t(l t (by omega) w).1)] simp;rw[ZA oneW b d˥ (λ h=>(j h).1),<- A];ring exact Zfw _ _ _ _ _ u F @[inline] def Yb (s:ConvShape):Nat:=s.h+2*s.pad @[inline] def Ya (s:ConvShape):Nat:=s.w+2*s.pad @[inline] def YI (s:ConvShape) (inp:Array Word) (idx:Nat):Word := let c:=idx/(Yb s*Ya s) let yy:=idx/Ya s%Yb s let xx:=idx%Ya s if yy=s.h\/xx-s.pad>=s.w then 0 else inp[(c*s.h+(yy-s.pad))*s.w+(xx-s.pad)]! @[inline] def Ys (s:ConvShape) (t:Nat):Nat := t/(s.kh*s.kw)*(Yb s*Ya s)+t/s.kw%s.kh*Ya s+t%s.kw lemma Za7 (c a b A B:Nat) (e:a b+(a[t]!)؆if tif tif tif t pbn+(off[t]!).toNat122 then Yam s inp wts b k o cw y x else let r:=YE k.toUSize (λ t ht=>P.uget (pbn.toUSize+(off.uget t (by rw [hoff];rw [ζ,Za _ (by omega)] at ht;exact ht)).toUSize) (by have:=Za9 P off k pbn hoff hPs hix t ht (by omega) (by rw [hoff];rw [ζ,Za _ (by omega)] at ht;exact ht) rw [this.1];exact this.2)) (λ t ht=>wts.uget ((o*k).toUSize+t) (by have:=Z0 wts o k h t ht rw [this.1];exact this.2)) lo ((lo.toNat:Int)-298) oneW bw 0 0 0 0 0 if r<0x100000000 then r.toUInt32 else Yam s inp wts b k o cw y x else Yam s inp wts b k o cw y x lemma ZQa {L r i:Nat} (a:L <= r) (b:r <= i+1) : L-1 <= i:=by omega lemma ZQb {m H i:Nat} (a:m <= H) (b:i+1 <= max m 1) : i <= H-1:=by omega lemma ZQ {p u a b c d g h j k l n o q e f B:Nat} (w:p <= (a-1)+(b-1)) (x:a=g) (y:b=h) (z:(c-1)+(d-1) <= u) (A:c=j) (C:d=k) (D:u-p <= B) (r:g <= l/\n <= j) (s:h <= o/\q <= k) (t:l <= e+1/\e+1 <= max n 1) (v:o <= f+1/\f+1 <= max q 1) : p <= e+f/\e+f <= p+B:=by subst x y A C;exact ⟨w.trans (CU (ZQa r.1 t.1) (ZQa s.1 v.1)),(CU (ZQb r.2 t.2) (ZQb s.2 v.2)).trans (z.trans (BR.mp D))⟩ lemma ZQ1 {p x u B:Nat} (a:p <= x) (b:x <= u) (d:u-p <= B) : p <= x/\x <= p+B:=⟨a,b.trans (BR.mp d)⟩ lemma Zba (s:ConvShape) (e P:Array Word) (d:Array UInt32) (a b:Array Word) (k o g y x f:Nat) (l:d؝=k) (n:k<1048576) (p:P.size<4294967296) (j:∀ t,t f+(d[t]!)؆ P[f+(d[t]!)؆]! = windowAt s e y x (g+t)) : YaC s e P d a b k o g y x f (Yc P P.size 0) (Yc a k o) l n p j = dotOf (k+1) (λ t=>if tif tW (φ.mp (by rw[K,h];rfl));have d2:Hv≠255:=λ h=>X (φ.mp (by rw[L,h];rfl));obtain⟨d4,N⟩:=Zh5 _ _ Z c5 have O:∀ t,t windowAt s e y x (g+t)=P[0*P.size+(f+(d[t]!)؆)]! :=λ t r=>by rw[Λ,ι];exact(q t r).symm apply ZcT k _ _ (λ t=>windowAt s e y x (g+t)) (λ t=>a[o*k+t]!) _ _ b[o]! (Yp w z b[o]!) n . intro t r;rw[O t r];exact(Zb _).2.2.1 (ϸ (H _ (j t r)).2 (Ϸ S d1)) . intro t r;exact(Zb _).2.2.1 (ϸ (J t r).2 (Ϸ T d2)) . exact Y . intro t r u;rw[O t r]at u ⊢;have h9:mantOf P[0*P.size+(f+(d[t]!)؆)]! ≠ 0:=λ h=>u (by rw[h,Λ]) have h4:mantOf a[o*k+t]! ≠ 0:=λ h=>u (by rw[h,Ρ]);obtain⟨-,-,-,ka⟩:=Zb P[0*P.size+(f+(d[t]!)؆)]!;obtain⟨-,-,-,kc⟩:=Zb a[o*k+t]!;exact ZQ B U V D K L N (H _ (j t r)) (J t r) (ka h9) (kc h4) . intro u;have Q:mantOf b[o]! ≠ 0:=λ h=>u (by rw[h,Ρ]);exact ZQ1 (C Q) (E Q) N . exact Zak s e a b k o g y x . intro t r;have hi:k؛܅=k:=Za _ (by omega) have hh:t܅(Ys s t؞).toUInt32)[t]!)؆=Ys s t:=by simp_all def Ya0 (s:ConvShape) (relu:Bool) (inp wts b:Array Word):Array Word := if hg:s.kh<=Yb s/\s.kw<=Ya s/\s.cin*(Yb s*Ya s)<=4294967295 /\ s.cin*s.kh*s.kw<1048576 then let P:Array Word:=Aa (n:=s.cin*(Yb s*Ya s)) λ i=>YI s inp i.val let off:Array UInt32:=Aa (n:=s.cin*s.kh*s.kw) λ t=>(Ys s t.val).toUInt32 let bp:=Yc P P.size 0 let BW:Array UInt32:=Aa (n:=s.cout) λ o=>Yc wts (s.cin*s.kh*s.kw) o.val Aa (n:=s.cout*(s.ho*s.wo)) λ q => act relu (YaC s inp P off wts b (s.cin*s.kh*s.kw) (q.val/(s.ho*s.wo)) 0 (q.val/s.wo%s.ho) (q.val%s.wo) (q.val/s.wo%s.ho*s.stride*Ya s+q.val%s.wo*s.stride) bp BW[q.val/(s.ho*s.wo)]! (by simp [off]) hg.2.2.2 (by simp [P];have:=hg.2.2.1;omega) (λ t ht=>by obtain ⟨hy,hx,-⟩:=Zt s.cout s.ho s.wo q.val q.isLt obtain ⟨w1,-⟩:=Zal s inp hg.1 hg.2.1 _ _ t hy hx ht simp only [P,off,Al] rw [ZD s _ t ht (by omega)] exact w1)) else conv2dWith Yn s relu inp wts b lemma ZcV:Ya0=conv2dSpec:=by funext s relu a d b;unfold Ya0 conv2dSpec;split . rename_i e;dsimp only;congr 1;funext q;obtain⟨g,h,j⟩:=Zt s.cout s.ho s.wo q؞ q.isLt;rw[Ze s.cout (λ o=>Yc d (s.cin*s.kh*s.kw) o) _ j];congr 1;refine(Zba s a _ _ d b _ _ 0 _ _ _ _ _ _ _ ?_).trans ?_ . intro t f;obtain⟨k,l⟩:=Zal s a e.1 e.2.1 _ _ t g h f;rw[ZD s _ t f (by omega),ι,Ze _ (λ i=>YI s a i) _ k] exact l . simp . simp only[Zi] def dwF (s:ConvShape) (relu:Bool) (inp wts b:Array Word):Array Word := if hg:s.kh<=Yb s/\s.kw<=Ya s/\s.cin*(Yb s*Ya s)<=4294967295 /\ s.kh*s.kw<1048576 then let P:Array Word:=Aa (n:=s.cin*(Yb s*Ya s)) λ i=>YI s inp i.val let off:Array UInt32:=Aa (n:=s.kh*s.kw) λ t=>(Ys s t.val).toUInt32 let bp:=Yc P P.size 0 let BW:Array UInt32:=Aa (n:=s.cin) λ c=>Yc wts (s.kh*s.kw) c.val Aa (n:=s.cin*(s.ho*s.wo)) λ q => act relu (YaC s inp P off wts b (s.kh*s.kw) (q.val/(s.ho*s.wo)) (q.val/(s.ho*s.wo)*(s.kh*s.kw)) (q.val/s.wo%s.ho) (q.val%s.wo) (q.val/(s.ho*s.wo)*(Yb s*Ya s) + (q.val/s.wo%s.ho*s.stride*Ya s+q.val%s.wo*s.stride)) bp BW[q.val/(s.ho*s.wo)]! (by simp [off]) hg.2.2.2 (by simp [P];have:=hg.2.2.1;omega) (λ t ht=>by obtain ⟨hy,hx,hc⟩:=Zt s.cin s.ho s.wo q.val q.isLt obtain ⟨w1,-⟩:=ZZ s inp _ t _ _ hg.1 hg.2.1 hc ht hy hx simp only [P,off,Al] rw [ZD s _ t ht (by omega)] exact w1)) else depthwiseWith Yn s relu inp wts b lemma ZcW:dwF=depthwiseSpec:=by funext s relu a d b;unfold dwF depthwiseSpec;split . rename_i e;dsimp only;congr 1;funext q;obtain⟨h,j,f⟩:=Zt s.cin s.ho s.wo q؞ q.isLt;rw[Ze s.cin (λ c=>Yc d (s.kh*s.kw) c) _ f];congr 1;refine(Zba s a _ _ d b _ _ _ _ _ _ _ _ _ _ ?_).trans rfl;intro t g;obtain⟨k,l⟩:=ZZ s a _ t _ _ e.1 e.2.1 f g h j;rw[ZD s _ t g (by omega),Ze _ (λ i=>YI s a i) _ k];exact l . simp only[Zi] section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Numerics open Model open RationalBinary (floorLog2 scaleByPowerOfTwo scaleByPowerOfTwo_snd_ne_zero) open FloatLib.Numerics (binaryRadix Radix.toReal) end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Floats.Formats.Flocq open Float.Model.UnpackedFloat open FloatLib.Numerics (binaryRadix Radix.toReal) end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats end def Yh (s:Bool) (m:Nat):Int:=if s then -(m:Int) else m lemma ZF (w:Word):sv w=Yh (signOf w) (mantOf w):=rfl lemma gO {α:Type} [Inhabited α] (n:Nat) (f:Nat -> α) (k:Nat) (a:kf i؞)[k]! = f k:=by simp_all def Ye (q:UInt64):Int:=(q.toNat:Int)-2^64*(q.toNat/2^63:Nat) termination_by n.toNat-k.toNat decreasing_by exact ZI n k h lemma shm (w:UInt32) (m:UInt64) (k:Nat) (a:k<=39) (h:mantOf w=0\/(m˥<=idxOf w/\idxOf w-m˥<=k)) : (Yf w<<<(Yd w-m))˥=mantOf w*2^(idxOf w-m˥) /\ mantOf w*2^(idxOf w-m˥)<2^(24+k):=by rcases h with b | ⟨e,f⟩ . have:Yf w=0:=ε.mp (by rw[Zk,b];rfl);rw[this,b];simp . have g:(Yd w-m)˥=idxOf w-m˥:=by rw[ξ _ _ (σ.mpr (by rw[Zf];exact e)),Zf] have j:=mantOf_lt_24 w;have d:mantOf w*2^(idxOf w-m˥)<2^(24+k):=calc _<2^24*2^(idxOf w-m˥):=ϖ j (θ _) _<=2^24*2^k:=Nat.mul_le_mul_left _ (κ (by norm_num) f) _=2^(24+k):=by rw[pow_add] refine⟨?_,d⟩;rw[χ,g,Zk,γ (show idxOf w-m˥<64 by omega),ο] exact γ (lt_of_lt_of_le d (κ (by norm_num) (by omega))) lemma Zdv (p:UInt64) (a:Bool) (b:p˥<2^63):Ye (if a then (0:UInt64)-p else p)=if a then -(p˥:Int) else p˥:=by unfold Ye;cases a . simp only[η,ite_false];rw[Α b];simp . simp only[ite_true];rw[ω];simp only[show(0:UInt64)˥=0 from rfl,ϯ];by_cases d:p˥=0 . rw[d];simp omega lemma Zdw (V:Nat) (a:Int) (h:(V:Int)%2^128=a%2^128) (b:V<2^128) (d : -2^127<=a) (e:a<2^127) : (((2^64-V/2^127)%2^64*2^128+V:Nat):Int)%2^192=a%2^192:=by omega lemma Zdx (a b c:UInt64) (d:Int) (e:c˥=0) (h:((a˥*2^64+b˥:Nat):Int)%2^128=d%2^128) (f : -2^127<=d) (g:d<2^127) : ((Yx ((0:UInt64)-(a>>>63)) a b+c˥:Nat):Int)%2^192=d%2^192:=by have j:((0:UInt64)-(a>>>63))˥=(2^64-a˥/2^63)%2^64:=by rw[ω,τ];simp[ν] have n:=b۾;have o:=a۾;have k:a˥/2^63=(a˥*2^64+b˥)/2^127:=by omega have l:a˥*2^64+b˥<2^128:=by omega unfold Yx;rw[j,e,ϯ,ϕ,k];exact Zdw _ d h l f g def okF (A:Array Word) (a n:Nat) (m:UInt64) (s:Nat):Prop := ∀ t,t mantOf A[a+t]! = 0\/(m.toNat<=idxOf A[a+t]! /\ idxOf A[a+t]! - m.toNat<=s) @[inline] def YU (bx:UInt32):UInt64:=Yk (bx&&&0xFFFF)-Yk (bx>>>16) lemma Zbt (A:Array Word) (a i:Nat) (b:i*a+a<=A.size) (g:i*a+a<4294967296) (d:(Yc A a i&&&0xFFFF)≠255) (f:Yk (Yc A a i>>>16)<=Yk (Yc A a i&&&0xFFFF)) : okF A (i*a) a (Yk (Yc A a i>>>16)) (YU (Yc A a i))˥ /\ (YU (Yc A a i))˥<=254/\(Yk (Yc A a i>>>16))˥<=511 /\ ∀ t,t < a -> expOf A[i*a+t]! ≠ 255:=by obtain⟨L,H,l,r,_,n⟩:=Zp A a i b (by omega);obtain⟨c,j⟩:=Zo _ L H l (by omega);have s:H≠255:=λh=>d (φ.mp (by rw[j,h];rfl));unfold okF;rw[(by unfold YU;rw[ξ _ _ f,Zq,Zq,c,j]:(YU (Yc A a i))˥=H-1-(L-1)),(by rw[Zq,c]:(Yk (Yc A a i>>>16))˥=L-1)];clear b g d f l c j;refine⟨?_,(by omega),(by omega),λt k=>(Zb A[i*a+t]!).2.2.1 (by have:=(n t k).2;omega)⟩;intro t k;refine(em _).imp_right λo=>?_;have p:=(Zb A[i*a+t]!).2.2.2 o;have q:=n t k;refine⟨Nat.sub_le_of_le_add (q.1.trans p.1),Nat.sub_le_sub_right ?_ _⟩;omega lemma Zdy (a:UInt32) (b:UInt64) (d:Yf a=0\/(b<=Yd oneW+Yd a/\Yd oneW+Yd a-b<80)) : mantOf oneW*mantOf a≠0 -> b˥<=idxOf oneW+idxOf a/\idxOf oneW+idxOf a<=b˥+79:=by intro f;have g:Yf a≠0:=by intro h;apply f;rw[<- Zk a,h];simp obtain⟨e,j⟩:=d.resolve_left g;have k:=σ.mp e;have l:=ς.mp j;rw[ZM]at k;rw[ξ _ _ e,ZM]at l;have:(80:UInt64)˥=80:=rfl;constructor<;>omega @[specialize] def Yaq (n:Nat) (f:Nat -> Word) (i:Nat) (acc:Array Word):Array Word := if i Word):Array Word:=Yaq n f 0 (Aj n) lemma Zdz (n:Nat) (f:Nat -> Word):∀ k i (a:Array Word),n-i=k -> (Yaq n f i a)׆=a׆ ++ (Av i (n-i)).map f:=by intro k;induction k with | zero=>intro i a h;unfold Yaq;rw[if_neg (by omega)];simp[h] | succ k b=>intro i a h;unfold Yaq;rw[if_pos (by omega),b (i+1) _ (by omega),show n-i=(n-(i+1))+1 by omega,AA];simp lemma ZdA (n:Nat) (f:Nat -> Word):Ybd n f=Aa (n:=n) λ i=>f i؞:=by apply BB;rw[Ybd,Zdz n f _ 0 _ rfl];apply Ap<;>simp def YbeO (relu:Bool) (c hw:Nat) (x s t:Array Word):Array Word := YT c hw λ ch j=>act relu (YaY x[ch*hw+j]! s[ch]! t[ch]!) lemma ZdBO:YbeO=scaleShiftSpec:=by funext relu c a x s t;simp only[YbeO,ZB c a _ rfl,scaleShiftSpec,ZcR,ϴ] def Ybf (relu:Bool) (a b:Array Word):Array Word := Ybd a.size λ i=>act relu (YaX a[i]! b[i]!) lemma ZdC:Ybf=addReluSpec:=by funext relu a b;simp only[Ybf,ZdA,addReluSpec,ZcQ];congr 1;funext i;rw[getElem!_pos a i؞ i.isLt];rfl @[inline] def YaJ (w:Word) (m:UInt64):UInt64 := if signOf w then 0-Yf w<<<(Yd w-m) else Yf w<<<(Yd w-m) lemma svz (q:UInt64) (z:Int) (a : -2^63<=z) (b:z<2^63) (h:((q˥:Int)-z)%2^64=0):Ye q=z:=by have:=q۾;unfold Ye;omega lemma Zbu (a:UInt64):(a˥:Int) ≡ Ye a [ZMOD 2^64]:=by unfold Ye;rw[Int.modEq_iff_dvd];exact⟨-(a˥/2^63:Nat),by ring⟩ lemma svm (a b:UInt64) (d : -2^63<=Ye a*Ye b) (e:Ye a*Ye b<2^63):Ye (a*b)=Ye a*Ye b:=by apply svz _ _ d e;have Zh:((a˥*b˥%2^64:Nat):Int) ≡ Ye a*Ye b [ZMOD 2^64]:=by push_cast;exact(Int.mod_modEq _ _).trans ((Zbu a).mul (Zbu b)) rw[Ϭ];exact Int.emod_eq_zero_of_dvd Zh.symm.dvd lemma sgv (w:Word) (m:UInt64) (k:Nat) (a:k<=39) (h:mantOf w=0\/(m˥<=idxOf w/\idxOf w-m˥<=k)) : Ye (YaJ w m)=sv w*2^(idxOf w-m˥) /\ |sv w*2^(idxOf w-m˥)| < 2^(24+k):=by obtain⟨b,d⟩:=shm w m k a h;have:=κ (show 0<2 by omega) (show 24+k<=63 by omega);unfold YaJ;rw[Zdv _ _ (by omega),b,ZF];unfold Yh;cases signOf w<;>simp<;>exact_mod_cast d @[inline] def YV (w:Word) (m:UInt64):Nat:=(YaJ w m+0x200000000000000).toNat @[inline] def Y4 (w:Word) (m:UInt64):UInt32:=(YaJ w m+0x80000000).toUInt32 @[inline] def QSx (v:UInt64):UInt64:=v.toUInt32.toInt32.toInt64.toUInt64 @[inline] def Y9 (a b:UInt64):UInt64:=QSx (a&&&0x1FFFFFF)*QSx (b-0x80000000) @[inline] def cq1 (a b:UInt64):UInt64:=QSx ((a>>>25)-0x100000000)*QSx (b-0x80000000) @[inline] def Y5f (B0:UInt64) (bw:UInt32) (a0 a1:UInt64):UInt64 := let l:=a1<<<25 let lo:=l+a0 let hi:=(a1>>>39)+(((0:UInt64)-(a1>>>63))<<<25)+((0:UInt64)-(a0>>>63)) + (if lo>>63)) hi lo 0 λ v2 v1 v0 c' => YD v2 v1 v0 c' ((B0.toNat:Int)-298) @[inline] def Y5g (B0:UInt64) (bw:UInt32) (a0 a1:UInt64):UInt64 := let s:=Yd bw+126-B0 if (Yf bw==0||s<=78)&&B0<=1000 then let l:=a1<<<25 let lo:=l+a0 let hi:=(a1>>>39)+(((0:UInt64)-(a1>>>63))<<<25)+((0:UInt64)-(a0>>>63))+(if lo>>1)>>>(63-s) else m<<<(s-64) let bl:=if s<64 then m<<>>63) if (t0|||t1|||t2)==0 then 0x100000000 else (YaTT t2 t1 t0 (λ _=>((B0.toNat:Int)-298)) false true (B0-298)).toUInt64 else Y5f B0 bw a0 a1 @[specialize] def Y5 (n:USize) (fa fb:(t:USize) -> t UInt64) (B0:UInt64) (bw:UInt32) (a0 a1:UInt64) (k:USize):UInt64 := if h:k>>25)-0x100000000)=X/2^25:=by constructor<;>apply svz _ _ (by omega) (by omega) . rw[AW,show(0x1FFFFFF:UInt64)˥=2^25-1 from rfl,Θ];omega . rw[ω,τ,show(25:UInt64)˥%64=25 from rfl,ν,show(0x100000000:UInt64)˥=2^32 from rfl];push_cast;omega lemma tC (b:UInt64) (W:Int) (a : -2^30push_cast<;>omega rw[e,f];exact BitVec.ofInt_toInt lemma tw (x w:UInt32) (d e:UInt64) (g f:Nat) (o:g+f<=31) (p:f<=6) (j:mantOf x=0\/(d˥<=idxOf x/\idxOf x-d˥<=g)) (k:mantOf w=0\/(e˥<=idxOf w/\idxOf w-e˥<=f)) (a b:UInt64) (l:a=(YV x d)׳) (n:b=(Y4 w e)،) : Ye (Y9 a b)+2^25*Ye (cq1 a b)=sv x*sv w*2^(idxOf x+idxOf w-(d˥+e˥)) /\ -2^55simp[sv,h] . have N:=j.resolve_left (λ h=>A (by simp[h]));have O:=k.resolve_left (λ h=>A (by simp[h]));rw[show idxOf x+idxOf w-(d˥+e˥)=(idxOf x-d˥)+(idxOf w-e˥) by omega,pow_add] ring lemma Zbx (a q:UInt64) (b : -2^63<=Ye a+Ye q) (d:Ye a+Ye q<2^63):Ye (a+q)=Ye a+Ye q:=by unfold Ye at *;rw[δ];have e:(2:Int)^64=18446744073709551616:=by simp omega lemma ZdI (b a:UInt64):((((a>>>39)+(((0:UInt64)-(a>>>63))<<<25)+((0:UInt64)-(b>>>63))+(if (a<<<25)+b>>1)>>>(63-s) else (Yf a<<<23)<<<(s-64))˥*2^64 + (if s<64 then (Yf a<<<23)<<simp[τ,χ] . generalize k:Yf a<<<23=M at d ⊢;split_ifs with h . rw[ς]at h;simp at h;rw[τ,τ,χ,ξ _ _ (by rw[σ];simp;omega),d] simp only[show(1:UInt64)˥=1 from rfl,show(63:UInt64)˥=63 from rfl,ν,ο,γ (show 63-s˥<64 by omega),γ (show s˥<64 by omega),ϩ,<- pow_add] rw[show 1+(63-s˥)=64-s˥ by omega] have g:2^64=2^(64-s˥)*2^s˥:=by rw[<- pow_add,show 64-s˥+s˥=64 by omega] rw[g,Cd,<- ϒ,<- Η,ϴ] . rw[ς]at h;simp at h;rw[χ,ξ _ _ (by rw[σ];simp;omega),d] rw[show(64:UInt64)˥=64 from rfl,ο,γ (show s˥-64<64 by omega),Ψ,ϯ] have j:mantOf a*2^23*2^(s˥-64)<2^64:=by calc mantOf a*2^23*2^(s˥-64)<2^24*2^23*2^14:=Μ (ϖ f (by positivity)) (κ (by omega) (by omega)) (by positivity) _<2^64:=by norm_num rw[γ j,ϒ,<- pow_add,show s˥-64+64=s˥ by omega] lemma Y5a (d a e b:UInt64):((((d+e+(if a+brename_i h<;>rw[ς,δ]at h<;>simp only[δ,CB,Nat.mod_add_mod]<;>push_cast<;>omega lemma Y5h (A B:Nat) (a:B<=A+2^128):((((A+2^128-B)%2^128:Nat):Int))%2^128=((A:Int)-B)%2^128:=by rw[Int.natCast_mod,ϻ a,Dd,CC,Cl,Int.emod_emod,show(A:Int)+2^128-B=(A-B)+2^128 by ring,Int.add_emod_right] lemma Y5b (d a e b:UInt64):((((d-e-(if arename_i h<;>rw[ς]at h<;>simp only[ω,Nat.add_mod_mod]<;>push_cast<;>omega lemma YCz (a b d:UInt64) (h:YC a b d=0):a˥*2^128+b˥*2^64+d˥=0:=by have:=a۾;have:=b۾;have:=d۾;unfold YC at h;split_ifs at h<;>omega lemma YCn (a b d:UInt64) (h:a˥*2^128+b˥*2^64+d˥=0):YC a b d=0:=by have:=a۾;unfold YC;rw[h];split_ifs<;>omega lemma Y5gF (b:UInt64) (a:UInt32) (e d:UInt64) (S:Int) (j:mantOf oneW*mantOf a≠0 -> b˥<=idxOf oneW+idxOf a) (k : -2^89>>1)>>>(63-s) else (Yf a<<<23)<<<(s-64))=u at p ⊢;generalize (if s<64 then (Yf a<<<23)<<push_cast<;>ring have L:u˥*2^64+n˥<=2^125:=by rw[p];rcases t with h|⟨I,J,y⟩ . simp[h] . have:=mantOf_lt_24 a;calc mantOf a*2^23*2^s˥<=2^24*2^23*2^78:=AG (μ _ (le_of_lt this)) (κ (by omega) I) _=2^125:=by norm_num have hacc:=ZdI e d;generalize (d>>>39)+(((0:UInt64)-(d>>>63))<<<25)+((0:UInt64)-(e>>>63))+(if (d<<<25)+eomega have hSb2:S<2^127:=by rw[f,hbias];split_ifs<;>omega have y:=Zdx r v 0 S rfl E hSb1 hSb2;generalize (0:UInt64)-(r>>>63)=w at y ⊢;unfold Yx at y;have M:=w۾;have N:=r۾;have O:=v۾;have F:YC w r v=S:=Zcp w r v S (by omega) (by omega) (by push_cast at y ⊢;omega) rw[Zcq];by_cases q:S=0 . have:=YCz w r v (by rw[F,q]) rw[if_pos (decide_eq_true this),if_pos q] . have:w˥*2^128+r˥*2^64+v˥≠0:=λ P=>q (by rw[<- F];exact YCn w r v P) rw[if_neg (by simpa using this),if_neg q,YaTTe,Zch _ _ _ _ _ _ _ (Y0k b (by omega)),F] lemma ZdJ (K:Nat) (o p:(t:USize) -> t UInt64) (j l:Nat -> Word) (e f:UInt64) (s q:Nat) (w:s+q<=31) (B:q<=6) (n:K<=256) (C:∀ t h,o t h=(YV (j t܅) e)׳) (D:∀ t h,p t h=(Y4 (l t܅) f)،) (x:∀ t,t mantOf (j t)=0\/(e˥<=idxOf (j t)/\idxOf (j t)-e˥<=s)) (y:∀ t,t mantOf (l t)=0\/(f˥<=idxOf (l t)/\idxOf (l t)-f˥<=q)) (z:(e+f)˥=e˥+f˥) (g:UInt32) (E:∀ t,t expOf (j t)≠255) (F:∀ t,t expOf (l t)≠255) (G:expOf g≠255) (r:mantOf oneW*mantOf g≠0 -> (e+f)˥<=idxOf oneW+idxOf g/\idxOf oneW+idxOf g<=(e+f)˥+122) : (if Y5 K؛ o p (e+f) g 0 0 0<0x100000000 then (Y5 K؛ o p (e+f) g 0 0 0)؍ else if Yq (λ t=>if tif tif tif t (e+f)˥<=idxOf oneW+idxOf g/\idxOf oneW+idxOf g < (e+f)˥+128 := λ h=>⟨(r h).1,by have:=(r h).2;clear * - this;omega⟩ have A:∀ (d:Nat) (k:USize) (J L:UInt64) (S:Int),K-k܅=d -> k܅<=K -> -((k܅:Int)*2^55)<=Ye J -> Ye J<=k܅*2^55 -> -((k܅:Int)*2^55)<=Ye L -> Ye L<=k܅*2^55 -> S=Ye J+2^25*Ye L+Yr j l (e+f)˥ k܅ (K-k܅)+sv oneW*sv g*2^(idxOf oneW+idxOf g-(e+f)˥) -> -2^191<=S -> S<2^191 -> Y5 K؛ o p (e+f) g J L k=if S=0 then 0x100000000 else (finishWord S (((e+f)˥:Int)-298) false)،:=by intro d induction d with | zero => intro k J L S I Z P Q R u1 M T U;rw[Y5,dif_neg (by rw[ζ,hc];clear * - I;omega)] by_cases V:((Yf g==0||Yd g+126-(e+f)<=78)&&(e+f)<=1000)=true . have W:(2:Int)^55=36028797018963968:=by norm_num have X:(2:Int)^89=618970019642690137449562112:=by norm_num have hk2:(k܅:Int)<=256:=by clear * - Z n;omega exact Y5gF _ _ _ _ S (λ h=>(hu h).1) (by rw[X];rw[W]at P Q R u1;linarith) (by rw[X];rw[W]at P Q R u1;linarith) (by rw[M,show K-k܅=0 by clear * - I;omega,Yr];ring) V unfold Y5g;rw[if_neg V];unfold Y5f;dsimp only;obtain⟨v2,v1,v0,c',hj,-,hl⟩:=Zr (e+f) oneW g _ _ ((L<<<25)+J) 0 (λ v2 v1 v0 c'=>YD v2 v1 v0 c' (((e+f)˥:Int)-298)) (by simp) hu rw[hj] apply ZV v2 v1 v0 c' _ S T U have H:(2:Int)^55=36028797018963968:=by norm_num have p127:(2:Int)^127=170141183460469231731687303715884105728:=by norm_num have hn:=Zdx _ ((L<<<25)+J) 0 (Ye J+2^25*Ye L) rfl (ZdI J L) (by rw[p127];rw[H]at P Q R u1;linarith) (by rw[p127];rw[H]at P Q R u1;linarith) rw[hl,Ο,hn,<- Ο,M,show K-k܅=0 by clear * - I;omega,Yr];ring_nf | succ d ih => intro k J L S I Z P Q R u1 M T U have hf:k mantOf (j t)*mantOf (l t)≠0 -> (e+f)˥<=idxOf (j t)+idxOf (l t) /\ idxOf (j t)+idxOf (l t)<=(e+f)˥+122:=by intro t ht hm;have u:=(x t ht).resolve_left (λ h=>hm (by rw[h,Λ]));have v:=(y t ht).resolve_left (λ h=>hm (by rw[h,Ρ]));rw[z];clear * - u v w;constructor<;>omega have hv:=Zaj j l (e+f)˥ K 0 (λ t _ h2 h3=>he t (by clear * - h2;omega) h3);have hx:=ZL oneW g (e+f)˥ r;generalize M:Yr j l (e+f)˥ 0 K+sv oneW*sv g*2^(idxOf oneW+idxOf g-(e+f)˥)=S have T : -2^191<=S:=by rw[<- M];clear * - hv hx n;omega have U:S<2^191:=by rw[<- M];clear * - hv hx n;omega have hq:dotOf (K+1) (λ t=>if tif tif tif tby by_cases h:tsimp[h,E,F,G]<;>decide)];congr 1;rw[ZW,Za6 j l K (e+f)˥ oneW g K 0 (by omega) (λ t _ h2 h3=>(he t (by clear * - h2;omega) h3).1)] simp only[ι,Cu,if_false];rw[ZA oneW g (e+f)˥ (λ h=>(r h).1),<- M];ring rw[A K 0 0 0 S (by simp) (by simp) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by rw[<- M];simp[Ye]) T U,hq] by_cases Y:S=0 . simp[Y,finishWord] . have hh:(finishWord S (((e+f)˥:Int)-298) false)،<0x100000000:=by rw[ς,Γ];exact Ν _ rw[if_neg Y,if_pos hh,<- finishWord_scale];have e1:(finishWord S (((e+f)˥:Int)-298) false)،؍=finishWord S (((e+f)˥:Int)-298) false:=by apply φ.mp;simp rw[e1];unfold finishWord;rw[if_neg Y,if_neg Y,show(-298:Int)+((e+f)˥:Int)=((e+f)˥:Int)-298 by ring] lemma u1 (n:USize) (h:¬n=0):(n-1)܅h (ώ.mp (by rw[e];rfl));rw[Ao _ _ (Ak.mpr (by simp;omega))];simp;omega @[specialize] def YO {α:Type} (B C:USize) (f:USize -> USize -> USize -> α) (n:USize) (a b c:USize) (acc:Array α):Array α := if h:n=0 then acc else let acc:=acc.push (f a b c) if c+1 USize -> USize -> α) (g:0 b܅ c܅ i+n<4294967296 -> (YO B C f n؛ a b c k)׆=k׆ ++ (Av i n).map (λ j=>f (j/(B܅*C܅))؛ (j/C܅%B܅)؛ (j%C܅)؛):=by intro n;induction n with | zero=>intro i a b c k _ _ _ _;unfold YO;rw[dif_pos (ώ.mp (by simp))];simp | succ n q => intro i a b c k D t E J;have K:=π;obtain⟨v,w,A⟩:=Za7 a܅ b܅ c܅ B܅ C܅ t E;rw[D]at v w A;have L:a܅<=a܅*(B܅*C܅):=Ω _ (Ϗ g d);have M:b܅<=b܅*C܅:=Ω _ d;have u:∀ (x:USize) (y:Nat),y=x܅ -> y<4294967296 -> y؛=x := λ x y h F=>ώ.mp (by rw[Za _ F,h]) have G:f (i/(B܅*C܅))؛ (i/C܅%B܅)؛ (i%C܅)؛=f a b c:=by rw[u a _ v (by omega),u b _ w (by omega),u c _ A (by omega)] have r:∀ x:USize,x܅<=i -> (x+1)܅=x܅+1:=λ x h=>by rw[Zc _ _ (by simp only[Β];omega),Β] have l:=r c (by omega);have o:=r b (by omega);have H:=r a (by omega);have z:(0:USize)܅=0:=rfl;have p:(n+1)؛܅=n+1:=Za _ (by omega);unfold YO;rw[dif_neg (λ e=>by rw[e]at p;simp at p),show(n+1)؛-1=n؛ from ώ.mp (by rw[Ao _ _ (Ak.mpr (by rw[p];simp)),p,Za _ (by omega)];simp)] rw[AA,List.map_cons,G];split . rename_i h;rw[ζ,l]at h;rw[q (i+1) a b (c+1) _ (by rw[l];omega) t (by rw[l];omega) (by omega)];simp . rename_i h;rw[ζ,l]at h;have I:C܅=c܅+1:=by omega split . rename_i s;rw[ζ,o]at s;rw[q (i+1) a (b+1) 0 _ (by rw[o,z,Η,Ξ];omega) (by rw[o];omega) (by rw[z];omega) (by omega)] simp . rename_i s;rw[ζ,o]at s;have N:B܅*C܅=b܅*C܅+c܅+1:=by rw[show B܅=b܅+1 by omega,Η,I];omega rw[q (i+1) (a+1) 0 0 _ (by rw[H,z,Η,Ξ];omega) (by rw[z];omega) (by rw[z];omega) (by omega)] simp lemma Zby {α:Type} (B C:USize) (f:USize -> USize -> USize -> α) (a:0f (q؞/(B܅*C܅))؛ (q؞/C܅%B܅)؛ (q؞%C܅)؛:=by apply BB;rw[ZdK B C f a b N 0 0 0 0 _ (by simp) (by simp;omega) (by simp;omega) (by omega)];apply Ap<;>simp @[inline] def YG (bv bw:UInt32) (xm:UInt64):UInt64 := if bv>>>16==511 then Yd oneW+Yd bw-xm else Yk (bv>>>16) @[inline] def Ybg (bv bw bp:UInt32) (k:Nat) (xm:UInt64):Bool := let xb:=Yd oneW+Yd bw k<256&&(bp&&&0xFFFF) != 255&&(bv&&&0xFFFF) != 255&&xm<=Yk (bp>>>16) && Yk (bp>>>16)<=Yk (bp&&&0xFFFF)&&Yk (bp&&&0xFFFF)-xm<=31 && (if bv>>>16==511 then xm<=xb else Yk (bv>>>16)<=Yk (bv&&&0xFFFF)&&YU bv<=6 && Yk (bp&&&0xFFFF)-xm+YU bv<=31)&&expOf bw != 255 && (Yf bw==0||(xm+YG bv bw xm<=xb&&xb-(xm+YG bv bw xm)<80)) @[inline] def Ybh (bp:UInt32) (BW:Array UInt32) (b:Array Word):UInt64 := (Cm BW.size).foldl (λ (m:UInt64) (o:Nat) => let wm:=Yk ((BW[o]! : UInt32)>>>16) let xb:=Yd oneW+Yd b[o]! if (BW[o]! : UInt32)>>>16 != 511&&Yf b[o]! != 0&&xb < m+wm then xb-wm else m) (Yk (bp>>>16)) @[inline] def Ybs (s:ConvShape) (inp:Array Word) (c yy xx:Nat):Word := if yy=s.h\/xx-s.pad>=s.w then 0 else inp[(c*s.h+(yy-s.pad))*s.w+(xx-s.pad)]! @[inline] def YbsU (pd h w:USize) (inp:Array Word) (c yy xx:USize):Word := if yy < pd || xx < pd || yy - pd >= h || xx - pd >= w then 0 else let j := (c * h + (yy - pd)) * w + (xx - pd) if hj : j.toNat < inp.size then inp.uget j hj else 0 @[inline] def Ybi (s:ConvShape) (inp:Array Word) (xm:UInt64):Array Nat := let pd:=s.pad.toUSize let h:=s.h.toUSize let w:=s.w.toUSize YO (Yb s).toUSize (Ya s).toUSize (λ c yy xx=>YV (YbsU pd h w inp c yy xx) xm) (s.cin*(Yb s*Ya s)).toUSize 0 0 0 (Aj (s.cin*(Yb s*Ya s))) lemma ZbUs (s:ConvShape) (d:Array Word) (c a b:Nat) (e:c= s.h.toUSize || b.toUSize - s.pad.toUSize >= s.w.toUSize) = decide (a=s.h ∨ b-s.pad>=s.w) := by by_cases o : a < s.pad · simp [o, ζ, k, j] by_cases r : b < s.pad · simp [o, r, ζ, l, j, k] have t : (a.toUSize - s.pad.toUSize).toNat = a - s.pad := by rw [Ao _ _ (by rw [Ak, k, j]; omega), k, j] have u : (b.toUSize - s.pad.toUSize).toNat = b - s.pad := by rw [Ao _ _ (by rw [Ak, l, j]; omega), l, j] simp [o, r, ζ, Ak, l, k, j, v, w, t, u] unfold YbsU Ybs rw [q] by_cases n : a=s.h ∨ b-s.pad>=s.w · simp [n] · rw [if_neg (by simpa using n), if_neg n] simp only [not_or, Nat.not_le, Dp] at n obtain ⟨o, r, J, K⟩ := n have t : (a.toUSize - s.pad.toUSize).toNat = a - s.pad := by rw [Ao _ _ (by rw [Ak, k, j]; omega), k, j] have u : (b.toUSize - s.pad.toUSize).toNat = b - s.pad := by rw [Ao _ _ (by rw [Ak, l, j]; omega), l, j] have L : c * s.h <= (c * s.h + (a - s.pad)) * s.w := by calc c * s.h <= c * s.h * s.w := Ω _ (by omega) _ <= _ := μ _ (by omega) have M : c * s.h + (a - s.pad) <= (c * s.h + (a - s.pad)) * s.w := Ω _ (by omega) have N : (c * s.h + (a - s.pad)) * s.w + s.w <= (c * s.h + s.h) * s.w := by rw [← Bq]; exact μ _ (by omega) have B : (c.toUSize * s.h.toUSize).toNat = c * s.h := by rw [Bn, A, v]; exact γ (lt_of_lt_of_le (show c * s.h < 4294967296 by omega) π) have C : (c.toUSize * s.h.toUSize + (a.toUSize - s.pad.toUSize)).toNat = c * s.h + (a - s.pad) := by rw [Cc, B, t]; exact γ (lt_of_lt_of_le (show c * s.h + (a - s.pad) < 4294967296 by omega) π) have D : ((c.toUSize * s.h.toUSize + (a.toUSize - s.pad.toUSize)) * s.w.toUSize).toNat = (c * s.h + (a - s.pad)) * s.w := by rw [Bn, C, w]; exact γ (lt_of_lt_of_le (show (c * s.h + (a - s.pad)) * s.w < 4294967296 by omega) π) have x : ((c.toUSize * s.h.toUSize + (a.toUSize - s.pad.toUSize)) * s.w.toUSize + (b.toUSize - s.pad.toUSize)).toNat = (c * s.h + (a - s.pad)) * s.w + (b - s.pad) := by rw [Cc, D, u]; exact γ (lt_of_lt_of_le (show (c * s.h + (a - s.pad)) * s.w + (b - s.pad) < 4294967296 by omega) π) simp only [] split · rename_i p; rw [← x, getElem!_pos d _ p]; rfl · rename_i p; rw [x] at p; rw [getElem!_neg d _ p]; rfl lemma Zbz (s:ConvShape) (a:Array Word) (b:UInt64) (d:0YV (YI s a i؞) b:=by have g:0by simp[h]at d);have j:0by simp[h]at d);have o:Yb s<=Yb s*Ya s:=Ω _ j;have p:Ya s<=Yb s*Ya s:=ϰ _ g;have k:(Yb s).toUSize.toNat=Yb s:=Za _ (by omega);have l:(Ya s).toUSize.toNat=Ya s:=Za _ (by omega);unfold Ybi;dsimp only;rw[Zby _ _ _ (by rw[k];omega) (by rw[l];omega) _ _ e];refine congrArg _ (funext λ i=>?_);rw[k,l] exact congrArg (YV · b) ((ZbUs s a _ _ _ (ϳ (lt_of_lt_of_eq i.isLt (Ϫ _ _))) (Ζ _ g) (Ζ _ j) e).trans rfl) lemma uk {t:USize} {k:Nat} (a:t Bool | 0=>true | r+1 => (let p:=if iif t < k then windowAt s a y x (e+t) else oneW) (λ t=>if t < k then d[o*k+t]! else b[o]!) i r:=by intro r; induction r <;> intro i <;> simp only[zW,Yq, *] @[inline] def Ybj (s:ConvShape) (inp:Array Word) (P2:Array Nat) (off:Array UInt32) (wts:Array Word) (W2:Array UInt32) (b:Array Word) (k o cw y x:Nat) (pb wa:USize) (B0:UInt64) (hk:k<1048576) (hoff:off.size=k) (hix:∀ t,t pb.toNat+(off[t]!).toNat wa.toNat+t(P2.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (uix _ _ _ (by rw [ox];exact hix _ (uk ht hk)))).toUInt64) (λ t ht=>(W2.uget (wa+t) (uix _ _ _ (hW _ (uk ht hk)))).toUInt64) B0 b[o]! 0 0 0 if v<0x100000000 then v.toUInt32 else if zW s inp wts b k o cw y x 0 (k+1) then 0x80000000 else 0 lemma ugn {α:Type} [Inhabited α] (A:Array α) (i:USize) (h:i܅ q܅+(f[t]!)؆ r܅+t l[q܅+(f[t]!)؆]! = YV (windowAt s d y x (g+t)) e) (F:∀ t,t p[r܅+t]! = Y4 a[o*k+t]! (YG (Yc a k o) b[o]! e)) (G:d؝<4294967296) (B:o*k+k<=a؝/\a؝<4294967296) (C:UInt64) (I:C=e+YG (Yc a k o) b[o]! e) : Ybj s d l f a p b k o g y x q r C u D v w = dotOf (k+1) (λ t=>if tif t>>16))˥:=by unfold YU;rw[ξ _ _ M] set P:=YG (Yc a k o) b[o]! e with h5;have Zh:∃ Q,Q<=6/\(Yk (K&&&0xFFFF))˥-e˥+Q<=31 /\ (∀ t,t mantOf a[o*k+t]! = 0\/(P˥<=idxOf a[o*k+t]! /\ idxOf a[o*k+t]! - P˥<=Q))/\(∀ t,t expOf a[o*k+t]! ≠ 255) /\ (e+P)˥=e˥+P˥:=by by_cases R:Yc a k o>>>16=511 . simp only[R,if_true,decide_eq_true_eq]at O;obtain⟨L,H,hb,-,hH,h4⟩:=Zp a k o B.1 (by omega);obtain⟨u1,u2⟩:=Zo _ L H hb (by omega);rw[R]at u1;have he:H≠255:=λ h=>c3 (φ.mp (by rw[u2,h];rfl));have hd:=ZM b[o]!;have:=Zg b[o]!;have:=(ZO).2;have z:∀ t,t mantOf a[o*k+t]! = 0/\expOf a[o*k+t]! ≠ 255:=λ t J=>by obtain⟨k1,k2⟩:=h4 t J;obtain⟨-,-,k3,k4⟩:=Zb a[o*k+t]!;exact⟨by by_contra hm;have:=(k4 hm).1;simp at u1;omega,k3 (by omega)⟩ refine⟨0,by omega,by omega,λ t J=>AJ (z t J).1,λ t J=>(z t J).2,?_⟩;simp only[h5,YG,R,beq_self_eq_true,if_true];rw[δ,ξ _ _ O];omega . simp only[R,if_false,Ε,decide_eq_true_eq]at O;obtain⟨⟨d1,d2⟩,d3⟩:=O;obtain⟨X,ws,wm5,wfin⟩:=Zbt a k o B.1 (by omega) c3 d1 have e3:=σ.mp d2;have e4:=σ.mp d3;rw[δ,ξ _ _ (Cb T M)]at e4;simp only[show(31:UInt64)˥=31 from rfl,show(6:UInt64)˥=6 from rfl]at e3 e4 have ew:P=Yk (Yc a k o>>>16):=by simp[h5,YG,R] rw[ew];exact⟨_,e3,by omega,X,wfin,by rw[δ];omega⟩ obtain⟨Q,k6,ks,X,wfin,hB⟩:=Zh;refine ZdJ k _ _ (λ t=>windowAt s d y x (g+t)) (λ t=>a[o*k+t]!) e _ ((Yk (K&&&0xFFFF))˥-e˥) Q (by omega) k6 (by omega) ?_ ?_ (λ t _=>?_) X hB b[o]! (λ t _=>?_) wfin c9 (λ h=>⟨(h6 h).1,by have:=(h6 h).2;omega⟩) rotate_left 2 . rcases ZbC s d y x (g+t) with h | ⟨j,Y,h⟩<;>rw[h] . exact AJ rfl . rcases V j Y with Z | Z<;>simp only[ι]at Z . exact AJ Z . right;omega . rcases ZbC s d y x (g+t) with h | ⟨j,Y,h⟩<;>rw[h] . decide . exact xfin j Y . intro t J;have S:=uk J u;have h1:=v _ S;rw[ugn l _ _ _ (by rw[Zc _ _ (by rw[ox];have:=π;omega),ox]),E _ S] . intro t J;have S:=uk J u;have h1:=w _ S;rw[ugn p _ _ _ (Zc _ _ (by have:=π;omega)),F _ S] lemma Z4 {a:USize} {n:Nat} (h:aomega);rw[g,f]at u;cases a . simp only[η,if_false,ι]at h ⊢;rw[USize.zero_add,u] . simp only[if_true]at h ⊢;rw[Zc _ _ (by rw[um _ _ (by rw[e];omega),u,e];have:=π;omega),um _ _ (by rw[e];omega),u,e] lemma ZbE (b:Bool) (s:ConvShape) (a:Array Word) (k o y x t:Nat) (j:k=if b then s.kh*s.kw else s.cin*s.kh*s.kw) (d:s.kh<=Yb s) (e:s.kw<=Ya s) (l:b -> o Y4 wts[t.val]! (YG BW[t.val/k]! b[t.val/k]! xm) else let ku := k.toUSize YO 1 ku (λ o _ j => let i := o * ku + j Y4 (if h : i.toNat < wts.size then wts.uget i h else 0) (YG (if h : o.toNat < BW.size then BW.uget o h else 0) (if h : o.toNat < b.size then b.uget o h else 0) xm)) wts.size.toUSize 0 0 0 (Aj wts.size) lemma YW2g {α:Type} [Inhabited α] (A:Array α) (i:USize) (n:Nat) (e:i.toNat = n) (d:α) (a:d = default) : (if h : i.toNat < A.size then A.uget i h else d) = A[n]! := by subst e; split · rename_i h; rw [getElem!_pos A _ h]; rfl · rename_i h; rw [getElem!_neg A _ h, a] lemma YW2e (a:Array Word) (d:Array UInt32) (b:Array Word) (f:UInt64) (k:Nat) (g:a.size < 4294967296) (e:k < 4294967296) : YW2 a d b f k = Aa (n:=a.size) λ t => Y4 a[t.val]! (YG d[t.val/k]! b[t.val/k]! f) := by unfold YW2 split · rfl · rename_i l have h : k.toUSize.toNat = k := Za k e rw [Zby 1 k.toUSize _ (by simp) (by rw [h]; omega) a.size _ g] refine congrArg _ (funext λ q => ?_) have s := q.isLt simp only [h, Β, Ξ] have j : (q.val/k).toUSize.toNat = q.val/k := Za _ (by have := AL q.val k; omega) have o : (q.val%k).toUSize.toNat = q.val%k := Za _ (by have := Nat.mod_le q.val k; omega) have p : q.val/k*k + q.val%k = q.val := by rw [Ϫ]; exact Ϲ q.val k have r : ((q.val/k).toUSize * k.toUSize + (q.val%k).toUSize).toNat = q.val := by rw [Cc, Bn, j, h, o, γ (lt_of_lt_of_le (show q.val/k*k < 4294967296 by omega) π), γ (lt_of_lt_of_le (show q.val/k*k + q.val%k < 4294967296 by omega) π), p] congr 1 · exact YW2g a _ q.val r 0 rfl · congr 1 · exact YW2g d _ (q.val/k) j 0 rfl · exact YW2g b _ (q.val/k) j 0 rfl @[inline] def YwV (w:Word) (m:UInt64):UInt64:=YaJ w m+0x8000000000000000 lemma tw3m (p W:Int) (b : -2^21<=p) (d:p<2^21) (a : -2^30nlinarith lemma tw3 (x w:UInt32) (a d:UInt64) (e f:Nat) (g:e<=39) (j:f<=6) (k:mantOf x=0\/(a˥<=idxOf x/\idxOf x-a˥<=e)) (l:mantOf w=0\/(d˥<=idxOf w/\idxOf w-d˥<=f)) (v b:UInt64) (n:v=YwV x a) (o:b=(Y4 w d)،) : Ye ((v&&&0x1FFFFF)؍،*(b-0x80000000))+2^21*Ye (((v>>>21)&&&0x1FFFFF)؍،*(b-0x80000000))+2^42*Ye (((v>>>42)؍،-0x200000)*(b-0x80000000))=sv x*sv w*2^(idxOf x+idxOf w-(a˥+d˥)) /\ -2^51>>21)&&&0x1FFFFF)؍،*(b-0x80000000)) /\ Ye (((v>>>21)&&&0x1FFFFF)؍،*(b-0x80000000))<2^51 /\ -2^51>>42)؍،-0x200000)*(b-0x80000000)) /\ Ye (((v>>>42)؍،-0x200000)*(b-0x80000000))<2^51:=by obtain⟨A,s⟩:=sgv x a e g k;obtain⟨F,t⟩:=sgv w d f (by clear * - j;omega) l generalize G:sv x*2^(idxOf x-a˥)=X at A s;generalize H:sv w*2^(idxOf w-d˥)=W at F t rw[abs_lt]at s t have I : -2^63<=X/\X<2^63:=by have:(2:Int)^(24+e)<=2^63:=pow_le_pow_right₀ (by norm_num) (Cr g 24);exact⟨by linarith only [s.1,this],by linarith only [s.2,this]⟩ have r : -2^30>>21)&&&0x1FFFFF)؍،)˥=v˥/2^21%2^21:=by rw[Γ,Τ,AW,show(0x1FFFFF:UInt64)˥=2^21-1 from rfl,Θ,τ,show(21:UInt64)˥%64=21 from rfl,ν];clear * - p;omega have M:((v>>>42)؍،)˥=v˥/2^42:=by rw[Γ,Τ,τ,show(42:UInt64)˥%64=42 from rfl,ν];clear * - p;omega have B:Ye ((v&&&0x1FFFFF)؍،)=((v˥%2^21:Nat):Int):=svz _ _ (by clear * - p;omega) (by clear * - p;omega) (by rw[K];simp) have C:Ye (((v>>>21)&&&0x1FFFFF)؍،)=((v˥/2^21%2^21:Nat):Int):=svz _ _ (by clear * - p;omega) (by clear * - p;omega) (by rw[L];simp) have D:Ye (((v>>>42)؍،)-0x200000)=((v˥/2^42:Nat):Int)-2^21:=svz _ _ (by clear * - p;omega) (by clear * - p;omega) (by rw[ω,M,show(0x200000:UInt64)˥=2^21 from rfl];push_cast;clear * - p;omega) have u:=tw3m ((v˥%2^21:Nat):Int) W (by clear * - p;omega) (by clear * - p;omega) r have y:=tw3m ((v˥/2^21%2^21:Nat):Int) W (by clear * - p;omega) (by clear * - p;omega) r have z:=tw3m (((v˥/2^42:Nat):Int)-2^21) W (by clear * - p;omega) (by clear * - p;omega) r rw[svm _ _ (by rw[B,q];linarith only [u.1]) (by rw[B,q];linarith only [u.2]),svm _ _ (by rw[C,q];linarith only [y.1]) (by rw[C,q];linarith only [y.2]),svm _ _ (by rw[D,q];linarith only [z.1]) (by rw[D,q];linarith only [z.2]),B,C,D,q] refine⟨?_,u.1,u.2,y.1,y.2,z.1,z.2⟩ have N:((v˥%2^21:Nat):Int)+2^21*((v˥/2^21%2^21:Nat):Int)+2^42*(((v˥/2^42:Nat):Int)-2^21)=X:=by clear * - J p;omega rw[show ((v˥%2^21:Nat):Int)*W+2^21*(((v˥/2^21%2^21:Nat):Int)*W)+2^42*((((v˥/2^42:Nat):Int)-2^21)*W)=X*W by rw[<- N];ring,<- G,<- H] by_cases E:mantOf x*mantOf w=0 . rcases ϛ.mp E with h | h<;>simp[sv,h] . have O:=k.resolve_left (λ h=>E (by simp[h]));have P:=l.resolve_left (λ h=>E (by simp[h]));rw[show idxOf x+idxOf w-(a˥+d˥)=(idxOf x-a˥)+(idxOf w-d˥) by clear * - O P;omega,pow_add] ring @[inline] def Y5t (B0:UInt64) (bw:UInt32) (hi lo:UInt64):UInt64 := let s:=Yd bw+126-B0 if (Yf bw==0||s<=78)&&B0<=1000 then let m:=Yf bw<<<23 let bh:=if s<64 then (m>>>1)>>>(63-s) else m<<<(s-64) let bl:=if s<64 then m<<>>63) if (t0|||t1|||t2)==0 then 0x100000000 else (YaT t2 t1 t0 ((B0.toNat:Int)-298) false true (B0-298)).toUInt64 else YL B0 oneW bw ((0:UInt64)-(hi>>>63)) hi lo 0 λ v2 v1 v0 c' => YD v2 v1 v0 c' ((B0.toNat:Int)-298) @[specialize] def Y53 (n:USize) (f0 f1 f2 fb:(t:USize) -> t UInt64) (B0:UInt64) (bw:UInt32) (a0 a1 a2:UInt64) (k:USize):UInt64 := if h:k>>63))+((a1>>>43)+(((0:UInt64)-(a1>>>63))<<<21))+(if a0+(a1<<<21)>>22)+(((0:UInt64)-(a2>>>63))<<<42))+(if a0+(a1<<<21)+(a2<<<42)>>63))˥*2^64+a˥:Nat):Int)%2^128=Ye a%2^128:=by have:=a۾;unfold Ye;simp only[ω,τ,ν];norm_num;omega lemma Zs21 (a:UInt64):((((a>>>43)+(((0:UInt64)-(a>>>63))<<<21))˥*2^64+(a<<<21)˥:Nat):Int)%2^128=(2^21*Ye a)%2^128:=by have:=a۾;unfold Ye;simp only[δ,ω,χ,τ,ο,ν];norm_num;omega lemma Zs42 (a:UInt64):((((a>>>22)+(((0:UInt64)-(a>>>63))<<<42))˥*2^64+(a<<<42)˥:Nat):Int)%2^128=(2^42*Ye a)%2^128:=by have:=a۾;unfold Ye;simp only[δ,ω,χ,τ,ο,ν];norm_num;omega lemma ZdI3 (b a d:UInt64):(((((0:UInt64)-(b>>>63))+((a>>>43)+(((0:UInt64)-(a>>>63))<<<21))+(if b+(a<<<21)>>22)+(((0:UInt64)-(d>>>63))<<<42))+(if b+(a<<<21)+(d<<<42)>>63))+((a>>>43)+(((0:UInt64)-(a>>>63))<<<21))+(if b+(a<<<21)>>22)+(((0:UInt64)-(d>>>63))<<<42)) (d<<<42) have f:Co (2^128) _ _:=Y5a ((0:UInt64)-(b>>>63)) b ((a>>>43)+(((0:UInt64)-(a>>>63))<<<21)) (a<<<21) have g:Co (2^128) _ _:=ZsA b;have h:Co (2^128) _ _:=Zs21 a;have j:Co (2^128) _ _:=Zs42 d exact e.trans ((f.trans (g.add h)).add j) lemma Y5tT (b:UInt64) (a:UInt32) (f d:UInt64) (A S:Int) (j:mantOf oneW*mantOf a≠0 -> b˥<=idxOf oneW+idxOf a/\idxOf oneW+idxOf a<=b˥+122) (k : -2^120>>1)>>>(63-s) else (Yf a<<<23)<<<(s-64))=t at o ⊢;generalize (if s<64 then (Yf a<<<23)<<push_cast<;>ring have Q:t˥*2^64+n˥<=2^125:=by rw[o];rcases r with h|⟨M,N,x⟩ . simp[h] . have:=mantOf_lt_24 a;calc mantOf a*2^23*2^s˥<=2^24*2^23*2^78:=AG (μ _ (le_of_lt this)) (κ (by omega) M) _=2^125:=by norm_num have D:((((if signOf a then f-t-(if domega have hSb2:S<2^127:=by rw[g,hbias];split_ifs<;>omega have x:=Zdx q u 0 S rfl D hSb1 hSb2;generalize (0:UInt64)-(q>>>63)=v at x ⊢;unfold Yx at x;have R:=v۾;have T:=q۾;have U:=u۾;have E:YC v q u=S:=Zcp v q u S (by omega) (by omega) (by push_cast at x ⊢;omega) rw[Zcq];by_cases p:S=0 . have:=YCz v q u (by rw[E,p]) rw[if_pos (decide_eq_true this),if_pos p] . have:v˥*2^128+q˥*2^64+u˥≠0:=λ V=>p (by rw[<- E];exact YCn v q u V) rw[if_neg (by simpa using this),if_neg p,Zch _ _ _ _ _ _ _ (Y0k b (by omega)),E] . obtain⟨F,G,H,I,W,-,O⟩:=Zr b oneW a _ _ d 0 (λ F G H I=>YD F G H I ((b˥:Int)-298)) (by simp) (λ h=>⟨(j h).1,by have:=(j h).2;clear * - this;omega⟩) rw[W];have X:=ZL oneW a b˥ j;generalize sv oneW*sv a*2^(idxOf oneW+idxOf a-b˥)=bi at X g O apply ZV F G H I _ S (by omega) (by omega) have Y:=Zdx f d 0 A rfl e (by omega) (by omega) rw[O,Ο,Y,<- Ο,g] lemma ZdJ3 (K:Nat) (n o p q:(t:USize) -> t UInt64) (f j:Nat -> Word) (a e:UInt64) (r s:Nat) (B:r<=39) (C:s<=6) (l:K<4096) (w:∀ t h,n t h=(YwV (f t܅) a&&&0x1FFFFF)؍،) (x:∀ t h,o t h=((YwV (f t܅) a>>>21)&&&0x1FFFFF)؍،) (y:∀ t h,p t h=(YwV (f t܅) a>>>42)؍،) (G:∀ t h,q t h=(Y4 (j t܅) e)،) (D:∀ t,t mantOf (f t)=0\/(a˥<=idxOf (f t)/\idxOf (f t)-a˥<=r)) (E:∀ t,t mantOf (j t)=0\/(e˥<=idxOf (j t)/\idxOf (j t)-e˥<=s)) (F:(a+e)˥=a˥+e˥) (g:UInt32) (H:∀ t,t expOf (f t)≠255) (I:∀ t,t expOf (j t)≠255) (J:expOf g≠255) (z:mantOf oneW*mantOf g≠0 -> (a+e)˥<=idxOf oneW+idxOf g/\idxOf oneW+idxOf g<=(a+e)˥+122) : (if Y53 K؛ n o p q (a+e) g 0 0 0 0<0x100000000 then (Y53 K؛ n o p q (a+e) g 0 0 0 0)؍ else if Yq (λ t=>if tif tif tif t k܅<=K -> -((k܅:Int)*2^51)<=Ye P -> Ye P<=k܅*2^51 -> -((k܅:Int)*2^51)<=Ye Q -> Ye Q<=k܅*2^51 -> -((k܅:Int)*2^51)<=Ye R -> Ye R<=k܅*2^51 -> S=Ye P+2^21*Ye Q+2^42*Ye R+Yr f j (a+e)˥ k܅ (K-k܅)+sv oneW*sv g*2^(idxOf oneW+idxOf g-(a+e)˥) -> -2^191<=S -> S<2^191 -> Y53 K؛ n o p q (a+e) g P Q R k=if S=0 then 0x100000000 else (finishWord S (((a+e)˥:Int)-298) false)،:=by intro d induction d with | zero => intro k P Q R S N Y Z u0 l1 u1 l2 u2 T U V;rw[Y53,dif_neg (by rw[ζ,hc];clear * - N;omega)] have L:(2:Int)^51=2251799813685248:=by norm_num have hk2:(k܅:Int)<=4096:=by clear * - Y l;omega rw[L]at Z u0 l1 u1 l2 u2 exact Y5tT _ _ _ _ (Ye P+2^21*Ye Q+2^42*Ye R) S z (by linarith) (by linarith) (ZdI3 P Q R) (by rw[T,show K-k܅=0 by clear * - N;omega,Yr];ring) | succ d ih => intro k P Q R S N Y Z u0 l1 u1 l2 u2 T U V have hf:k>>21)&&&0x1FFFFF)؍،*(b-0x80000000)) (by rw[M];linarith) (by rw[M];linarith) have c2:=Zbx R (((v>>>42)؍،-0x200000)*(b-0x80000000)) (by rw[M];linarith) (by rw[M];linarith) refine ih (k+1) _ _ _ S (by clear * - N O;omega) (by clear * - N O Y;omega) ?_ ?_ ?_ ?_ ?_ ?_ ?_ U V . rw[c0,O,L];push_cast;linarith . rw[c0,O,L];push_cast;linarith . rw[c1,O,L];push_cast;linarith . rw[c1,O,L];push_cast;linarith . rw[c2,O,L];push_cast;linarith . rw[c2,O,L];push_cast;linarith . rw[T,c0,c1,c2,show K-k܅=(K-(k+1)܅)+1 by clear * - N O;omega,Yr,O,F];linear_combination -1*tq1 have he:∀ t,t mantOf (f t)*mantOf (j t)≠0 -> (a+e)˥<=idxOf (f t)+idxOf (j t) /\ idxOf (f t)+idxOf (j t)<=(a+e)˥+122:=by intro t ht hm;have u:=(D t ht).resolve_left (λ h=>hm (by rw[h,Λ]));have v:=(E t ht).resolve_left (λ h=>hm (by rw[h,Ρ]));rw[F];clear * - u v B C;constructor<;>omega have W:=Zaj f j (a+e)˥ K 0 (λ t _ h2 h3=>he t (by clear * - h2;omega) h3);have hx:=ZL oneW g (a+e)˥ z;generalize T:Yr f j (a+e)˥ 0 K+sv oneW*sv g*2^(idxOf oneW+idxOf g-(a+e)˥)=S have U : -2^191<=S:=by rw[<- T];clear * - W hx l;omega have V:S<2^191:=by rw[<- T];clear * - W hx l;omega have hq:dotOf (K+1) (λ t=>if tif tif tif tby by_cases h:tsimp[h,H,I,J]<;>decide)];congr 1;rw[ZW,Za6 f j K (a+e)˥ oneW g K 0 (by omega) (λ t _ h2 h3=>(he t (by clear * - h2;omega) h3).1)] simp only[ι,Cu,if_false];rw[ZA oneW g (a+e)˥ (λ h=>(z h).1),<- T];ring rw[A K 0 0 0 0 S (by simp) (by simp) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by simp[Ye]) (by rw[<- T];simp[Ye]) U V,hq] by_cases X:S=0 . simp[X,finishWord] . have hh:(finishWord S (((a+e)˥:Int)-298) false)،<0x100000000:=by rw[ς,Γ];exact Ν _ rw[if_neg X,if_pos hh,<- finishWord_scale];have e1:(finishWord S (((a+e)˥:Int)-298) false)،؍=finishWord S (((a+e)˥:Int)-298) false:=by apply φ.mp;simp rw[e1];unfold finishWord;rw[if_neg X,if_neg X,show(-298:Int)+((a+e)˥:Int)=((a+e)˥:Int)-298 by ring] @[specialize] def YO3 (B C:USize) (f:USize -> USize -> USize -> UInt64) (n:USize) (a b c:USize) (acc:Array UInt32):Array UInt32 := if h:n=0 then acc else let v:=f a b c let acc:=((acc.push (v&&&0x1FFFFF)؍).push ((v>>>21)&&&0x1FFFFF)؍).push (v>>>42)؍ if c+1 USize -> USize -> UInt64) (g:0 b܅ c܅ i+n<4294967296 -> (YO3 B C f n؛ a b c k)׆=k׆ ++ (Av i n).flatMap (λ j=>[(f (j/(B܅*C܅))؛ (j/C܅%B܅)؛ (j%C܅)؛&&&0x1FFFFF)؍,((f (j/(B܅*C܅))؛ (j/C܅%B܅)؛ (j%C܅)؛>>>21)&&&0x1FFFFF)؍,(f (j/(B܅*C܅))؛ (j/C܅%B܅)؛ (j%C܅)؛>>>42)؍]):=by intro n;induction n with | zero=>intro i a b c k _ _ _ _;unfold YO3;rw[dif_pos (ώ.mp (by simp))];simp | succ n q => intro i a b c k D t E J;have K:=π;obtain⟨v,w,A⟩:=Za7 a܅ b܅ c܅ B܅ C܅ t E;rw[D]at v w A;have L:a܅<=a܅*(B܅*C܅):=Ω _ (Ϗ g d);have M:b܅<=b܅*C܅:=Ω _ d;have u:∀ (x:USize) (y:Nat),y=x܅ -> y<4294967296 -> y؛=x := λ x y h F=>ώ.mp (by rw[Za _ F,h]) have G:f (i/(B܅*C܅))؛ (i/C܅%B܅)؛ (i%C܅)؛=f a b c:=by rw[u a _ v (by omega),u b _ w (by omega),u c _ A (by omega)] have r:∀ x:USize,x܅<=i -> (x+1)܅=x܅+1:=λ x h=>by rw[Zc _ _ (by simp only[Β];omega),Β] have l:=r c (by omega);have o:=r b (by omega);have H:=r a (by omega);have z:(0:USize)܅=0:=rfl;have p:(n+1)؛܅=n+1:=Za _ (by omega);unfold YO3;rw[dif_neg (λ e=>by rw[e]at p;simp at p),show(n+1)؛-1=n؛ from ώ.mp (by rw[Ao _ _ (Ak.mpr (by rw[p];simp)),p,Za _ (by omega)];simp)] rw[AA,BF,G];dsimp only;split . rename_i h;rw[ζ,l]at h;rw[q (i+1) a b (c+1) _ (by rw[l];omega) t (by rw[l];omega) (by omega)];simp . rename_i h;rw[ζ,l]at h;have I:C܅=c܅+1:=by omega split . rename_i s;rw[ζ,o]at s;rw[q (i+1) a (b+1) 0 _ (by rw[o,z,Η,Ξ];omega) (by rw[o];omega) (by rw[z];omega) (by omega)] simp . rename_i s;rw[ζ,o]at s;have N:B܅*C܅=b܅*C܅+c܅+1:=by rw[show B܅=b܅+1 by omega,Η,I];omega rw[q (i+1) (a+1) 0 0 _ (by rw[H,z,Η,Ξ];omega) (by rw[z];omega) (by rw[z];omega) (by omega)] simp @[inline] def Yu3i (r:Nat) (v:UInt64):UInt32:=if r=0 then (v&&&0x1FFFFF)؍ else if r=1 then ((v>>>21)&&&0x1FFFFF)؍ else (v>>>42)؍ lemma Zfm (F:Nat -> UInt64):∀ N i q,q<3*N -> ((Av i N).flatMap (λ j=>[(F j&&&0x1FFFFF)؍,((F j>>>21)&&&0x1FFFFF)؍,(F j>>>42)؍]))[q]?=some (Yu3i (q%3) (F (i+q/3))):=by intro N;induction N with | zero=>intro i q h;omega | succ N a=> intro i q h;rw[AA,BF] by_cases b:q<3 . rw[List.getElem?_append_left (by simp;omega)];interval_cases q<;>simp[Yu3i] . rw[List.getElem?_append_right (by simp;omega),a (i+1) _ (by simp;omega)];simp only[BN,CN] rw[show (q-(0+1+1+1))%3=q%3 by omega,show i+1+(q-(0+1+1+1))/3=i+q/3 by omega] lemma Zfl (F:Nat -> UInt64):∀ N i,((Av i N).flatMap (λ j=>[(F j&&&0x1FFFFF)؍,((F j>>>21)&&&0x1FFFFF)؍,(F j>>>42)؍])).length=3*N:=by intro N;induction N with | zero=>intro i;simp | succ N a=>intro i;rw[AA,BF,Cx,a];simp;omega lemma Zby3 (B C:USize) (f:USize -> USize -> USize -> UInt64) (a:0Yu3i (q؞%3) (f (q؞/3/(B܅*C܅))؛ (q؞/3/C܅%B܅)؛ (q؞/3%C܅)؛):=by apply BB;rw[ZdK3 B C f a b N 0 0 0 0 _ (by simp) (by simp;omega) (by simp;omega) (by omega)] rw[show (Aj m:Array UInt32)׆=[] from rfl,Ca,CF];apply List.ext_getElem?;intro q;rw[List.getElem?_ofFn] by_cases e:q<3*N . rw[Zfm (λ j=>f (j/(B܅*C܅))؛ (j/C܅%B܅)؛ (j%C܅)؛) N 0 q e,dif_pos e];simp . rw[dif_neg e,List.getElem?_eq_none (by rw[Zfl];omega)] @[inline] def Ybi3 (s:ConvShape) (inp:Array Word) (xm:UInt64):Array UInt32 := YO3 (Yb s).toUSize (Ya s).toUSize (λ c yy xx=>YwV (Ybs s inp c.toNat yy.toNat xx.toNat) xm) (s.cin*(Yb s*Ya s)).toUSize 0 0 0 (Aj (3*(s.cin*(Yb s*Ya s)))) lemma Zbz3 (s:ConvShape) (a:Array Word) (b:UInt64) (d:0Yu3i (q؞%3) (YwV (YI s a (q؞/3)) b):=by have g:0by simp[h]at d);have j:0by simp[h]at d);have o:Yb s<=Yb s*Ya s:=Ω _ j;have p:Ya s<=Yb s*Ya s:=ϰ _ g;have k:(Yb s)؛܅=Yb s:=Za _ (by omega);have l:(Ya s)؛܅=Ya s:=Za _ (by omega);unfold Ybi3;rw[Zby3 _ _ _ (by rw[k];omega) (by rw[l];omega) _ _ e];refine congrArg _ (funext λ q=>?_);have r:q؞/3>>16) && Yk (bp>>>16)<=Yk (bp&&&0xFFFF)&&Yk (bp&&&0xFFFF)-xm<=39 && (if bv>>>16==511 then xm<=xb else Yk (bv>>>16)<=Yk (bv&&&0xFFFF)&&YU bv<=6)&&expOf bw != 255 && (Yf bw==0||(xm+YG bv bw xm<=xb&&xb-(xm+YG bv bw xm)<80)) @[inline] def Ybj3 (s:ConvShape) (inp:Array Word) (P3 off:Array UInt32) (wts:Array Word) (W2:Array UInt32) (b:Array Word) (k o cw y x:Nat) (pb wa:USize) (B0:UInt64) (hk:k<1048576) (hoff:off.size=k) (hix:∀ t,t pb.toNat+(off[t]!).toNat+2 wa.toNat+t(P3.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize) (uix _ _ _ (by rw [ox];have:=hix _ (uk ht hk);omega))).toUInt64) (λ t ht=>(P3.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize+1) (uix _ _ _ (by rw [Zc _ _ (by rw [ox];have:=hix _ (uk ht hk);have:=π;omega),ox,Β];have:=hix _ (uk ht hk);omega))).toUInt64) (λ t ht=>(P3.uget (pb+(off.uget t (by rw [hoff];exact uk ht hk)).toUSize+2) (uix _ _ _ (by rw [Zc _ _ (by rw [ox];have:=hix _ (uk ht hk);have:=π;omega),ox,show(2:USize)܅=2 by simp];have:=hix _ (uk ht hk);omega))).toUInt64) (λ t ht=>(W2.uget (wa+t) (uix _ _ _ (hW _ (uk ht hk)))).toUInt64) B0 b[o]! 0 0 0 0 if v<0x100000000 then v.toUInt32 else if zW s inp wts b k o cw y x 0 (k+1) then 0x80000000 else 0 lemma ZdN3 (s:ConvShape) (d:Array Word) (g:Array UInt32) (e:Array UInt32) (a:Array Word) (p:Array UInt32) (b:Array Word) (k o l y x:Nat) (q v:USize) (f:UInt64) (r:k<1048576) (G:e؝=k) (u:∀ t,t q܅+(e[t]!)؆+2 v܅+t g[q܅+(e[t]!)؆]! = (YwV (windowAt s d y x (l+t)) f&&&0x1FFFFF)؍) (A:∀ t,t g[q܅+(e[t]!)؆+1]! = ((YwV (windowAt s d y x (l+t)) f>>>21)&&&0x1FFFFF)؍) (B:∀ t,t g[q܅+(e[t]!)؆+2]! = (YwV (windowAt s d y x (l+t)) f>>>42)؍) (I:∀ t,t p[v܅+t]! = Y4 a[o*k+t]! (YG (Yc a k o) b[o]! f)) (J:d؝<4294967296) (E:o*k+k<=a؝/\a؝<4294967296) (F:UInt64) (K:F=f+YG (Yc a k o) b[o]! f) : Ybj3 s d g e a p b k o l y x q v F r G u C = dotOf (k+1) (λ t=>if tif t>>16))˥:=by unfold YU;rw[ξ _ _ P] set S:=YG (Yc a k o) b[o]! f with h5;have Zh:∃ U,U<=6/\(∀ t,t mantOf a[o*k+t]! = 0\/(S˥<=idxOf a[o*k+t]! /\ idxOf a[o*k+t]! - S˥<=U))/\(∀ t,t expOf a[o*k+t]! ≠ 255) /\ (f+S)˥=f˥+S˥:=by by_cases T:Yc a k o>>>16=511 . simp only[T,if_true,decide_eq_true_eq]at R;obtain⟨L,H,hb,-,hH,h4⟩:=Zp a k o E.1 (by omega);obtain⟨u1,u2⟩:=Zo _ L H hb (by omega);rw[T]at u1;have he:H≠255:=λ h=>c3 (φ.mp (by rw[u2,h];rfl));have hd:=ZM b[o]!;have:=Zg b[o]!;have:=(ZO).2;have z:∀ t,t mantOf a[o*k+t]! = 0/\expOf a[o*k+t]! ≠ 255:=λ t M=>by obtain⟨k1,k2⟩:=h4 t M;obtain⟨-,-,k3,k4⟩:=Zb a[o*k+t]!;exact⟨by by_contra hm;have:=(k4 hm).1;simp at u1;omega,k3 (by omega)⟩ refine⟨0,by omega,λ t M=>AJ (z t M).1,λ t M=>(z t M).2,?_⟩;simp only[h5,YG,T,beq_self_eq_true,if_true];rw[δ,ξ _ _ R];omega . simp only[T,if_false,Ε,decide_eq_true_eq]at R;obtain⟨d1,d2⟩:=R;obtain⟨Z,ws,wm5,wfin⟩:=Zbt a k o E.1 (by omega) c3 d1 have e3:=σ.mp d2;simp only[show(6:UInt64)˥=6 from rfl]at e3 have ew:S=Yk (Yc a k o>>>16):=by simp[h5,YG,T] rw[ew];exact⟨_,e3,Z,wfin,by rw[δ];omega⟩ obtain⟨U,k6,Z,wfin,hB⟩:=Zh;refine ZdJ3 k _ _ _ _ (λ t=>windowAt s d y x (l+t)) (λ t=>a[o*k+t]!) f _ ((Yk (O&&&0xFFFF))˥-f˥) U (by omega) k6 (by omega) ?_ ?_ ?_ ?_ (λ t _=>?_) Z hB b[o]! (λ t _=>?_) wfin c9 (λ h=>⟨(h6 h).1,by have:=(h6 h).2;omega⟩) rotate_left 4 . rcases ZbC s d y x (l+t) with h | ⟨j,hj,h⟩<;>rw[h] . exact AJ rfl . rcases X j hj with h' | h'<;>simp only[ι]at h' . exact AJ h' . right;omega . rcases ZbC s d y x (l+t) with h | ⟨j,hj,h⟩<;>rw[h] . decide . exact xfin j hj . intro t M;have N:=uk M r;have h1:=u _ N;rw[ugn g _ _ _ (by rw[Zc _ _ (by rw[ox];have:=π;omega),ox]),w _ N] . intro t M;have N:=uk M r;have h1:=u _ N;rw[ugn g _ _ _ (by rw[Zc _ _ (by rw[Zc _ _ (by rw[ox];have:=π;omega),ox,Β];have:=π;omega),Zc _ _ (by rw[ox];have:=π;omega),ox,Β]),A _ N] . intro t M;have N:=uk M r;have h1:=u _ N;rw[ugn g _ _ _ (by rw[Zc _ _ (by rw[Zc _ _ (by rw[ox];have:=π;omega),ox,show(2:USize)܅=2 by simp];have:=π;omega),Zc _ _ (by rw[ox];have:=π;omega),ox,show(2:USize)܅=2 by simp]),B _ N] . intro t M;have N:=uk M r;have h1:=C _ N;rw[ugn p _ _ _ (Zc _ _ (by have:=π;omega)),I _ N] lemma pb3 (s:ConvShape) (y x:USize) (a:0(3*Ys s t؞).toUInt32)[t]!)؆=3*Ys s t:=by simp_all @[inline] def Yw3k (s:ConvShape) (relu:Bool) (inp wts b:Array Word) (k C:Nat) (hk:k=s.cin*s.kh*s.kw) (hC:C=s.cout) : Array Word := let off:Array UInt32:=Aa (n:=k) λ t=>(3*Ys s t.val).toUInt32 let bp:=Yc inp inp.size 0 let BW:Array UInt32:=Aa (n:=C) λ o=>Yc wts k o.val let xm:=Ybh bp BW b if hg:s.kh<=Yb s/\s.kw<=Ya s/\0Ybw BW[o]! b[o]! bp k xm) then let P3:=Ybi3 s inp xm let W2:Array UInt32:=Aa (n:=wts.size) λ t => Y4 wts[t.val]! (YG BW[t.val/k]! b[t.val/k]! xm) have hP3:P3.size=3*(s.cin*(Yb s*Ya s)):=by simp only [P3];rw [Zbz3 s inp xm hg.2.2.1 (by omega) (by omega),Al] have a:=cfa s C hg.2.2.1 let B0s:Array UInt64:=Aa (n:=C) λ o=>xm+YG BW[o.val]! b[o.val]! xm let st:=s.stride.toUSize let wp:=(Ya s).toUSize let ku:=k.toUSize YO s.ho.toUSize s.wo.toUSize (λ o y x => if h:oby obtain ⟨w1,-⟩:=ZbE false s inp k o.toNat y.toNat x.toNat t (by rw[hk];rfl) hg.1 hg.2.1 (by intro d;cases d) (Z4 h.2.1 (by omega)) (Z4 h.2.2 (by omega)) ht simp only[η,if_false,ι]at w1 rw [pb3 s y x hg.2.2.1 (by omega) (by omega),hP3,ZD3 s _ t ht (by omega)];omega) (λ t ht=>by have:=μ k (show o.toNat+1<=C from Z4 h.1 (by omega)) rw [Η,Ξ] at this rw [um _ _ (by rw [Za _ (by omega)];omega),Za _ (by omega)] simp only [W2,Al];omega)) else 0) (C*(s.ho*s.wo)).toUSize 0 0 0 (Aj (C*(s.ho*s.wo))) else Ya0 s relu inp wts b def Yw3 (s:ConvShape) (relu:Bool) (inp wts b:Array Word):Array Word:=Yw3k s relu inp wts b _ _ rfl rfl @[inline] def Yq5 (fast neg:Bool) (bh bl B0:UInt64) (bw:UInt32) (a0 a1:UInt64):UInt64 := if fast then let l:=a1<<<25 let lo:=l+a0 let hi:=(a1>>>39)+(((0:UInt64)-(a1>>>63))<<<25)+((0:UInt64)-(a0>>>63))+(if lo < l then (1:UInt64) else 0) let t0:=if neg then lo-bl else lo+bl let t1:=if neg then hi-bh-(if lo < bl then 1 else 0) else hi+bh+(if lo+bl < lo then 1 else 0) let t2:=(0:UInt64)-(t1>>>63) if (t0|||t1|||t2)==0 then 0x100000000 else (YaTT t2 t1 t0 (λ _=>((B0.toNat:Int)-298)) false true (B0-298)).toUInt64 else Y5f B0 bw a0 a1 lemma ugm {α:Type} [Inhabited α] (A:Array α) (i:USize) (h:i܅(rw[Zc _ _ (by (try rw[b]);(try rw[d]);simp;omega)];(try rw[b]);(try rw[d]);simp) lemma Yj9 (j:USize) (h:j܅+9<4294967296) : (j+1)܅=j܅+1/\(j+2)܅=j܅+2/\(j+3)܅=j܅+3/\(j+4)܅=j܅+4/\(j+5)܅=j܅+5/\(j+6)܅=j܅+6/\(j+7)܅=j܅+7/\(j+8)܅=j܅+8:=by have a:=π refine⟨?_,?_,?_,?_,?_,?_,?_,?_⟩<;>rw[Zc _ _ (by simp;omega)]<;>simp lemma Yn1 (t n:USize) (i:Nat) (h:t܅=i) (d:iexact uix _ _ _ ⟨by simp;omega,d⟩ lemma Yu9 (r w:USize) (n:Nat) (h:r܅+2*w܅+2 c T[p]!+c*hw܅+2*wp܅+2 j0܅+9*c+9<=W؝) (hW2:∀ c,c j20܅+9*c+9<=W؝) (hT:n܅<=T؝) (hS:P؝+hw܅+W؝<4294967296) (acc acc2:Array Word) (p c r j j2:USize) (hp:p c T[p]!+c*hw܅+2*wp܅+2 j0܅+9*c+9<=W؝) (hT:n܅<=T؝) (hS:P؝+hw܅+W؝<4294967296) (acc:Array Word) (p c r j:USize) (hp:p c T[p]!+c*hw܅+2*wp܅+2 c o*k+9*c+9<=W؝) (hT:n܅<=T؝) (hS:P؝+hw܅+W؝<4294967296) (o:Nat) (acc:Array Word):Array Word := if ho:o>>1)>>>(63-sh) else m<<<(sh-64)) (if sh < 64 then m<<>>1)>>>(63-sh1) else m1<<<(sh1-64)) (if sh1 < 64 then m1<<by rw[e1];exact hW o c ho hc) (λ c hc=>by rw[e2];exact hW (o+1) c h2 hc) hT hS acc (Aj n܅) 0 0 ((T.uget 0 (by simp;omega))؛) (o*k)؛ ((o+1)*k)؛ (ζ.mpr (by simpa using h0)) (by have:=hB 0 0 h0 hn;rw[ugm,Za _ (by simp;omega)];simp) (by simp) (by simp) 0 0 0 0) else Yt3f s relu inp wts b k o P T W hw wp nc n ((Yf bw==0||sh<=78)&&B0<=1000) (signOf bw) (if sh < 64 then (m>>>1)>>>(63-sh) else m<<<(sh-64)) (if sh < 64 then m<<by rw[e1];exact hW o c ho hc) hT hS acc 0 0 ((T.uget 0 (by simp;omega))؛) (o*k)؛ (ζ.mpr (by simpa using h0)) (by have:=hB 0 0 h0 hn;rw[ugm,Za _ (by simp;omega)];simp) (by simp) 0 0 else acc termination_by C-o lemma YsT (s:ConvShape) (a:s.kh=3) (b:s.kw=3) (t:Nat):Ys s t=t/9*(Yb s*Ya s)+t/3%3*Ya s+t%3:=by simp only [Ys,a,b] @[inline] def Ytb (s:ConvShape):Array Nat:=YO s.ho؛ s.wo؛ (λ _ y x=>y܅*s.stride*Ya s+x܅*s.stride) (s.ho*s.wo)؛ 0 0 0 (Aj (s.ho*s.wo)) lemma YtbE (s:ConvShape) (h:s.ho*s.wo<4294967296):(Ytb s)؝=s.ho*s.wo/\∀ p,p (Ytb s)[p]! = p/s.wo*s.stride*Ya s+p%s.wo*s.stride:=by have b:=ZG s have a:s.ho<4294967296:=by have:=Ω s.ho b.2;omega have d:s.wo<4294967296:=by have:=ϰ s.wo b.1;omega unfold Ytb;rw[Zby _ _ _ (by rw[Za _ a];exact b.1) (by rw[Za _ d];exact b.2) _ _ h] refine⟨Al,λ p e=>?_⟩ have y:p/s.wo(q/s.wo؛܅%s.ho؛܅)؛܅*s.stride*Ya s+(q%s.wo؛܅)؛܅*s.stride) _ e] simp only [Za _ a,Za _ d,γ y] rw[Za _ (by omega),Za _ (by have:=Ζ p b.2;omega)] @[noinline] def Yt3w (s:ConvShape) (relu:Bool) (inp wts b:Array Word) (k C:Nat) (P:Array Nat) (W:Array UInt32) (xm:UInt64) (BW:Array UInt32) (hk:k=s.cin*s.kh*s.kw) (hC:C=s.cout) (e1:s.kh=3) (e2:s.kw=3) (g1:s.kh<=Yb s) (g2:s.kw<=Ya s) (g4:9<=k) (g8:k<256) (g5:C*k<=W؝) (g6:P؝=s.cin*(Yb s*Ya s)) (g7:P؝+Yb s*Ya s+W؝+C*(s.ho*s.wo)+s.ho*s.wo+s.stride<=4294967295):Array Word := have hz:=ZG s have L:∀ {a b c d e f:Nat},a+b+c+d+e+f<=4294967295 -> b<4294967296/\e<4294967296/\a+b+c<4294967296/\d<4294967296:=by clear * -;intros;omega have h7:=L g7 have kN:k<4294967296:=Ae g8 (by decide) have a:=cfa s C (Ϗ (Ad (show 0<3 by decide) (show 3<=Yb s from e1▸g1)) (Ad (show 0<3 by decide) (show 3<=Ya s from e2▸g2))) have hT:=YtbE s h7.2.1 Yt3c s relu inp wts b k C P (Ytb s) W (Yb s*Ya s)؛ (Ya s)؛ (k/9)؛ (s.ho*s.wo)؛ xm BW (by rw[Za _ (ϸ (AL _ _) kN)];exact Nat.div_pos g4 (by decide)) (by rw[Za _ h7.2.1];exact Ϗ hz.1 hz.2) (ϸ a.2.2.1 h7.2.2.2) (λ p c hp hc=>by rw[Za _ h7.2.1] at hp;rw[Za _ (ϸ (AL _ _) kN)] at hc;rw[Za _ h7.1,Za _ (ϸ a.2.2.2 h7.1),hT.2 p hp] have y:p/s.woby rw[Za _ (ϸ (AL _ _) kN)] at hc;have:=μ k (show o+1<=C from ho);rw[Η,Ξ] at this;clear * - this g5 hc;omega) (by rw[hT.1,Za _ h7.2.1]) (by rw[Za _ h7.1];exact h7.2.2.1) 0 (Aj (C*(s.ho*s.wo))) @[inline] def cdQ (dw:Bool) (s:ConvShape) (relu:Bool) (inp wts b:Array Word) (k C:Nat) (hk:k=if dw then s.kh*s.kw else s.cin*s.kh*s.kw) (hC:C=if dw then s.cin else s.cout) : Array Word := let off:Array UInt32:=Aa (n:=k) λ t=>(Ys s t.val).toUInt32 let bp:=Yc inp inp.size 0 let BW:Array UInt32:=Aa (n:=C) λ o=>Yc wts k o.val let xm:=Ybh bp BW b if hg:s.kh<=Yb s/\s.kw<=Ya s/\0Ybg BW[o]! b[o]! bp k xm) then have L:∀ {a b c d e f g:Nat},a+b+c+d+e+f+g<=4294967295 -> a<4294967296/\b<4294967296/\c<4294967296/\d<4294967296/\e<4294967296/\f<4294967296/\b+g<4294967296/\a+b+d+e+f+g<=4294967295:=by clear * -;intros;omega have hb:=L hg.2.2.2.2.2.1 have kN:k<4294967296:=Ae hg.2.2.2.1 (by decide) let P2:=Ybi s inp xm let W2:Array UInt32:=YW2 wts BW b xm k have hP2:P2.size=s.cin*(Yb s*Ya s):=by simp only [P2];rw [Zbz s inp xm hg.2.2.1 hb.1 hb.2.1,Al] if h3:(s.kh==3&&s.kw==3&&!dw&&decide (9<=k))=true then have e:((s.kh=3/\s.kw=3)/\dw=false)/\9<=k:=by simpa only [Ε,beq_iff_eq,decide_eq_true_eq,AD] using h3 Yt3w s relu inp wts b k C P2 W2 xm BW (by rw[hk,e.1.2];rfl) (by rw[hC,e.1.2];rfl) e.1.1.1 e.1.1.2 hg.1 hg.2.1 e.2 hg.2.2.2.1 (by simp only [W2,YW2e wts BW b xm k hb.2.2.2.1 kN,Al];exact hg.2.2.2.2.1) hP2 (by simp only [W2,YW2e wts BW b xm k hb.2.2.2.1 kN,Al];rw[hP2];exact hb.2.2.2.2.2.2.2) else have a:=cfa s C hg.2.2.1 have cN:C<4294967296:=ϸ a.2.2.1 hb.2.2.2.2.1 have hoN:s.ho<4294967296:=ϸ a.1 hb.2.2.2.2.2.1 have woN:s.wo<4294967296:=ϸ a.2.1 hb.2.2.2.2.2.1 let B0s:Array UInt64:=Aa (n:=C) λ o=>xm+YG BW[o.val]! b[o.val]! xm let hw:=(Yb s*Ya s).toUSize let st:=s.stride.toUSize let wp:=(Ya s).toUSize let ku:=k.toUSize YO s.ho.toUSize s.wo.toUSize (λ o y x => if h:oby obtain ⟨w1,-⟩:=ZbE dw s inp k o.toNat y.toNat x.toNat t hk hg.1 hg.2.1 (by intro d;subst d hC;simpa using Z4 h.1 cN) (Z4 h.2.1 hoN) (Z4 h.2.2 woN) ht rw [pbN dw s o y x hg.2.2.1 hb.2.2.2.2.2.2.1 (ϸ (ϝ _ _) (Ae w1 hb.1)),hP2,ZD s _ t ht (ϸ (AM _ _) (Ae w1 hb.1))];exact ⟨w1,hb.1⟩) (λ t ht=>by have:=Am (μ k (show o.toNat+1<=C from Z4 h.1 cN)) hg.2.2.2.2.1 rw [Η,Ξ] at this rw [um _ _ (by rw [Za _ kN];exact ϸ (Am (ϝ _ _) this) hb.2.2.2.1),Za _ kN] simp only [W2,YW2e wts BW b xm k hb.2.2.2.1 kN,Al];exact ⟨Ad (ϧ ht _) this,hb.2.2.2.1⟩)) else 0) (C*(s.ho*s.wo)).toUSize 0 0 0 (Aj (C*(s.ho*s.wo))) else if dw then dwF s relu inp wts b else Yw3 s relu inp wts b lemma ZdO (d:Bool) (s:ConvShape) (a:Bool) (e f b:Array Word) (k C:Nat) (g:k=if d then s.kh*s.kw else s.cin*s.kh*s.kw) (h:C=if d then s.cin else s.cout) : (if d then depthwiseSpec else conv2dSpec) s a e f b=Aa (n:=C*(s.ho*s.wo)) λ q=>act a (dotOf (k+1) (λ t=>if tif tsimp[depthwiseSpec,depthwiseWith,conv2dSpec,conv2dWith] lemma Yq5e (b:UInt64) (a:UInt32) (d e:UInt64) : Yq5 ((Yf a==0||Yd a+126-b<=78)&&b<=1000) (signOf a) (if Yd a+126-b < 64 then ((Yf a<<<23)>>>1)>>>(63-(Yd a+126-b)) else (Yf a<<<23)<<<(Yd a+126-b-64)) (if Yd a+126-b < 64 then (Yf a<<<23)<<<(Yd a+126-b) else 0) b a d e = Y5g b a d e := by unfold Yq5 Y5g; rfl lemma Yr1 (n:USize) (a b:(t:USize) -> t UInt64) (d:UInt64) (e:UInt32) (f g:UInt64) (t:USize) (h:t t UInt64) (a:UInt64) (b:UInt32) (d e:UInt64) (t:USize) (h:¬t Nat -> α) (o M a:Nat) (b:0H o q.val) ++ Bt (n:=M*a) (λ q=>H (o+1+q.val/a) (q.val%a)) = Bt (n:=(M+1)*a) (λ q=>H (o+q.val/a) (q.val%a)) := by apply Ap (by simp only [Cx, As, Bq]; omega) intro d g h rw [List.getElem_append] simp only [As, Aq] split . rename_i e; rw [Α e, γ e, ϯ] . rename_i f obtain ⟨r, rfl⟩ : ∃ r, d = r + a := ⟨d - a, by omega⟩ rw [By, BE _ b, Nat.add_mod_right] congr 1; omega lemma Zw3k (s:ConvShape) (l:Bool) (h j b:Array Word) (k C:Nat) (p:k=s.cin*s.kh*s.kw) (r:C=s.cout) : Yw3k s l h j b k C p r=conv2dSpec s l h j b:=by unfold Yw3k;dsimp only;split . rename_i V;obtain⟨G,H,B,W,X,Y,Z⟩:=V;obtain⟨a1,a2,a3,a4⟩:=cfa s C B have L:∀ {a b c d e f g:Nat},a+b+c+d+e+f+g<=4294967295 -> a<4294967296/\b<4294967296/\c<4294967296/\d<4294967296/\e<4294967296/\f<4294967296/\b+g<4294967296:=by clear * -;intros;omega obtain⟨w,I,b2,O,P,Q,J⟩:=L Y have R:s.ho<4294967296:=ϸ a1 Q;have S:s.wo<4294967296:=ϸ a2 Q;have T:C<4294967296:=ϸ a3 P have K:s.ho.toUSize.toNat=s.ho:=Za _ R;have M:s.wo.toUSize.toNat=s.wo:=Za _ S;rw[Zby _ _ _ (by rw[K];exact(ZG s).1) (by rw[M];exact(ZG s).2) _ _ P,show conv2dSpec s l h j b=_ from ZdO false s l h j b k C (by rw[p];rfl) (by rw[r];rfl)] congr 1;funext q;obtain⟨D,E,x⟩:=Zt C s.ho s.wo q؞ q.isLt;have F:(q؞/(s.ho*s.wo))؛܅=q؞/(s.ho*s.wo):=Za _ (Ae x T) have y:(q؞/s.wo%s.ho)؛܅=q؞/s.wo%s.ho:=Za _ (Ae D R);have z:(q؞%s.wo)؛܅=q؞%s.wo:=Za _ (Ae E S);have U:k؛܅=k:=Za _ (Ae W (by decide));have N:q؞/(s.ho*s.wo)*k+k<=j؝:=by have:=μ k (show q؞/(s.ho*s.wo)+1<=C from x);rw[Η,Ξ]at this;exact Am this X have hm:=μ (Yb s*Ya s) (show q؞/(s.ho*s.wo)+1<=C from x);simp only[K,M];rw[dif_pos ⟨by rw[ζ,F,Za _ T];exact x,by rw[ζ,y,K];exact D,by rw[ζ,z,M];exact E⟩] simp only[F,y,z];congr 1;refine ZdN3 s h _ _ j _ b _ _ _ _ _ _ _ (Ybh (Yc h h؝ 0) (Aa (n:=C) λ o=>Yc j k o؞) b) _ _ _ _ ?_ ?_ ?_ ?_ ?_ b2 ⟨N,O⟩ _ ?_ . have:=BG.mp Z (q؞/(s.ho*s.wo)) (by simpa using x);simpa [gO C (λ o=>Yc j k o) _ x] using this . intro t v;obtain⟨u,A⟩:=ZbE false s h k (q؞/(s.ho*s.wo)) _ _ t (by rw[p];rfl) G H (by intro d;cases d) D E v simp only[η,if_false,ι]at u A ⊢ rw[pb3 s _ _ B J (by rw[y,z];clear * - u w;omega),y,z,ZD3 s _ t v (by clear * - u w;omega),Zbz3 s h _ B (by clear * - w;omega) I,gO _ (λ i=>Yu3i (i%3) (YwV (YI s h (i/3)) _)) _ (by clear * - u;omega),show (3*(q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟)+3*Ys s t)%3=0 by clear * -;omega,show (3*(q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟)+3*Ys s t)/3=q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟+Ys s t by clear * -;omega,A];rfl . intro t v;obtain⟨u,A⟩:=ZbE false s h k (q؞/(s.ho*s.wo)) _ _ t (by rw[p];rfl) G H (by intro d;cases d) D E v simp only[η,if_false,ι]at u A ⊢ rw[pb3 s _ _ B J (by rw[y,z];clear * - u w;omega),y,z,ZD3 s _ t v (by clear * - u w;omega),Zbz3 s h _ B (by clear * - w;omega) I,gO _ (λ i=>Yu3i (i%3) (YwV (YI s h (i/3)) _)) _ (by clear * - u;omega),show (3*(q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟)+3*Ys s t+1)%3=1 by clear * -;omega,show (3*(q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟)+3*Ys s t+1)/3=q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟+Ys s t by clear * -;omega,A];rfl . intro t v;obtain⟨u,A⟩:=ZbE false s h k (q؞/(s.ho*s.wo)) _ _ t (by rw[p];rfl) G H (by intro d;cases d) D E v simp only[η,if_false,ι]at u A ⊢ rw[pb3 s _ _ B J (by rw[y,z];clear * - u w;omega),y,z,ZD3 s _ t v (by clear * - u w;omega),Zbz3 s h _ B (by clear * - w;omega) I,gO _ (λ i=>Yu3i (i%3) (YwV (YI s h (i/3)) _)) _ (by clear * - u;omega),show (3*(q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟)+3*Ys s t+2)%3=2 by clear * -;omega,show (3*(q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟)+3*Ys s t+2)/3=q؞/s.wo%s.ho*s؟*Ya s+q؞%s.wo*s؟+Ys s t by clear * -;omega,A];rfl . intro t v;rw[um _ _ (by rw[F,U];exact ϸ (Am (ϝ _ _) N) O),F,U,gO _ (λ t=>Y4 j[t]! (YG (Aa (n:=C) λ o=>Yc j k o؞)[t/k]! b[t/k]! (Ybh (Yc h h؝ 0) (Aa (n:=C) λ o=>Yc j k o؞) b))) _ (Ad (ϧ v _) N), show(q؞/(s.ho*s.wo)*k+t)/k=q؞/(s.ho*s.wo) by rw[Δ,Ι _ _ (ϸ (Dl _) v),Α v,ι], gO C (λ o=>Yc j k o) _ x] . rw[gO C (λ o=>_+YG (Aa (n:=C) λ o=>Yc j k o؞)[o]! b[o]! _) _ x,gO C (λ o=>Yc j k o) _ x] . exact ZcV ▸ rfl lemma Zw3:Yw3=conv2dSpec:=funext λ s=>funext λ r=>funext λ i=>funext λ w=>funext λ b=>Zw3k s r i w b _ _ rfl rfl lemma Yt3gL {s relu L M b k o} (P T:Array Nat) (W:Array UInt32) (w l d n x f:USize) {f0 n0 U l0 C0 v0 f1 n1 N l1 C1 v1 hn hB hW V hT hS} (y:∀ D E,Yq5 f0 n0 U l0 C0 v0 D E=Y5g C0 v0 D E) (g:∀ D E,Yq5 f1 n1 N l1 C1 v1 D E=Y5g C1 v1 D E) (K:USize) (z:K܅=9*d܅) (F:Nat -> (t:USize) -> t UInt64) (G A:(t:USize) -> t UInt64) (a:∀ p c i t h,i<9 -> t܅=9*c+i -> F p t h=(P[T[p]!+c*w܅+i/3*l܅+i%3]!)׳) (B:∀ t h,G t h=(W[x܅+t܅]!)،) (u:∀ t h,A t h=(W[f܅+t܅]!)،) : ∀ H acc2 p (c:USize) r j X (t:USize) Y hr hj J D E Z b1,t܅=9*c܅ -> (Yt3g s relu L M b k o P T W w l d n f0 n0 U l0 C0 v0 f1 n1 N l1 C1 v1 x f hn hB hW V hT hS H acc2 p c r j X Y hr hj J D E Z b1).toList = (H.toList ++ Bt (n:=n܅-p܅) (λ q=>act relu ( let v:=Y5 K (F (p܅+q؞)) G C0 v0 (if q؞=0 then D else 0) (if q؞=0 then E else 0) (if q؞=0 then t else 0) if v < 0x100000000 then v.toUInt32 else if zW s L M b k o 0 ((p܅+q؞)/s.wo) ((p܅+q؞)%s.wo) 0 (k+1) then 0x80000000 else 0))) ++ (acc2.toList ++ Bt (n:=n܅-p܅) (λ q=>act relu ( let v:=Y5 K (F (p܅+q؞)) A C1 v1 (if q؞=0 then Z else 0) (if q؞=0 then b1 else 0) (if q؞=0 then t else 0) if v < 0x100000000 then v.toUInt32 else if zW s L M b k (o+1) 0 ((p܅+q؞)/s.wo) ((p܅+q؞)%s.wo) 0 (k+1) then 0x80000000 else 0))):=by intro H acc2 p c r j X t Y hr hj J D E Z b1 ht induction hM:n܅-p܅ generalizing H acc2 p c r j X t D E Z b1 with | zero=>exact absurd (ζ.mp Y) (by omega) | succ m ihP=> induction hN:d܅-c܅ generalizing H acc2 c r j X t D E Z b1 with | zero=> have N:¬comega) intro Q S e2 cases Q with | zero=> simp only [AK,Aq] simp only [y,g,Yr2 _ _ _ _ _ _ _ t h1',if_true,ϯ,dite_eq_ite] | succ m=> simp only [BS,Aq,Cs,if_false,ite_self,O] simp only [ϕ,BZ,CE 1 m,Δ 1 m] . rename_i R have hu2:n܅=p܅+1:=by have:=mt ζ.mpr R;omega rw[Array.toList_append] congr 1 all_goals rw[Bh];congr 1 apply Ap (by simp only [AN,As];omega) intro Q S e2 have:Q=0:=by simp only [AN] at S;omega subst this simp only [AK,Aq] simp only [y,g,Yr2 _ _ _ _ _ _ _ t h1',if_true,ϯ,dite_eq_ite] | succ m2 ihT=> have hc:c (t:USize) -> t UInt64) (G:(t:USize) -> t UInt64) (a:∀ p c i t h,i<9 -> t܅=9*c+i -> F p t h=(P[T[p]!+c*g܅+i/3*f܅+i%3]!)׳) (x:∀ t h,G t h=(W[l܅+t܅]!)،) : ∀ z p (c:USize) r j (t:USize) N U V B C,t܅=9*c܅ -> (Yt3f s relu J L b k o P T W g f d n f0 n0 M l0 C0 S l hn hB hW hT hS z p c r j N U V B C).toList = z.toList ++ Bt (n:=n܅-p܅) (λ q=>act relu ( let v:=Y5 K (F (p܅+q؞)) G C0 S (if q؞=0 then B else 0) (if q؞=0 then C else 0) (if q؞=0 then t else 0) if v < 0x100000000 then v.toUInt32 else if zW s J L b k o 0 ((p܅+q؞)/s.wo) ((p܅+q؞)%s.wo) 0 (k+1) then 0x80000000 else 0)):=by intro z p c r j t N U V B C X induction hM:n܅-p܅ generalizing z p c r j t B C with | zero=>exact absurd (ζ.mp N) (by omega) | succ m ihP=> induction Y:d܅-c܅ generalizing z c r j t B C with | zero=> have Z:¬comega) intro E I Q cases E with | zero=> simp only [AK,Aq] simp only [u,Yr2 _ _ _ _ _ _ _ t O,if_true,ϯ,dite_eq_ite] | succ m=> simp only [BS,Aq,Cs,if_false,ite_self,D] simp only [ϕ,BZ,CE 1 m,Δ 1 m] . rename_i H have hu2:n܅=p܅+1:=by have:=mt ζ.mpr H;omega rw[Bh];congr 1 apply Ap (by simp only [AN,As];omega) intro E I Q have:E=0:=by simp only [AN] at I;omega subst this simp only [AK,Aq] simp only [u,Yr2 _ _ _ _ _ _ _ t O,if_true,ϯ,dite_eq_ite] | succ m2 ihT=> have hc:c Nat -> Word) (f:∀ r D,H r D=act relu ( let v:=Y5 K (λ t _=>(P[T[D]!+(t܅/9*a܅+t܅/3%3*d܅+t܅%3)]!)׳) (λ t _=>(W[r*k+t܅]!)،) (E+YG BW[r]! b[r]! E) b[r]! 0 0 0 if v < 0x100000000 then v.toUInt32 else if zW s w x b k r 0 (D/s.wo) (D%s.wo) 0 (k+1) then 0x80000000 else 0)) : ∀ m o (j:Array Word),C-o<=m -> (Yt3c s relu w x b k C P T W a d e n E BW F B N O G Q I o j).toList = j.toList ++ Bt (n:=(C-o)*n܅) (λ q=>H (o+q؞/n܅) (q؞%n܅)):=by intro m;induction m with | zero=>intro o j h;rw[Yt3c,dif_neg (by clear * - h;omega),show C-o=0 by clear * - h;omega,Λ];simp | succ m R=> intro o j h by_cases u:oYq5e _ _ z A) (λ z A=>Yq5e _ _ z A) K g (λ J t _=>(P[T[J]!+(t܅/9*a܅+t܅/3%3*d܅+t܅%3)]!)׳) (λ t _=>(W[o*k+t܅]!)،) (λ t _=>(W[(o+1)*k+t܅]!)،) (λ p c i t _ l L=>by rw[L,show (9*c+i)/9=c by clear * - l;omega,show (9*c+i)/3%3=i/3 by clear * - l;omega,show (9*c+i)%3=i%3 by clear * - l;omega];congr 2;clear * -;omega) (λ t _=>by rw[M]) (λ t _=>by rw[S]) _ _ _ _ _ _ _ 0 _ _ _ _ _ _ _ _ (by simp), show (Aj n܅:Array Word).toList=[] from rfl,Ca,AP,AP] congr 1 rw[show C-o=(C-(o+1))+1 by clear * - u;omega,← Yl3 H o (C-(o+1)) n܅ B,show C-(o+1)=(C-(o+1+1))+1 by clear * - y;omega,← Yl3 H (o+1) (C-(o+1+1)) n܅ B, show n܅-(0:USize)܅=n܅ by simp] congr 1 . congr 1;funext q;rw[f];simp only [BP,ι,ite_self] congr 1 . congr 1;funext q;rw[f];simp only [BP,ι,ite_self] . rw[dif_neg y,Yt3fL P T W a d e n _ (λ z A=>Yq5e _ _ z A) K g (λ J t _=>(P[T[J]!+(t܅/9*a܅+t܅/3%3*d܅+t܅%3)]!)׳) (λ t _=>(W[o*k+t܅]!)،) (λ p c i t _ l L=>by rw[L,show (9*c+i)/9=c by clear * - l;omega,show (9*c+i)/3%3=i/3 by clear * - l;omega,show (9*c+i)%3=i%3 by clear * - l;omega];congr 2;clear * -;omega) (λ t _=>by rw[M]) _ _ _ _ _ 0 _ _ _ _ _ (by simp),show C-o=0+1 by clear * - u y;omega,← Yl3 H o 0 n܅ B] simp only [Λ,List.ofFn_zero,List.append_nil,show n܅-(0:USize)܅=n܅ by simp] congr 1;congr 1;funext q;rw[f];simp only [BP,ι,ite_self,BZ] lemma ZtW (s:ConvShape) (p:Bool) (j l b:Array Word) (k C:Nat) (q:k=s.cin*s.kh*s.kw) (B:C=s.cout) (u:s.kh=3) (w:s.kw=3) (x:s.kh<=Yb s) (y:s.kw<=Ya s) (D:9<=k) (z:k<256) (r:C*k<=l؝) (E:s.cin*(Yb s*Ya s)+Yb s*Ya s+j؝+l؝+C*(s.ho*s.wo)+s.ho*s.wo+s.stride<=4294967295) (A:(Cm C).all (λ o=>Ybg (Aa (n:=C) λ o=>Yc l k o؞)[o]! b[o]! (Yc j j؝ 0) k (Ybh (Yc j j؝ 0) (Aa (n:=C) λ o=>Yc l k o؞) b))=true) (q5 q6 q7) : Yt3w s p j l b k C (Ybi s j (Ybh (Yc j j؝ 0) (Aa (n:=C) λ o=>Yc l k o؞) b)) (YW2 l (Aa (n:=C) λ o=>Yc l k o؞) b (Ybh (Yc j j؝ 0) (Aa (n:=C) λ o=>Yc l k o؞) b) k) (Ybh (Yc j j؝ 0) (Aa (n:=C) λ o=>Yc l k o؞) b) (Aa (n:=C) λ o=>Yc l k o؞) q B u w x y D z q5 q6 q7 = conv2dSpec s p j l b := by generalize M:(Aa (n:=C) λ o=>Yc l k o؞)=BW at A q5 q6 q7 ⊢ generalize hxm:Ybh (Yc j j؝ 0) BW b=F at A q5 q6 q7 ⊢ replace M:=M.symm have hz:=ZG s have L:∀ {a b c d e f g:Nat},a+b+c+d+e+f+g<=4294967295 -> a<4294967296/\b<4294967296/\c<4294967296/\d<4294967296/\e<4294967296/\f<4294967296:=by clear * -;intros;omega obtain⟨V,Z,l3,W,l5,l6⟩:=L E have kN:k<4294967296:=Ae z (by decide) have S:k<1048576:=Ae z (by decide) have kp:0((Ybi s j F)[(Ytb s)[I]!+(t܅/9*(Yb s*Ya s)؛܅+t܅/3%3*(Ya s)؛܅+t܅%3)]!)׳) (λ t _=>((YW2 l BW b F k)[X*k+t܅]!)،) (F+YG BW[X]! b[X]! F) b[X]! 0 0 0 if v < 0x100000000 then v.toUInt32 else if zW s j l b k X 0 (I/s.wo) (I%s.wo) 0 (k+1) then 0x80000000 else 0):=⟨_,λ _ _=>rfl⟩ rw[Yt3cL (Ybi s j F) (Ytb s) (YW2 l BW b F k) (Yb s*Ya s)؛ (Ya s)؛ (k/9)؛ (s.ho*s.wo)؛ k؛ (by rw[Za _ kN,Za _ (ϸ (AL _ _) kN)];exact (Nat.mul_div_cancel' (Nat.dvd_of_mod_eq_zero e9)).symm) H hH _ 0 _ (Nat.le_refl _), show (Aj (C*(s.ho*s.wo)):Array Word).toList=[] from rfl,Ca,CF] apply Ap (by simp only [As,eN,Bf]) intro J i1 i2 simp only [Aq,BZ,eN,ι] have hi:J < C*(s.ho*s.wo):=by rw[As,Bf,eN] at i1;exact i1 have Y:J/(s.ho*s.wo) < C:=ϳ (by rw[Ϫ];exact hi) have T:J%(s.ho*s.wo) < s.ho*s.wo:=Ζ _ (Ϗ hz.1 hz.2) have ey:J/s.wo%s.ho=J%(s.ho*s.wo)/s.wo:=by rw[Ϫ s.ho s.wo,Bx] have ex:J%s.wo=J%(s.ho*s.wo)%s.wo:=by rw[Nat.mod_mul_left_mod] rewrite[ey,ex] obtain⟨o,hoi⟩:∃ o,o=J/(s.ho*s.wo):=⟨_,rfl⟩ rewrite[← hoi] at Y ⊢ obtain⟨I,hpi⟩:∃ I,I=J%(s.ho*s.wo):=⟨_,rfl⟩ rewrite[← hpi] at T ⊢ have hy:I/s.wo < s.ho:=ϳ (by rw[Ϫ];exact T) have hx:I%s.wo < s.wo:=Ζ _ hz.2 rw[hH];refine congrArg (act p) ?_ have N:o*k+k <= C*k:=by have e:=μ k (show o+1 <= C from Y);rw[Η,Ξ] at e;exact e have eo:(o*k)؛܅=o*k:=Za _ (ϸ (Am (ϝ _ _) (Am N r)) W) obtain⟨R,U⟩:∃ R,R=I/s.wo*s.stride*Ya s+I%s.wo*s.stride:=⟨_,rfl⟩ have O:∀ t,t R+Ys s tby rw[U];simpa using(ZbE false s j k o _ _ t (by simp [q]) x y (by simp) hy hx G).1 have ep:R؛܅=R:=Za _ (ϸ (ϝ _ _) (Ae (O 0 kp) V)) let K:Array UInt32:=Aa (n:=k) λ t=>(Ys s t؞).toUInt32 have ha:K؝=k:=by simp [K] have hY:∀ t,t (K[t]!)؆=Ys s t:=λ t G=>ZD s _ t G (ϸ (AM _ _) (Ae (O t G) V)) have hix:∀ t,t R؛܅+(K[t]!)؆<(Ybi s j F)؝/\(Ybi s j F)؝<4294967296:=by intro t G;rw[ep,hY t G,hP2];exact ⟨O t G,V⟩ have hW2:∀ t,t (o*k)؛܅+t<(YW2 l BW b F k)؝/\(YW2 l BW b F k)؝<4294967296:=by intro t G;rw[YW2e _ _ _ _ _ W kN,Al,eo];exact ⟨Ad (ϧ G _) (Am N r),W⟩ have hc:Ybg (Yc l k o) b[o]! (Yc j j؝ 0) k F=true:=by have:=BG.mp A o (by simpa using Y);rw[M] at this;simpa [gO C (λ o=>Yc l k o) _ Y] using this have hPv:∀ t,t (Ybi s j F)[R؛܅+(K[t]!)؆]! = YV (windowAt s j (I/s.wo) (I%s.wo) (0+t)) F:=by intro t G have w2:=(ZbE false s j k o _ _ t (by simp [q]) x y (by simp) hy hx G).2;simp only [η,if_false,ι] at w2 rw[ep,hY t G,Zbz s j F g3 V Z,gO _ (λ i=>YV (YI s j i) F) _ (O t G),U,ι,w2] have h9:∀ t,t (YW2 l BW b F k)[(o*k)؛܅+t]! = Y4 l[o*k+t]! (YG (Yc l k o) b[o]! F):=by intro t G rw[eo,YW2e _ _ _ _ _ W kN,gO _ (λ t=>Y4 l[t]! (YG BW[t/k]! b[t/k]! F)) _ (Ad (ϧ G _) (Am N r)),M, show (o*k+t)/k=o by rw[Δ,Ι _ _ kp,Α G,ι], gO C (λ o=>Yc l k o) _ Y] refine Eq.trans ?_ (ZdN s j (Ybi s j F) K l (YW2 l BW b F k) b k o 0 (I/s.wo) (I%s.wo) R؛ (o*k)؛ F S ha hix hW2 hc hPv h9 l3 ⟨Am N r,W⟩ (F+YG BW[o]! b[o]! F) (by rw[M,gO C (λ o=>Yc l k o) _ Y])) unfold Ybj;dsimp only have key:∀ P Q:(t:USize) → t < k؛ → UInt64, (∀ t h,P t h=((Ybi s j F)[(Ytb s)[I]!+(t܅/9*(Yb s*Ya s)؛܅+t܅/3%3*(Ya s)؛܅+t܅%3)]!)׳) → (∀ t h,Q t h=((YW2 l BW b F k)[o*k+t܅]!)،) → Y5 k؛ P Q (F+YG BW[o]! b[o]! F) b[o]! 0 0 0 = Y5 k؛ (λ t _=>((Ybi s j F)[(Ytb s)[I]!+(t܅/9*(Yb s*Ya s)؛܅+t܅/3%3*(Ya s)؛܅+t܅%3)]!)׳) (λ t _=>((YW2 l BW b F k)[o*k+t܅]!)،) (F+YG BW[o]! b[o]! F) b[o]! 0 0 0:=by intro P Q ha' hb';rw[show P=_ from funext λ t=>funext λ h=>ha' t h,show Q=_ from funext λ t=>funext λ h=>hb' t h] symm;rw[key _ _ (λ t h=>?ga) (λ t h=>?gb)] case ga=> have G:=uk h S rw[ugn _ _ _ ((Ytb s)[I]!+(t܅/9*(Yb s*Ya s)؛܅+t܅/3%3*(Ya s)؛܅+t܅%3)) (by rw[Zc _ _ (by rw[ep,ox,hY _ G];exact Ad (Ae (O _ G) V) π),ep,ox,hY _ G,YsT s u w,eH,eW,hT.2 I T,U])] case gb=> have G:=uk h S rw[ugn _ _ _ (o*k+t܅) (by rw[Zc _ _ (by rw[eo];exact Ad (Ae (Ad (ϧ G _) (Am N r)) W) π),eo])] lemma Zau (p:Bool) (s:ConvShape) (l:Bool) (j h b:Array Word) (k C:Nat) (r:k=if p then s.kh*s.kw else s.cin*s.kh*s.kw) (u:C=if p then s.cin else s.cout) : cdQ p s l j h b k C r u=(if p then depthwiseSpec else conv2dSpec) s l j h b:=by unfold cdQ;dsimp only;split . rename_i x;split . rename_i B;simp only [Ε,beq_iff_eq,decide_eq_true_eq,AD] at B;obtain⟨⟨⟨w,y⟩,rfl⟩,z⟩:=B exact ZtW s l j h b k C (by simpa using r) (by simpa using u) w y x.1 x.2.1 z x.2.2.2.1 x.2.2.2.2.1 x.2.2.2.2.2.1 x.2.2.2.2.2.2 _ _ _ rename_i B;obtain⟨U,V,D,N,W,X,Y⟩:=x;obtain⟨Z,a2,a3,a4⟩:=cfa s C D have L:∀ {a b c d e f g:Nat},a+b+c+d+e+f+g<=4294967295 -> a<4294967296/\b<4294967296/\c<4294967296/\d<4294967296/\e<4294967296/\f<4294967296/\b+g<4294967296:=by clear * -;intros;omega obtain⟨E,b1,b2,F,O,P,b6⟩:=L X have Q:s.ho<4294967296:=ϸ Z P;have R:s.wo<4294967296:=ϸ a2 P;have S:C<4294967296:=ϸ a3 O have G:s.ho.toUSize.toNat=s.ho:=Za _ Q;have H:s.wo.toUSize.toNat=s.wo:=Za _ R;rw[Zby _ _ _ (by rw[G];exact(ZG s).1) (by rw[H];exact(ZG s).2) _ _ O,ZdO p s l j h b k C r u] congr 1;funext q;obtain⟨I,J,v⟩:=Zt C s.ho s.wo q؞ q.isLt;have w:(q؞/(s.ho*s.wo))؛܅=q؞/(s.ho*s.wo):=Za _ (Ae v S) have y:(q؞/s.wo%s.ho)؛܅=q؞/s.wo%s.ho:=Za _ (Ae I Q);have z:(q؞%s.wo)؛܅=q؞%s.wo:=Za _ (Ae J R);have T:k؛܅=k:=Za _ (Ae N (by decide));have K:q؞/(s.ho*s.wo)*k+k<=h؝:=by have:=μ k (show q؞/(s.ho*s.wo)+1<=C from v);rw[Η,Ξ]at this;exact Am this W have hm:=μ (Yb s*Ya s) (show q؞/(s.ho*s.wo)+1<=C from v);simp only[G,H];rw[dif_pos ⟨by rw[ζ,w,Za _ S];exact v,by rw[ζ,y,G];exact I,by rw[ζ,z,H];exact J⟩] simp only[w,y,z];congr 1;refine ZdN s j _ _ h _ b _ _ _ _ _ _ _ (Ybh (Yc j j؝ 0) (Aa (n:=C) λ o=>Yc h k o؞) b) _ _ _ _ ?_ ?_ ?_ b2 ⟨K,F⟩ _ ?_ . have:=BG.mp Y (q؞/(s.ho*s.wo)) (by simpa using v);simpa [gO C (λ o=>Yc h k o) _ v] using this . intro t A;obtain⟨M,w2⟩:=ZbE p s j k (q؞/(s.ho*s.wo)) _ _ t r U V (by intro d;subst d u;simpa using v) I J A rw[pbN p s _ _ _ D b6 (by rw[w,y,z];exact ϸ (ϝ _ _) (Ae M E)),w,y,z,ZD s _ t A (ϸ (AM _ _) (Ae M E)),Zbz s j _ D E b1,gO _ (λ i=>YV (YI s j i) _) _ M,w2] . intro t A;rw[um _ _ (by rw[w,T];exact ϸ (Am (ϝ _ _) K) F),w,T,YW2e _ _ _ _ _ F (Ae N (by decide)),gO _ (λ t=>Y4 h[t]! (YG (Aa (n:=C) λ o=>Yc h k o؞)[t/k]! b[t/k]! (Ybh (Yc j j؝ 0) (Aa (n:=C) λ o=>Yc h k o؞) b))) _ (Ad (ϧ A _) K), show(q؞/(s.ho*s.wo)*k+t)/k=q؞/(s.ho*s.wo) by rw[Δ,Ι _ _ (ϸ (Dl _) A),Α A,ι], gO C (λ o=>Yc h k o) _ v] . rw[gO C (λ o=>_+YG (Aa (n:=C) λ o=>Yc h k o؞)[o]! b[o]! _) _ v,gO C (λ o=>Yc h k o) _ v] . subst r u;cases p . exact Zw3 ▸ rfl . exact ZcW ▸ rfl def Ybp (s:ConvShape) (relu:Bool) (inp wts b:Array Word):Array Word := cdQ false s relu inp wts b _ _ rfl rfl def dwQ (s:ConvShape) (relu:Bool) (inp wts b:Array Word):Array Word := cdQ true s relu inp wts b _ _ rfl rfl lemma ZdP:Ybp=conv2dSpec:=funext λ s=>funext λ r=>funext λ i=>funext λ w=>funext λ b=>Zau false s r i w b _ _ rfl rfl lemma ZdQ:dwQ=depthwiseSpec:=funext λ s=>funext λ r=>funext λ i=>funext λ w=>funext λ b=>Zau true s r i w b _ _ rfl rfl lemma dz (n:Nat) (F:Nat -> Word) (e:0 expOf (F t)≠255) : dotOf (n+1) (λ t=>if tif toneW):=by have l:∀ r k,k+r<=n -> Yo (λ t=>if tif toneW) k r /\ Yq (λ t=>if tif toneW) k r:=by intro r;induction r with | zero=>intro k _;exact⟨rfl,rfl⟩ | succ r j=>intro k h;obtain⟨a,b⟩:=j (k+1) (by omega);simp only[Yo,Yq,a,b,if_pos (show k Word) r k,Yq f g k (r+1)=(Yq f g k r && (decide (mantOf (f (k+r))*mantOf (g (k+r))=0)&&ψ (signOf (f (k+r))) (signOf (g (k+r))))):=by intro f g r;induction r with | zero=>intro k;simp[Yq] | succ r j => intro k;conv_lhs=>rw[Yq,j (k+1)] conv_rhs=>rw[Yq] rw[show k+1+r=k+(r+1) by omega];simp only[CW] rw[Zy (n+1) _ _ (λ t _=>by by_cases h:tsimp[h,d]<;>decide),Zy n _ _ (λ t p=>⟨d t p,by decide⟩),ZW,o,(l n 0 (by omega)).1,(l n 0 (by omega)).2] have q:sv (0x80000000:UInt32)=0:=by decide have s:((decide (mantOf oneW*mantOf (0x80000000:UInt32)=0)) && ψ (signOf oneW) (signOf (0x80000000:UInt32)))=true:=by decide simp only[ι,Cu,if_false,q,mul_zero,zero_mul,add_zero,s,Bool.and_true,show(n+1≠0)=True from eq_true (by omega),show(n≠0)=True from eq_true (by omega)] lemma wp (c h w k a y x t:Nat) (b:Array Word) (e:yr (φ.mp (by rw[v,e];rfl));omega) . rw[getElem!_neg a j d];decide have g:BX ⟨c,h,w,c,k,k,k,0⟩=h/k:=by show(h-k)/k+1=h/k;conv_rhs=>rw[show h=(h-k)+k by omega];rw[BE _ b] have l:BY ⟨c,h,w,c,k,k,k,0⟩=w/k:=by show(w-k)/k+1=w/k;conv_rhs=>rw[show w=(w-k)+k by omega];rw[BE _ b] rw[Zau,if_pos rfl];unfold depthwiseSpec depthwiseWith avgpoolSpec avgpoolWith;apply CI . simp[g,l] . intro i D E;simp only[Array.getElem_map,BA,g,l];have x:is _)] unfold act;simp;congr 1<;>funext t<;>split . rename_i n;exact wp c h w k _ _ _ t a y z n . rfl . rename_i n;rw[getElem!_pos _ _ (by simp;omega)];simp . rw[getElem!_pos _ _ (by simp;omega)];simp . rw[ZcS] def Ybl (c h w k:Nat) (inp:Array Word):Array Word := if k=2 then YT (c*(h/2)) (w/2) λ cy x=> let o:=((cy/(h/2))*h+(cy%(h/2))*2)*w+x*2 let v0:=inp[o]! YQ (YQ (YQ (YQ v0 v0) inp[o+1]!) inp[o+w]!) inp[o+w+1]! else Yad c h w k inp lemma ZdT:Ybl=maxpoolSpec:=by rw[<- ZaF];funext c h w k a;unfold Ybl;split . subst_vars;rw[ZB _ _ (c*(h/2*(w/2))) (ϒ _ _ _)];congr 1;have b:∀ v:Nat,v/(w/2)/(h/2)=v/(h/2*(w/2)):=λ v=>by rw[ϩ,Ϫ] funext i;simp only[b,show Ac (2*2)=[0,1,2,3] from rfl,Ϻ,List.foldl_nil,poolAt];congr 2<;>ring_nf . rfl @[noinline] def YaYs (x y z:Word):Word:=YaY x y z lemma Gd (a b:UInt32):((a^^^b)>>>31 != 0)=ψ (signOf a) (signOf b):=by have h:=Zcr a b;rw[Γ]at h;have e:((a^^^b)>>>31 != 0)=decide (((a^^^b)>>>31)؆≠0):=by rw[ϊ,bne_iff_ne,decide_eq_true_iff,ne_eq,ne_eq,<- φ,UInt32.toNat_zero] rw[e,h];cases ψ (signOf a) (signOf b)<;>decide @[inline] def Ysx (x y z:Word) (my iy mz iq:UInt64):Word := if expOf x != 255 then let mp:=Yl x*my let p:=Yd x+iy let k:=if mp==0 then iq else if mz==0 then p else if p<=iq then p else iq let dp:=if k<=p then p-k else 0 let dq:=if k<=iq then iq-k else 0 if dp<=14 && dq<=38 then let neg:=(x^^^y)>>>31 != 0 let tp:=mp<<>>47)+dp let Lq:=(23:UInt64)+dq let M:=if Lt<=Lq then Lq else Lt Ge ((if neg then 0-tp else tp)+(if signOf z then 0-tq else tq)) (M+(1:UInt64)-(((x^^^y)^^^z)>>>31)،) (λ _=>((k.toNat:Int)-298)) (neg&&signOf z) true (k-298) else YaYs x y z else YaYs x y z lemma Yst (P K:UInt64):(if K<=P then P-K else 0)˥=P˥-K˥:=by split . rename_i h;rw[ξ _ _ h] . rename_i h;rw[σ]at h;simp;omega lemma YsxE (x y z:Word) (a:expOf y≠255) (b:expOf z≠255) : Ysx x y z (Yl y) (Yd y) (Yl z) (Yd z+149)=YaY x y z:=by unfold Ysx;by_cases l:expOf x=255 . rw[if_neg (by simp[l])];rfl . rw[if_pos (by simpa using l)] have g:(Yd x+Yd y)˥=idxOf x+idxOf y:=by rw[δ,Zf,Zf];have:=Zg x;have:=Zg y;omega have j:(Yd z+149)˥=idxOf z+149:=by rw[δ,Zf];have:=Zg z;simp;omega have A:idxOf x+idxOf y<=508:=by have:=Zg x;have:=Zg y;omega have B:idxOf z+149<=403:=by have:=Zg z;omega dsimp only;rw[Gd x y,Gc];generalize Yd x+Yd y=P at g ⊢;generalize Yd z+149=Q at j ⊢;generalize o:(if Yl x*Yl y==0 then Q else if Yl z==0 then P else if P<=Q then P else Q)=K;have n:K˥=Y1 (Yl x*Yl y) (Yl z) (idxOf x+idxOf y) (idxOf z+149):=by rw[<- o,<- g,<- j];unfold Y1;by_cases e:Yl x*Yl y=0 . simp[e] . by_cases k:Yl z=0 . simp[e,k] . have p:(Yl x*Yl y==0)=false:=by simpa using e have q:(Yl z==0)=false:=by simpa using k simp only[p,q,e,k,η,ite_false];by_cases f:P<=Q . rw[if_pos f];rw[σ]at f;omega . rw[if_neg f];rw[σ]at f;omega have C:K˥<=508:=by rw[n];unfold Y1;split_ifs<;>omega generalize r:(if K<=P then P-K else 0)=D;generalize s:(if K<=Q then Q-K else 0)=E;have t:D˥=P˥-K˥:=by rw[<- r];exact Yst P K have u:E˥=Q˥-K˥:=by rw[<- s];exact Yst Q K by_cases d:(D<=14 && E<=38)=true . rw[if_pos d];simp only[Ε,decide_eq_true_eq]at d;have F:D˥<=14:=by have:=σ.mp d.1;simpa using this have G:E˥<=38:=by have:=σ.mp d.2;simpa using this unfold YaY;rw[if_neg (show ¬(expOf x=255\/expOf y=255\/expOf z=255) by rintro (h|h|h)<;>contradiction)] dsimp only;rw[<- n,<- g,<- j,if_pos (And.intro (show P˥-K˥<=14 by omega) (show Q˥-K˥<=38 by omega))] have v:(P˥-K˥)׳=D:=ε.mp (by rw[Ϯ,ϥ,t];omega) have w:(Q˥-K˥)׳=E:=ε.mp (by rw[Ϯ,ϥ,u];omega) rw[v,w,ZaL,YaPTe,Zca _ _ _ _ _ (Y0k K (by omega))] . rw[if_neg d];rfl def Ysj (relu:Bool) (x:Array Word) (n:USize) (hn:n.toNat<=x.size) (y z:Word) (my iy mz iq:UInt64) (j:USize) (acc:Array Word):Array Word := if h:j (Ysj a x n b y z (Yl y) (Yd y) (Yl z) (Yd z+149) j f)׆=f׆++(Av j܅ (n܅-j܅)).map (λ i=>act a (YaY x[i]! y z)):=by intro m;induction m with | zero=>intro j f h;unfold Ysj;rw[dif_neg (by rw[ζ];omega)];simp[h] | succ m g=> intro j f h;unfold Ysj;have k:jact relu (YaY x[ch*hw+j]! s[ch]! t[ch]!)) ch 0 acc) else acc termination_by c-ch lemma YskE (b:Bool) (c a:Nat) (x s t:Array Word) (d:c*a<=x؝) (e:c*a<=4294967295) : ∀ m f (g:Array Word),c-f=m -> Ysk b c a x s t d e f g=Yak c a (λ f j=>act b (YaY x[f*a+j]! s[f]! t[f]!)) f g:=by intro m;induction m with | zero=>intro f g h;unfold Ysk Yak;rw[dif_neg (by omega),if_neg (by omega)] | succ m l=> intro f g h;unfold Ysk Yak;rw[dif_pos (show f Word) (m:UInt64) (i:Nat):Nat -> UInt64 | 0=>0 | r+1=>YaJ (fa i) m+Ysm fa m (i+1) r def Yt (fa:Nat -> Word) (m:Nat) (i:Nat):Nat -> Int | 0=>0 | r+1=>sv (fa i)*2^(idxOf (fa i)-m)+Yt fa m (i+1) r @[inline] def Ypf (m:UInt64) (n:Nat) (fa:Nat -> Word) (S:UInt64):Word := if S==0 then (if decide (n≠0)&&Yq fa (λ _=>oneW) 0 n then 0x80000000 else 0) else YaP S ((m.toNat:Int)-149) false true (m-149) lemma YmE (w:UInt64):Ym w=Ye w:=by unfold Ym Ye;have:=w۾;split_ifs with h . rw[Α h];simp . rw[show w˥/2^63=1 by omega];simp lemma YsmE (a:Nat -> Word) (m:UInt64) (U:Nat) (d:U<=30) (b:∀ t,mantOf (a t)=0\/(m˥<=idxOf (a t)/\idxOf (a t)-m˥<=U)) : ∀ r i,r<=256 -> Ye (Ysm a m i r)=Yt a m˥ i r /\ -((r:Int)*2^54)<=Yt a m˥ i r /\ Yt a m˥ i r<=(r:Int)*2^54:=by intro r;induction r with | zero=>intro i _;simp[Ysm,Yt,Ye] | succ r g=> intro i j;obtain⟨e,k,l⟩:=g (i+1) (by omega) obtain⟨f,h⟩:=sgv (a i) m U (by omega) (b i) have n:(2:Int)^(24+U)<=2^54:=by exact_mod_cast κ (show 0<2 by omega) (show 24+U<=54 by omega) obtain⟨o,p⟩:=abs_lt.mp h;have q:(r:Int)<=255:=by omega rw[Ysm,Yt];rw[Zbx _ _ (by rw[e,f];omega) (by rw[e,f];omega),e,f] push_cast;refine⟨rfl,by omega,by omega⟩ lemma YoE (a:Nat -> Word) (m:Nat) (b:∀ t,mantOf (a t)=0\/(m<=idxOf (a t))) : ∀ r i,Yo a (λ _=>oneW) i r=Yt a m i r*2^(m+149):=by have d:sv oneW=2^23:=by decide have e:idxOf oneW=126:=by decide intro r;induction r with | zero=>intro i;simp[Yo,Yt] | succ r f=> intro i;rw[Yo,Yt,f (i+1),add_mul];congr 1;simp only[d,e];rcases b i with h|h . simp[sv,h] . rw[show(2:Int)^(idxOf (a i)+126)=2^(idxOf (a i)-m)*2^(m+126) by rw[<- pow_add,show idxOf (a i)-m+(m+126)=idxOf (a i)+126 by omega]] ring lemma YeZ (q:UInt64) (h:Ye q=0):q=0:=by unfold Ye at h;have:=q۾;have b:q˥=0:=by rcases Ϩ q˥ (2^63) with a|a . rw[Α a]at h;omega . rw[show q˥/2^63=1 by omega]at h;omega exact ε.mp (by rw[b];rfl) lemma YpE (n:Nat) (a:Nat -> Word) (m:UInt64) (U:Nat) (d:U<=30) (e:n<=256) (f:m˥<1024) (g:∀ t,expOf (a t)≠255) (b:∀ t,mantOf (a t)=0\/(m˥<=idxOf (a t)/\idxOf (a t)-m˥<=U)) : Ypf m n a (Ysm a m 0 n)=dotOf n a (λ _=>oneW):=by rw[Zy n a _ (λ t _=>⟨g t,by decide⟩)] obtain⟨j,-⟩:=YsmE a m U d b n 0 e;rw[YoE a m˥ (λ t=>by rcases b t with h|h;exact AJ h;exact Bz h.1) n 0,<- finishWord_scale] unfold Ypf;split . rename_i k;have o:Ysm a m 0 n=0:=by simpa using k have l:Yt a m˥ 0 n=0:=by rw[<- j,o];simp[Ye] rw[l];simp[finishWord] . rename_i k;have p:Ysm a m 0 n≠0:=by simpa using k have l:Yt a m˥ 0 n≠0:=by rw[<- j];exact λ h=>p (YeZ _ h) rw[Zca _ _ _ _ _ (Y0p m f),YmE,j,ZcN _ _ (decide (n≠0)&&Yq a (λ _=>oneW) 0 n) false l] exact congrArg (finishWord _ · false) (by push_cast;omega) def Ysa (inp:Array Word) (m:UInt64) (b i n:Nat) (acc:UInt64):UInt64 := if i Ysa a m b i n d=d+Ysm (λ t=>a[b+t]!) m i r:=by intro r;induction r with | zero=>intro i d h;unfold Ysa;rw[if_neg (by omega)];simp[Ysm] | succ r e=>intro i d h;unfold Ysa;rw[if_pos (by omega),e (i+1) _ (by omega),Ysm,Bj] lemma YdC (n:Nat) (b a:Nat -> Word) (d:Nat -> Word) (h:∀ t,t b t=a t):dotOf n b d=dotOf n a d:=by unfold dotOf;congr 2;funext i;exact h _ i.isLt def YbkF (c h w k:Nat) (inp:Array Word):Array Word := let bp:=Yc inp inp.size 0 let m:=Yk (bp>>>16) if (bp&&&0xFFFF)≠255/\m<=Yk (bp&&&0xFFFF)/\YU bp<=30/\inp.size<=4294967295 then if h=k/\w=k/\0YaB (k*k) (Ypf m (k*k) (λ t=>inp[ch*(k*k)+t]!) (Ysa inp m (ch*(k*k)) 0 (k*k) 0)) else Ybk c h w k inp else Ybk c h w k inp lemma ZdSF:YbkF=avgpoolSpec:=by rw[<- ZdS];funext c h w k a;unfold YbkF;dsimp only;split . rename_i o;obtain⟨p,r,s,A⟩:=o;obtain⟨d,-,f,xfin⟩:=Zbt a a؝ 0 (by simp) (by simp;omega) p r unfold okF at d;simp only[Λ,ι]at d xfin;generalize Yk (Yc a a؝ 0>>>16)=m at d f ⊢;have u:=σ.mp s;have g:∀ j:Nat,mantOf a[j]! = 0\/(m˥<=idxOf a[j]!/\idxOf a[j]!-m˥<=30):=by intro j;by_cases b:j < a؝ . rcases d j b with h|⟨e,B⟩ . exact AJ h . exact Bz ⟨e,by simp at u;omega⟩ . left;rw[getElem!_neg a j b];rfl have l:∀ j:Nat,expOf a[j]!≠255:=by intro j;by_cases b:j < a؝ . exact xfin j b . rw[getElem!_neg a j b];decide rw[ZdS];split . rename_i v;obtain⟨x,y,z,n⟩:=v;subst y;subst x;have e:h/h=1:=CD z;rw[ZB _ _ (c*(h/h*(h/h))) (by simp[e])];unfold avgpoolSpec avgpoolWith;congr 1;funext q simp only[e,Nat.div_one,Dn,Ξ,CJ];rw[YsaL a m _ _ _ 0 0 rfl,UInt64.zero_add,Bf,YpE (h*h) _ m 30 (by omega) n (by omega) (λ t=>l _) (λ t=>g _),Za4] rw[YdC (h*h) _ (poolAt h h h a (q:Nat) 0 0) _ (λ t C=>by unfold poolAt;congr 1;rw[show((q:Nat)*h+0*h+t/h)*h+0*h+t%h=(q:Nat)*(h*h)+(h*(t/h)+t%h) by ring,Ϲ])] . rfl . rfl def YlN (r i o:Nat) (f:Bool) (X W b:Array Word):Array Word:=if r=1 then Ybp ⟨i,1,1,o,1,1,1,0⟩ f X W b else linearWith Yn r i o f X W b lemma ZlN:YlN=linearSpec:=by funext r i o f X W b;unfold YlN;split . subst r;rw[ZdP];unfold conv2dSpec conv2dWith linearSpec linearWith apply CI (by simp [BX,BY]) intro q a d simp only [BA] simp [BX,BY,windowAt] at a ⊢ have:q/o=0:=Α a simp [γ a,this,Dn] . rw[Zi];rfl def kernels:Kernels where core:=kernels0.core dense:=⟨YlN,kernels0.dense.gemm⟩ conv:=⟨Ybp,dwQ⟩ elem:=⟨YbkF,Ybl,Ybf,Ybe⟩ norm:=kernels0.norm theorem correct:Obligation kernels:=by have h:kernels0=specKernels:=ZbZ;simp only[Obligation,kernels,h,specKernels,specDense,specConv,specElem,specNorm,ZlN,ZdP,ZdQ,ZdSF,ZdC,ZdB, ZdT] end Submission