import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open ExactRuntime renaming idxOf->γ,Word->δ,mantOf->ε,oneW->ζ,signOf->η,expOf->θ,Fmt->κ,toWord->π,finishWord->ρ,rationalWord->ς,dotOf->Γ,limbVal->ϋ,sqrtLower->Ϗ,decodeD_toRat->ϙ,mantOf_lt_24->Ϛ,addLimbs64->ϛ,rowVariance->ϫ,finishWord_scale->Aa,sqrtRational->Ac open Nat renaming mod_eq_of_lt->ν,shiftRight_eq_div_pow->ψ,mul_le_mul_right->ω,shiftLeft_eq->Α,zero_add->Β,two_pow_pos->Δ,mod_lt->Ε,mul_comm->Θ,pow_le_pow_right->Ι,pow_add->Κ,pos_of_ne_zero->Ο,lt_of_le_of_lt->Ρ,div_eq_of_lt->Υ,mul_pos->ϊ,le_add_right->ώ,add_zero->ϑ,add_mul_div_right->ϔ,div_lt_of_lt_mul->ϕ,cast_sub->ϗ,one_mul->Ϙ,add_comm->Ϟ,add_mul->ϟ,and_two_pow_sub_one_eq_mod->ϡ,mul_assoc->ϣ,div_div_eq_div_mul->ϧ,add_le_add_left->Ϯ,log2_self_le->ϰ,add_mul_mod_self_right->ϲ,add_lt_add_left->ϴ,div_add_mod'->϶,zero_mul->ϸ,log2_lt->Ϻ,eq_zero_or_pos->Ae,log2_eq_iff->Af,lt_of_lt_of_le->Ag,succ_mul->Ah,sub_zero->Ai,mul_lt_mul_of_pos_right->Aj,lt_log2_self->Ak,lt_of_sub_eq_succ->Al,le_div_iff_mul_le->Am,div_lt_iff_lt_mul->An,lt_succ_iff->Ao,lt_or_eq_of_le->Ap,div_add_mod->Aq,mul_le_mul->Ar,le_sub_of_add_le->Au,div_mul_le_self->Av,sub_add_cancel->Aw,mul_eq_zero->Ax,le_one_iff_eq_zero_or_eq_one->Ay,shiftLeft_add_eq_or_of_lt->Bq,and_two_pow_sub_one_of_lt_two_pow->Bx,sub_lt_left_of_lt_add->Bz,one_le_two_pow->BE,testBit_eq_decide_div_mod_eq->BJ,sub_le_iff_le_add'->BK,mul_lt_mul''->BP,add_assoc->BU,reduceMod->BY,sub_le_sub_right->BZ,toUInt32_eq->Cd,mul_add_mod->Ce,mul_add_div->Cf,mul_le_mul_left->Ci,mul_zero->Co,le_trans->Cp,sub_right_comm->Cu,add_right_comm->Cv,mod_mul_right_div_self->Cw,sub_add_eq->Cx,add_le_add->Cy,add_sub_cancel->Cz,add_mul_mod_self_left->CF,le_log2->CH,le_of_lt_succ->CI,cast_zero->CP,add_sub_cancel_left->CT,pos_of_mul_pos_left->CU,one_le_iff_ne_zero->Dd,sub_eq_zero_iff_le->De,add_one_mul->Dp,le_of_sub_eq_zero->Dw,cast_ofNat->DF,add_mul_div_left->DG,mod_mul->DH,pow_lt_pow_right->DJ,reducePow->DU,mod_le->DY,not_lt->DZ,cast_pow->Ei,add_sub_of_le->Ej,zero_lt_of_lt->Ek,le_of_not_le->Ev,mod_add_div->Ez,cast_natAbs->EA,sub_le->EI,cast_add->ER,cast_mul->ES,lt_asymm->ET,cast_one->EU,mod_one->Fb open UInt64 renaming toNat_lt->Az,toNat_toUInt32->AA,toNat_add->ξ,toNat_inj->σ,toNat_sub_of_le->Η,toNat_shiftRight->Ξ,toNat_sub->Τ,lt_iff_toNat_lt->Ψ,toNat_shiftLeft->ό,le_iff_toNat_le->ϐ,toNat_zero->Ϝ,toNat_mul->ϯ,reduceToNat->Bc,toNat_and->BR,zero_xor->Ch,toNat_ofNat_of_lt'->CG,add_assoc->CY,toNat_not->CZ,toNat_one->Da,zero_shiftRight->Dm,toNat_or->Du,or_eq_zero_iff->DA,zero_shiftLeft->DB,toNat->Er,not_lt->EO,size->Fd open USize renaming le_size->τ,lt_iff_toNat_lt->υ,size->Λ,toNat_one->Φ,toNat_lt_size->ϝ,toNat_mul->Dv open Bool renaming false_eq_true->φ,xor->Ζ,and_eq_true->Ω,not_eq_true'->ϵ,or_eq_true->Ϸ,eq_iff_iff->AB,false_ne_true->AC,and_self->DW,and_assoc->EK,and_false->EL,xor_false->EM open Array renaming replicate->Χ,ext'->ϻ,getElem_ofFn->AD,size_ofFn->AE,ofFn->AF,mkEmpty->AY,emptyWithCapacity->Ba,emptyWithCapacity_eq->Bw,size_map->CC,getElem_map->CN,getElem_replicate->CW,size_push->Dt,getElem_push_lt->Dy,getElem_push_eq->Dz,getElem_toList->DL,size_replicate->DN open UInt32 renaming toNat_inj->ύ,toNat_shiftRight->Ϣ,toNat_toUInt64->AG,toNat_and->AH,toNat_toUSize->AI,le_iff_toNat_le->AJ,toNat_lt_size->AK,toNat_ofNat'->AL,reduceToNat->CD,toNat_sub->CX,toNat_sub_of_le->Dj,toNat_shiftLeft->Dk,lt_iff_toNat_lt->Dl,ofNat_toNat->Ee,xor_zero->EE open List renaming range->ϒ,range'_succ->Ϩ,ext_getElem->ϩ,foldl_cons->AO,range'->Bd,drop_of_length_le->BL,mem_range->BM,range_eq_range'->Ca,map_congr_left->Ck,size_toArray->CK,append_assoc->CL,length_range->CM,map_cons->CR,map_map->Df,sum_map_mul_right->Dg,length_nil->Dr,length_map->Ds,map_add_range'->DS,sum_cons->DV,length_cons->Ex,nil_append->EB,mem_map->EZ open FloatFormat renaming toModel->ϓ,binary32->AZ,subnormalAlignExp->Cb,ieeeMinNormalExponent->Ef,ieeeMaxNormalExponent->Eg open Model.NativeBinary32 renaming mkBits->ϥ,roundRatScaled->AW,ofUInt32_roundRatScaled->Bf,ofUInt32->Bj,ofUInt32_mkBits->BB open Int renaming add_emod->Ϫ,emod_eq_emod_iff_emod_sub_eq_zero->By,ofNat->BG,toNat_of_nonneg->Cj,add_mul_emod_self_left->CA,negSucc->CJ,shiftLeft_eq->CV,ofNat_eq_natCast->DK,ModEq.add_right->DT,zero_add->EW,toNat->Fe open Int64 renaming ofInt->ϱ open FloatLib.Numerics renaming roundQuotientEven->AP,roundShiftRightEven->AQ,shiftRightJam->AR,FixedWord.roundShiftRightEven_toNat->Bg,roundShiftRightEven_shiftRightJam->Bh,FixedWord.roundShiftRightEven->Bm,roundShiftRightEven_le_succ->Bn,or_one_eq->Bu,roundShiftRightEven_eq_roundQuotientEven->BQ,roundShiftRightEven_mul_two_pow_of_le->Cc,roundShiftRightEven_eq_guard_sticky->Cl,div_two_pow_le_roundShiftRightEven->Cq,roundShiftRightEven_mul_two_pow->CE,shiftRightJam_ne_zero->DC,Radix.toReal->Fa open Model renaming roundDyadicGeneral->AT,roundDyadicGeneral_eq_roundDyadic->AV,ofModel_finite_normalized_eq_ofFields->Bo,roundDyadic->Bt,packRoundedSubnormal->Bv,isFinite->BI,ofModel->BT,finishRoundedMantissa->Cn,zero->Cs,pow2->Ct,packRoundedNormal->CS,toNatBits->Dn,ofUInt32->DD,nativeOverflow->DE,fma->Eu,ofFields->EH,ofBits->EQ open Or renaming inl->Ea,inr->EY open FloatLib.Numerics.Dyadic renaming toRat_eq_zero_iff->Di open Float.Model renaming totalExponent->Bb open Real renaming sqrt->Db open Float.Model.UnpackedFloat renaming roundWithAccuracy->Bp,accuracyOfFraction->Dc open Float.Model.Format renaming targetExponent->BH open FloatLib.Numerics.RationalBinary renaming lessThanPowerOfTwo->Bi,atLeastPowerOfTwo->Bk,scaleByPowerOfTwo->Bl,floorLog2->Br 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.toUSize (x :) local notation:max x:max "܀"=>Nat.log2 (x :) local notation:max x:max "܂"=>Fin.val (x :) local notation:max x:max "܃"=>Array.size (x :) local notation:max x:max "܅"=>UInt32.toUInt64 (x :) local notation:max x:max "܉"=>UInt64.toNat_lt (x :) local notation:max x:max "܍"=>Array.toList (x :) local notation:max x:max "߷"=>FloatLib.Floats.Formats.BinaryInterchange.FloatFormat.fracWidth (x :) local notation:max x:max "߸"=>Nat.toUInt64 (x :) local notation:max x:max "՜"=>UInt64.toUInt32 (x :) local notation:max x:max "׆"=>Int.toNat (x :) local notation"א"=>by omega local notation"ב"=>by norm_num local notation"ג"=>by simp local notation"ד"=>by decide local notation"ה"=>by positivity local notation"ו"=>by simp;omega local notation"ז"=>by grind local notation"ח"=>by simp_all local notation"߾"=>0x80000000 local notation"߿"=>0x100000000 local notation"ק"=>0x7FFFFFFF local notation"ר"=>ite_true local notation"ש"=>ite_false local notation"ת"=>decide_eq_true_eq local notation"ؠ"=>zpow_natCast local notation"ة"=>decide_eq_true_iff local notation"ح"=>getElem!_pos local notation"ض"=>Fmt.minSubnormalExponent local notation"ػ"=>UInt64 local notation"ؼ"=>UInt32 local notation"ؽ"=>Array local notation"ؾ"=>USize local notation"ف"=>Bool local notation"ٳ"=>Nat local notation"ٴ"=>Int local postfix:max"ٽ"=>Array.size local postfix:max"پ"=>UInt64.toNat local postfix:max"پ"=>USize.toNat local postfix:max"پ"=>UInt32.toNat local postfix:max"پ"=>Int.toNat local postfix:max"ٿ"=>Nat.toUSize local postfix:max"ٿ"=>UInt64.toUSize local postfix:max"ٿ"=>UInt32.toUSize local notation:max"ڀ"k:max=>Array.ofFn (n:=k) local notation"ހ"=>4294967295 local notation"ށ"=>1048576 local notation"ނ"=>16777216 local notation"ރ"=>8388608 local notation"ބ"=>4611686018427387904 local notation"ޅ"=>0xFFFF structure Acc where pos:ؽ ٳ neg:ؽ ٳ special:ف negZero:ف def Acc.empty:Acc:=⟨Χ 18 0,Χ 18 0,false,true⟩ def Acc.total (acc:Acc):ٴ:=(ϋ acc.pos.toList:ٴ)-ϋ acc.neg.toList @[inline] def Acc.add (acc:Acc) (m idx:ٳ) (neg:ف):Acc:= match acc with | ⟨pos,ng,sp,nz⟩ => if m=0 then ⟨pos,ng,sp,nz&&neg⟩ else if neg then ⟨pos,ϛ ng m.toUInt64 idx,sp,false⟩ else ⟨ϛ 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:ٳ) (b:ف) (e:a.posٽ=18) (f:a.negٽ=18) (g:m<2^64) (h:d/32+1<18):(a.add m d b).posٽ=18/\(a.add m d b).negٽ=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:ٴ) else m)*2^d:=by obtain⟨pos,k,l,n⟩:=a;simp only at e f;by_cases j:m=0 . simp[add,total,j,e,f] . cases b<;>refine⟨by simp[add,j,addLimbs64_size,e],by simp[add,j,addLimbs64_size,f],by simp[add,j],by simp[add,j],?_⟩<;>simp only[add,j,ש,φ,ר,addLimbs64_eq _ _ _ g,total]<;>rw[addLimbs_val _ _ _ א]<;>push_cast<;>ring lemma Acc.total_empty:Acc.empty.total=0:=ד section open FloatLib.Numerics lemma ZbF (s:ف) (m:ٳ) (e:ٴ) (j:ٳ) (h:j+25<=m܀):Bt κ ⟨s,shiftRightJam m j,e+j⟩=Bt κ ⟨s,m,e⟩:=by obtain⟨l,b,d⟩:j<=m܀/\23<=m܀-j/\23<=m܀:=א;have f:m≠0:=by rintro rfl;simp at h have n:=ϰ f;have g:2^(j+1)<=m:=Cp (Ι ב ((ώ (j+1) 24).trans h)) n;have o:=log2_shiftRightJam m j g;have k:AR m j≠0:=DC m j (Cp (Ι ב (ώ j 1)) g);rw[<-AV,<-AV];unfold AT;have p:κ߷=23:=rfl;have q:ض=-149:=rfl;have r:κ.minNormalExponent=-126:=rfl;simp only[beq_iff_eq,o,k,f,ϗ l,sub_add_add_cancel,p,q,r,b,d,↓reduceIte];clear f n g o k l b d p q r;split_ifs;rfl;congr 1;obtain⟨a,b⟩:=Int.eq_negSucc_of_lt_zero (א:e+j- -149<0);obtain⟨d,k⟩:e- -149=CJ (j+a)/\0 ٳ | 0=>0 | k+1=>a[i]! + 2^32*Yg a (i+1) k lemma Zv (a:ؽ ٳ) (i k m:ٳ):Yg a i (k+m)=Yg a i k+2^(32*k)*Yg a (i+k) m:=by induction k generalizing i;simp[Yg];next k b=>rw[Cv _ 1,Yg,Yg,b,BU i 1 k,Ϟ 1 k];ring lemma ZbG (a b:ؽ ٳ) (i j k:ٳ) (h:∀t,ta[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[BU,BU,Ϟ 1];exact h _ א),show a[i]! =b[j]! by simpa using h 0 א] lemma Zw (a:ؽ ٳ) (i k:ٳ):Yg a i k=0↔∀t,ta[i+t]! = 0:=by induction k generalizing i with |zero=>simp[Yg] |succ k d=>rw[Yg,Nat.add_eq_zero_iff,Ax,d (i+1)];have e:(2:ٳ)^32≠0:=ג;constructor;rintro⟨f,b|b⟩ t g;exact absurd b e;rcases t with _|t;simpa using f;rw[(א:i+(t+1)=i+1+t)];exact b t א;intro h;refine⟨by simpa using h 0 א,EY λt g=>?_⟩;rw[(א:i+1+t=i+(t+1))];exact h (t+1) א lemma ZbH (a:ؽ ٳ) (i k:ٳ) (h:∀t,ta[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 א;have e:=b (i+1) (λt f=>by rw[(א:i+1+t=i+(t+1))];exact h (t+1) א);simp at d;rw[Yg,(א:32*(k+1)=32+32*k),Κ];linarith lemma O0 (a:ؽ ٳ) (t:ٳ) (h:a܃<=t):a[t]! = 0:=ח lemma ZbI (a:ؽ ٳ) (i k:ٳ) (h:a܃<=i+k):Yg a i k=ϋ (a܍.drop i):=by induction k generalizing i;simp[Yg,BL (by simpa using h:a܍.length<=i),ϋ];rename_i b;rw[Yg,b (i+1) א];by_cases d:ia[t]! = 0) (e:∀t,b+n<=t->a[t]! = 0):ϋ a܍=2^(32*b)*Yg a b n:=by rw[<-List.drop_zero (l:=a܍),<-ZbI a 0 (b+(n+a܃)) א,Zv,Zv,(Zw a 0 b).2 (λt f=>by simpa using d t f),(Zw a (0+b+n) a܃).2 (λt _=>e _ א)];simp def YP (a b:ؽ ٳ) (i ca cb br:ٳ) (out:ؽ ٳ) : ٳ -> ؽ ٳ × ٳ × ٳ × ٳ | 0=>(out,ca,cb,br) | k+1 => let ta:=a[i]! + ca;let tb:=b[i]! + cb;let t:=ta%߿+߿-tb%߿-br;YP a b (i+1) (ta/߿) (tb/߿) (1-t/߿) (out.push (t%߿)) k lemma N9 (a b:ؽ ٳ) (i f g e:ٳ) (d:ؽ ٳ) (k:ٳ) (j:e<=1) (h:∀t,td[t]! < 2^32) : let r:=YP a b i f g e d k r.1ٽ=d܃+k/\(∀t,tr.1[t]! <2^32)/\(Yg r.1 0 r.1ٽ:ٴ)+2^(32*(d܃+k))*(r.2.1-r.2.2.1-r.2.2.2:ٴ)=Yg d 0 d܃+2^(32*d܃)*((Yg a i k:ٴ)-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%߿+߿-o%߿-e;obtain⟨w,x,p⟩:=q (i+1) (n/߿) (o/߿) (1-t/߿) (d.push (t%߿)) א (by intro s l;simp only[Dt]at l;rcases Ap (Ao.1 l)with l|rfl;rw[ح _ s ו,Dy l,<-ح d s l];exact h s l;rw[ح _ _ ג,Dz];omega);refine⟨by simp[w];omega,x,?_⟩;simp only[Dt]at p⊢;rw[(א:d܃+(k+1)=d܃+1+k),p,(by rw[Zv,ZbG _ d 0 0 d܃ (λs l=>by rw[ح _ _ ו,Dy א,<-ح d _ א])];simp only[Yg,Β,Co,ϑ];rw[ح _ _ ג,Dz]:Yg (d.push (t%߿)) 0 (d܃+1)=Yg d 0 d܃+2^(32*d܃)*(t%߿)),Yg,Yg];simp only[ER,ES,Ei,DF];linear_combination (2:ٴ)^(32*d܃)*(א:((t%߿:ٳ):ٴ)+߿*((n/߿:ٳ)-(o/߿:ٳ)-(1-t/߿:ٳ))=(a[i]!:ٴ)-b[i]!+f-g-e) def YW (r:ؽ ٳ):ٳ -> Option ٳ | 0=>none | k+1=>if r[k]! != 0 then some k else YW r k def YX (r:ؽ ٳ):ٳ -> ف | 0=>false | k+1=>r[k]! != 0||YX r k lemma ZbK (r:ؽ ٳ) (k:ٳ) (h:YW r k=none):∀t,tr[t]! = 0:=by induction k<;>intro t a ·omega rename_i b;simp only[YW]at h;split at h;cases h;rename_i d;rcases Ap (Ao.1 a)with a|rfl;exact b h t a;simpa using d lemma N8 (r:ؽ ٳ) (k h:ٳ) (d:YW r k=some h):htr[t]! = 0:=by induction k;simp[YW]at d;rename_i j;simp only[YW]at d;split at d<;>rename_i f;cases d;exact⟨א,by simpa using f,λt g e=>א⟩;obtain⟨a,b,c⟩:=j d;refine⟨א,b,λt g e=>?_⟩;rcases Ap (Ao.mp e)with e|rfl;exact c t g e;simpa using f lemma N7 (r:ؽ ٳ) (k:ٳ):YX r k=false↔∀t,tr[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];exact⟨λ⟨d,e⟩ t a=>(Ap (Ao.mp a)).elim (e t) (·▸d),λh=>⟨h k א,λt a=>h t א⟩⟩ lemma ZbL (r:ؽ ٳ) (k:ٳ):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 ((N7 r k).1 h)];rfl;simp;exact λb=>by have:=(N7 r k).2 (a.1 b);simp_all lemma ZbM (a x y h:ٳ) (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):=ז;have q:x%4<4:=Ε x ב;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 nth_rw 1[<-Ez x 4];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;obtain p|p:=Ax.1 o.2<;>omega;intro d;simp at d;simp[d.1,d.2] unfold AR;dsimp only;rw[k,l,DG _ _ א,Υ f,Β,CF,ν f];by_cases j:x%4≠0\/a≠0;have:¬(a+2^(32*h)*(x%4)=0):=λd=>g.1 d j;have e:(x%4 !=0||a !=0)=true:=ז;simp only[beq_iff_eq,this,ש,e,ר];have:=g.2 j;have e:(x%4 !=0||a !=0)=false:=ז;simp only[beq_iff_eq,this,ר,e];rfl def Yas (neg:ف) (r:ؽ ٳ) (e:ٴ) (negZero:ف):ؼ:= match YW r rٽ with | none=>ρ 0 e negZero | some 0=>ρ (if neg then -(r[0]! : ٴ) 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;π (Bt κ ⟨neg,m,e+((32*h+2:ٳ):ٴ)⟩) lemma F9 (b:ف) (R:ٳ) (e:ٴ) (a:ف) (d:R≠0):ρ (if b then -(R:ٴ) else R) e a=π (Bt κ ⟨b,R,e⟩):=by have f:(0:ٴ)simp[ρ,ofIntDyadic,d,not_lt.2 f.le,Ο d] lemma N6 (b:ف) (r:ؽ ٳ) (e:ٴ) (a:ف) (d:∀t,tr[t]! < 2^32):Yas b r e a=ρ (if b then -(Yg r 0 r܃:ٴ) 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⟩:=N8 r _ 0 g;rw[(א:r܃=1+(r܃-1)),Zv,(Zw r (0+1) (r܃-1)).2 (λt f=>k _ א א)];simp[Yg] rename_i h g;obtain⟨p,j,k⟩:=N8 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[(א:r܃=h+(2+(r܃-h-2))),Zv,Zv,(Zw r (0+h+2) _).2 (λt f=>k _ א א)];simp[Yg] have q:Yg r 0 h<2^(32*h):=ZbH r 0 h (λt f=>d _ א);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[CH n,l];have:=Ο j;calc 2^(32*h+2+25)<=2^(32*h)*2^32:=by rw[<-pow_add];exact Ι ב א _<=2^(32*h)*(r[h]!+2^32*r[h+1]!):=by gcongr;linarith _<=_:=א rw[F9 b _ e a n,<-ZbF b _ e _ s,l,ZbM _ _ _ h q,ZbL] def Yab (pos neg:ؽ ٳ):ٳ -> ٳ | 0=>0 | k+1=>if pos[k]! != 0||neg[k]! != 0 then k+1 else Yab pos neg k lemma ZbO (a b:ؽ ٳ) (k:ٳ):∀t,Yab a b k<=t->ta[t]! = 0/\b[t]! = 0:=by induction k<;>intro t d e ·omega rename_i f;simp only[Yab]at d;split at d;omega;rename_i g;rcases Ap (Ao.1 e)with e|rfl;exact f t d e;simpa[Ϸ,bne_iff_ne,not_or]using g def YaL (pos neg:ؽ ٳ) (e:ٴ) (negZero:ف):ؼ:= let lo:=lowLimb pos neg posٽ 0;let n:=Yab pos neg (max posٽ negٽ)+1-lo;let e':=e+((32*lo:ٳ):ٴ);let d:=YP pos neg lo 0 0 0 (Ba 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 (Ba 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 Q2 (b d:ؽ ٳ) (e:ٴ) (f:ف):YaL b d e f=ρ ((ϋ b܍:ٴ)-ϋ 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 o:=lowLimb_zero b d b܃ 0;have p:=ZbO b d (max b܃ d܃);have q (a:ؽ ٳ) (h:a=b\/a=d):ϋ a܍=2^(32*g)*Yg a g n:=by apply ZbJ a g n<;>intro t j;rcases h with rfl|rfl;exact(o t א j).1;exact(o t א j).2;by_cases r:t< max b܃ d܃;rcases h with rfl|rfl;exact(p t א r).1;exact(p t א r).2;rcases h with rfl|rfl<;>exact O0 _ t א have s:=q b (Ea rfl);have u:=q d (EY rfl);rw[show(Ba n:ؽ ٳ)=#[]from rfl];have v:=N9 b d g 0 0 0 #[] n א ג;have w:=N9 d b g 0 0 0 #[] n א ג;have z:Yg (#[]:ؽ ٳ) 0 0=0:=rfl;simp only[CK,Dr,Co,pow_zero,one_mul,z,CP,zero_add]at v w;obtain⟨-,A,x⟩:=v;obtain⟨-,B,y⟩:=w;split_ifs with k l;rw[N6 false _ _ _ A,Aa,s,u];simp;congr 1;rw[k.1,k.2.1,k.2.2]at x;linear_combination (2:ٴ)^(32*g)*x;rw[N6 true _ _ _ B,Aa,s,u];simp;congr 1;rw[l.1,l.2.1,l.2.2]at y;linear_combination (-(2:ٴ)^(32*g))*y;exact finishLimbs_eq b d e f end @[inline] def Yy (acc:Acc) (wa wb:ؼ):Acc:= if θ wa=255\/θ wb=255 then acc.markSpecial else acc.add (ε wa*ε wb) (γ wa+γ wb) (Ζ (η wa) (η wb)) @[specialize] def Yw (fa fb:ٳ -> ؼ) (pos neg:ؽ ٳ) (sp nz:ف) (index:ٳ):ٳ -> 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:ٳ) (fa fb:ٳ -> ؼ):ؼ:= let acc:=Yw fa fb (Χ 18 0) (Χ 18 0) false true 0 n;if acc.special then dotSpec (ڀ n λi=>fa i) (ڀ n λi=>fb i) else YaL acc.pos acc.neg (-298) (n≠0&&acc.negZero) lemma Zn (a b:ؼ):(if Ζ (η a) (η b) then -((ε a*ε b:ٳ):ٴ) else ((ε a*ε b:ٳ):ٴ))=sv a*sv b:=by unfold sv;cases η a<;>cases η b<;>simp lemma ZbP (g h:ٳ->ؼ) (d e:ؽ ٳ) (f:ف) (a b:ٳ):(Yw g h d e true f a b).special=true:=by induction b generalizing d e f a ·rfl rename_i 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 Q1 (g j:ٳ->ؼ) (A B:ؽ ؼ) (n:ٳ) (o:∀k,kA[k]! = g k) (r:∀k,kB[k]! = j k) (f:Acc) (e d:ٳ) (h:e+d<=n) (t:f.posٽ=18) (u:f.negٽ=18) (l:(Yw g j f.pos f.neg f.special f.negZero e d).special =false):f.special=false /\ (∀k,e<=k->k < e+d->θ A[k]! ≠ 255/\θ B[k]! ≠ 255) /\ (Yw g j f.pos f.neg f.special f.negZero e d).total=f.total+dsum A B e d /\ (Yw g j f.pos f.neg f.special f.negZero e d).negZero=(f.negZero&&dallNZ A B e d):=by induction d generalizing f e with |zero=>cases f;simp_all[Yw,dsum,dallNZ] |succ _ C=>obtain⟨p,q,s,z⟩:=f;have v:=o e א;have w:=r e א;rw[Yw,Yy]at l⊢;generalize g e=a,j e=b at*;by_cases x:θ a=255\/θ b=255;simp only[if_pos x,Acc.markSpecial,ZbP,Bool.true_eq_false]at l;have y:=not_or.mp x;obtain⟨D,E,F,G,H⟩:=Acc.add_spec ⟨p,q,s,z⟩ (ε a*ε b) (γ a+γ b) (Ζ (η a) (η b)) t u (mul_mant_lt _ _) (by have:=idxOf_le _ y.1;have:=idxOf_le _ y.2;omega);rw[if_neg x]at l⊢;obtain⟨I,J,K,L⟩:=C _ (e+1) א D E l;refine⟨F▸I,?_,?_,?_⟩;intro k N O;by_cases M:k=e;subst M;rw[v,w];exact y;exact J k א א;rw[K,H,dsum,v,w,Zn];ring;rw[L,G,dallNZ,v,w];simp[EK] lemma Ze (n:ٳ) (f:ٳ->ؼ) (k:ٳ) (a:kf i܂)[k]! = f k:=ח lemma Z5 (n:ٳ) (a b:ٳ->ؼ):Yn n a b=dotSpec (ڀ n λi=>a i) (ڀ n λi=>b i):=by unfold Yn;set A:=ڀ n λ i=>a i with y;set B:=ڀ n λ i=>b i with z;set d:=Yw a b (Χ 18 0) (Χ 18 0) false true 0 n;cases l:d.special;swap;simp[l];obtain⟨-,f,g,o⟩:=Q1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א rfl rfl l;have g:d.total=dsum A B 0 n:=by rwa[Acc.total_empty,EW]at g have o:d.negZero=dallNZ A B 0 n:=o;simp only[l,φ,ש];rw[Q2,<-Acc.total];obtain⟨p,u⟩:Aٽ=n/\Bٽ=n:=by simp[y,z] obtain⟨C,D⟩:=dotStateLoop_flags A B {} 0 n (by simp[p]) (by simp[u]) f;set L:=A.map (DD (fmt:=κ)) with h;set R:=B.map (DD (fmt:=κ)) with v;obtain⟨e,w⟩:Lٽ=Rٽ/\Lٽ=n:=ז;have q:∀ k (r:kby have:=(f k א א).1;rw[ح A k א]at this;simp[h,isFinite_ofUInt32,this] have s:∀ k (r:kby have:=(f k א א).2;rw[ح B k א]at this;simp[v,isFinite_ofUInt32,this] have t:=(finiteDotSlice_eq A B 0 Lٽ (by simp[h]) (by simp[h,p,u]) (λk E _=>f k E א)).trans (by rw[w,g]:_=(d.total:ℚ)*2^(-298:ℤ));have x:=Model.Reduction.Internal.dotState_exact_toRat (destination:=κ) L R e q s;unfold dotSpec Model.dot;by_cases j:d.total=0 . rw[Model.Reduction.dotWithStatus_eq_zero_of_finite κ L R .nearestEven e q s (by rw[<-Di,x,t,j];simp),j,finishWord_zero];simp[Model.Reduction.Internal.dotState,Except.map,h,v,p,C,D,o] rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero κ L R .nearestEven e q s (by rw[Model.Reduction.Semantics.finiteDot_toList_eq_slice L R e,t];simpa using j)];exact finishWord_of_ne _ _ _ _ j (by rw[x,t]) lemma Zi:Yn=Γ:=funext λn=>funext λa=>funext λb=>Z5 n a b def Yo (fa fb:ٳ -> ؼ) (i:ٳ):ٳ -> ٴ | 0=>0 | r+1=>sv (fa i)*sv (fb i)*2^(γ (fa i)+γ (fb i))+Yo fa fb (i+1) r def Yq (fa fb:ٳ -> ؼ) (i:ٳ):ٳ -> ف | 0=>true | r+1=>(decide (ε (fa i)*ε (fb i)=0)&&Ζ (η (fa i)) (η (fb i))) && Yq fa fb (i+1) r lemma Zb0 (n:ٳ) (a b:ٳ->ؼ) (i r:ٳ) (h:i+r<=n):dsum (ڀ n λk=>a k܂) (ڀ n λk=>b k܂) i r=Yo a b i r:=by induction r generalizing i;rfl;next r d=>rw[dsum,Yo,Ze n a i א,Ze n b i א,d (i+1) א] lemma Zb1 (n:ٳ) (a b:ٳ->ؼ) (i r:ٳ) (h:i+r<=n):dallNZ (ڀ n λk=>a k܂) (ڀ n λk=>b k܂) i r=Yq a b i r:=by induction r generalizing i;rfl;next r d=>rw[dallNZ,Yq,Ze n a i א,Ze n b i א,d (i+1) א] lemma Zb2 (f g:ٳ->ؼ) (d e:ؽ ٳ) (j:ف) (a b:ٳ) (l:∀k,a<=k->k < a+b->θ (f k)≠255/\θ (g k)≠255):(Yw f g d e false j a b).special=false:=by induction b generalizing d e j a ·rfl rename_i t;rw[Yw];have o:(Yy ⟨d,e,false,j⟩ (f a) (g a)).special=false:=by have u:¬(θ (f a)=255\/θ (g a)=255):=not_or.2 (l a א א);unfold Yy 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 א א) lemma Zy (n:ٳ) (a b:ٳ->ؼ) (d:∀k,kθ (a k)≠255/\θ (b k)≠255):Γ n a b=ρ (Yo a b 0 n) (-298) (decide (n≠0)&&Yq a b 0 n):=by rw[<-Zi];unfold Yn;set A:=ڀ n λi=>a i܂;set B:=ڀ n λi=>b i܂;set e:=Yw a b (Χ 18 0) (Χ 18 0) false true 0 n;have f:e.special=false:=Zb2 a b _ _ true 0 n (λk _ r=>d k א) obtain⟨-,-,g,h⟩:=Q1 a b A B n (Ze n a) (Ze n b) Acc.empty 0 n א rfl rfl f;have j:e.total=Yo a b 0 n:=by simp only[Acc.total_empty,EW]at g;rwa[<-Zb0 n a b 0 n א] have l:e.negZero=Yq a b 0 n:=by rwa[<-Zb1 n a b 0 n א] simp only[f,φ,ש];rw[Q2,show((ϋ e.pos܍:ٴ)-ϋ e.neg܍)=e.total from rfl,j,l] noncomputable def YC (w2 w1 w0:ػ):ٴ:= ((w2پ*2^128+w1پ*2^64+w0پ:ٳ):ٴ) - (if w2پ<2^63 then 0 else 2^192) lemma Zb3 (s:ف) (E F:ٳ) (b:E<256) (a:F<2^23):(EH κ 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,EQ,Dn,BitVec.toNat_ofNatLT];have d:E&&&κ.expAllOnesNat=E:=Bx (n:=8) b;have e:F&&&κ.fracMaskNat=F:=Bx (n:=23) a;rw[d,e,show E.shiftLeft κ߷=E<<<23 from rfl,Nat.or_assoc,<-Bq a];have f:E<<<23+F<2^31:=א;cases s;simp[Α];simp only[ר];rw[show Nat.shiftLeft 1 (κ.expWidth+κ߷)=1<<<31 from rfl,<-Bq f];simp;omega @[inline] def Yv (neg:ف) (E F:ؼ):ؼ:=(if neg then (߾:ؼ) else 0)+(E<<<23)+F lemma ZT (a:ف) (E F:ؼ) (b:E؎<256) (d:F؎<2^23):Yv a E F=π (EH κ a E؎ F؎):=by unfold π;rw[Zb3 a _ _ b d];apply ύ.1;unfold Yv;cases a<;>simp<;>omega lemma P7 (a:ف):Yv a 255 0=π (DE κ a):=by rw[Model.nativeOverflow_eq_signedInf_of_isIEEE Fmt ד];cases a<;>decide lemma Zb4 (a:ف):Yv a 0 0=π (Cs κ a):=by cases a<;>decide @[inline] def YH (x r d:ػ):ػ:=if x>>>(r+d) != 0 then r+d else r @[inline] def Yj (x:ػ):ػ:= YH x (YH x (YH x (YH x (YH x (YH x 0 32) 16) 8) 4) 2) 1 lemma Zz (x r d:ػ) (D:ٳ) (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,ν א,ψ] unfold YH;by_cases j:x>>>(r+d) !=0;simp only[j,ר,k];have:x˧/2^(r˧+d˧)≠0:=(by intro h;apply(bne_iff_ne.mp j);apply σ.mp;rw[l,h];rfl);exact⟨א,(Am (Δ _)).mp (Dd.mpr this)|>.trans' ג,by rwa[(א:r˧+d˧+d˧=r˧+2*d˧)]⟩;simp only[j,ש,φ];have n:x>>>(r+d)=0:=ז;exact⟨א,b,(Nat.div_eq_zero_iff_lt (Δ _)).mp (by rw[<-l,n];rfl)⟩ lemma Zj (x:ػ) (a:x≠0):(Yj x)˧=x˧܀:=by have b:1<=x˧:=Dd.mpr λh=>a (σ.mp (by simpa using h));have d:=x܉;obtain⟨t,e,f⟩:=Zz x 0 32 32 rfl ד ד (by simpa using b) (by simpa using d);obtain⟨u,g,j⟩:=Zz x _ 16 16 rfl ד א e (by simpa using f);obtain⟨v,k,l⟩:=Zz x _ 8 8 rfl ד א g (by simpa using j);obtain⟨w,n,o⟩:=Zz x _ 4 4 rfl ד א k (by simpa using l);obtain⟨y,p,q⟩:=Zz x _ 2 2 rfl ד א n (by simpa using o);obtain⟨z,r,s⟩:=Zz x _ 1 1 rfl ד א p (by simpa using q);exact((Af א).mpr ⟨r,s⟩).symm @[inline] def Ybm (m:ػ) (e:ٴ):ػ:= match e+149 with | .ofNat k=>m<<Bm m (k+1) @[inline] def YaO (neg:ف) (m:ػ) (e:ٴ):ؼ:= let fr:=Ybm m e;if fr==0 then Yv neg 0 0 else if (0x800000:ػ)<=fr then Yv neg 1 0 else Yv neg 0 fr.toUInt32 lemma Zb5 (a:ف) (m:ػ) (e:ٴ) (b:m˧≠0) (h:(m˧܀:ٴ)+e < -126):YaO a m e=π (Bv κ a (Cs κ a) (match e-ض with | BG shift=>m˧<<AQ m˧ (shift+1))):=by rw[show ض= -149 from rfl,Int.sub_neg];unfold YaO Ybm;generalize l:e+149=s;suffices H:∀(d:ػ) F,d˧=F->F<=2^23->(if d==0 then Yv a 0 0 else if 0x800000<=d then Yv a 1 0 else Yv a 0 d՜)=π (Bv κ a (Cs κ a) F) by rcases s with k|k;·simp at l;have o:m˧*2^k<2^23:=(Aj (Ak (n:=m˧)) (Δ k)).trans_le (by rw[<-Κ];exact Ι א א);exact H _ (m˧<<g (σ.mp h),ש];by_cases f:0x800000<=d;. simp only[f,ר,show d˧>=Ct Fmt߷from f];exact ZT a 1 0 ד ד . simp only[f,ש,show¬d˧>=Ct Fmt߷from f];have j:d՜؎=d˧:=ν א;exact j▸ZT a 0 _ ד (by rw[j];exact not_le.1 f) @[inline] def YK (m L:ػ):ػ:= if 23<=L then Bm m (L-23).toNat else m<<<(23-L) @[inline] def Yae (neg:ف) (m L:ػ) (t:ٴ):ؼ:= 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:ػ) (a:m≠0):(YK m (Yj m))˧=(if κ߷<=m˧܀ then AQ m˧ (m˧܀-κ߷) else m˧<<<(κ߷-m˧܀)) /\ 2^23<=(YK m (Yj m))˧/\(YK m (Yj m))˧<=2^24:=by have k:m˧≠0:=λh=>a (σ.mp (by simpa using h));have b:=Zj m a;have f:=ϰ k;have g:m˧<2^(m˧܀+1):=Ak;rw[show κ߷=23 from rfl];unfold YK;generalize Yj m=L at b⊢;generalize q:m˧܀=N at*;by_cases h:23<=N;have d:(23:ػ)<=L:=by rw[ϐ,b];exact h simp only[d,ר,h,(ח:(L-23)˧=N-23),Bg];exact⟨trivial,(by rw[Am (Δ _),<-Κ,Ej h];exact f:2^23<=m˧/2^(N-23)).trans (Cq _ _),(Bn _ _).trans (by rw[An (Δ _),<-Κ,(by clear*-h;omega:24+(N-23)=N+1)];exact g:m˧/2^(N-23)<2^24)⟩;simp only[(by rw[ϐ,b];exact h:¬(23:ػ)<=L),ש,h];have j:m˧*2^(23-N)<2^24:=(Aj g (Δ _)).trans_eq (by rw[<-Κ];congr 1;clear*-h;omega);rw[(by rw[ό,(by rw[Η _ _ (by rw[ϐ,b];exact Ev h),b];rfl:(23-L)˧=23-N),ν (Ρ (EI 23 N) ד),Α];exact ν (j.trans ד):(m<<<(23-L))˧=m˧*2^(23-N)),Α];exact⟨rfl,(by rw[<-Κ,Ej (Ev h)]:2^23=2^N*2^(23-N)).trans_le (ω _ f),j.le⟩ lemma K3 (n:ٳ) (h:n<2^32):n.toUInt32؎=n:=by rw[Cd,AL,ν h] lemma Zb6 (a:ف) (m:ػ) (e:ٴ) (b:m≠0) (d:¬ ((m˧܀:ٴ)+e>127)) (f:¬ ((m˧܀:ٴ)+e < -126)):Yae a m (Yj m) ((m˧܀:ٴ)+e)=π (CS κ a (DE κ a) (↑m˧܀+e) (if κ߷<=m˧܀ then AQ m˧ (m˧܀-κ߷) else m˧<<<(κ߷-m˧܀))):=by obtain⟨q,r,s⟩:=Z7 m b;rw[<-q];unfold Yae CS;generalize YK m (Yj m)=g at r s⊢;generalize (m˧܀:ٴ)+e=t at d f⊢;simp only[Model.pow2_eq_two_pow,show κ߷=23 from rfl,show κ.maxNormalExponent=127 from rfl,show κ.exponentBias=127 from rfl,show κ.maxFiniteExpField=254 from rfl,show κ.maxFiniteFracField=8388607 from rfl,DU,Nat.reduceAdd,DK,DF];by_cases k:g˧=ނ;have l:(g==0x1000000)=true:=beq_iff_eq.2 (σ.1 k);simp only[l,ר,k,BEq.rfl];by_cases o:t+1>127;simp only[o];exact P7 a;simp only[o,ש];have j:((t+128)׆.toUInt32)؎=(t+1+127)׆:=by rw[K3 (t+128)׆ א];omega rw[if_neg ז,ZT a _ 0 (by rw[j];omega) ד,j];rfl;have l:(g==0x1000000)=false:=beq_eq_false_iff_ne.2 λh=>k (by rw[h];rfl);have u:(g˧==ނ)=false:=ז;simp only[l,u,φ,ש,(א:¬t>127)];have j:=K3 (t+127)׆ א;have p:(g՜-0x800000)؎=g˧-ރ:=by rw[Dj _ _ (by rw[AJ];simp;omega)];simp;omega rw[if_neg ז,ZT a _ _ (by rw[j];omega) (by rw[p];omega),j,p] @[inline] def YA (neg:ف) (m:ػ) (e:ٴ):ؼ:= let L:=Yj m;let t:ٴ:=(Lپ:ٴ)+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:ف) (m:ػ) (e:ٴ) (b:m≠0):YA a m e=π (AT κ ⟨a,m˧,e⟩):=by have g:m˧≠0:=λh=>b (σ.mp (by simpa using h));have j:=Zj m b;unfold YA AT;simp only[show(m˧==0)=false by simpa using g,φ,ש,j,show κ.maxNormalExponent=127 from rfl,show κ.minNormalExponent= -126 from rfl];by_cases f:(m˧܀:ٴ)+e>127;simp only[f,ר];exact P7 a;simp only[f,ש];by_cases d:(m˧܀:ٴ)+e< -126;simp only[d,ר];exact Zb5 a m e g d;simp only[d,ש];exact Zb6 a m e b f d @[noinline] def Ybn (neg:ف) (m:ػ) (e:ٴ):ؼ:=YA neg m e @[noinline] def Yat (neg:ف) (m:ػ) (e:ٴ) (L c:ػ):ؼ:= YA neg m (e+((Lپ+cپ:ٳ):ٴ)) @[inline] def YY (n:ػ):ػ:= let q:=n>>>40;q+(((n&&&0xFFFFFFFFFF)+0x7FFFFFFFFF+(q&&&1))>>>40) lemma Zb7 (n:ػ):(YY n)˧=AQ n˧ 40:=by rw[Cl _ _ ד];have b:(n>>>40)˧=n˧/2^40:=by rw[Ξ,ψ];rfl have d:(n&&&0xFFFFFFFFFF)˧=n˧%2^40:=by rw[BR,show(0xFFFFFFFFFF:ػ)˧=2^40-1 from rfl,ϡ] have e:((n>>>40)&&&1)˧=n˧/2^40%2:=ח;have f:n˧/2^(40-1)%2=n˧%2^40/2^39:=by rw[(ב:(2:ٳ)^40=2^39*2),Cw] have g:n˧%2^(40-1)=n˧%2^40%2^39:=by rw[(ב:(2:ٳ)^40=2^39*2),Nat.mod_mul_right_mod] have k:=Ε n˧ (Δ 40);have l:n˧/2^40<2^24:=(An ד).2 n܉;unfold YY;simp only[ξ,Ξ,d,e,BJ,f,g];clear b d e f g;generalize n˧%2^40=R at*;simp only[Bc,ψ,BY,DU]at*;split<;>rename_i h<;>simp at h<;>omega lemma Z8 (a:ف) (E F:ؼ) (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:ف) (u n:ػ):ؼ:= (if neg then (߾:ؼ) else 0)+((u<<<23)+YY n).toUInt32 lemma Zb8 (a:ف) (u n:ػ) (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 P6 (a:ف) (m:ػ) (e:ٴ) (u:ػ) (b:m≠0) (d:(u˧:ٴ)=(m˧܀:ٴ)+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 ν ((Aj Ak (Δ _)).trans_eq (by rw[<-Κ,(by clear*-j;omega:m˧܀+1+(63-m˧܀)=64)])):(m<<<(63-Yj m))˧=m˧*2^(63-m˧܀)),show κ߷=23 from rfl];split<;>rename_i g;rw[(by clear*-g j;omega:(40:ٳ)=m˧܀-23+(63-m˧܀)),CE];rw[Cc _ _ _ (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,ש];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˧܀:ٴ)+e=t at d⊢;clear b k o j;by_cases g:n˧=ނ;simp only[show(n==0x1000000)=true by simp[<-σ,g],ר];by_cases v:t+1>127<;>simp only[v,ר,ש]<;>rw[Z8 a _ _ (by simp<;>omega)]<;>simp<;>omega;simp only[show(n==0x1000000)=false by simp[<-σ,g],φ,ש];rw[Z8 a _ _ (by simp[CX];omega)];simp[CX];omega lemma P5 (a:ف) (n:ػ) (E:ٴ) (u:ػ) (b:2^63<=n˧) (e:(u˧:ٴ)=E+189) (d:u˧<=253):YZ a u n=YA a n E:=by have f:=Nat.pos_iff_ne_zero.mp (Ag (Δ 63) b);have g:n≠0:=λh=>f (by rw[h];rfl);have j:n˧܀=63:=(Af f).mpr ⟨b,n܉⟩;have k:Yj n=63:=σ.mp (by rw[Zj n g,j];rfl);have:=P6 a n E u g (by rw[j];push_cast;omega) d;rw[k,show n<<<(63-63:ػ)=n from σ.mp (by rw[ό];simp only[UInt64.reduceSub];exact ν n܉)]at this;exact this lemma Zb9 (e:ٴ) (c:ػ) (b:c˧<2^62) (h:(ϱ e).toInt=e) (a:((ϱ e).toUInt64+c)˧<=253):(((ϱ e).toUInt64+c)˧:ٴ)=e+c˧:=by have d:=Int64.toInt_lt (ϱ e);have f:=Int64.le_toInt (ϱ e);have g:((ϱ e).toUInt64˧:ٴ)=e%2^64:=by simp;exact Cj (Int.emod_nonneg _ ד) rw[ξ]at a⊢;omega def Y0 (e:ٴ) (ok:ف) (B:ػ):Prop:= ∀ c:ػ,cپ<2^62 -> ok=true -> (B+c).toNat<=253 -> ((B+c).toNat:ٴ)=e+cپ lemma P4 (e:ٴ):Y0 e ((ϱ e).toInt==e) (ϱ e).toUInt64:=λc a b d=>Zb9 e c a (beq_iff_eq.1 b) d @[inline] def Yau (neg:ف) (m:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= 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 P3 (a:ف) (m:ػ) (e:ٴ) (d:ف) (B:ػ) (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 (σ.1 (by simpa using h));have l:=Zj m b;have q:=(Ϻ k).2 m܉;unfold Yau Ybn;dsimp only;split;swap;rfl;rename_i h;simp at h;obtain⟨n,g⟩:=h;have o:(Yj m+126)˧=m˧܀+126:=by rw[ξ,l];simp;omega rw[CY]at g⊢;have j:(B+(Yj m+126))˧<=253:=by simpa using ϐ.1 g have p:=f _ (by rw[o];omega) n j;exact P6 a m e _ b (by rw[p];omega) j lemma Zcb (V s:ٳ) (h:s+25<=V܀):(AR V s)܀=V܀-s:=by have d:V≠0:=by rintro rfl;simp at h have f:=ϰ d;have g:V<2^(V܀+1):=Ak;have a:2^(V܀-s)<=V/2^s:=by rw[Am (Δ _),<-Κ,(א:V܀-s+s=V܀)];exact f have b:V/2^s<2^(V܀-s+1):=by rw[An (Δ _),<-Κ,(א:V܀-s+1+s=V܀+1)];exact g unfold AR;simp only;split;exact(Af א).2 ⟨a,b⟩;rw[Bu];split;rename_i _ j;apply(Af א).2;omega;exact(Af א).2 ⟨a,b⟩ lemma P0 (b:ف) (V s:ٳ) (e:ٴ) (h:s+25<=V܀):AT κ ⟨b,AR V s,e+s⟩=AT κ ⟨b,V,e⟩:=by have d:V≠0:=by rintro rfl;simp at h have k:2^s<=V:=Cp (Ι ב א) (ϰ d);have l:=DC V s k;have n:=Zcb V s h;unfold AT;simp only[show(AR V s==0)=false by simpa using l,show(V==0)=false by simpa using d,φ,ש,n];rw[(א:((V܀-s:ٳ):ٴ)+(e+s)=V܀+e)];split;rfl;split;rename_i _ f;have t:ض= -149:=rfl;have u:(V܀:ٴ)+e< -126:=lt_of_lt_of_eq f rfl;obtain⟨a,g⟩:∃a:ٳ,e-ض=CJ a/\s+2<=a+1:=by refine⟨(-(e+149)-1)׆,?_,א⟩;omega rw[g.1,(א:e+(s:ٴ)-ض=CJ (a-s))];simp only;rw[(א:a-s+1=a+1-s),Bh V s (a+1) g.2];rename_i _ f;have q:κ߷<=V܀-s:=by rw[show κ߷=23 from rfl];omega simp only[q,(א:κ߷<=V܀),ר];rw[show κ߷=23 from rfl,(א:V܀-s-23=V܀-23-s),Bh V s (V܀-23) א] lemma Z9 (b a d:ػ) (L:ٳ) (e:d˧=L) (g:L<=63) (f: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 j:(63-d)˧=63-L:=by rw[Η _ _ (by rw[ϐ,e];simp;omega),e];rfl have h:(2:ٳ)^64=2^(63-L)*2^(L+1):=by rw[<-Κ];congr 1;omega refine⟨by rw[Du,(by rw[ό,j,ν (א:63-L<64),Α,ν];rw[h,Θ (2^_)];exact Aj f (Δ _):(b<<<(63-d))˧=b˧*2^(63-L)),(by rw[Ξ,Ξ,e,ν (א:L<64)];simp only[Bc,BY,ψ,ϧ,<-Nat.pow_succ]:((a>>>d)>>>1)˧=a˧/2^(L+1)),(by rw[h,<-ϣ,Ϟ,ϔ _ _ (Δ _),Ϟ]:(b˧*2^64+a˧)/2^(L+1)=b˧*2^(63-L)+a˧/2^(L+1)),<-Α,<-Bq (by rw[An (Δ _),<-h];exact a܉:a˧/2^(L+1)<2^(63-L))],?_⟩;rw[h,<-ϣ,Nat.mul_add_mod_self_right,AB];simp[<-σ,(by rw[ό,j,ν (א:63-L<64),Α,h,Θ (2^(63-L)),Nat.mul_mod_mul_right]:(a<<<(63-d))˧=a˧%2^(L+1)*2^(63-L))] @[inline] def Yav (w0:ػ):ػ:= ~~~w0+1 @[inline] def Yaw (w1 w0:ػ):ػ:= ~~~w1+(if w0==0 then 1 else 0) @[inline] def Yax (w2 w1 w0:ػ):ػ:= ~~~w2+(if w1==0&&w0==0 then 1 else 0) lemma Zcc (d b a:ػ) (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_cases l:b=0;have g:b˧=0:=ז;simp only[e,l,DW]at*;simp at*;omega;have j:(b==0)=false:=ז;have g:b˧≠0:=λh=>l (σ.mp (by rw[h];rfl));simp only[e,j,beq_self_eq_true,Bool.false_and,φ,ש,ר,ξ,CZ]at*;simp at*;omega;have k:(a==0)=false:=ז;have f:a˧≠0:=λh=>e (σ.mp (by rw[h];rfl));simp only[k,EL,φ,ש,ξ,CZ]at*;simp at*;omega @[inline] def Yaf (neg:ف) (m2 m1 m0:ػ) (e:ٴ):ؼ:= 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پ+65:ٳ):ٴ)) @[inline] def Yag (neg:ف) (m1 m0:ػ) (e:ٴ):ؼ:= 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پ+1:ٳ):ٴ)) @[inline] def Yay (neg:ف) (m2 m1 m0:ػ) (e:ٴ):ؼ:= 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 O9 (x:ػ) (a:ف) (Q R:ٳ) (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 QF (m:ػ) (h:m≠0):m˧܀<=63/\m˧<2^(m˧܀+1)/\2^m˧܀<=m˧:=by have a:m˧≠0:=λb=>h (σ.1 b);exact⟨CI ((Ϻ a).2 m܉),Ak,ϰ a⟩ lemma QH (m r K:ٳ) (a:2^K<=m):2<=(m*2^64+r)/2^(K+1):=by rw[Am (Δ _)];calc 2*2^(K+1)=2^K*2^2:=by rw[<-Κ,<-Nat.pow_succ'] _<=m*2^64:=Ar a (Ι ב ב) _<=_:=ώ _ _ lemma QL (m:ػ) (s r:ٳ) (h:m≠0) (a:r<2^s):(m˧*2^s+r)܀=s+m˧܀:=by have b:m˧≠0:=λd=>h (σ.mp (by rw[d];rfl));have e:=@Ak m˧;apply(Af (Nat.ne_of_gt (Ag (ϊ (Ο b) (Δ s)) (ώ _ _)))).mpr;constructor . rw[Κ,Θ];exact(ω _ (ϰ b)).trans (ώ _ _) . calc m˧*2^s+r<(m˧+1)*2^s:=by rw[Dp];omega _<=2^(m˧܀+1)*2^s:=ω _ e _=2^(s+m˧܀+1):=by rw[<-Κ];ring_nf lemma QN (x:ػ) (a:ف) (Q R:ٳ) (b:(if a then x|||1 else x)˧=(if R==0 then Q else Q|||1)) (d:2<=Q):(if a then x|||1 else x)≠0:=by intro h;have e:=congrArg Er h;rw[b,Ϝ]at e;split at e;omega;rw[Bu]at e;split at e<;>omega lemma Zcd (b:ف) (a d:ػ) (e:ٴ) (f:a≠0):Yag b a d e=π (AT κ ⟨b,a˧*2^64+d˧,e⟩):=by have s:=a܉;have p:=d܉;unfold Yag;have c:=Zj a f;obtain⟨g,h,j⟩:=QF a f;generalize q:a˧܀=K at c g h j;obtain⟨k,l⟩:=Z9 a d (Yj a) K c g h;generalize Yj a=L at c k l⊢;have n:=QH _ d˧ K j;have o:=O9 _ _ _ _ k l n;rw[ZU _ _ _ (QN _ _ _ _ o n),o,c];have r:=QL a 64 _ f p;rw[q]at r;have:=P0 b (a˧*2^64+d˧) (K+1) e א;unfold AR at this;rw[this] lemma Zce (f:ف) (a d b:ػ) (e:ٴ) (g:a≠0):Yaf f a d b e=π (AT κ ⟨f,a˧*2^128+d˧*2^64+b˧,e⟩):=by have u:=d܉;have v:=b܉;unfold Yaf;have c:=Zj a g;obtain⟨n,o,p⟩:=QF a g;generalize w:a˧܀=K at c n o p;obtain⟨h,k⟩:=Z9 a d (Yj a) K c n o;generalize Yj a=L at c h k⊢;obtain⟨A,l⟩:∃A,a˧*2^64+d˧=A:=⟨_,rfl⟩;rw[l]at h k;have x:=(϶ A (2^(K+1))).symm;have y:A%2^(K+1)<2^(K+1):=Ε _ (Δ _);have q:(2:ٳ)^(K+65)=2^(K+1)*2^64:=ז;have r: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[<-l];ring rw[this,q];conv_lhs=>rw[x] ring have s:A%2^(K+1)*2^64+b˧<2^(K+65):=by rw[q];exact Ag א (ω _ y) have z:(a˧*2^128+d˧*2^64+b˧)/2^(K+65)=A/2^(K+1):=by rw[r,ϔ _ _ (Δ _),Υ s,Β] have B:(a˧*2^128+d˧*2^64+b˧)%2^(K+65)=A%2^(K+1)*2^64+b˧:=by rw[r,ϲ,ν s] have C:((d<<<(63-L) !=0)||(b !=0))=decide ((a˧*2^128+d˧*2^64+b˧)%2^(K+65)≠0):=by rw[k,B,show(b !=0)=decide (b˧≠0)from AB.2 (by simp[<-σ])];simp have j:=QH _ d˧ K p;rw[l]at j;rw[<-z]at h j;have t:=O9 _ _ _ _ h C j;rw[ZU _ _ _ (QN _ _ _ _ t j),t,c];have D:=QL a 128 (d˧*2^64+b˧) g (by clear* -v u;omega);rw[<-BU,w]at D;have:=P0 f (a˧*2^128+d˧*2^64+b˧) (K+65) e א;unfold AR at this;rw[this] lemma O8 (a:ف) (d b f:ػ) (e:ٴ) (g:d˧*2^128+b˧*2^64+f˧≠0):Yay a d b f e=π (AT κ ⟨a,d˧*2^128+b˧*2^64+f˧,e⟩):=by unfold Yay;by_cases j:d=0;subst j;simp only[Ϝ,ϸ,Β]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[bne_iff_ne.2 k,ר];exact Zcd a b f e k;simp only[bne_iff_ne.2 j,ר];exact Zce a d b f e j lemma ZaP (a d b:ػ) (L:ٳ) (f:b˧=L) (g:L<=63) (h:a˧<2^(L+1)) (j:2^L<=a˧) (e:ف):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):=(Am (Δ _)).2 ((by rw[<-Κ,<-Κ,(א:63+(L+1)=L+64)]:2^63*2^(L+1)=2^L*2^64).trans_le ((ω _ j).trans (ώ _ _)));cases e;simp only[φ,ש];rw[k];exact l;simp only[ר];rw[Du,k,show(1:ػ)˧=1 from rfl,Bu];split<;>omega @[inline] def YaR (neg:ف) (m1 m0:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= 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 K5 (a b:ػ) (h:a≠0):(Yj a)˧=a˧܀/\a˧܀<=63/\∀g:ف,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 (σ.1 e);have f:a˧܀<=63:=CI ((Ϻ d).2 a܉);exact⟨Zj a h,f,ZaP a b (Yj a) _ (Zj a h) f Ak (ϰ d)⟩ lemma X9 (a:ف) (b d:ػ) (e:ٴ) (f:ف) (B:ػ) (g:b≠0) (j:Y0 e f B):YaR a b d e f B=Yag a b d e:=by obtain⟨c,o,k⟩:=K5 b d g;generalize b˧܀=K at c o;unfold YaR Yag Yat;dsimp only;generalize Yj b=L at c k⊢;split;rename_i h;simp at h;obtain⟨p,l⟩:=h;have q:(L+190)˧=K+190:=by rw[ξ,c];simp;omega rw[CY]at l⊢;have n:(B+(L+190))˧<=253:=by simpa using ϐ.mp l exact P5 a _ _ _ (k _) (by rw[j _ (by rw[q];omega) p n];push_cast;omega) n;rfl @[inline] def YaS (neg:ف) (m2 m1 m0:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= 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 X8 (a:ف) (b d f:ػ) (e:ٴ) (g:ف) (B:ػ) (j:b≠0) (k:Y0 e g B):YaS a b d f e g B=Yaf a b d f e:=by obtain⟨c,p,l⟩:=K5 b d j;generalize b˧܀=K at c p;unfold YaS Yaf Yat;dsimp only;generalize Yj b=L at c l⊢;split . rename_i h;simp at h;obtain⟨q,n⟩:=h;have r:(L+254)˧=K+254:=by rw[ξ,c];simp;omega rw[CY]at n⊢;have o:(B+(L+254))˧<=253:=by simpa using ϐ.mp n have s:=k _ (by rw[r];omega) q o;exact P5 a _ _ _ (l _) (by rw[s];push_cast;omega) o . rfl @[inline] def Yaz (neg:ف) (m2 m1 m0:ػ) (e:ٴ) (ok:ف) (b:ػ):ؼ:= 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 O7 (a:ف) (d b f:ػ) (e:ٴ) (g:ف) (B:ػ) (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 P3 a f e g B (λh=>k (by rw[h];rfl)) j;simp only[bne_iff_ne.2 n,ר];exact X9 a b f e g B n j;simp only[bne_iff_ne.2 l,ר];exact X8 a d b f e g B l j @[inline] def YaT (w2 w1 w0:ػ) (e:ٴ) (negZero ok:ف) (B:ػ):ؼ:= if w2=0/\w1=0/\w0=0 then (if negZero then ߾ 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 L5 (b d f:ػ) (e:ٴ) (a g:ف) (B:ػ) (j:Y0 e g B):YaT b d f e a g B=ρ (YC b d f) e a:=by have o:b˧*2^128+d˧*2^64+f˧<2^192:=by have:=b܉;have:=d܉;have:=f܉;omega unfold YaT;by_cases l:b=0/\d=0/\f=0;. obtain⟨rfl,rfl,rfl⟩:=l;simp[YC,ρ] have k:b˧*2^128+d˧*2^64+f˧≠0:=λh=>l (by simp only[<-σ,Ϝ];omega) rw[ite_eq_right l];by_cases p:b˧<2^63;. rw[ite_eq_right (by simp[<-σ];omega:¬(b>>>63 !=0)=true),O7 _ _ _ _ _ _ _ k j,O8 _ _ _ _ _ k,AV,<-F9 _ _ _ a k,YC,ite_eq_left p,Int.sub_zero];rfl . generalize q:b˧*2^128+d˧*2^64+f˧=N at o;have n:=Zcc b d f k;rw[q]at n;have r:=n▸Nat.sub_ne_zero_of_lt o;rw[ite_eq_left (by simp[<-σ];omega:(b>>>63 !=0)=true),O7 _ _ _ _ _ _ _ r j,O8 _ _ _ _ _ r,n,AV,<-F9 _ _ _ a א,YC,q,ite_eq_right p,(א:(N:ٴ)-2^192=-((2^192-N:ٳ):ٴ)),ite_eq_left rfl] def Ybo (w2 w1 w0:ػ) (e:ٴ) (negZero:ف):ؼ:= YaT w2 w1 w0 e negZero ((ϱ e).toInt==e) (ϱ e).toUInt64 lemma X7 (b d f:ػ) (e:ٴ) (a:ف):Ybo b d f e a=ρ (YC b d f) e a:= L5 b d f e a _ _ (P4 e) @[inline] def Yf (w:ؼ):ػ:= if θ w=0 then (fracOf w).toUInt64 else (fracOf w).toUInt64+0x800000 @[inline] def Yd (w:ؼ):ػ:= if θ w=0 then 0 else (θ w).toUInt64-1 lemma Zk (w:ؼ):(Yf w)˧=ε w:=by have:=fracOf_toNat_lt w;unfold Yf ε;split_ifs;simp;simp only[ξ];show((fracOf w)؎+ރ)%2^64=2^23+(fracOf w)؎;omega lemma Zf (w:ؼ):(Yd w)˧=γ w:=by unfold Yd γ;split_ifs with h;. rfl . have b:1<=(θ w)؎:=by rcases Ae (θ w)؎with a|a;. exact absurd (ύ.mp (by simpa using a)) h . exact a rw[Η _ _ (by rw[ϐ];simp;omega)];simp lemma Zc (a b:ؾ) (h:a؛+b؛<Λ):(a+b)؛=a؛+b؛:=ν h lemma A4 (A:ؽ δ) (a n k:ؾ) (b:a؛+n؛<=Aٽ) (d:a؛+n؛<Λ) (h:k>>1)>>>(63-r))˧=m˧/2^(64-r˧):=by rw[Ξ,Ξ,X6 r a,ψ,ψ,ν (Nat.sub_lt_succ 63 _),show(1:ػ)˧%64=1 from rfl,ϧ,<-Κ];congr 2;omega lemma G8 (m r:ٳ) (a:r<64):m*2^r%2^64+m/2^(64-r)*2^64=m*2^r:=by rw[<-show m*2^r/2^64=m/2^(64-r) by rw[show(2:ٳ)^64=2^r*2^(64-r) by rw[<-Κ,Ej a.le],<-ϧ,Nat.mul_div_cancel _ (Δ r)]];exact Nat.mod_add_div' _ _ lemma X5 (m s:ػ) (a:s˧<64):((m>>>1)>>>(63-(s&&&63)))˧*2^64+(m<<<(s&&&63))˧ =m˧*2^s˧:=by have b:(s&&&63)˧=s˧:=by rw[H0];exact ν a rw[C0 _ _ א,G9 _ _ א,b];have:=G8 m˧ s˧ a;omega lemma X4 (m s:ػ) (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[H0];omega rw[C0 _ _ א,G9 _ _ א,d];have:=G8 m˧ (s˧-64) א;have:m˧*2^s˧=m˧*2^(s˧-64)*2^64:=by rw[ϣ,<-Κ,Aw a] omega lemma X3 (m s:ػ) (a:s˧<128):(if s<64 then (0:ػ) 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 X5 m s (Ψ.1 h);rw[if_neg h,if_neg h,if_neg h,Ϝ,ϑ];exact X4 m s (DZ.1 (Ψ.not.1 h)) a lemma G7 (y a:ػ) (h:a˧<=1):(y^^^(0-a))˧=if a˧=1 then 2^64-1-y˧ else y˧:=by rcases Ay.1 h with b|d;obtain rfl:a=0:=σ.1 (by simpa using b);simp;obtain rfl:a=1:=σ.1 (by simpa using d);show(y.toBitVec^^^BitVec.allOnes 64).toNat=_;rw[BitVec.xor_allOnes,BitVec.toNat_not];simp lemma ZJ (a b:ػ):(a+b)˧=(a˧+b˧)%2^64 /\ (if a+brw[Ψ,d]at h;show 1=_;omega;show 0=_;omega lemma X2 (f a d g b e:ػ):(f+g+((if a+bsimp[h] rw[ξ,ξ,x,w,v,l,n,p,k];clear* -r s t u;omega lemma X1 (d b a c:ػ):(d+(if b+(if a+comega lemma L3 (a b d:ػ):((a|||b|||d)==0)=decide (d˧*2^128+b˧*2^64+a˧=0):=by rw[AB,beq_iff_eq,ة,DA,DA,<-σ,<-σ,<-σ,Ϝ];omega lemma D4 (a b:ؼ):((a^^^b)>>>31)܅˧=if Ζ (η a) (η b) then 1 else 0:=by have d:∀a:ؼ,η a=decide (a؎/2^31=1):=λa=>by have:=a.toNat_lt;unfold η;have j:(a؎&&&2^31)%2^31=0:=by rw[Nat.and_mod_two_pow,Nat.mod_self,Nat.and_zero] have k:(a؎&&&2^31)/2^31=a؎/2^31%2:=by rw[Nat.and_div_two_pow,Nat.div_self (Δ 31),Nat.and_one_is_mod] rw[(by rw[AB,bne_iff_ne,ة,ne_eq,ne_eq,<-ύ];simp:(a&&&߾!=0)=decide ((a&&&߾)؎≠0)),(ג:(a&&&߾)؎=a؎&&&2^31),AB,ة,ة];omega rw[AG,Ϣ,UInt32.toNat_xor,show(31:ؼ)؎%32=31 from rfl,Nat.shiftRight_xor_distrib,ψ,ψ,d,d];have:=a.toNat_lt;have:=b.toNat_lt;rcases Ay.mp (א:aپ/2^31<=1)with h|h<;>rcases Ay.mp (א:bپ/2^31<=1)with e|e<;>rw[h,e]<;>decide @[inline] def YL {β:Type} (lo:ػ) (a b:ؼ) (w2 w1 w0 c:ػ) (kont:ػ -> ػ -> ػ -> ػ -> β):β:= 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:ػ:=0-ng;let s0:=w0+(y0^^^mk);let k0:ػ:=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 obtain rfl:m=0:=σ.mp (by simpa using a);split_ifs<;>simp lemma Zg (w:ؼ):γ w<=254:=by have:=expOf_toNat_lt w;unfold γ;split_ifs<;>omega lemma ZK (a b:ؼ):ε a*ε b<2^48:=calc ε a*ε b<2^24*2^24:=BP (Ϛ a) (Ϛ b) lemma K4 (a b:δ):(Yf a*Yf b)˧=ε a*ε b:=by rw[ϯ,Zk,Zk];exact ν (by have:=ZK a b;omega) lemma B6 (a b:δ):(Yd a+Yd b)˧=γ a+γ b:=by have:=Zg a;have:=Zg b;rw[ξ,Zf,Zf,ν א] lemma E7 (w:δ):(Yf w==0)=decide (ε w=0):=by rw[AB,beq_iff_eq,ة,<-Zk,<-σ];rfl lemma Zr {β:Type} (d:ػ) (a b:ؼ) (f g h c:ػ) (e:ػ->ػ->ػ->ػ->β) (j:c˧+1<2^64) (k:ε a*ε b≠0->d˧<=γ a+γ b/\γ a+γ b>>31)܅˧<=1:=by rw[p];split<;>decide refine⟨_,_,_,_,rfl,?_,?_⟩;all_goals generalize Yf a*Yf b=m,F:Yd a+Yd b-d=s,((a^^^b)>>>31)܅=l at r p n⊢ . rw[ξ];exact(DY _ _).trans (Ϯ n _) have o:(if s<64 then (0:ػ)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)˧=ε a*ε b*2^(γ a+γ b-d˧):=by by_cases t:ε a*ε b=0;rw[t,ϸ];exact X0 m s (by rw[r,t]);obtain⟨A,G⟩:=k t;have B:s˧=γ a+γ b-d˧:=(by rw[<-F,Η _ _ (by rwa[ϐ,B6]),B6]);rw[<-r,<-B];exact X3 m s (B▸Bz A G) generalize (if s<64 then (0:ػ)else (m>>>1)>>>(63-(s&&&63)))=u,(if s<64 then (m>>>1)>>>(63-(s&&&63))else m<<<(s&&&63))=v,(if s<64 then m<<<(s&&&63)else 0)=w at o⊢;unfold Yx;rw[X2,ξ,ν (a:=c˧+l˧) ((Ϯ n _).trans_lt j),<-Zn];generalize K:ε a*ε b*2^(γ a+γ b-d˧)=P at o;rw[(by rw[<-K];split_ifs<;>push_cast<;>ring:(if Ζ (η a) (η b)then-((ε a*ε b:ٳ):ٴ)else ((ε a*ε b:ٳ):ٴ))*2^(γ a+γ b-d˧)=if Ζ (η a) (η b)then-(P:ٴ)else P)];clear* -p n o;have C:=G7 u l n;have D:=G7 v l n;have E:=G7 w l n;have H:=u܉;have I:=v܉;have J:=w܉;push_cast;rw[Int.emod_add_emod];conv_rhs=>rw[<-CA _ _ (l˧:ٴ)] exact congrArg (·%_) (by linear_combination (by subst o;split_ifs at p C D E⊢<;>omega:((u^^^(0-l))˧*2^128+(v^^^(0-l))˧*2^64+(w^^^(0-l))˧+l˧:ٴ)=(if Ζ (η a) (η b)then-(P:ٴ)else P)+2^192*l˧)) @[inline] def YD (w2 w1 w0 c:ػ) (e:ٴ):ػ:= let t0:=w0+c;let k0:ػ:=if t0>>23).toNat def YM (a:ؼ):ٳ:=((a&&&ק)>>>23).toNat lemma W9 (a:ؼ):(a&&&ק)؎=(θ a)؎*2^23+(fracOf a)؎:=by simp only[AH,θ,fracOf,Ϣ];rw[show(ק:ؼ)؎=2^31-1 from rfl,show(0xFF:ؼ)؎=2^8-1 from rfl,show(0x7FFFFF:ؼ)؎=2^23-1 from rfl,show(23:ؼ)؎%32=23 from rfl,ϡ,ϡ,ϡ,ψ];omega lemma Zb (a:ؼ):YR a<=511/\YM a<=255/\(YM a<255->θ a≠255) /\ (ε a≠0->YR a<=γ a+1/\γ a+1<=max (YM a) 1):=by have e:=expOf_toNat_lt a;have f:=fracOf_toNat_lt a;unfold YR YM ε γ;simp only[Ϣ,CX,CD,BY,ψ,W9,ne_eq,<-ύ];rw[Ϟ _ (fracOf a)؎,ϔ _ _ (Δ _),Υ f,Β];generalize (θ 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:=א;refine⟨CI (ϕ (Ε _ ד)),CI e,ne_of_lt,λd=>?_⟩;by_cases b:E=0;rw[if_pos b]at d⊢;exact⟨(K.resolve_right λh=>d h.2).trans א,le_max_right _ _⟩;rw[if_neg b]at d⊢;rw[Aw (Ο b)];exact⟨K.resolve_right λh=>b h.1,le_max_left _ _⟩ def Yah (A:ؽ δ) (base n:ؾ) (hA:baseپ+nپ<=Aٽ) (hs:baseپ+nپ<Λ) (lo hi:ؼ) (k:ؾ):ؼ:= if h:k>>23)<<<16)+(hi>>>23) termination_by nپ-kپ decreasing_by exact ZI n k h lemma W8 (A:ؽ δ) (a n:ؾ) (h:a؛+n؛<=Aٽ) (f:a؛+n؛<Λ) (b e:ؼ) (k:ؾ) (j:k؛<=n؛) (g:e؎<2^31):∃ L H:ٳ,(Yah A a n h f b e k)؎=L*2^16+H/\L<=511/\H<=255 /\ L<=b؎/2^23/\e؎/2^23<=H /\ ∀t,k؛<=t->tL<=YR A[a؛+t]! /\ YM A[a؛+t]! <= H:=by generalize E:n؛-k؛=d;induction d generalizing k b e with |zero=> rw[Yah,dif_neg (mt υ.1 א)];have:=b.toNat_lt;refine⟨b؎/2^23,e؎/2^23,?_,א,א,le_rfl,le_rfl,λt o p=>א⟩;simp only[UInt32.toNat_add,Dk,Ϣ,CD,BY];omega |succ d u=> have q:komega) א;have r:L<=b؎/2^23∧L<=YR w:=by split_ifs at y with l<;>rw[Dl]at l<;>omega have s:e؎/2^23<=H∧YM w<=H:=by split_ifs at z with l<;>rw[Dl]at l<;>omega refine⟨L,H,o,p,x,r.1,s.1,λt K C=>?_⟩;obtain rfl|D:t=kپ∨(k+1)؛<=t:=א;rw[v];exact⟨r.2,s.2⟩;exact B t D C def YS (X W:ؽ δ) (xa wa n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW:waپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw:waپ+nپ<Λ) (lo:ػ) (e:ٴ) (bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if h:kYS X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL lo ζ bw w2 w1 w0 c λv2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nپ-kپ decreasing_by exact ZI n k h def YB (X W:ؽ δ) (xa wa lo k:ٳ):ٳ -> ٴ | 0=>0 | r+1=>sv X[xa+k]! * sv W[wa+k]! * 2^(γ X[xa+k]! + γ W[wa+k]! - lo) + YB X W xa wa lo (k+1) r lemma ZL (a b:ؼ) (d:ٳ) (h:ε a*ε b≠0->d<=γ a+γ b/\γ a+γ b<=d+122):-(2^170:ٴ)<=sv a*sv b*2^(γ a+γ b-d) /\ sv a*sv b*2^(γ a+γ b-d)<=2^170:=by rw[<-Zn];have g:=ZK a b;by_cases e:ε a*ε b=0;rw[e];split_ifs<;>simp;obtain⟨j,k⟩:=h e;have f:2^(γ a+γ b-d)<=2^122:=Ι ב א;have l:=(Ar (א:ε a*ε b<=2^48) f).trans_eq (ב:2^48*2^122=2^170);have c:((ε a*ε b:ٳ):ٴ)*2^(γ a+γ b-d)=((ε a*ε b*2^(γ a+γ b-d):ٳ):ٴ):=by push_cast;ring split_ifs;rw[neg_mul,c];omega;rw[c];omega lemma ZW (a b:ٳ->ؼ):∀r k,Yo a b k (r+1)=Yo a b k r+sv (a (k+r))*sv (b (k+r))*2^(γ (a (k+r))+γ (b (k+r))):=by intro r;induction r;simp[Yo];next r d=>intro k;rw[Yo,d (k+1),Yo,BU k 1 r,Ϟ 1 r];ring lemma ZA (a b:ؼ) (d:ٳ) (h:ε a*ε b≠0->d<=γ a+γ b):sv a*sv b*2^(γ a+γ b)=2^d*(sv a*sv b*2^(γ a+γ b-d)):=by by_cases e:ε a*ε b=0;. rw[(by rw[<-Zn,e];split_ifs<;>simp:sv a*sv b=0)];ring rw[mul_left_comm,<-pow_add,Ej (h e)] @[inline] def Yc (A:ؽ δ) (inW i:ٳ):ؼ:= if h:i*inW+inW<=Aٽ/\i*inW+inW<=ހ then Yah A (i*inW).toUSize inWٿ (by rw [Za _ א,Za _ א];exact h.1) (by rw [Za _ א,Za _ א];have:=τ;omega) 0xFFFFFFFF 0 0 else 0x01FF00FF @[inline] def Yk (k:ؼ):ػ:=(if k=0 then 0 else k-1).toUInt64 @[inline] def Yp (bx bv bw:ؼ):ػ:= let lo0:=Yk (bx>>>16)+Yk (bv>>>16);let xb:=Yd ζ+Yd bw;if !(Yf bw==0)&&xbif t < inW then X[i*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!) @[inline] def YL6 {β:Type} (lo:ػ) (a b:ؼ) (w2 w1 w0 c:ػ) (kont:ػ -> ػ -> ػ -> ػ -> β):β:= let m:=Yf a*Yf b;let s:=Yd a+Yd b-lo;let rr:=s&&&63;let y0:=m<<>>1)>>>(63-rr);let ng:=((a^^^b)>>>31).toUInt64;let mk:ػ:=0-ng;let s0:=w0+(y0^^^mk);let k0:ػ:=if s0ػ->ػ->ػ->β) (h:ε a*ε b=0\/(e˧<=γ a+γ b/\γ a+γ b<=e˧+63)):YL6 e a b f g j c d=YL e a b f g j c d:=by unfold YL6 YL;by_cases k:Yd a+Yd b-e<64;·simp only[k,ר,Ch] have o:Yf a*Yf b=0:=by rcases h with h|⟨p,q⟩;rcases Ax.1 h with h|h;simp[(σ.1 (by rw[Zk,h];rfl):Yf a=0)];simp[(σ.1 (by rw[Zk,h];rfl):Yf b=0)];exfalso;apply k;have l:=Zf a;have n:=Zf b;have r:=Zg a;have s:=Zg b;rw[Ψ,Η _ _ (ϐ.2 (by rw[ξ,l,n];norm_num;omega)),ξ,l,n];norm_num;omega simp only[k,ש,o,DB,Dm,Ch] @[inline] def YL16 {β:Type} (lo:ػ) (a b:ؼ) (_w2 h w0 c:ػ) (kont:ػ -> ػ -> ػ -> ػ -> β):β:= let m:=Yf a*Yf b;let s:=Yd a+Yd b-lo;let y0:=m<<<(s&&&63);let ng:=((a^^^b)>>>31).toUInt64;let mk:ػ:=0-ng;let s0:=w0+(y0^^^mk);let k0:ػ:=if s0>>63)) (h+mk+k0) s0 (c+ng) lemma J3 (h a b:ػ) (d:a=0\/a=0-1) (f:b=0\/b=1) (g:h˧≠2^63-1/\h˧≠2^63):(0:ػ)-(h>>>63)+a+((if h+a>>63):=by have e:∀x:ػ,((0:ػ)-(x>>>63))˧=if x˧<2^63 then 0 else 2^64-1:=by intro x;have:=x܉;rw[Τ,Ξ,ψ];simp only[Ϝ,show(63:ػ)˧%64=63 from rfl];split_ifs<;>omega have j:=h܉;replace g:h˧<2^63-1\/2^63rcases f with rfl|rfl<;>split_ifs with k l<;>simp only[Ψ,ξ,e,Du,show(0-1:ػ)˧=2^64-1 from rfl,Ϝ,Da,Nat.zero_or,Nat.or_zero,Nat.or_self]at*<;>split_ifs at*<;>omega lemma S5 (h a b:ػ) (k:ٳ) (d:a=0\/a=0-1) (e:b=0\/b=1) (g:h˧<=k\/2^64-k<=h˧) (f:k<2^62):(h+a+b)˧<=k+1\/2^64-(k+1)<=(h+a+b)˧:=by have j:=h܉;rcases d with rfl|rfl<;>rcases e with rfl|rfl<;>simp only[ξ,show(0-1:ػ)˧=2^64-1 from rfl,Ϝ,Da]<;>omega lemma S6 (m r:ػ) (a:m˧<2^48) (b:r˧<=16):(m>>>1)>>>(63-r)=0:=by apply σ.mp;rw[Ξ,Ξ,Η _ _ (ϐ.mpr (by show r˧<=63;omega)),ψ,ψ,show(63:ػ)˧=63 from rfl,show(1:ػ)˧%64=1 from rfl,Ϝ,ν (show 63-r˧<64 by omega),ϧ];exact Υ (a.trans_le (by rw[<-Κ];exact Ι ב א)) lemma E1 (a b:ؼ):(0:ػ)-((a^^^b)>>>31)܅=0\/(0:ػ)-((a^^^b)>>>31)܅=0-1:=by have:=D4 a b;split at this;right;rw[σ.1 (show((a^^^b)>>>31)܅˧=(1:ػ)˧from this)];left;rw[σ.1 (show((a^^^b)>>>31)܅˧=(0:ػ)˧from this)];rfl lemma C5 {β:Type} (e:ػ) (a b:ؼ) (h f c:ػ) (d:ػ->ػ->ػ->ػ->β) (g:ε a*ε b=0\/(e˧<=γ a+γ b/\γ a+γ b<=e˧+16)) (j:h˧≠2^63-1/\h˧≠2^63):YL e a b ((0:ػ)-(h>>>63)) h f c d=YL16 e a b ((0:ػ)-(h>>>63)) h f c d:=by have n:=Zf a;have o:=Zf b;have u:=Zg a;have v:=Zg b;have k:ε a*ε b=0->Yf a*Yf b=0:=λl=>σ.mp (by rw[ϯ,Zk,Zk,l];rfl);have p:((Yf a*Yf b)>>>1)>>>(63-((Yd a+Yd b-e)&&&63))=0:=by rcases g with l|⟨r,s⟩;rw[k l];simp;apply S6;rw[ϯ,Zk,Zk];have:=ZK a b;omega;rw[H0,Η _ _ (ϐ.mpr (by rw[ξ,n,o];omega)),ξ,n,o];omega unfold YL YL16;dsimp only;by_cases q:Yd a+Yd b-e<64;simp only[q,ר,p,Ch];rw[J3 h _ _ (E1 a b) ?_ j];split<;>simp;have t:Yf a*Yf b=0:=by rcases g with l|⟨r,s⟩;exact k l;exfalso;apply q;rw[Ψ,Η _ _ (ϐ.mpr (by rw[ξ,n,o];omega)),ξ,n,o];norm_num;omega simp only[q,ש,t,DB,Dm,Ch];rw[J3 h _ _ (E1 a b) ?_ j];split<;>simp def YS6 (q:ف) (X W:ؽ δ) (xa wa n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW:waپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw:waپ+nپ<Λ) (lo:ػ) (e:ٴ) (bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= if h:kYS6 q X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL6 lo (X.uget (xa+k) (A4 X xa n k hX hx h)) (W.uget (wa+k) (A4 W wa n k hW hw h)) w2 w1 w0 c λv2 v1 v0 c'=>YS6 q X W xa wa n hX hW hx hw lo e bw v2 v1 v0 c' (k+1) else YL lo ζ bw w2 w1 w0 c λv2 v1 v0 c'=>YD v2 v1 v0 c' e termination_by nپ-kپ decreasing_by all_goals exact ZI n k h lemma I6 (q:ف) (X W:ؽ δ) (a b n:ؾ) (j:a؛+n؛<=Xٽ) (l:b؛+n؛<=Wٽ) (g:a؛+n؛<Λ) (h:b؛+n؛<Λ) (f:ػ) (e:ٴ) (o:ؼ) (p:n؛<2^62) (D:ٳ) (r:q->D<=16) (s:D<=63) (u:∀t,tε X[a؛+t]! * ε W[b؛+t]! ≠ 0->f˧<=γ X[a؛+t]! + γ W[b؛+t]! /\ γ X[a؛+t]! + γ W[b؛+t]! <= f˧+D):∀ (d:ٳ) (k:ؾ) (w v x c:ػ),n؛-k؛=d->(q->w=(0:ػ)-(v>>>63)/\(v˧<=k؛\/2^64-k؛<=v˧))->YS6 q X W a b n j l g h f e o w v x c k=YS X W a b n j l g h f e o w v x c k:=by intro d;induction d<;>intro k w v x c B J ·have y:=υ.not.2 (Dw B).not_gt;rw[YS6,YS,dif_neg y,dif_neg y] rename_i d E;have z:=Al B;have y:=υ.2 z;have F:=QK n k y;have G:n؛-(k+1)؛=d:=by rw[F];omega rw[YS6,YS,dif_pos y,dif_pos y,B3 X a k _ ((ϴ z _).trans g),B3 W b k _ ((ϴ z _).trans h)];have C:=u k؛ z;cases q;rw[if_neg AC,I7 f _ _ w v x c _ (or_iff_not_imp_left.2 λA=>⟨(C A).1,(C A).2.trans (by gcongr)⟩)];apply congrArg;funext K L M N;exact E _ K L M N G ג;obtain⟨rfl,H⟩:=J rfl;have I:=z.trans p;rw[if_pos rfl,C5 f _ _ v x c _ (or_iff_not_imp_left.2 λA=>⟨(C A).1,(C A).2.trans (by gcongr;exact r rfl)⟩) (by clear* -H I;omega)];unfold YL16;dsimp only;apply E (k+1) _ _ _ _ G (λ_=>⟨rfl,?_⟩);rw[F];apply S5 v _ _ k؛ (E1 _ _) ?_ H I;split<;>simp @[inline] def YaU (X W b:ؽ δ) (inW i j:ٳ) (bx bv:ؼ):δ:= if h:i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\i*inW+inW<=ހ /\ j*inW+inW<=ހ/\inW<ށ then let bw:=b[j]!;let lo:=Yp bx bv bw;let hi:=Yu bx bv bw;if (bx&&&ޅ)=255||(bv&&&ޅ)=255||θ bw=255||hi122 then Yai X W b inW i j else have p1:(i*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];exact h.1 have p2:(j*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];exact h.2.1 have p3:(i*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have p4:(j*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega let r:=if hi-lo<=63 then YS6 (hi-lo<=16) X W (i*inW).toUSize (j*inW).toUSize inWٿ p1 p2 p3 p4 lo ((loپ:ٴ)-298) bw 0 0 0 0 0 else YS X W (i*inW).toUSize (j*inW).toUSize inWٿ p1 p2 p3 p4 lo ((loپ:ٴ)-298) bw 0 0 0 0 0 if r<߿ then r.toUInt32 else Yai X W b inW i j else Yai X W b inW i j @[specialize] def Yaj (hw:ٳ) (f:ٳ -> ٳ -> δ) (ch j:ٳ) (acc:ؽ δ):ؽ δ:= if j ٳ -> δ) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if ch ٳ -> δ):ؽ δ:=Yak c hw f 0 (AY (c*hw)) lemma D3 (a:ٳ) (f:ٳ->ٳ->δ) (b:ٳ):∀k j (d:ؽ δ),a-j=k->(Yaj a f b j d)܍=d܍++(Bd j (a-j)).map (f b):=by intro k;induction k<;>intro j d h<;>unfold Yaj;rw[if_neg א];simp[h];next k e=>rw[if_pos א,e (j+1) _ א,Cx,h,Ϩ];simp lemma W5 (c a:ٳ) (f:ٳ->ٳ->δ):∀k b (d:ؽ δ),c-b=k->(Yak c a f b d)܍=d܍++(Bd (b*a) ((c-b)*a)).map (λi=>f (i/a) (i%a)):=by intro k;induction k<;>intro b d h<;>unfold Yak ·rw[if_neg א];simp[h] rename_i e;rw[if_pos א,e (b+1) _ א,D3 a f b _ 0 _ rfl,show(c-b)*a=a+(c-(b+1))*a by rw[(א:c-b=c-(b+1)+1),Dp,Ϟ],<-List.range'_append,List.map_append,Ah];simp only[CL,Ai];congr 2;rw[show Bd (b*a) a=(Bd 0 a).map (b*a+·) by rw[DS];simp,Df];apply Ck;intro j g;rw[List.mem_range'_1]at g;have q:jٳ->δ):YT c a f=ڀ N λi=>f (i܂/a) (i܂%a):=by subst b;apply ϻ;rw[YT,W5 c a f _ 0 _ rfl];apply ϩ<;>simp @[inline] def QhiS (hi lo q:ػ):ػ:= hi+((0:ػ)-(q>>>63))+(if lo+q>>16) @[specialize] def QY6G (n:ؾ) (f:(k:ؾ) -> k ػ) (B0:ػ) (bw:ؼ) (hi lo:ػ) (k:ؾ):ػ:= if h:k>>63)) hi lo 0 λv2 v1 v0 c' => YD v2 v1 v0 c' ((B0پ:ٴ)-298) termination_by nپ-kپ decreasing_by exact ZI n k h @[inline] def QPb (x:ؼ) (m:ػ) (s:ف):ٳ:= let M:=Yf x<<<(Yd x-m);(if η x != s then ބ-M else ބ+M).toNat @[specialize] def QPD (n:ٳ) (f:ٳ -> ؼ) (m:ػ) (t:ٳ) (P:ؽ ٳ):ؽ ٳ:= if t ؼ) (t:ٳ) (I:ؽ ؼ):ؽ ؼ:= if t>>31).toUSize)؛=2*k؛+(w>>>31)؎/\(w>>>31)؎<2:=by have e:(w>>>31)؎<2:=by rw[Ϣ,ψ];exact ϕ w.toNat_lt have:=τ;exact⟨by rw[Zc _ _ (by rw[Zc _ _ א,AI];omega),Zc _ _ א,AI];omega,e⟩ @[inline] def QPS (inW:ٳ) (BX BV:ؽ ؼ):ف:= 16<=inW&&BX.all (λbx=>bx&&&ޅ != 255)&&BV.all (λbv=>bv&&&ޅ != 255) && (BX.foldl (λ(m:ػ) (bx:ؼ)=>min m (QYF bx)) 99).toNat+(BV.foldl (λ(m:ػ) (bv:ؼ)=>max m (QYF bv)) 0).toNat<=15 lemma R8 (u:ؼ) (n:ٳ) (h:n<ށ):(min u (n-1).toUInt32)؎<=n-1 /\ (u؎<=n-1->min u (n-1).toUInt32=u):=by have e:(n-1).toUInt32؎=n-1:=ו;rw[UInt32.min_def];split<;>rename_i c<;>rw[AJ,e]at c;exact⟨c,λ_=>rfl⟩;exact⟨by omega,(absurd · c)⟩ @[inline] def QPa (X:ؽ δ) (P:ؽ ٳ) (I:ؽ ؼ) (W b:ؽ δ) (inW i j:ٳ) (bx bv:ؼ):δ:= let xm:=Yk (bx>>>16) let wm:=Yk (bv>>>16) let bw:=b[j]! let xb:=Yd ζ+Yd bw if h:Pٽ=2*(if Iٽ=0 then inW else Iٽ)/\Iٽ<=inW/\i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\i*inW+inW<=ހ /\ j*inW+inW<=ހ/\inW<ށ/\(bx&&&ޅ)≠255/\(bv&&&ޅ)≠255 /\ xm<=Yk (bx&&&ޅ)/\wm<=Yk (bv&&&ޅ)/\(QYF bx).toNat+(QYF bv).toNat<=15 /\ θ bw≠255/\(Yf bw=0\/(xm+wm<=xb/\xb-(xm+wm)<80))/\1<=wm then let wa:=(j*inW).toUSize let iw:=(inW-1).toUInt32 let r:=if c:Iٽ=0 then QY6G inWٿ (λk hk=> let w:=W.uget (wa+k) (by have:=υ.mp hk;rw [Za _ א] at this;simp only [wa];rw [Zc _ _ (by rw [Za _ א];have:=τ;omega),Za _ א];omega) ((P.uget (k+k+(w>>>31).toUSize) (by have:=υ.mp hk;rw [Za _ א] at this;have:=D0 k w א;rw [if_pos c] at h;omega)).toUInt64-ބ)*(Yf w<<<((θ w).toUInt64-(wm+1)))) (xm+wm) bw 0 0 0 else QY6G Iٽٿ (λk hk=> let u:=I.uget k (by have:=υ.mp hk;rw [Za _ א] at this;omega) let w:=W.uget (wa+(min u iw).toUSize) (by have:=υ.mp hk;rw [Za _ א] at this;have:=(R8 u inW א).1;simp only [wa,iw] at *;rw [Zc _ _ (by rw [Za _ א,AI];have:=τ;omega),Za _ א,AI];omega) ((P.uget (k+k+(w>>>31).toUSize) (by have:=υ.mp hk;rw [Za _ א] at this;have:=D0 k w א;rw [if_neg c] at h;omega)).toUInt64-ބ)*(Yf w<<<((θ w).toUInt64-(wm+1)))) (xm+wm) bw 0 0 0 if r<߿ then r.toUInt32 else Yai X W b inW i j else YaU X W b inW i j bx bv @[specialize] def YS6c4 {β:Type} (kont:ػ -> ػ -> ػ -> ػ -> β) (q:ف) (X W:ؽ δ) (xa w1a w2a w3a w4a n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW1:w1aپ+nپ<=Wٽ) (hW2:w2aپ+nپ<=Wٽ) (hW3:w3aپ+nپ<=Wٽ) (hW4:w4aپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw1:w1aپ+nپ<Λ) (hw2:w2aپ+nپ<Λ) (hw3:w3aپ+nپ<Λ) (hw4:w4aپ+nپ<Λ) (lo1 lo2 lo3 lo4:ػ) (e1 e2 e3 e4:ٴ) (bw1 bw2 bw3 bw4:ؼ) (a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc:ػ) (k:ؾ):β:= if h:kYL16 lo2 x w2 b2 b1 b0 bc λb2 b1 b0 bc=>YL16 lo3 x w3 c2 c1 c0 cc λc2 c1 c0 cc=>YL16 lo4 x w4 d2 d1 d0 dc λd2 d1 d0 dc=>YS6c4 kont q X W xa w1a w2a w3a w4a n hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw1 bw2 bw3 bw4 a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc (k+1) else YL6 lo1 x w1 a2 a1 a0 ac λa2 a1 a0 ac=>YL6 lo2 x w2 b2 b1 b0 bc λb2 b1 b0 bc=>YL6 lo3 x w3 c2 c1 c0 cc λc2 c1 c0 cc=>YL6 lo4 x w4 d2 d1 d0 dc λd2 d1 d0 dc=>YS6c4 kont q X W xa w1a w2a w3a w4a n hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw1 bw2 bw3 bw4 a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc (k+1) else kont (YL lo1 ζ bw1 a2 a1 a0 ac λv2 v1 v0 c'=>YD v2 v1 v0 c' e1) (YL lo2 ζ bw2 b2 b1 b0 bc λv2 v1 v0 c'=>YD v2 v1 v0 c' e2) (YL lo3 ζ bw3 c2 c1 c0 cc λv2 v1 v0 c'=>YD v2 v1 v0 c' e3) (YL lo4 ζ bw4 d2 d1 d0 dc λv2 v1 v0 c'=>YD v2 v1 v0 c' e4) termination_by nپ-kپ decreasing_by all_goals exact ZI n k h @[inline] def YaUc4 (X W b:ؽ δ) (inW i j:ٳ) (bx bv1 bv2 bv3 bv4:ؼ):(δ × δ) × (δ × δ):= let bw1:=b[j]!;let bw2:=b[j+1]!;let bw3:=b[j+2]!;let bw4:=b[j+2+1]! let lo1:=Yp bx bv1 bw1;let hi1:=Yu bx bv1 bw1;let lo2:=Yp bx bv2 bw2;let hi2:=Yu bx bv2 bw2 let lo3:=Yp bx bv3 bw3;let hi3:=Yu bx bv3 bw3;let lo4:=Yp bx bv4 bw4;let hi4:=Yu bx bv4 bw4 let q:=hi1-lo1<=16 if h:i*inW+inW<=Xٽ/\j*inW+inW<=Wٽ/\(j+1)*inW+inW<=Wٽ/\(j+2)*inW+inW<=Wٽ/\(j+2+1)*inW+inW<=Wٽ/\i*inW+inW<=ހ/\j*inW+inW<=ހ/\(j+1)*inW+inW<=ހ/\(j+2)*inW+inW<=ހ/\(j+2+1)*inW+inW<=ހ/\inW<ށ/\ ((bx&&&ޅ)=255||(bv1&&&ޅ)=255||θ bw1=255||hi1122)=false/\((bx&&&ޅ)=255||(bv2&&&ޅ)=255||θ bw2=255||hi2122)=false/\ ((bx&&&ޅ)=255||(bv3&&&ޅ)=255||θ bw3=255||hi3122)=false/\((bx&&&ޅ)=255||(bv4&&&ޅ)=255||θ bw4=255||hi4122)=false/\ hi1-lo1<=63/\hi2-lo2<=63/\hi3-lo3<=63/\hi4-lo4<=63/\(hi2-lo2<=16)=q/\(hi3-lo3<=16)=q/\(hi4-lo4<=16)=q then have hX:(i*inW).toUSizeپ+inW.toUSizeپ<=Xٽ:=by rw [Za _ א,Za _ א];omega have hx:(i*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW1:(j*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw1:(j*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW2:((j+1)*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw2:((j+1)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW3:((j+2)*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw3:((j+2)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega have hW4:((j+2+1)*inW).toUSizeپ+inW.toUSizeپ<=Wٽ:=by rw [Za _ א,Za _ א];omega have hw4:((j+2+1)*inW).toUSizeپ+inW.toUSizeپ<Λ:=by rw [Za _ א,Za _ א];have:=τ;omega YS6c4 (λr1 r2 r3 r4=>((if r1<߿ then r1.toUInt32 else Yai X W b inW i j,if r2<߿ then r2.toUInt32 else Yai X W b inW i (j+1)),(if r3<߿ then r3.toUInt32 else Yai X W b inW i (j+2),if r4<߿ then r4.toUInt32 else Yai X W b inW i (j+2+1)))) q X W (i*inW).toUSize (j*inW).toUSize ((j+1)*inW).toUSize ((j+2)*inW).toUSize ((j+2+1)*inW).toUSize inWٿ hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 ((lo1پ:ٴ)-298) ((lo2پ:ٴ)-298) ((lo3پ:ٴ)-298) ((lo4پ:ٴ)-298) bw1 bw2 bw3 bw4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 else ((YaU X W b inW i j bx bv1,YaU X W b inW i (j+1) bx bv2),(YaU X W b inW i (j+2) bx bv3,YaU X W b inW i (j+2+1) bx bv4)) @[inline] def QPac4 (X:ؽ δ) (P:ؽ ٳ) (I:ؽ ؼ) (W b:ؽ δ) (inW i j:ٳ) (bx bv1 bv2 bv3 bv4:ؼ):(δ × δ) × (δ × δ):= if Pٽ=0/\1<=inW then YaUc4 X W b inW i j bx bv1 bv2 bv3 bv4 else ((QPa X P I W b inW i j bx bv1,QPa X P I W b inW i (j+1) bx bv2),(QPa X P I W b inW i (j+2) bx bv3,QPa X P I W b inW i (j+2+1) bx bv4)) @[specialize] def Yaj4 (hw:ٳ) (f:ٳ -> ٳ -> δ) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4:ٳ -> ف) (ch j:ٳ) (acc:ؽ δ):ؽ δ:= if j+3 ٳ -> δ) (f4:ٳ -> ٳ -> (δ × δ) × (δ × δ)) (d4:ٳ -> ف) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if ch>> 31).toUInt64;let mk:UInt64:=0-ng;(0x80000000:UInt64)+((v ^^^ mk)-mk) @[inline] def B8x2 (e:UInt64) (x:UInt32):UInt64:=let v:=Yf x <<< (Yd x - e);let ng:=(x >>> 31).toUInt64;let mk:UInt64:=0-ng;(0x8000000000000000:UInt64)+((v ^^^ mk)-mk) lemma B8A (A:ؽ δ) (a n k S r:ؾ) (b:a؛+S؛*n؛<=Aٽ) (d:a؛+S؛*n؛<Λ) (e:r؛ ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> β) (XL W:ؽ δ) (xa wa n:ؾ) (hX:xa؛+(8:ؾ)؛*n؛<=XLٽ) (gX:xa؛+(8:ؾ)؛*n؛<Λ) (hW:wa؛+n؛<=Wٽ) (gW:wa؛+n؛<Λ) (w0:ػ) (a0 c0 a1 c1 a2 c2 a3 c3 a4 c4 a5 c5 a6 c6 a7 c7 sw:ػ) (k:ؾ):β:= if h:kYD v2 v1 v0 c' ((lo˧:ٴ)-298)) < ߿ then (YL lo ζ bw w2 w1 w0 0 (λv2 v1 v0 c'=>YD v2 v1 v0 c' ((lo˧:ٴ)-298)))՜ else Yai X W b inW i j) else if Yd ζ+Yd bw < lo && lo-(Yd ζ+Yd bw) <= 64 then (if YL (lo-64) ζ bw w1 w0 0 0 (λv2 v1 v0 c'=>YD v2 v1 v0 c' (((lo-64)˧:ٴ)-298)) < ߿ then (YL (lo-64) ζ bw w1 w0 0 0 (λv2 v1 v0 c'=>YD v2 v1 v0 c' (((lo-64)˧:ٴ)-298)))՜ else Yai X W b inW i j) else Yai X W b inW i j) @[inline] def B8F1 (X W b:ؽ δ) (inW i j:ٳ) (relu:ف) (bw:ؼ) (e0 ew0 a c sx sw:ػ):δ:= let q:=sx+sw B8G X W b inW i j relu bw (e0+ew0) ((0:ػ)-(((c-(q>>>33)-(if a<(q<<<31) then (1:ػ) else 0))+(inW߸>>>2)+(if (a-(q<<<31))+(inW߸<<<62)<(a-(q<<<31)) then (1:ػ) else 0))>>>63)) ((c-(q>>>33)-(if a<(q<<<31) then (1:ػ) else 0))+(inW߸>>>2)+(if (a-(q<<<31))+(inW߸<<<62)<(a-(q<<<31)) then (1:ػ) else 0)) ((a-(q<<<31))+(inW߸<<<62)) @[inline] def B8W (W b:ؽ δ) (inW j:ٳ) (bv:ؼ):ف:= (bv&&&ޅ) != 255 && Yk (bv>>>16) <= Yk (bv&&&ޅ) && QYF bv <= 7 && θ (b[j]!) != 255 && j*inW+inW <= Wٽ && j*inW+inW <= ހ && inW < ށ lemma B8Wv (W b:ؽ δ) (inW j:ٳ) (bv:ؼ) (h:B8W W b inW j bv=true):(bv&&&ޅ)≠255 /\ Yk (bv>>>16)<=Yk (bv&&&ޅ) /\ (QYF bv)˧<=7 /\ θ b[j]!≠255 /\ j*inW+inW<=Wٽ /\ j*inW+inW<=ހ /\ inW<ށ:=by simp only[B8W,Ω,bne_iff_ne,ne_eq,ת]at h;obtain⟨⟨⟨⟨⟨⟨a,c⟩,d⟩,e⟩,f⟩,g⟩,k⟩:=h;exact⟨a,c,ϐ.1 d,e,f,g,k⟩ @[inline] def B8K1 (X W b XL:ؽ δ) (inW i0 j:ٳ) (relu:ف) (BX BV:ؽ ؼ) (S:ؽ ػ) (h:B8W W b inW j BV[j]! = true/\XLٽ=8*inW):δ × δ × δ × δ × δ × δ × δ × δ:= B8I1 (λa0 c0 a1 c1 a2 c2 a3 c3 a4 c4 a5 c5 a6 c6 a7 c7 sw=>(B8F1 X W b inW (i0+0) j relu b[j]! (Yk (BX[i0+0]!>>>16)) (Yk (BV[j]!>>>16)) a0 c0 S[0]! sw,B8F1 X W b inW (i0+1) j relu b[j]! (Yk (BX[i0+1]!>>>16)) (Yk (BV[j]!>>>16)) a1 c1 S[1]! sw,B8F1 X W b inW (i0+2) j relu b[j]! (Yk (BX[i0+2]!>>>16)) (Yk (BV[j]!>>>16)) a2 c2 S[2]! sw,B8F1 X W b inW (i0+3) j relu b[j]! (Yk (BX[i0+3]!>>>16)) (Yk (BV[j]!>>>16)) a3 c3 S[3]! sw,B8F1 X W b inW (i0+4) j relu b[j]! (Yk (BX[i0+4]!>>>16)) (Yk (BV[j]!>>>16)) a4 c4 S[4]! sw,B8F1 X W b inW (i0+5) j relu b[j]! (Yk (BX[i0+5]!>>>16)) (Yk (BV[j]!>>>16)) a5 c5 S[5]! sw,B8F1 X W b inW (i0+6) j relu b[j]! (Yk (BX[i0+6]!>>>16)) (Yk (BV[j]!>>>16)) a6 c6 S[6]! sw,B8F1 X W b inW (i0+7) j relu b[j]! (Yk (BX[i0+7]!>>>16)) (Yk (BV[j]!>>>16)) a7 c7 S[7]! sw)) XL W 0 (j*inW).toUSize inW.toUSize (by have u:=B8Wv W b inW j BV[j]! h.1;rw[h.2,Za inW (א)];simp) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za inW (א)];have:=τ;simp;omega) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za _ (א),Za inW (א)];omega) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za _ (א),Za inW (א)];have:=τ;omega) (Yk (BV[j]!>>>16)) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 def B8C1 (X W b XL:ؽ δ) (inW outW i0:ٳ) (relu:ف) (BX BV:ؽ ؼ) (F:ٳ -> ٳ -> δ) (S:ؽ ػ) (j:ٳ) (O0 O1 O2 O3 O4 O5 O6 O7:ؽ δ):ؽ δ:= if j < outW then if h:B8W W b inW j BV[j]! = true/\XLٽ=8*inW then let r:=B8K1 X W b XL inW i0 j relu BX BV S h B8C1 X W b XL inW outW i0 relu BX BV F S (j+1) (O0.push r.1) (O1.push r.2.1) (O2.push r.2.2.1) (O3.push r.2.2.2.1) (O4.push r.2.2.2.2.1) (O5.push r.2.2.2.2.2.1) (O6.push r.2.2.2.2.2.2.1) (O7.push r.2.2.2.2.2.2.2) else B8C1 X W b XL inW outW i0 relu BX BV F S (j+1) (O0.push (F (i0+0) j)) (O1.push (F (i0+1) j)) (O2.push (F (i0+2) j)) (O3.push (F (i0+3) j)) (O4.push (F (i0+4) j)) (O5.push (F (i0+5) j)) (O6.push (F (i0+6) j)) (O7.push (F (i0+7) j)) else O0++O1++O2++O3++O4++O5++O6++O7 termination_by outW-j @[inline] def B8R (X:ؽ δ) (inW i:ٳ) (bx:ؼ) (c:ػ):ف:=(bx&&&ޅ) != 255 && Yk (bx>>>16) <= Yk (bx&&&ޅ) && QYF bx <= c && i*inW+inW <= Xٽ && i*inW+inW <= ހ @[inline] def B8R8 (X:ؽ δ) (inW ch:ٳ) (BX:ؽ ؼ) (c:ػ):ف:=B8R X inW (ch+0) BX[ch+0]! c&&B8R X inW (ch+1) BX[ch+1]! c&&B8R X inW (ch+2) BX[ch+2]! c&&B8R X inW (ch+3) BX[ch+3]! c&&B8R X inW (ch+4) BX[ch+4]! c&&B8R X inW (ch+5) BX[ch+5]! c&&B8R X inW (ch+6) BX[ch+6]! c&&B8R X inW (ch+7) BX[ch+7]! c def B8P2 (X:ؽ δ) (inW:ٳ) (b0 b1 b2 b3 b4 b5 b6 b7:ٳ) (e0 e1 e2 e3 e4 e5 e6 e7:ػ) (t:ٳ) (XA XB:ؽ δ) (l0 l1 l2 l3 l4 l5 l6 l7 h0 h1 h2 h3 h4 h5 h6 h7:ػ):ؽ δ × ؽ δ × ؽ ػ:= if t < inW then let x0:=B8x2 e0 X[b0+t]! let x1:=B8x2 e1 X[b1+t]! let x2:=B8x2 e2 X[b2+t]! let x3:=B8x2 e3 X[b3+t]! let x4:=B8x2 e4 X[b4+t]! let x5:=B8x2 e5 X[b5+t]! let x6:=B8x2 e6 X[b6+t]! let x7:=B8x2 e7 X[b7+t]! B8P2 X inW b0 b1 b2 b3 b4 b5 b6 b7 e0 e1 e2 e3 e4 e5 e6 e7 (t+1) ((((((((XA.push x0՜).push x1՜).push x2՜).push x3՜).push x4՜).push x5՜).push x6՜).push x7՜) ((((((((XB.push (x0>>>32)՜).push (x1>>>32)՜).push (x2>>>32)՜).push (x3>>>32)՜).push (x4>>>32)՜).push (x5>>>32)՜).push (x6>>>32)՜).push (x7>>>32)՜) (l0+(x0&&&ހ)) (l1+(x1&&&ހ)) (l2+(x2&&&ހ)) (l3+(x3&&&ހ)) (l4+(x4&&&ހ)) (l5+(x5&&&ހ)) (l6+(x6&&&ހ)) (l7+(x7&&&ހ)) (h0+(x0>>>32)) (h1+(x1>>>32)) (h2+(x2>>>32)) (h3+(x3>>>32)) (h4+(x4>>>32)) (h5+(x5>>>32)) (h6+(x6>>>32)) (h7+(x7>>>32)) else (XA,XB,#[l0,l1,l2,l3,l4,l5,l6,l7,h0,h1,h2,h3,h4,h5,h6,h7]) termination_by inW-t @[inline] def B8F2 (X W b:ؽ δ) (inW i j:ٳ) (relu:ف) (bw:ؼ) (e0 ew0 ll lh hl hh sl sh sw:ػ):δ:= let g:=sh+sw;let x1:=(hh<<<32)+(hl>>>32);let x0:=hl<<<32;let y0:=x0+ll;let y1:=x1+lh+(if y0>>33)+(g>>>1)+(if q0<(sl<<<31) then (1:ػ) else 0) let z0:=y0-q0;let z1:=y1-q1-(if y0>>63)) t1 z0 @[inline] def B8K2 (X W b XA XB:ؽ δ) (inW i0 j:ٳ) (relu:ف) (BX BV:ؽ ؼ) (S:ؽ ػ) (h:B8W W b inW j BV[j]! = true/\XAٽ=8*inW/\XBٽ=8*inW):δ × δ × δ × δ × δ × δ × δ × δ:= B8I1 (λa0 c0 a1 c1 a2 c2 a3 c3 a4 c4 a5 c5 a6 c6 a7 c7 sw=>B8I1 (λd0 f0 d1 f1 d2 f2 d3 f3 d4 f4 d5 f5 d6 f6 d7 f7 _=>(B8F2 X W b inW (i0+0) j relu b[j]! (Yk (BX[i0+0]!>>>16)) (Yk (BV[j]!>>>16)) a0 c0 d0 f0 S[0]! S[8]! sw,B8F2 X W b inW (i0+1) j relu b[j]! (Yk (BX[i0+1]!>>>16)) (Yk (BV[j]!>>>16)) a1 c1 d1 f1 S[1]! S[9]! sw,B8F2 X W b inW (i0+2) j relu b[j]! (Yk (BX[i0+2]!>>>16)) (Yk (BV[j]!>>>16)) a2 c2 d2 f2 S[2]! S[10]! sw,B8F2 X W b inW (i0+3) j relu b[j]! (Yk (BX[i0+3]!>>>16)) (Yk (BV[j]!>>>16)) a3 c3 d3 f3 S[3]! S[11]! sw,B8F2 X W b inW (i0+4) j relu b[j]! (Yk (BX[i0+4]!>>>16)) (Yk (BV[j]!>>>16)) a4 c4 d4 f4 S[4]! S[12]! sw,B8F2 X W b inW (i0+5) j relu b[j]! (Yk (BX[i0+5]!>>>16)) (Yk (BV[j]!>>>16)) a5 c5 d5 f5 S[5]! S[13]! sw,B8F2 X W b inW (i0+6) j relu b[j]! (Yk (BX[i0+6]!>>>16)) (Yk (BV[j]!>>>16)) a6 c6 d6 f6 S[6]! S[14]! sw,B8F2 X W b inW (i0+7) j relu b[j]! (Yk (BX[i0+7]!>>>16)) (Yk (BV[j]!>>>16)) a7 c7 d7 f7 S[7]! S[15]! sw)) XB W 0 (j*inW).toUSize inW.toUSize (by have u:=B8Wv W b inW j BV[j]! h.1;rw[h.2.2,Za inW (א)];simp) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za inW (א)];have:=τ;simp;omega) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za _ (א),Za inW (א)];omega) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za _ (א),Za inW (א)];have:=τ;omega) (Yk (BV[j]!>>>16)) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0) XA W 0 (j*inW).toUSize inW.toUSize (by have u:=B8Wv W b inW j BV[j]! h.1;rw[h.2.1,Za inW (א)];simp) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za inW (א)];have:=τ;simp;omega) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za _ (א),Za inW (א)];omega) (by have u:=B8Wv W b inW j BV[j]! h.1;rw[Za _ (א),Za inW (א)];have:=τ;omega) (Yk (BV[j]!>>>16)) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 def B8C2 (X W b XA XB:ؽ δ) (inW outW i0:ٳ) (relu:ف) (BX BV:ؽ ؼ) (F:ٳ -> ٳ -> δ) (S:ؽ ػ) (j:ٳ) (O0 O1 O2 O3 O4 O5 O6 O7:ؽ δ):ؽ δ:= if j < outW then if h:B8W W b inW j BV[j]! = true/\XAٽ=8*inW/\XBٽ=8*inW then let r:=B8K2 X W b XA XB inW i0 j relu BX BV S h B8C2 X W b XA XB inW outW i0 relu BX BV F S (j+1) (O0.push r.1) (O1.push r.2.1) (O2.push r.2.2.1) (O3.push r.2.2.2.1) (O4.push r.2.2.2.2.1) (O5.push r.2.2.2.2.2.1) (O6.push r.2.2.2.2.2.2.1) (O7.push r.2.2.2.2.2.2.2) else B8C2 X W b XA XB inW outW i0 relu BX BV F S (j+1) (O0.push (F (i0+0) j)) (O1.push (F (i0+1) j)) (O2.push (F (i0+2) j)) (O3.push (F (i0+3) j)) (O4.push (F (i0+4) j)) (O5.push (F (i0+5) j)) (O6.push (F (i0+6) j)) (O7.push (F (i0+7) j)) else O0++O1++O2++O3++O4++O5++O6++O7 termination_by outW-j def B8T (rows inW outW:ٳ) (relu:ف) (X W b:ؽ δ) (BX BV:ؽ ؼ) (F:ٳ -> ٳ -> δ) (ch:ٳ) (acc:ؽ δ):ؽ δ:= if h:ch+7 < rows/\B8R8 X inW ch BX 7=true then let q:=B8P1 X inW ((ch+0)*inW) ((ch+1)*inW) ((ch+2)*inW) ((ch+3)*inW) ((ch+4)*inW) ((ch+5)*inW) ((ch+6)*inW) ((ch+7)*inW) (Yk (BX[ch+0]!>>>16)) (Yk (BX[ch+1]!>>>16)) (Yk (BX[ch+2]!>>>16)) (Yk (BX[ch+3]!>>>16)) (Yk (BX[ch+4]!>>>16)) (Yk (BX[ch+5]!>>>16)) (Yk (BX[ch+6]!>>>16)) (Yk (BX[ch+7]!>>>16)) 0 (AY (inW*8)) 0 0 0 0 0 0 0 0 B8T rows inW outW relu X W b BX BV F (ch+8) (acc++B8C1 X W b q.1 inW outW ch relu BX BV F q.2 0 #[] #[] #[] #[] #[] #[] #[] #[]) else if h':ch+7 < rows/\B8R8 X inW ch BX 39=true then let q:=B8P2 X inW ((ch+0)*inW) ((ch+1)*inW) ((ch+2)*inW) ((ch+3)*inW) ((ch+4)*inW) ((ch+5)*inW) ((ch+6)*inW) ((ch+7)*inW) (Yk (BX[ch+0]!>>>16)) (Yk (BX[ch+1]!>>>16)) (Yk (BX[ch+2]!>>>16)) (Yk (BX[ch+3]!>>>16)) (Yk (BX[ch+4]!>>>16)) (Yk (BX[ch+5]!>>>16)) (Yk (BX[ch+6]!>>>16)) (Yk (BX[ch+7]!>>>16)) 0 (AY (inW*8)) (AY (inW*8)) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 B8T rows inW outW relu X W b BX BV F (ch+8) (acc++B8C2 X W b q.1 q.2.1 inW outW ch relu BX BV F q.2.2 0 #[] #[] #[] #[] #[] #[] #[] #[]) else Yak rows outW F ch acc termination_by rows-ch def YaV (rows inW outW:ٳ) (relu:ف) (X W b:ؽ δ):ؽ δ:= let BX:ؽ ؼ:=ڀ rows λi=>Yc X inW i.val let BV:ؽ ؼ:=ڀ outW λj=>Yc W inW j.val if rows<2 then let P:ؽ (ؽ ٳ × ؽ ؼ):=if QPS inW BX BV then ڀ rows λi=> if (QYF BX[i.val]!).toNat+(BV.foldl (λ(m:ػ) (bv:ؼ)=>max m (QYF bv)) 0).toNat>15 then (#[],#[]) else let I:=QPI inW (λt=>X[i.val*inW+t]!) 0 (Ba inW) if 0X[i.val*inW+(I[m]!).toNat]!) (Yk (BX[i.val]! >>> 16)) 0 (Ba (2*Iٽ)),I) else (QPD inW (λt=>X[i.val*inW+t]!) (Yk (BX[i.val]! >>> 16)) 0 (Ba (2*inW)),#[]) else Χ rows (#[],#[]) Yak4 rows outW (λi j=>act relu (QPa X P[i]!.1 P[i]!.2 W b inW i j BX[i]! BV[j]!)) (λi j=>let r:=QPac4 X P[i]!.1 P[i]!.2 W b inW i j BX[i]! BV[j]! BV[j+1]! BV[j+2]! BV[j+2+1]!;((act relu r.1.1,act relu r.1.2),(act relu r.2.1,act relu r.2.2))) (λi=>P[i]!.1ٽ==0&&1<=inW) 0 (AY (rows*outW)) else B8T rows inW outW relu X W b BX BV (λi j=>act relu (Yai X W b inW i j)) 0 (AY (rows*outW)) lemma Zq (k:ؼ):(Yk k)˧=k؎-1:=by unfold Yk;split_ifs with h;subst h;rfl;rw[AG,Dj _ _ (by rw[AJ];exact Dd.2 λa=>h (ύ.1 a))];rfl lemma E6 (x y:ؼ):(Yk x+Yk y)˧=x؎-1+(y؎-1):=by rw[ξ,Zq,Zq];have:x؎<2^32:=AK _;have:y؎<2^32:=AK _;exact ν א lemma ZM (a:ؼ):(Yd ζ+Yd a)˧=γ ζ+γ a:=B6 ζ a lemma D7 (b d a:ؼ):(Yp b d a)˧<=((b>>>16)؎-1)+((d>>>16)؎-1) /\ (ε a≠0->(Yp b d a)˧<=γ ζ+γ a):=by have h:=E6 (b>>>16) (d>>>16);have j:=ZM a;unfold Yp;dsimp only;rw[E7 a];split_ifs with e;simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ]at e;omega;simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ,not_and,not_lt]at e;constructor;omega;intro g;have:=e g;omega lemma D6 (b d a:ؼ):((b&&&ޅ)؎-1)+((d&&&ޅ)؎-1)<=(Yu b d a)˧ /\ (ε a≠0->γ ζ+γ a<=(Yu b d a)˧):=by have h:=E6 (b&&&ޅ) (d&&&ޅ);have j:=ZM a;unfold Yu;dsimp only;rw[E7 a];split_ifs with e<;>simp only[Ω,ϵ,decide_eq_false_iff_not,ת,Ψ,not_and,not_lt]at e;omega;constructor;omega;intro g;have:=e g;omega lemma Zo (a:ؼ) (L H:ٳ) (h:a؎=L*2^16+H) (hH:H<2^16):(a>>>16)؎=L/\(a&&&ޅ)؎=H:=by constructor;rw[Ϣ,show(16:ؼ)؎%32=16 from rfl,ψ,h];omega;rw[AH,show(ޅ:ؼ)؎=2^16-1 from rfl,ϡ,h];omega lemma O2 (X W b:ؽ δ) (a i j:ٳ):Yai X W b a i j=Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b[j]!):=by unfold Yai;rw[Zi] lemma Zp (A:ؽ δ) (a i:ٳ) (b:i*a+a<=Aٽ) (d:i*a+a<=ހ):∃ L H:ٳ,(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 _ א;have g:a۞؛=a:=Za _ א;unfold Yc;rw[dif_pos ⟨b,א⟩];obtain⟨L,H,e,h,c,-,-,j⟩:=W8 A (i*a)۞ a۞ (by rw[f,g];exact b) (by rw[f,g];have:=τ;omega) ހ 0 0 ג ד;refine⟨L,H,e,h,c,λt k=>?_⟩;rw[<-f];exact j t ג (by rwa[g]) lemma A9 (S:ٴ) (a:ػ) (c:ف) (b D:δ) (d:S=0->b=D) (e:D=ρ (S*2^a˧) (-298) c):(if (if S=0 then ߿ else (ρ S ((a˧:ٴ)-298) false)܅)<߿ then (if S=0 then ߿ else (ρ S ((a˧:ٴ)-298) false)܅)՜ else b)=D:=by by_cases f:S=0;rw[if_pos f,if_neg ד,d f];rw[if_neg f,if_pos (by rw[Ψ];simpa using AK (ρ S ((a˧:ٴ)-298) false):(ρ S ((a˧:ٴ)-298) false)܅<߿),e,<-Aa,(by apply ύ.mp;simp:(ρ S ((a˧:ٴ)-298) false)܅՜=ρ S ((a˧:ٴ)-298) false)];unfold finishWord;rw[if_neg f,if_neg f,show(-298:ٴ)+(a˧:ٴ)=(a˧:ٴ)-298 by ring] lemma E8 (u p:ػ) (b:¬u122):p˧<=u˧/\u˧-p˧<=122:=by rw[Ψ]at b;have d:p˧<=u˧:=א;rw[gt_iff_lt,Ψ,Η _ _ (ϐ.2 d)]at a;exact⟨d,DZ.1 a⟩ lemma H4 {L r i:ٳ} (a:L<=r) (b:r<=i+1):L-1<=i:=א lemma H3 {m H i:ٳ} (a:m<=H) (b:i+1<=max m 1):i<=H-1:=א lemma ZQ {p u a b c d B:ٳ} {x w:δ} (h:p<=(a-1)+(b-1)) (j:(c-1)+(d-1)<=u) (k:u-p<=B) (e:a<=YR x/\YM x<=c) (f:b<=YR w/\YM w<=d) (g:ε x*ε w≠0):p<=γ x+γ w/\γ x+γ w<=p+B:= have l:=(Zb x).2.2.2 (left_ne_zero_of_mul g);have n:=(Zb w).2.2.2 (right_ne_zero_of_mul g);⟨h.trans (Cy (H4 e.1 l.1) (H4 f.1 n.1)),(Cy (H3 e.2 l.2) (H3 f.2 n.2)).trans (j.trans (BK.1 k))⟩ @[specialize] def YE (n:ؾ) (fx fw:(t:ؾ) -> t δ) (lo:ػ) (e:ٴ) (bx bw:ؼ) (w2 w1 w0 c:ػ) (k:ؾ):ػ:= 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پ-kپ decreasing_by exact ZI n k h def Yr (fa fb:ٳ -> δ) (lo k:ٳ):ٳ -> ٴ | 0=>0 | r+1=>sv (fa k)*sv (fb k)*2^(γ (fa k)+γ (fb k)-lo)+Yr fa fb lo (k+1) r lemma H2 (n:ؾ) (l o:(t:ؾ)->tδ) (f a:ٳ->δ) (p:∀t h,l t h=f t؛) (q:∀t h,o t h=a t؛) (b:ػ) (e:ٴ) (g j:ؼ) (s:n؛<2^32) (r:ε g*ε j≠0->b˧<=γ g+γ j/\γ g+γ jk؛<=n؛->c˧<=k؛->(∀t,k؛<=t->tε (f t)*ε (a t)≠0->b˧<=γ (f t)+γ (a t)/\γ (f t)+γ (a t)((Yx z A B+c˧:ٳ):ٴ)%2^192=S0%2^192->S=S0+Yr f a b˧ k؛ (n؛-k؛)+sv g*sv j*2^(γ g+γ j-b˧)->-2^191<=S->S<2^191->YE n l o b e g j z A B c k=if S=0 then ߿ else (ρ S e false)܅:=by intro d;induction d<;>intro k z A B c S0 S C P K J ·rw[YE,dif_neg (υ.not.2 א)];obtain⟨u,v,w,x,E,-,F⟩:=Zr b g j z A B c (YD · · · · e) א r;rw[E,C,Yr];intro G H L M;apply ZV u v w x e S L M;rw[F,H,add_zero];exact DT _ G rename_i N;have D:=υ.2 (Al C);have y:=QK n k D;rw[YE,dif_pos D,p,q];obtain⟨u,v,w,x,E,O,F⟩:=Zr b (f k؛) (a k؛) z A B c (YE n l o b e g j · · · · (k+1)) א (J k؛ le_rfl (υ.1 D));rw[E,show n؛-k؛=(n؛-(k+1)؛)+1 by clear*-y C;omega,Yr,y];have I:=N (k+1) u v w x (S0+sv (f k؛)*sv (a k؛)*2^(γ (f k؛)+γ (a k؛)-b˧)) S (by clear*-y C;omega) (y▸υ.1 D) (y▸O.trans (Nat.succ_le_succ K)) (λt Q=>J t א);exact λG H=>I (F.trans (DT _ G)) (by rw[H,y];ring) lemma G4 (a b:ٳ->δ) (d:ٳ):∀ (r k:ٳ),(∀t,k<=t->tε (a t)*ε (b t)≠0->d<=γ (a t)+γ (b t)/\γ (a t)+γ (b t)<=d+122)->-((r:ٴ)*2^170)<=Yr a b d k r/\Yr a b d k r<=(r:ٴ)*2^170:=by intro r;induction r<;>intro k h ·simp[Yr] rename_i e;obtain⟨f,g⟩:=ZL (a k) (b k) d (h k א א);obtain⟨j,l⟩:=e (k+1) (λt n o=>h t א א);rw[Yr];push_cast;constructor<;>linarith lemma Q6 (a b:ٳ->δ) (K d:ٳ) (e f:ؼ):∀r k,k+r<=K->(∀t,k<=t->tε (a t)*ε (b t)≠0->d<=γ (a t)+γ (b t))->Yo (λt=>if tif tintro k j h ·simp[Yo,Yr] rename_i g;rw[Yo,Yr,g (k+1) א (λt l n=>h t א א)];simp only[(א:ktδ) (e a:ٳ->δ) (o:∀t h,f t h=e t؛) (p:∀t h,g t h=a t؛) (b:ؼ) (d:ػ) (hK:K<ށ) (q:∀t,tθ (e t)≠255) (r:∀t,tθ (a t)≠255) (s:θ b≠255) (j:∀t,tε (e t)*ε (a t)≠0->d˧<=γ (e t)+γ (a t)/\γ (e t)+γ (a t)<=d˧+122) (l:ε ζ*ε b≠0->d˧<=γ ζ+γ b/\γ ζ+γ b<=d˧+122) (n:δ) (u:n=Γ (K+1) (λt=>if tif tif tif tj t א v);have E:=ZL ζ b d˧ l;generalize z:Yr e a d˧ 0 K+sv ζ*sv b*2^(γ ζ+γ b-d˧)=S;rw[H2 K۞ f g e a o p d ((d˧:ٴ)-298) ζ b א (λh=>by have:=l h;omega) K 0 0 0 0 0 0 S (by simp[x]) ג ג (λt _ _ v=>by have:=j t א v;omega) (by simp[Yx]) (by rw[<-z,x];simp) א א];rw[Zy (K+1) (λt=>if tif tby by_cases w:ksimp only[w,ר,ש];exact⟨q k w,r k w⟩;exact⟨ד,s⟩)]at u⊢;exact A9 _ _ _ _ _ (λ_=>u) (congrArg (ρ · _ _) (by rw[ZW,Q6 e a K d˧ ζ b K 0 א (λt _ _ v=>(j t א v).1)];simp;rw[ZA ζ b d˧ (λh=>(l h).1),<-z];ring)) lemma S2 (X W:ؽ δ) (a b d:ٳ):∀r k,YB X W a b d k r=Yr (λt=>X[a+t]!) (λt=>W[b+t]!) d k r:=by intro r;induction r;intro;rfl;next r e=>intro;rw[YB,Yr,e] lemma R7 (X W:ؽ δ) (a b n:ؾ) (f:a؛+n؛<=Xٽ) (g:b؛+n؛<=Wٽ) (j:a؛+n؛<Λ) (l:b؛+n؛<Λ) (o:ػ) (e:ٴ) (p:ؼ):∀d (k:ؾ) (r s u c:ػ),n؛-k؛=d->YS X W a b n f g j l o e p r s u c k=YE n (λt h=>X.uget (a+t) (A4 X a n t f j h)) (λt h=>W.uget (b+t) (A4 W b n t g l h)) o e ζ p r s u c k:=by intro d;induction d<;>intro k r s u c v ·have q:¬kf˧<=γ ζ+γ g/\γ ζ+γ gk؛<=n؛->c˧<=k؛->(∀t,k؛<=t->tε X[a؛+t]! * ε W[b؛+t]! ≠ 0->f˧<=γ X[a؛+t]! + γ W[b؛+t]! /\ γ X[a؛+t]! + γ W[b؛+t]! < f˧+128)->((Yx s u v+c˧:ٳ):ٴ)%2^192=S0%2^192->S=S0+YB X W a؛ b؛ f˧ k؛ (n؛-k؛)+sv ζ*sv g*2^(γ ζ+γ g-f˧)->-2^191<=S->S<2^191->YS X W a b n j l o p f e g s u v c k=if S=0 then ߿ else (ρ S e false)܅:=by intro d k s u v c S0 S w x y z A B C D;rw[R7 X W a b n j l o p f e g _ k s u v c rfl];exact H2 n _ _ (λt=>X[a؛+t]!) (λt=>W[b؛+t]!) (λt h=>B3 X a t _ (by have:=υ.1 h;omega)) (λt h=>B3 W b t _ (by have:=υ.1 h;omega)) f e ζ g q r d k s u v c S0 S w x y z A (by rw[B,S2]) C D lemma W6 (X W:ؽ δ) (a b d:ٳ):∀ (r k:ٳ),(∀t,k<=t->tε X[a+t]! * ε W[b+t]! ≠ 0->d<=γ X[a+t]! + γ W[b+t]! /\ γ X[a+t]! + γ W[b+t]! <= d+122)->-((r:ٴ)*2^170)<=YB X W a b d k r/\YB X W a b d k r<=(r:ٴ)*2^170:=λr k h=>S2 X W a b d r k▸G4 _ _ d r k h lemma L8 (X W:ؽ δ) (a i j:ٳ) (b:ؼ) (d:ػ) (e:(i*a)۞؛+a۞؛<=Xٽ) (f:(j*a)۞؛+a۞؛<=Wٽ) (g:(i*a)۞؛+a۞؛<Λ) (k:(j*a)۞؛+a۞؛<Λ) (n:(i*a)۞؛=i*a) (o:(j*a)۞؛=j*a) (x:a۞؛=a) (p:a<ށ) (q:∀t,t < a->θ X[i*a+t]! ≠ 255) (r:∀t,t < a->θ W[j*a+t]! ≠ 255) (s:θ b≠255) (u:∀t,t < a->ε X[i*a+t]! * ε W[j*a+t]! ≠ 0->d˧<=γ X[i*a+t]! + γ W[j*a+t]! /\ γ X[i*a+t]! + γ W[j*a+t]! <= d˧+122) (v:ε ζ*ε b≠0->d˧<=γ ζ+γ b/\γ ζ+γ b<=d˧+122) (l:δ) (w:l=Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b)):(if YS X W (i*a)۞ (j*a)۞ a۞ e f g k d ((d˧:ٴ)-298) b 0 0 0 0 0<߿ then (YS X W (i*a)۞ (j*a)۞ a۞ e f g k d ((d˧:ٴ)-298) b 0 0 0 0 0)՜ else l) = Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b):=by rw[R7 X W _ _ _ e f g k d _ b _ 0 0 0 0 0 rfl];exact L7 a _ _ (λt=>X[i*a+t]!) (λt=>W[j*a+t]!) (λt h=>by rw[B3 X _ t _ (by have:=υ.mp h;omega),n]) (λt h=>by rw[B3 W _ t _ (by have:=υ.mp h;omega),o]) b d p q r s u v l w lemma ZcB (X W b:ؽ δ) (a i j:ٳ):YaU X W b a i j (Yc X a i) (Yc W a j)=Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b[j]!):=by have F:=O2 X W b a i j;unfold YaU;split;swap;exact F;obtain⟨G,H,I,J,K⟩:=‹_/\_›;have w:=Za (i*a) א;have x:=Za (j*a) א;have p:=Za a א;obtain⟨Lx,Hx,y,Z,L,r⟩:=Zp X a i G I;obtain⟨Lv,Hv,z,_,M,s⟩:=Zp W a j H J;generalize Yc X a i=f at y⊢;generalize Yc W a j=g at z⊢;obtain⟨N,A⟩:=Zo f Lx Hx y א;obtain⟨O,B⟩:=Zo g Lv Hv z א;obtain⟨k,u⟩:=D7 f g b[j]!;obtain⟨l,v⟩:=D6 f g b[j]!;rw[N,O]at k;rw[A,B]at l;dsimp only;split;exact F;rename_i C;simp only[Ϸ,ת,not_or]at C;obtain⟨⟨⟨⟨P,Q⟩,R⟩,S⟩,T⟩:=C;obtain⟨Y,D⟩:=E8 _ _ S T;by_cases n:Yu f g b[j]! -Yp f g b[j]!<=63;rw[if_pos n,I6 _ X W (i*a)۞ (j*a)۞ a۞ _ _ _ _ (Yp f g b[j]!) _ b[j]! א _ (λq=>ϐ.1 (of_decide_eq_true q)) (ϐ.1 n) (λt d o=>by rw[w,x]at o⊢;exact ZQ k l (Η _ _ (ϐ.2 Y)).ge (r t (p▸d)) (s t (p▸d)) o) a۞؛ 0 0 0 0 0 ג (λ_=>⟨rfl,ג⟩)];swap;rw[if_neg n];all_goals exact L8 X W a i j b[j]! (Yp f g b[j]!) _ _ _ _ w x p K (λt d=>(Zb _).2.2.1 ((r t d).2.trans_lt (L.lt_of_ne λh=>P (ύ.1 (A.trans h))))) (λt d=>(Zb _).2.2.1 ((s t d).2.trans_lt (M.lt_of_ne λh=>Q (ύ.1 (B.trans h))))) R (λt d=>ZQ k l D (r t d) (s t d)) (λo=>⟨u (right_ne_zero_of_mul o),(v (right_ne_zero_of_mul o)).trans (BK.1 D)⟩) _ F 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) lemma bz (e:ٴ):bpow e=(2:ℝ)^e:=by simp[bpow,Formats.Flocq.bpow,binaryRadix,Fa] lemma cW (w:ؼ):π (Bj w)=w:=by simp only[π,Bj,Dn,EQ];exact Ee lemma cU {a b:ٴ} {v:ℝ} (d:bpow a<=v) (e:vlinarith[bpow_le_bpow_of_le h] lemma cB {n d:ٳ} (e:ٴ) (a:n≠0) (b:d≠0):bpow (floorLog2 n d+e)<=n/d*bpow e/\n/d*bpow eAP (Bl n d x).1 (Bl n d x).2=AP (Bl a b r).1 (Bl a b r).2:=λx r h=>by apply roundQuotientEven_eq_of_rat_eq _ _ _ _ (scaleByPowerOfTwo_snd_ne_zero _ _ _ k) (scaleByPowerOfTwo_snd_ne_zero _ _ _ l);rw[scaleByPowerOfTwo_real,scaleByPowerOfTwo_real];rwa[mul_assoc,<-bpow_add,mul_assoc,<-bpow_add,add_sub_cancel,add_sub_cancel]at h rw[roundRatScaled_false_eq_of_isIEEE f n d e o p k,roundRatScaled_false_eq_of_isIEEE f a b g o q l];simp only;rw[u _ (g+BG (Cb f)) (by rw[j];ring_nf),u _ (BG f߷-Br a b) (by rw[j,(א:BG f߷-Br n d-e=BG f߷-Br a b-g)]),y] lemma N3 (Q:ℚ) (s:ف) (N D:ٳ) (E:ٴ) (b:00simp_all);obtain rfl:Q=0:=(by simp[a]);simp[roundRatScaled_num_zero _ _ _ _ b.ne'];rfl;have g:(0:ℚ)simp[neg_div] have h:Q.num.natAbs≠0:=by simpa using (by rw[a];cases s<;>simp[g.ne']:Q≠0) have k:(0:ℝ)push_cast<;>simp[abs_of_pos k] rw[(by rw[a];cases s<;>simp[g,not_lt.mpr g.le]:decide (Q<0)=s)];cases s;exact cV _ e _ _ _ _ _ _ h Q.den_nz f b.ne' j;rw[roundRatScaled_true_eq_neg_false _ _ _ _ e Q.den_nz,roundRatScaled_true_eq_neg_false _ _ _ _ e b.ne',cV _ e _ _ _ _ _ _ h Q.den_nz f b.ne' j] lemma Zc1 (q u D r:ٳ) (d:2<=u) (f:u%2=0) (e:0.trans ג;rw[bpow_natCast];push_cast;rw[pow_succ];linarith;rw[show((q܀+1:ℕ):ٴ)+1=((q܀+2:ℕ):ٴ) by push_cast;ring,bpow_natCast];push_cast;rw[show q܀+2=q܀+1+1 from rfl,pow_succ];linarith lemma Zc3 (s:ف) (N D:ٳ) (E:ٴ) (a:0simp[n,j]<;>omega . have:¬((q܀:ٴ)+Esimp[j]<;>omega end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats FloatLib.Floats.Formats.Flocq open Float.Model.UnpackedFloat open FloatLib.Numerics (binaryRadix Radix.toReal) lemma Zc4 (q:ℚ) (b a:ٳ) (e:ٴ) (d:0(x:ℝ)) g;push_cast at this;rw[this,(ב:(4:ℝ)=2*2),mul_zpow,sq] rw[t,Real.sqrt_mul (by exact_mod_cast d.le),Real.sqrt_sq ה];simp only[bpow,binaryRadix,Fa];push_cast;rw[mul_assoc,<-zpow_add₀ (ב:(2:ℝ)≠0)];simp rw[s]at n o;have u:(nearestEven (scaledMantissa binaryRadix (Model.fexpOf κ) (Db (q:ℝ))))׆=(shiftToTargetExponent (ϓ κ) (Ϗ b a) e (sqrtAccuracy b a)).1.roundedMantissa:=by rw[o,<-r];simp simp only[sqrtMathWord,not_le.mpr d,ש,n,u];rw[Model.roundWithAccuracy_eq_finishRoundedMantissa,Model.shiftToTargetExponent_eq_of_le_targetExponent κ _ e _ l] end @[inline] def Y2 (x:ؽ δ) (base n:ٳ):ٳ:= (ϒ n).foldl (λb j => let w:=x[base+j]!;if ε w=0 then b else min b (γ w)) 255 @[inline] def Y6 (x:ؽ δ) (base n b0:ٳ):ؽ ٳ:= (ϒ n).foldl (λa j => let w:=x[base+j]!;ϛ a (ε w*ε w)߸ (2*(γ w-b0))) (Χ 18 0) @[inline] def Y7 (x:ؽ δ) (base n b0:ٳ):ؽ ٳ × ؽ ٳ:= (ϒ n).foldl (λpq j => let w:=x[base+j]!;if η w then (pq.1,ϛ pq.2 (ε w)߸ (γ w-b0)) else (ϛ pq.1 (ε w)߸ (γ w-b0),pq.2)) (Χ 18 0,Χ 18 0) @[inline] def sqA (num den root:ٳ):ٳ:= if num=root*root*den then 0 else if 4*num δ):δ:= let t:ٴ:=(47-(num0܀:ٴ)+m܀+1)/2;let num:=if 0<=t then num0<<<(2*tپ) else num0;let den:=if 0<=t then m else m<<<(2*(-t)׆);let root:=Ϗ num den;if ރ<=root then sqW num den root (h-t) else fallback () @[inline] def YF (b0 ie:ٳ):ٳ:=min (2*b0) (ie+149)/2*2 noncomputable def YaE (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):δ:= let b0:=Y2 x (r*n) n;let c:=YF b0 (γ eps);YaD (limbValA (Y6 x (r*n) n b0)<<<(2*b0-c) + (n*ε eps)<<<(γ eps+149-c)) n (((c:ٴ)-298)/2) λ_=>Ac (ϫ n x r 0+ς eps) noncomputable def Y8 (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):ٳ × ٴ × δ:= let b0:=Y2 x (r*n) n;let pq:=Y7 x (r*n) n b0;let S1:ٴ:=(limbValA pq.1:ٴ)-limbValA pq.2;let T:ٴ:=(n:ٴ)*limbValA (Y6 x (r*n) n b0)-S1*S1;let c:=YF b0 (γ eps);(b0,S1,YaD (Tپ<<<(2*b0-c)+(n*n*ε eps)<<<(γ eps+149-c)) (n*n) (((c:ٴ)-298)/2) λ_ => Ac (ϫ n x r (rowMean n x r)+ς eps)) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat lemma iB (w:δ):γ w<=254:=Zg w lemma lS (m k:ٳ->ٳ) (d:∀j,m j<2^64) (e:∀j,k j/32+1<18) (l:List ٳ) (a:ؽ ٳ) (b:a܃=18):(l.foldl (λa j=>ϛ a (m j)߸ (k j)) a)܃=18 /\ ϋ (l.foldl (λa j=>ϛ a (m j)߸ (k j)) a)܍=ϋ a܍+(l.map λj=>m j*2^k j).sum:=by induction l generalizing a with|nil=>simp[b]|cons j l f=>simp;obtain⟨g,h⟩:=f (ϛ a (m j)߸ (k j)) (by rwa[addLimbs64_size]);refine⟨g,?_⟩;rw[h,addLimbs64_eq _ _ _ (d j),addLimbs_val _ _ _ (by rw[b];exact e j)];ring lemma lP (x:ؽ δ) (a b:ٳ) (f:ؽ ٳ × ؽ ٳ->ٳ->ؽ ٳ × ؽ ٳ) (d:∀e j,f e j=if η x[a+j]! then (e.1,ϛ e.2 (ε x[a+j]!)߸ (γ x[a+j]! - b)) else (ϛ e.1 (ε x[a+j]!)߸ (γ x[a+j]! - b),e.2)) (l:List ٳ):∀p q,p܃=18->q܃=18->(l.foldl f (p,q)).1ٽ=18 /\ (l.foldl f (p,q)).2ٽ=18/\((ϋ (l.foldl f (p,q)).1.toList:ٴ) - ϋ (l.foldl f (p,q)).2.toList)=(ϋ p܍:ٴ)-ϋ q܍+(l.map λj=>sv x[a+j]! * 2^(γ x[a+j]! - b)).sum:=by induction l<;>intro p q g h;simp[g,h];rename_i j l s;simp only[AO,CR,DV,d];have t:=Ϛ x[a+j]!;have u:=iB x[a+j]!;by_cases k:η x[a+j]! =true;simp only[k,ר];obtain⟨n,o,r⟩:=s p (ϛ q (ε x[a+j]!)߸ (γ x[a+j]!-b)) g (by rw[addLimbs64_size];exact h);refine⟨n,o,?_⟩;rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by rw[h];omega)];simp only[sv,k,ר];push_cast;ring;simp only[k,φ,ש];obtain⟨n,o,r⟩:=s (ϛ p (ε x[a+j]!)߸ (γ x[a+j]!-b)) q (by rw[addLimbs64_size];exact g) h;refine⟨n,o,?_⟩;rw[r,addLimbs64_eq _ _ _ א,addLimbs_val _ _ _ (by rw[g];omega)];simp only[sv,k,φ,ש];push_cast;ring lemma fS (f:ٳ->ℚ) (l:List ٳ) (a:ℚ):l.foldl (λt j=>t+f j) a=a+(l.map f).sum:=by induction l generalizing a;simp;next j l b=>simp[AO,b,add_assoc] lemma A3 (a b:ٳ):sqrtAccuracy a b=Dc (sqA a b (Ϗ a b)) 4:=by unfold sqrtAccuracy sqA;dsimp only;simp only[sq];split_ifs<;>rfl lemma J9 (N d:ٳ):N/d<=AP N d /\ AP N d<=N/d+1:=by unfold AP;dsimp only;split_ifs<;>omega lemma J5:κ߷=23/\Ct κ߷=ރ/\Ct (κ߷+1)=ނ/\Ef κ = -126/\ BG (Eg κ)=127/\BG κ.bias=127:=ד lemma QW (E F:ٳ):π (Bj (ϥ false E F))=ϥ false E F:=cW _ lemma J4 (r:ٳ) (k:ٴ) (b:ރ<=r) (d:r<ނ) (e:-126<=k) (a:k<=127):π (BT κ (Cn (ϓ κ) .positive (r,k-23)))=ϥ false (k+127)׆ (r-ރ):=by obtain⟨j,g,f,m,M,o⟩:=J5;rw[show(k-23:ٴ)=k-(κ߷:ٴ) by rw[j];rfl,Model.finishRoundedMantissa_normalized κ .positive r k (by rw[g];exact b) (by rw[f];exact d) (by rw[m];exact e)];erw[Bo κ false r k (by rw[g];exact b) (by rw[f];exact d) (by rw[m];exact e) (by rw[M];exact a)];have h:=QW (k+127)׆ (r-ރ);rwa[BB]at h lemma J6 (k:ٴ) (b:-126<=k) (a:k+1<=127):π (BT κ (Cn (ϓ κ) .positive (ނ,k-23)))=ϥ false (k+1+127)׆ 0:=by obtain⟨f,g,d,c,i,l⟩:=J5;rw[show(k-23:ٴ)=k-(Fmt߷:ٴ) by rw[f];rfl,show(ނ:ٳ)=Ct (κ߷+1)from d.symm,Model.finishRoundedMantissa_normalized_carry κ .positive k (by rwa[c])];erw[Bo κ false (Ct κ߷) (k+1) le_rfl (by rw[g,d];decide) (by rw[c];omega) (by rwa[i])];have e:=QW (k+1+127)׆ 0;rwa[BB]at e theorem A8 (b d:ٳ) (e:ٴ):sqW b d (Ϗ b d) e=π (BT κ (Bp (ϓ κ) .positive (Ϗ b d) e (sqrtAccuracy b d))):=by have l:=A3 b d;unfold sqW;generalize Ϗ b d=c at l⊢;have j:(ϓ κ).mantissaBits=24:=ד;have k:(ϓ κ).minExponent= -149:=ד;by_cases u:c<ނ<;>simp only[u,ר,ש,CP,add_zero,EU] all_goals split;swap;rfl;rename_i v;obtain⟨w,x,A,y,z⟩:=v;have n:sqA b d c<4:=by unfold sqA;split_ifs<;>omega generalize sqA b d c=a at l n⊢;rw[l];have g:=Model.roundWithAccuracy_quotient_eq_finishRoundedMantissa (ϓ κ) .positive (4*c+a) 4 e ב;rw[show(4*c+a)/4=c by omega,show(4*c+a)%4=a by omega]at g;have f:c≠0:=א . have o:23<=c܀:=(CH f).2 א;have p:c܀<24:=(Ϻ f).2 א;have h:((ϓ κ).targetExponent (Bb c e)-e)׆=0:=by simp only[BH,Bb,j,k];omega rw[g];dsimp only;rw[h];simp only[pow_zero,mul_one,CP,add_zero];obtain⟨q,s⟩:=J9 (4*c+a) 4;generalize AP (4*c+a) 4=r at q s⊢;rw[show e=(e+23)-23 by ring];split;next t=>subst t;rw[J6 (e+23) א א];congr 2;omega ·rw[J4 r (e+23) א א א א];congr 2;omega . have o:24<=c܀:=(CH f).2 א;have p:c܀<25:=(Ϻ f).2 א;have h:((ϓ κ).targetExponent (Bb c e)-e)׆=1:=by simp only[BH,Bb,j,k];omega rw[g];dsimp only;rw[h];simp only[pow_one,EU];obtain⟨q,s⟩:=J9 (4*c+a) (4*2);generalize AP (4*c+a) (4*2)=r at q s⊢;rw[show e+1=(e+24)-23 by ring];split;next t=>subst t;rw[J6 (e+24) א א];congr 2;omega ·rw[J4 r (e+24) א א א א];congr 2;omega lemma N1 (a m:ٳ) (h:ٴ) (q:ℚ) (d:0Ac q)=Ac q:=by unfold YaD;simp only[A8];generalize (47-((a܀:ٳ):ٴ)+(m܀:ٳ)+1)/2=t;have e:∀k:ٳ,(2:ℚ)^(2*k)=4^(k:ٴ):=λk=>by rw[pow_mul,ؠ];norm_num by_cases g:0<=t<;>simp only[g,ר,ש]<;>split_ifs with j<;>try rfl all_goals refine Zc4 q _ _ _ d (by first|exact b|rw[Α];exact ϊ b ה) ?_ (by rw[(ב:(2:ٳ)^23=ރ)];exact j);rw[<-f,(by ring: -(h-t)=t-h),zpow_sub₀ ב];simp only[Α];push_cast;rw[e,Cj א];field_simp[zpow_neg] all_goals rw[mul_assoc,<-zpow_add₀ ב];simp lemma Zc7 (w:δ):(sv w:ℚ)^2=(ε w:ℚ)^2:=by unfold sv;split_ifs<;>push_cast<;>ring lemma N0 (a:δ) (b:0<ς a):ς a=(ε a:ℚ)*2^((γ a:ℤ)-149):=by simp only[ς,ϙ]at b⊢;unfold sv at b⊢;split_ifs at b⊢with d;have:(0:ℚ)<=2^((γ a:ٴ)-149):=ה;push_cast at b;nlinarith[(ה:(0:ℚ)<=ε a)];push_cast;ring lemma M9 (x:ؽ δ) (n r a:ٳ) (b:∀ja<=γ x[r*n+j]!):(limbValA (Y6 x (r*n) n a):ℚ)*2^((2*a:ℤ)-298)=((ϒ n).map λj=>(ς x[r*n+j]!)^2).sum:=by unfold Y6;rw[limbValA_eq,(lS (λj=>ε x[r*n+j]! *ε x[r*n+j]!) (λj=>2*(γ x[r*n+j]! -a)) (λj=>by have:=Ϛ x[r*n+j]!;nlinarith) (λj=>by have:=iB x[r*n+j]!;omega) _ _ ג).2,show ϋ (Χ 18 0)܍=0 from ד,Β,Nat.cast_list_sum,Df,<-Dg];congr 1;apply Ck;intro j f;simp only[Function.comp,ς,ϙ];by_cases d:ε x[r*n+j]! =0;. simp[d,sv] . have k:((2:ℚ)^((γ x[r*n+j]!:ٴ)-149))^2=(2:ℚ)^(2*(γ x[r*n+j]! -a))*2^((2*a:ٴ)-298):=by rw[<-ؠ (2:ℚ) (2*(γ x[r*n+j]! -a)),<-zpow_add₀ ב,<-ؠ _ 2,<-zpow_mul];congr 1;push_cast[b j (BM.1 f) d];ring rw[mul_pow,Zc7,k];push_cast;ring lemma M8 (x:ؽ δ) (n r a:ٳ) (b:∀ja<=γ x[r*n+j]!):(((limbValA (Y7 x (r*n) n a).1:ℤ)-limbValA (Y7 x (r*n) n a).2:ℤ):ℚ)*2^((a:ℤ)-149)=((ϒ n).map λj=>ς x[r*n+j]!).sum:=by unfold Y7;rw[limbValA_eq,limbValA_eq,(lP x (r*n) a _ (λ_ _=>rfl) (ϒ n) _ _ ג ג).2.2,show ϋ (Χ 18 0)܍=0 from ד];push_cast;rw[zero_add,Df,<-Dg];congr 1;apply Ck;intro j f;simp only[Function.comp,ς,ϙ];push_cast;by_cases d:ε x[r*n+j]! =0;. simp[d,sv] . rw[mul_assoc,<-ؠ,<-zpow_add₀ ב];push_cast[b j (BM.1 f) d];ring lemma sm (f:ٳ->ℚ) (μ:ℚ) (l:List ٳ):(l.map λj=>(f j-μ)^2).sum=(l.map λj=>f j^2).sum-2*μ*(l.map f).sum+l.length*μ^2:=by induction l;simp;next j l a=>simp only[CR,DV,Ex,a];push_cast;ring lemma Z2 (x:ؽ δ) (d n j:ٳ) (e:jif ε x[d+j]! =0 then b else min b (γ x[d+j]!)) b<=b/\∀k∈l,ε x[d+k]!≠0->l.foldl (λb j=>if ε x[d+j]! =0 then b else min b (γ x[d+j]!)) b<=γ x[d+k]! from(H _ 255).2 j (BM.2 e) f intro l;induction l with|nil=>intro b;simp|cons a l p=>intro b;simp only[AO];obtain⟨h,q⟩:=p (if ε x[d+a]! =0 then b else min b (γ x[d+a]!));refine⟨Cp h (by split_ifs<;>omega),λk g o=>?_⟩;rcases List.mem_cons.1 g with rfl|g;exacts[Cp h (by simp[o]),q k g o] lemma Zc9 (a b:ٳ):YF a b<=2*a/\YF a b<=b+149 /\ (4:ℚ)^(((YF a b:ℤ)-298)/2)=2^((YF a b:ℤ)-298):=by unfold YF;refine⟨א,א,?_⟩;rw[show(4:ℚ)=2^(2:ٴ)from ב,<-zpow_mul];congr 1;omega lemma M7 (A n a b d:ٳ) (e:0(ς x[r*n+j]! -0)^2)];simp;rw[g] have o:0<ϫ n x r 0+ς a:=by rw[h];positivity refine N1 _ _ _ _ o b ?_;rw[h,N0 a d];exact M7 A n e (γ a) (ε a) b lemma M6 (n:ٳ) (x:ؽ δ) (r:ٳ) (μ:ℚ):0<=ϫ n x r μ:=by unfold ϫ;rw[fS,zero_add];exact div_nonneg (List.sum_nonneg λa b=>by obtain⟨j,_,rfl⟩:=EZ.1 b;positivity) ה lemma V1 (x:ؽ δ) (n:ٳ) (a:δ) (r:ٳ) (b:0(ς x[r*n+j]!-rowMean n x r)^2),zero_add,sm,CM]:ϫ n x r (rowMean n x r)=(((ϒ n).map λj=>(ς x[r*n+j]!)^2).sum-2*rowMean n x r*((ϒ n).map λj=>ς x[r*n+j]!).sum+n*rowMean n x r^2)/n),(by unfold rowMean;rw[fS (λj=>ς x[r*n+j]!),zero_add]:rowMean n x r=((ϒ n).map λj=>ς x[r*n+j]!).sum/n),<-f,<-g,show(2:ℚ)^((2*e:ٴ)-298)=(2^((e:ٴ)-149))^2 by rw[<-ؠ _ 2,<-zpow_mul];congr 1;ring];push_cast;field_simp;ring rw[M7 _ (n*n) e (γ a) (ε a) (ϊ b b),h,show((((n:ٴ)*A-S1*S1)׆:ٳ):ℚ)=(((n:ٴ)*A-S1*S1:ٴ):ℚ) by exact_mod_cast Cj (by have:=M6 n x r (rowMean n x r);rw[h]at this;exact_mod_cast nonneg_of_mul_nonneg_left this (div_pos ה (by exact_mod_cast ϊ b b)):0<=(n:ٴ)*A-S1*S1)];push_cast;ring lemma V0 (x:ؽ δ) (n:ٳ) (a:δ) (r:ٳ) (b:0 ℚ):δ:= if sv dw<=0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let P:=((n:ٴ)*YaF w b0-S1)*sv gw<<<(b0+γ gw-c2) + (n:ٴ)*sv bw*sv dw<<<(γ bw+γ dw-c2) AW (P<0) P.natAbs (n*ε dw) ((c2:ٴ)-149-γ dw) section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats lemma eD (d:δ) (h:¬sv d<=0):sv d=ε d/\0 < ε d:=by have a:η d=false:=by by_contra c;simp at c;exact h (by simp[sv,c]) have:sv d=ε d:=by simp[sv,a] exact⟨this,by omega⟩ lemma eP (P:ℤ):(if decide (P<0)=true then -((P.natAbs:ℕ):ℚ) else (P.natAbs:ℚ))=P:=by rw[EA];split_ifs with c<;>simp_all[abs_of_neg,abs_of_nonneg] lemma U9 (w a b:δ):elR w a b=roundRational (ς w*ς a/ς b):=by unfold elR;split_ifs with h;rfl;obtain⟨e,f⟩:=eD b h;refine(N3 _ _ _ _ _ f (λp=>by simp at p;omega) ?_).symm;simp only[ς,ϙ,e];rw[eP];have d:(2:ℚ)≠0:=ג;rw[show((γ w:ٴ)+γ a-γ b-149)=((γ w:ٴ)-149)+((γ a:ٴ)-149)-((γ b:ٴ)-149) by ring,zpow_sub₀ d (((γ w:ٴ)-149)+((γ a:ٴ)-149)) ((γ b:ٴ)-149),zpow_add₀ d ((γ w:ٴ)-149) ((γ a:ٴ)-149)];push_cast;field_simp lemma U8 (n:ٳ) (w e f:δ) (b:ٳ) (g:ٴ) (d:δ) (a:Unit->ℚ) (j:0b<=γ w) (l:a ()=(g:ℚ)*2^((b:ٴ)-149)/n) : elL n w e f b g d a=roundRational ((ς w-a ())*ς e/ς d+ς f):=by unfold elL;split_ifs with h;·rfl obtain⟨r,s⟩:=eD d h;refine(N3 _ _ _ _ _ (ϊ j s) (λp=>by simp at p;omega) ?_).symm;simp only[ς,ϙ,l];rw[eP];generalize q:min (b+γ e) (γ f+γ d)=c;have t:=q▸min_le_left _ _;have u:=q▸min_le_right _ _;simp only[YaF,CV,r];push_cast;have o:(2:ℚ)≠0:=ג;have v:(sv w:ℚ)*2^((γ w:ٴ)-149)=sv w*2^(γ w-b)*2^((b:ٴ)-149):=by by_cases m:ε w=0;·simp[sv,m] rw[mul_assoc,<-ؠ,<-zpow_add₀ o];push_cast[k m];ring have x:(2:ℚ)^((b:ٴ)-149)*2^((γ e:ٴ)-149)=2^((c:ٴ)-149-γ d)*2^((γ d:ٴ)-149)*2^(b+γ e-c):=by rw[<-ؠ,<-zpow_add₀ o,<-zpow_add₀ o,<-zpow_add₀ o];push_cast[t];ring have y:(2:ℚ)^((γ f:ٴ)-149)=2^((c:ٴ)-149-γ d)*2^(γ f+γ d-c):=by rw[<-ؠ,<-zpow_add₀ o];congr 1;push_cast[u];ring rw[v,y];field_simp;linear_combination (((n:ℚ)*sv w*2^(γ w-b)-g)*sv e)*x end @[inline] def p2 (k:ٳ):ٳ:=if k<63 then ((1:ػ)<< ف | .ofNat s=>aa*p2 (s+1) ف | .ofNat s=>a>=b*p2 s | .negSucc s=>a*p2 (s+1)>=b @[inline] def fl2 (a b:ٳ):ٴ:= let i:ٴ:=BG (lg a)-BG (lg b);let l:=if lt2 a b i then i-1 else i;if ge2 a b (l+1) then l+1 else l @[inline] def sc2 (a b:ٳ):ٴ -> ٳ × ٳ | .ofNat s=>(a*p2 s,b) | .negSucc s=>(a,b*p2 (s+1)) @[inline] def YN (s:ف) (N D:ٳ) (E:ٴ):ؼ:= if D==0 then 0x7fc00000 else if N==0 then if s then ߾ else 0 else let r:=fl2 N D;let t:=r+E;if t>127 then if s then 0xff800000 else 0x7f800000 else if t < -150 then if s then ߾ else 0 else if t < -126 then let c:=sc2 N D (E+149);let f:=AP c.1 c.2;if f==0 then if s then ߾ else 0 else match Nat.decLe ރ f with | isTrue _=>ϥ s 1 0 | isFalse _=>ϥ s 0 f else let c:=sc2 N D (23-r);let m:=AP c.1 c.2;let k:=m==ނ;let x:=if k then t+1 else t;let y:=if k then ރ else m;if x>127 then if s then 0xff800000 else 0x7f800000 else ϥ s (Fe (x+127)) (y-ރ) @[inline] def Yap (sa:ف) (a:ٳ) (sb:ف) (b:ٳ):ف × ٳ:= if sa==sb then (sa,a+b) else if b<=a then (sa,a-b) else (sb,b-a) @[inline] def Ya7 (w gw dw:δ):δ:= if sv dw<=0 then roundRational (ς w*ς gw/ς dw) else let Pn:=ε w*ε gw;YN (η w != η gw&&Pn != 0) Pn (ε dw) ((γ w:ٴ)+γ gw-γ dw-149) @[inline] def Y3 (s1:ف) (q1 r1:ٳ) (s2:ف) (B D:ٳ):ف × ٳ × ٳ:= if s1==s2 then (s1,q1+B,r1) else if B<=q1 then (s1,q1-B,r1) else if r1=0 then (s2,B-q1,0) else (s2,B-q1-1,D-r1) @[inline] def Ya8 (s:ف) (M:ػ) (E:ٴ):ؼ:= let L:=Yj M;let t:=(Lپ:ٴ)+E;if M=0\/L<24\/t < -126 then YN s Mپ 1 E else let m:=(YK M L)˧;let k:=m==ނ;let x:=if k then t+1 else t;let y:=if k then ރ else m;if x>127 then if s then 0xff800000 else 0x7f800000 else ϥ s (Fe (x+127)) (y-ރ) @[inline] def Ya9 (s:ف) (M:ٳ) (E:ٴ):ؼ:=if M>>>62=0 then Ya8 s M߸ E else YN s M 1 E lemma ZE (k:ٳ):p2 k=2^k:=by unfold p2;split;next h=>have a:k߸˧=k:=CG (by unfold Fd;omega);rw[ό,a,ν (א:k<64),Da,Nat.one_shiftLeft];exact ν (DJ ב א) rfl lemma U7 (n:ٳ):lg n=n܀:=by unfold lg;dsimp only;split;rename_i h;by_cases a:n߸=0;have:n=0:=by rw[<-h,a];rfl subst this;decide;rw[Zj _ a,h];rfl lemma U6 (a b:ٳ) (e:ٴ):lt2 a b e=Bi a b e:=by cases e<;>simp[lt2,Bi,ZE,Α] lemma U5 (a b:ٳ) (e:ٴ):ge2 a b e=Bk a b e:=by cases e<;>simp[ge2,Bk,ZE,Α] lemma U4:sc2=Bl:=by funext a b e;cases e<;>simp[sc2,Bl,ZE,Α] lemma M5:fl2=Br:=by funext a b;simp only[fl2,Br,U7,U6,U5] lemma G2 (s:ف) (N D:ٳ) (E:ٴ):YN s N D E=AW s N D E:=by unfold YN;rw[M5,U4];rfl lemma U3 (s:ف) (M:ػ) (E:ٴ):Ya8 s M E=YN s M˧ 1 E:=by unfold Ya8;dsimp only;split;rfl;rename_i h;simp only[not_or,EO]at h;obtain⟨a,k,o⟩:=h;have d:M˧≠0:=λe=>a (σ.mp (by simpa using e));have f:=Zj M a;have p:24<=M˧܀:=by rw[<-f];exact ϐ.1 k obtain⟨g,_,_⟩:=Z7 M a;rw[if_pos (by show 23<=_;omega:κ߷<=M˧܀)]at g;rw[g,BQ,f,show κ߷=23 from rfl];unfold YN;rw[M5,Model.floorLog2_den_one _ d];simp only[show((1:ٳ)==0)=false from rfl,show(M˧==0)=false by simpa using d,(א:(23:ٴ)-(M˧܀:ٴ)=CJ (M˧܀-24)),sc2,ZE,φ,ש,Ϙ,(א:M˧܀-24+1=M˧܀-23)];by_cases j:(M˧܀:ٴ)+E>127;simp only[j,(by intro b;split<;>omega:∀b:ف,(if b=true then (M˧܀:ٴ)+E+1 else (M˧܀:ٴ)+E)>127),ר];simp only[j,ש,show¬(M˧܀:ٴ)+E< -150 by omega,show¬(M˧܀:ٴ)+E< -126 by omega] lemma U2 (s:ف) (M:ٳ) (E:ٴ):Ya9 s M E=YN s M 1 E:=by unfold Ya9;split;next h=>rw[U3];congr 1;simp[Nat.toUInt64];omega rfl def Yh (s:ف) (m:ٳ):ٴ:=if s then -(m:ٴ) else m lemma U1 (d:ف) (a:ٳ) (e:ف) (b:ٳ):Yh (Yap d a e b).1 (Yap d a e b).2=Yh d a+Yh e b:=by unfold Yap;by_cases g:d=e;subst g;cases d<;>simp[Yh];omega;rw[if_neg (by simpa using g)];by_cases f:b<=a;rw[if_pos f];cases d<;>cases e<;>simp_all[Yh,ϗ f]<;>omega;rw[if_neg f];have h:a<=b:=א;cases d<;>cases e<;>simp_all[Yh,ϗ h]<;>omega lemma M4 (s:ف) (m:ٳ):(Yh s m).natAbs=m:=by cases s<;>simp[Yh] lemma M3 (s:ف) (m:ٳ):decide (Yh s m<0)=(s&&m != 0):=by cases s;simp[Yh];by_cases h:m=0;simp[Yh,h];have:(0:ٴ)< m:=Nat.cast_pos.2 (Ο h);simp only[Yh,ר,Left.neg_neg_iff,this,decide_true,Bool.true_and];simpa using h lemma ZF (w:δ):sv w=Yh (η w) (ε w):=rfl lemma U0 (s:ف) (a b:ٳ):Yh s (a*b)=a*Yh s b:=by cases s<;>simp[Yh] lemma Z3 (s:ف) (a b:ٳ):Yh s (a*b)=Yh s a*b:=by cases s<;>simp[Yh] lemma M2 (s t:ف) (a b:ٳ):Yh (s != t) (a*b)=Yh s a*Yh t b:=by cases s<;>cases t<;>simp[Yh] lemma T9 (S:ٴ):Yh (!decide (S<0)) S.natAbs = -S:=by unfold Yh;by_cases h:S<0<;>simp[h]<;>omega lemma T8 (w a b:δ):Ya7 w a b=elR w a b:=by unfold Ya7 elR;split;rfl;simp only[G2,show sv w*sv a=Yh (η w !=η a) (ε w*ε a) by rw[M2,ZF,ZF],M4,M3] lemma T7 (a:ف) (b d:ٳ) (f:ف) (B D:ٳ) (g:dsimp only[Yh]<;>simp<;>ring;obtain rfl:f=!a:=by cases a<;>cases f<;>simp_all rw[if_neg (by cases a<;>simp)];by_cases h:B<=b;rw[if_pos h];refine⟨?_,g⟩;cases a<;>simp only[Yh]<;>simp<;>push_cast[ϗ h]<;>ring;rw[if_neg h];by_cases j:d=0;rw[if_pos j];have k:b<=B:=א;refine⟨?_,by dsimp only;omega⟩;cases a<;>simp only[Yh,j]<;>simp<;>push_cast[ϗ k]<;>ring;rw[if_neg j];have k:b+1<=B:=א;have n:d<=D:=א;refine⟨?_,by dsimp only;omega⟩;cases a<;>simp only[Yh]<;>simp<;>push_cast[ϗ k,ϗ n,Nat.sub_sub]<;>ring lemma T6 (t k D:ٳ):(t/D*k+t%D*k/D)*D+t%D*k%D=t*k:=by rw[ϟ,BU,϶,Nat.mul_right_comm,<-ϟ,϶] lemma J8 (a m D:ٳ):a*m/D=a/D*m+a%D*m/D/\a*m%D=a%D*m%D:=by rcases Ae D with rfl|b;simp;rw[show a*m=a%D*m+D*(a/D*m) by rw[<-ϣ,<-ϟ,Ez],DG _ _ b,CF];exact⟨Ϟ _ _,rfl⟩ lemma gO {α:Type} [Inhabited α] (n:ٳ) (f:ٳ->α) (k:ٳ) (a:kf i܂)[k]! = f k:=ח lemma M1 (a n:ٳ) (b:δ) (x g:ؽ δ) (h:stableNormDomain a n b x g=true):0>>63)) a b+c˧:ٳ):ٴ)%2^192=d%2^192:=by have n:=b܉;have o:=a܉;unfold Yx;rw[(by rw[Τ,Ξ];simp[ψ]:((0:ػ)-(a>>>63))˧=(2^64-a˧/2^63)%2^64),e,ϑ,BU,(א:a˧/2^63=(a˧*2^64+b˧)/2^127)];exact T2 _ d h (א:a˧*2^64+b˧<2^128) f g lemma K7 (a:ؼ) (b:ػ) (d:Yf a=0\/(b<=Yd ζ+Yd a/\Yd ζ+Yd a-b<80)):ε ζ*ε a≠0->b˧<=γ ζ+γ a/\γ ζ+γ a<=b˧+79:=by intro f;obtain⟨e,j⟩:=d.resolve_left λh=>f (by rw[<-Zk a,h];simp);have k:=ϐ.mp e;have l:=Ψ.mp j;rw[ZM]at k;rw[Η _ _ e,ZM]at l;have:(80:ػ)˧=80:=rfl;constructor<;>omega lemma D8 (d a e b:ػ):((((d+e+(if a+brename_i h<;>rw[Ψ,ξ]at h<;>simp only[ξ,Bc,Nat.mod_add_mod]<;>push_cast<;>omega lemma S7 (a:ػ):((((0:ػ)-(a>>>63))˧*2^64+a˧:ٳ):ٴ)%2^128=Ye a%2^128:=by have:=a܉;unfold Ye;simp only[Τ];norm_num;omega lemma A2 {α:Type} [Inhabited α] (A:ؽ α) (i:ؾ) (h:i؛>>63))˧*2^64+q˧:ٳ):ٴ)%2^128=Ye q%2^128:=S7 q lemma QZb (w:ؼ):((w>>>31)܅)˧=if η w then 1 else 0:=by have h:=D4 w 0;rwa[EE,show η 0=false from rfl,EM]at h lemma C9 (x w:ؼ) (b a:ػ) (d f:ٳ) (l:d+f<=15) (j:ε x=0\/(b˧<=γ x/\γ x-b˧<=d)) (g:ε w=0\/(a˧<=γ w/\γ w-a˧<=f)) (k:1<=a):Ye (((QPb x b (η w))߸-ބ)*(Yf w<<<((θ w)܅-(a+1)))) = sv x*sv w*2^(γ x+γ w-(b˧+a˧)) /\ -2^63grind:∀c:ف,((if c then ބ-M else ބ+M)˧߸-ބ)*D=if c then 0-M*D else M*D),show(η x !=η w)=Ζ (η x) (η w) by cases η x<;>cases η w<;>rfl];generalize M*D=p at n⊢;have Zk:(if Ζ (η x) (η w)then-(p˧:ٴ)else p˧)=sv x*sv w*2^(γ x+γ w-(b˧+a˧)):=by rw[n,<-Zn];by_cases q:ε x*ε w=0;rcases Ax.1 q with h|h<;>simp[h];have B:=j.resolve_left (left_ne_zero_of_mul q);have C:=g.resolve_left (right_ne_zero_of_mul q);rw[(א:γ x+γ w-(b˧+a˧)=γ x-b˧+(γ w-a˧)),pow_add];split_ifs<;>push_cast<;>ring have E:(p˧:ٴ)<2^63:=by rw[n];exact_mod_cast o refine⟨(K8 p (Ζ (η x) (η w)) (by rw[n];omega)).trans Zk,?_,?_⟩<;>rw[<-Zk]<;>split_ifs<;>omega lemma C8 (X W:ؽ δ) (e g:ٳ) (n:ؾ) (f:(k:ؾ)->kػ) (a:ػ) (b:ؼ) (j:n؛<=ށ) (o:∀t h,Ye (f t h)=sv X[e+t؛]!*sv W[g+t؛]!*2^(γ X[e+t؛]!+γ W[g+t؛]!-a˧) /\ -2^63<=Ye (f t h) /\ Ye (f t h)<=2^63) (l:ε ζ*ε b≠0->a˧<=γ ζ+γ b/\γ ζ+γ b<=a˧+122):∀ (d:ٳ) (k:ؾ) (p r:ػ) (S0 S:ٴ),n؛-k؛=d->k؛<=n؛->((p˧*2^64+r˧:ٳ):ٴ)%2^128=S0%2^128->-((k؛:ٴ)*2^63)<=S0->S0<=k؛*2^63->S=S0+YB X W e g a˧ k؛ (n؛-k؛)+sv ζ*sv b*2^(γ ζ+γ b-a˧)->-2^191<=S->S<2^191->QY6G n f a b p r k=if S=0 then ߿ else (ρ S ((a˧:ٴ)-298) false)܅:=by intro d;induction d<;>intro k p r S0 S s z A x y B C D;rw[QY6G,dif_neg (by rw[υ];exact DZ.2 (De.1 s))];obtain⟨I,J,K,L,M,-,v⟩:=Zr a ζ b _ p r 0 (YD · · · · ((a˧:ٴ)-298)) ג (λh=>⟨(l h).1,(l h).2.trans_lt ג⟩);rw[M];apply ZV I J K L _ S C D;rw[v,Ϫ,E9 p r 0 S0 rfl A (by clear*-x y z j;omega) (by clear*-x y z j;omega),<-Ϫ,B,s,YB];ring_nf;rename_i d N;have v:=Al s;have w:=υ.2 v;have u:=QK n k w;have E:n؛-(k+1)؛=d:=by rw[u,Cx,s,Cz] rw[QY6G,dif_pos w];dsimp only;obtain⟨F,G,H⟩:=o k w;generalize f k w=q at F G H⊢;refine N (k+1) _ _ (S0+Ye q) S E (u▸v) ?_ (by clear*-u x G;omega) (by clear*-u y H;omega) ?_ C D;unfold QhiS;rw[D8,Ϫ,A,Qsx q,<-Ϫ];rw[B,s,YB,E,u,F];ring lemma C7 (A:ؽ δ) (a i c:ٳ) (e:i*a+a<=Aٽ) (f:i*a+a<=ހ) (g:(Yc A a i&&&ޅ)≠255) (b:Yk (Yc A a i>>>16)<=Yk (Yc A a i&&&ޅ)) (d:(QYF (Yc A a i))˧<=c):∀t,t < a->(ε A[i*a+t]! = 0\/((Yk (Yc A a i>>>16))˧<=γ A[i*a+t]!/\γ A[i*a+t]!-(Yk (Yc A a i>>>16))˧<=c)) /\ θ A[i*a+t]!≠255:=by obtain⟨L,H,o,-,hH,p⟩:=Zp A a i e f;obtain⟨q,k⟩:=Zo _ L H o א;have j:=Zq (Yc A a i>>>16);have h:=Zq (Yc A a i&&&ޅ);rw[q]at j;rw[k]at h;unfold QYF at d;rw[Η _ _ b,j,h]at d;have r:H≠255:=λc=>g (ύ.mp (by rw[k,c];rfl));intro t s;obtain⟨-,-,u,v⟩:=Zb A[i*a+t]!;have:=p t s;refine⟨?_,u (Ρ this.2 (hH.lt_of_ne r))⟩;by_cases l:ε A[i*a+t]! =0;exact Ea l;have n:=v l;right;rw[j];exact⟨H4 this.1 n.1,(BZ (H3 this.2 n.2) _).trans d⟩ lemma R5 (X W b:ؽ δ) (a i j w x:ٳ) (d e:ؼ) (l o:ؽ δ) (r s:ٳ) (n:ؾ) (f:(k:ؾ)->kػ) (C:i*a+a<=Xٽ) (D:j*a+a<=Wٽ) (y:i*a+a<=ހ) (z:j*a+a<=ހ) (g:a<ށ) (E:w+x<=122) (F:n؛<=ށ) (G:YB l o r s ((Yk (d>>>16))+(Yk (e>>>16)))˧ 0 n؛=YB X W (i*a) (j*a) ((Yk (d>>>16))+(Yk (e>>>16)))˧ 0 a) (A:∀t,t < a->(ε X[i*a+t]! = 0\/((Yk (d>>>16))˧<=γ X[i*a+t]!/\γ X[i*a+t]!-(Yk (d>>>16))˧<=w)) /\ θ X[i*a+t]!≠255) (B:∀t,t < a->(ε W[j*a+t]! = 0\/((Yk (e>>>16))˧<=γ W[j*a+t]!/\γ W[j*a+t]!-(Yk (e>>>16))˧<=x)) /\ θ W[j*a+t]!≠255) (u:θ b[j]!≠255) (v:Yf b[j]! = 0\/(Yk (d>>>16)+Yk (e>>>16)<=Yd ζ+Yd b[j]!/\Yd ζ+Yd b[j]!-(Yk (d>>>16)+Yk (e>>>16))<80)) (H:∀t h,Ye (f t h)=sv l[r+t؛]!*sv o[s+t؛]!*2^(γ l[r+t؛]!+γ o[s+t؛]!-((Yk (d>>>16))˧+(Yk (e>>>16))˧)) /\ -2^63<=Ye (f t h) /\ Ye (f t h)<=2^63):(if QY6G n f (Yk (d>>>16)+Yk (e>>>16)) b[j]! 0 0 0<߿ then (QY6G n f (Yk (d>>>16)+Yk (e>>>16)) b[j]! 0 0 0)՜ else Yai X W b a i j) = Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b[j]!):=by have H':=Za (i*a) א;have I:=Za (j*a) א;have J:=Za a א;have L:=τ;have R:(Yk (d>>>16)+Yk (e>>>16))˧=(Yk (d>>>16))˧+(Yk (e>>>16))˧:=by rw[E6,Zq,Zq] generalize Yk (d>>>16)=Z,Yk (e>>>16)=U at*;have M:=K7 b[j]! _ v;have G':∀t,tε X[i*a+t]!*ε W[j*a+t]!≠0->(Z+U)˧<=γ X[i*a+t]!+γ W[j*a+t]!/\γ X[i*a+t]!+γ W[j*a+t]!<=(Z+U)˧+122:=by intro t N K;have:=(A t N).1.resolve_left (left_ne_zero_of_mul K);have:=(B t N).1.resolve_left (right_ne_zero_of_mul K);omega have T:=W6 X W (i*a) (j*a) _ a 0 (λt _ _=>G' t א);have K:=ZL ζ b[j]! _ (λc=>⟨(M c).1,א⟩);generalize O:YB X W (i*a) (j*a) (Z+U)˧ 0 a+sv ζ*sv b[j]!*(2:ٴ)^(γ ζ+γ b[j]!-(Z+U)˧)=S;have P:-2^191<=S:=א;have Q:S<2^191:=א;rw[C8 l o r s n f _ b[j]! F (by rwa[R]) א n؛ 0 0 0 0 S rfl ג ג ג ג (by rw[<-O,<-G];simp) P Q,<-W7 X W (i*a)۞ (j*a)۞ a۞ א א א א _ _ b[j]! א (λc=>⟨(M c).1,א⟩) a 0 0 0 0 0 0 S J ג ג (λt _ _=>by rw[H',I];have:=G' t א;omega) (by simp[Yx]) (by rw[<-O,H',I,J];simp) P Q];exact L8 X W a i j b[j]! _ _ _ _ _ H' I J g (A · · |>.2) (B · · |>.2) u G' א _ (O2 X W b a i j) lemma J1 (n:ٳ) (f:ٳ->ؼ) (m:ػ):∀k t (P:ؽ ٳ),n-t=k->(QPD n f m t P)܍=P܍ ++ (Bd (2*t) (2*(n-t))).map λu=>QPb (f (u/2)) m (u%2=1):=by intro k;induction k<;>intro t P h<;>unfold QPD ·rw[if_neg א];simp[h] rename_i k a;rw[if_pos א];dsimp only;have e:n-(t+1)=k:=א;rw[a (t+1) _ e,h,e,Nat.mul_succ 2 k,Ϩ,Ϩ];simp[Cf,(א:2*(t+1)=2*t+1+1)] lemma D2 (n c:ٳ) (f:ٳ->ؼ) (m:ػ):QPD n f m 0 (Ba c)=ڀ (2*n) λu=>QPb (f (u܂/2)) m (u܂%2=1):=by apply ϻ;rw[J1 n f m _ 0 _ rfl];apply ϩ<;>simp lemma J0 (n:ٳ) (f:ٳ->ؼ):∀k t (I:ؽ ؼ),n-t=k->(QPI n f t I)܍=I܍ ++ ((Bd t (n-t)).filter λu=>Yf (f u)≠0).map (·.toUInt32):=by intro k;induction k<;>intro t I h<;>unfold QPI ·rw[if_neg א];simp[h] rename_i a;rw[if_pos א,a (t+1) _ א,(א:n-t=(n-(t+1))+1),Ϩ];split<;>simp[*] lemma R6 (X W:ؽ δ) (a b d:ٳ):∀r k,YB X W a b d k r=((Bd k r).map λu=>sv X[a+u]!*sv W[b+u]!*2^(γ X[a+u]!+γ W[b+u]!-d)).sum:=by intro r;induction r;intro;rfl;next r e=>intro;rw[YB,e,Ϩ];simp lemma QFL (L:List ٳ) (p:ٳ->Prop) [DecidablePred p] (g:ٳ->ٴ) (h:∀x ∈ L,¬p x->g x=0):((L.filter p).map g).sum=(L.map g).sum:=by induction L;rfl;next x L a=>simp only[List.filter_cons,CR,DV];split<;>simp_all lemma R9 (t:ؾ) (w:ؼ) (h:t؛<ށ):(t+t+(w>>>31).toUSize)؛=2*t؛+(w>>>31)؎/\(w>>>31)؎<2 /\ (2*t؛+(w>>>31)؎)/2=t؛/\decide ((2*t؛+(w>>>31)؎)%2=1)=η w:=by obtain⟨a,b⟩:=D0 t w h;have h:=QZb w;simp only[AG]at h;refine⟨a,b,?_⟩;rcases (η w).eq_false_or_eq_true with c|c<;>rw[c]at h⊢<;>simp only[↓reduceIte,φ,ת,decide_eq_false_iff_not]at h⊢<;>omega lemma I9 (X:ؽ δ) (P:ؽ ٳ) (I:ؽ ؼ) (W b:ؽ δ) (d i j:ٳ) (H:(Iٽ=0->∀t,t<2*d->Pٽ=2*d->P[t]! = QPb X[i*d+t/2]! (Yk (Yc X d i>>>16)) (t%2=1)) /\ (Iٽ≠0->I܍=((ϒ d).filter λt=>Yf X[i*d+t]! ≠ 0).map (·.toUInt32) /\ ∀u,u<2*Iٽ->Pٽ=2*Iٽ->P[u]! = QPb X[i*d+(I[u/2]!)؎]! (Yk (Yc X d i>>>16)) (u%2=1))):QPa X P I W b d i j (Yc X d i) (Yc W d j) = Γ (d+1) (λt=>if t < d then X[i*d+t]! else ζ) (λt=>if t < d then W[j*d+t]! else b[j]!):=by unfold QPa;by_cases c:Iٽ=0<;>simp only[c,reduceDIte,reduceIte]<;>split<;>(try exact ZcB ..)<;>obtain⟨F,O,x,y,z,A,G,K,L,B,C,l,n,o,p⟩:=‹_/\_›<;>have r:=C7 X d i _ x z K B le_rfl<;>have s:=C7 W d j _ y A L C le_rfl<;>have e:∀u:ؾ,u؛((j*d)۞+u)؛=j*d+u؛:=λu h=>by rw[Zc _ _ (by rw[Za _ א];have:=τ;omega),Za _ א] exact R5 X W b d i j _ _ _ _ X W _ _ _ _ x y z A G א (by rw[Za _ א];omega) (by rw[Za _ א]) r s n o (λt h=>by have f:t؛δ)m,m(I.map g)[0+m]! =g I[m]!:=λg m h=>by rw[Β,ح _ m (by rwa[CC]),CN,ح I m h] exact R5 X W b d i j _ _ _ _ (I.map λv=>X[i*d+v؎]!) (I.map λv=>W[j*d+v؎]!) 0 0 _ _ x y z A G א (by rw[Za _ א];omega) (by rw[Za _ א,R6,R6,<-Ca,<-Ca,<-QFL (ϒ d) (λt=>Yf X[i*d+t]!≠0) _ (λu _ h=>by simp only[sv,<-Zk,not_not.1 h,Ϝ,CP,neg_zero,ite_self,zero_mul])];apply congrArg;apply ϩ (by simp only[Ds,CM,<-Array.length_toList,D]);intro m E N;simp only[Ds,CM]at E;simp only[List.getElem_map,List.getElem_range,V _ _ E,ح I m E,<-DL,D,Cd,UInt32.toNat_ofNat_of_lt' ((BM.1 (List.mem_of_mem_filter (List.getElem_mem (Ds _▸N)))).trans (א:d<߿))]) r s n o (λt h=>by have f:t؛ػ->ػ->ػ->β) (q:ف) (X W:ؽ δ) (xa w1a w2a w3a w4a n:ؾ) (hX:xaپ+nپ<=Xٽ) (hW1:w1aپ+nپ<=Wٽ) (hW2:w2aپ+nپ<=Wٽ) (hW3:w3aپ+nپ<=Wٽ) (hW4:w4aپ+nپ<=Wٽ) (hx:xaپ+nپ<Λ) (hw1:w1aپ+nپ<Λ) (hw2:w2aپ+nپ<Λ) (hw3:w3aپ+nپ<Λ) (hw4:w4aپ+nپ<Λ) (lo1 lo2 lo3 lo4:ػ) (e1 e2 e3 e4:ٴ) (bw1 bw2 bw3 bw4:ؼ) (a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc:ػ) (k:ؾ):YS6c4 kont q X W xa w1a w2a w3a w4a n hX hW1 hW2 hW3 hW4 hx hw1 hw2 hw3 hw4 lo1 lo2 lo3 lo4 e1 e2 e3 e4 bw1 bw2 bw3 bw4 a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc k=kont (YS6 q X W xa w1a n hX hW1 hx hw1 lo1 e1 bw1 a2 a1 a0 ac k) (YS6 q X W xa w2a n hX hW2 hx hw2 lo2 e2 bw2 b2 b1 b0 bc k) (YS6 q X W xa w3a n hX hW3 hx hw3 lo3 e3 bw3 c2 c1 c0 cc k) (YS6 q X W xa w4a n hX hW4 hx hw4 lo4 e4 bw4 d2 d1 d0 dc k):=by induction E:n؛-k؛generalizing a2 a1 a0 ac b2 b1 b0 bc c2 c1 c0 cc d2 d1 d0 dc k with |zero=>have o:¬khave o:ksimp only[dif_pos o,YL16,YL6,φ,↓reduceIte]<;>apply p<;>have:=QK n k o<;>omega lemma Yuc4 (X W b:ؽ δ) (inW i j:ٳ) (bx bv1 bv2 bv3 bv4:ؼ):YaUc4 X W b inW i j bx bv1 bv2 bv3 bv4=((YaU X W b inW i j bx bv1,YaU X W b inW i (j+1) bx bv2),(YaU X W b inW i (j+2) bx bv3,YaU X W b inW i (j+2+1) bx bv4)):=by unfold YaUc4;dsimp only;split;rw[Yc64];unfold YaU;simp only[*,and_self,↓reduceDIte,φ,↓reduceIte,decide_true];rfl lemma QWc4 (X:ؽ δ) (P:ؽ ٳ) (I:ؽ ؼ) (W b:ؽ δ) (inW i j:ٳ) (bx bv1 bv2 bv3 bv4:ؼ):QPac4 X P I W b inW i j bx bv1 bv2 bv3 bv4=((QPa X P I W b inW i j bx bv1,QPa X P I W b inW i (j+1) bx bv2),(QPa X P I W b inW i (j+2) bx bv3,QPa X P I W b inW i (j+2+1) bx bv4)):=by unfold QPac4;split;swap;rfl;rename_i h;rw[Yuc4];have Z:∀r bv,QPa X P I W b inW i r bx bv=YaU X W b inW i r bx bv:=λr bv=>by unfold QPa;dsimp only;rw[dif_neg (λk=>by have:=k.1;rw[h.1]at this;split at this<;>omega)] simp only[Z] lemma Zj4 (hw:ٳ) (f:ٳ->ٳ->δ) (f4:ٳ->ٳ->(δ × δ) × (δ × δ)) (d4:ٳ->ف) (ch:ٳ) (u:∀j,f4 ch j=((f ch j,f ch (j+1)),(f ch (j+2),f ch (j+2+1)))):∀k j (n:ؽ δ),hw-j<=k->Yaj4 hw f f4 d4 ch j n=Yaj hw f ch j n:=by have Y:∀m (n:ؽ δ),mYaj hw f ch m n=Yaj hw f ch (m+1) (n.push (f ch m)):=λm n o=>by conv_lhs=>unfold Yaj;rw[if_pos o] intro k;induction k with |zero=>intro j n h;unfold Yaj4 Yaj;rw[if_neg א,if_neg א,if_neg א] |succ k p=>intro j n h;unfold Yaj4;split;split;dsimp only;rw[p _ _ א,u,Y j n א,Y (j+1) _ א,Y (j+1+1) _ א,Y (j+1+1+1) _ א];rw[p _ _ א,Y j n א];split;rw[p _ _ א,Y j n ‹_›];unfold Yaj;rw[if_neg ‹_›] lemma Zk4 (c hw:ٳ) (f:ٳ->ٳ->δ) (f4:ٳ->ٳ->(δ × δ) × (δ × δ)) (d4:ٳ->ف) (u:∀i j,f4 i j=((f i j,f i (j+1)),(f i (j+2),f i (j+2+1)))):∀k l (n:ؽ δ),c-l<=k->Yak4 c hw f f4 d4 l n=Yak c hw f l n:=by intro k;induction k<;>intro l n h<;>unfold Yak4 Yak ·rw[if_neg א,if_neg א] rename_i p;by_cases o:lػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->ػ->β) (XL W:ؽ δ) (xa wa n:ؾ) (hX:xa؛+(8:ؾ)؛*n؛<=XLٽ) (gX:xa؛+(8:ؾ)؛*n؛<Λ) (hW:wa؛+n؛<=Wٽ) (gW:wa؛+n؛<Λ) (w0:ػ) (a0 c0 a1 c1 a2 c2 a3 c3 a4 c4 a5 c5 a6 c6 a7 c7 sw:ػ) (k:ؾ): B8I1 kont XL W xa wa n hX gX hW gW w0 a0 c0 a1 c1 a2 c2 a3 c3 a4 c4 a5 c5 a6 c6 a7 c7 sw k=kont (B1J XL W xa wa n 8 0 hX gX hW gW (by simp) w0 a0 c0 k).1 (B1J XL W xa wa n 8 0 hX gX hW gW (by simp) w0 a0 c0 k).2 (B1J XL W xa wa n 8 1 hX gX hW gW (by simp) w0 a1 c1 k).1 (B1J XL W xa wa n 8 1 hX gX hW gW (by simp) w0 a1 c1 k).2 (B1J XL W xa wa n 8 2 hX gX hW gW (by simp) w0 a2 c2 k).1 (B1J XL W xa wa n 8 2 hX gX hW gW (by simp) w0 a2 c2 k).2 (B1J XL W xa wa n 8 3 hX gX hW gW (by simp) w0 a3 c3 k).1 (B1J XL W xa wa n 8 3 hX gX hW gW (by simp) w0 a3 c3 k).2 (B1J XL W xa wa n 8 4 hX gX hW gW (by simp) w0 a4 c4 k).1 (B1J XL W xa wa n 8 4 hX gX hW gW (by simp) w0 a4 c4 k).2 (B1J XL W xa wa n 8 5 hX gX hW gW (by simp) w0 a5 c5 k).1 (B1J XL W xa wa n 8 5 hX gX hW gW (by simp) w0 a5 c5 k).2 (B1J XL W xa wa n 8 6 hX gX hW gW (by simp) w0 a6 c6 k).1 (B1J XL W xa wa n 8 6 hX gX hW gW (by simp) w0 a6 c6 k).2 (B1J XL W xa wa n 8 7 hX gX hW gW (by simp) w0 a7 c7 k).1 (B1J XL W xa wa n 8 7 hX gX hW gW (by simp) w0 a7 c7 k).2 (B1S W wa n hW gW w0 sw k):=by induction E:n؛-k؛generalizing a0 c0 a1 c1 a2 c2 a3 c3 a4 c4 a5 c5 a6 c6 a7 c7 sw k<;>rw[B8I1,B1J,B1J,B1J,B1J,B1J,B1J,B1J,B1J,B1S] ·simp only[dif_neg (show¬k ٳ | 0=>0 | m+1=>(((XL[xa+S*k+r]!)܅)*B8x1 w0 W[wa+k]!)˧+B8Z XL W xa wa S r w0 (k+1) m lemma B1Jv (XL W:ؽ δ) (xa wa n S r:ؾ) (hX:xa؛+S؛*n؛<=XLٽ) (gX:xa؛+S؛*n؛<Λ) (hW:wa؛+n؛<=Wٽ) (gW:wa؛+n؛<Λ) (hr:r؛(((B1J XL W xa wa n S r hX gX hW gW hr w0 a c k).2˧*2^64+(B1J XL W xa wa n S r hX gX hW gW hr w0 a c k).1˧:ٳ):ٴ)%2^128=((c˧*2^64+a˧:ٳ)+(B8Z XL W xa؛ wa؛ S؛ r؛ w0 k؛ (n؛-k؛):ٳ):ٴ)%2^128:=by intro d;induction d<;>intro k a c s<;>rw[B1J];rw[dif_neg (mt υ.1 א),s,B8Z];simp;next d N=>have w:k ٳ | 0=>0 | m+1=>(B8x1 w0 W[wa+k]!)˧+B8Y W wa w0 (k+1) m lemma B1Sv (W:ؽ δ) (wa n:ؾ) (hW:wa؛+n؛<=Wٽ) (gW:wa؛+n؛<Λ) (w0:ػ):∀ (d:ٳ) (k:ؾ) (sw:ػ),n؛-k؛=d->(B1S W wa n hW gW w0 sw k)˧=(sw˧+B8Y W wa؛ w0 k؛ (n؛-k؛))%2^64:=by intro d;induction d<;>intro k sw s<;>rw[B1S];rw[dif_neg (mt υ.1 א),s,B8Y];have:=Az sw;omega;next d N=>have w:k ػ | 0=>0 | m+1=>B8x1 e X[b+t]!+B8U X b e (t+1) m lemma B8P1v (X:ؽ δ) (inW:ٳ) (b0 b1 b2 b3 b4 b5 b6 b7:ٳ) (e0 e1 e2 e3 e4 e5 e6 e7:ػ):∀d t (XL:ؽ δ) (s0 s1 s2 s3 s4 s5 s6 s7:ػ),inW-t=d -> (B8P1 X inW b0 b1 b2 b3 b4 b5 b6 b7 e0 e1 e2 e3 e4 e5 e6 e7 t XL s0 s1 s2 s3 s4 s5 s6 s7).1.toList=XL.toList++(Bd t d).flatMap (λu=>[(B8x1 e0 X[b0+u]!)՜,(B8x1 e1 X[b1+u]!)՜,(B8x1 e2 X[b2+u]!)՜,(B8x1 e3 X[b3+u]!)՜,(B8x1 e4 X[b4+u]!)՜,(B8x1 e5 X[b5+u]!)՜,(B8x1 e6 X[b6+u]!)՜,(B8x1 e7 X[b7+u]!)՜]) /\ (B8P1 X inW b0 b1 b2 b3 b4 b5 b6 b7 e0 e1 e2 e3 e4 e5 e6 e7 t XL s0 s1 s2 s3 s4 s5 s6 s7).2=#[s0+B8U X b0 e0 t d,s1+B8U X b1 e1 t d,s2+B8U X b2 e2 t d,s3+B8U X b3 e3 t d,s4+B8U X b4 e4 t d,s5+B8U X b5 e5 t d,s6+B8U X b6 e6 t d,s7+B8U X b7 e7 t d]:=by intro d;induction d<;>intro t XL a b c e f g i j h<;>rw[B8P1];rw[if_neg א];simp[B8U];next d N=>rw[if_pos א];dsimp only;obtain⟨p,q⟩:=N (t+1) _ _ _ _ _ _ _ _ _ א;rw[p,q];exact⟨by simp only[Array.toList_push,Ϩ,List.flatMap_cons,CL,List.cons_append,EB],by simp only[B8U,CY]⟩ lemma B8GK {α:Type} (K:ٳ) (f:ٳ->List α) (hf:∀t,(f t).length=K):∀n s t r,tr((Bd s n).flatMap f)[K*t+r]?=(f (s+t))[r]?:=by intro n;induction n with |zero=>intros;omega |succ n N=> intro s t r h e;rw[Ϩ,List.flatMap_cons];rcases t with _|t ·rw[List.getElem?_append_left (by rw[hf];omega)];simp have m:K*(t+1)=K*t+K:=rfl rw[List.getElem?_append_right (by rw[hf];omega),hf,show K*(t+1)+r-K=K*t+r by omega,N (s+1) t r א e,show s+1+t=s+(t+1) by omega] lemma B8v (e:ػ) (x:ؼ) (k:ٳ) (a:k<=39) (h:ε x=0\/(e˧<=γ x/\γ x-e˧<=k)) (B:ػ) (hB:2^(24+k)<=B˧) (hB2:B˧+2^(24+k)<=2^64) : ((B+(((Yf x<<<(Yd x-e))^^^((0:ػ)-(x>>>31)܅))-((0:ػ)-(x>>>31)܅)))˧:ٴ)=B˧+sv x*2^(γ x-e˧) /\ (B+(((Yf x<<<(Yd x-e))^^^((0:ػ)-(x>>>31)܅))-((0:ػ)-(x>>>31)܅)))˧>>31)܅=g at r⊢;have p':(v˧:ٴ)=(ε x:ٴ)*2^(γ x-e˧):=by exact_mod_cast p unfold sv;cases c:η x<;>simp only[c,↓reduceIte]at r⊢;. have:g=0:=σ.1 (by rw[r];rfl);subst this;simp only[UInt64.sub_zero,UInt64.xor_zero];rw[ξ];push_cast;omega . have:g=1:=σ.1 (by rw[r];rfl);subst this;have u:=G7 v 1 ד;simp only[show ((1:ػ))˧=1 from rfl,↓reduceIte]at u;have hv:v˧<=B˧:=א;have w:(B+((v^^^((0:ػ)-1))-((0:ػ)-1)))˧=B˧-v˧:=by rw[ξ,Τ,u];simp only[show ((0:ػ)-1)˧=2^64-1 from rfl];omega rw[w];refine⟨?_,by omega⟩;rw[ϗ hv,p'];ring lemma R5n (X W b:ؽ δ) (a i j:ٳ) (L w2 w1 w0:ػ) (T:ٴ) (C:i*a+a<=Xٽ) (D:j*a+a<=Wٽ) (y:i*a+a<=ހ) (z:j*a+a<=ހ) (g:a<ށ) (q:∀t,t < a->θ X[i*a+t]!≠255) (r:∀t,t < a->θ W[j*a+t]!≠255) (u:θ b[j]!≠255) (G':∀t,t < a->ε X[i*a+t]!*ε W[j*a+t]!≠0->L˧<=γ X[i*a+t]!+γ W[j*a+t]!/\γ X[i*a+t]!+γ W[j*a+t]!<=L˧+122) (M:ε ζ*ε b[j]!≠0->L˧<=γ ζ+γ b[j]!/\γ ζ+γ b[j]!<=L˧+79) (hT:T=YB X W (i*a) (j*a) L˧ 0 a) (hA:((Yx w2 w1 w0:ٳ):ٴ)%2^192=T%2^192) : (if YL L ζ b[j]! w2 w1 w0 0 (λv2 v1 v0 c'=>YD v2 v1 v0 c' ((L˧:ٴ)-298))<߿ then (YL L ζ b[j]! w2 w1 w0 0 (λv2 v1 v0 c'=>YD v2 v1 v0 c' ((L˧:ٴ)-298)))՜ else Yai X W b a i j)=Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b[j]!):=by have H':=Za (i*a) א;have I:=Za (j*a) א;have J:=Za a א;have L0:=τ;have T6:=W6 X W (i*a) (j*a) _ a 0 (λt _ h=>G' t א);have K:=ZL ζ b[j]! _ (λc=>⟨(M c).1,א⟩);generalize O:YB X W (i*a) (j*a) L˧ 0 a+sv ζ*sv b[j]!*(2:ٴ)^(γ ζ+γ b[j]!-L˧)=S;have P:-2^191<=S:=א;have Q:S<2^191:=א;obtain⟨I1,J1,K1,L1,M1,-,v⟩:=Zr L ζ b[j]! w2 w1 w0 0 (YD · · · · ((L˧:ٴ)-298)) ג (λh=>⟨(M h).1,(M h).2.trans_lt ג⟩);rw[M1,ZV I1 J1 K1 L1 _ S P Q (by rw[v,Ϫ];simp only[Ϝ,ϑ];rw[hA,<-Ϫ,hT,<-O])];rw[<-W7 X W (i*a)۞ (j*a)۞ a۞ א א א א _ _ b[j]! א (λc=>⟨(M c).1,א⟩) a 0 0 0 0 0 0 S J ג ג (λt _ h=>by rw[H',I];have:=G' t א;omega) (by simp[Yx]) (by rw[<-O,H',I,J];simp) P Q];exact L8 X W a i j b[j]! _ _ _ _ _ H' I J g q r u G' (λc=>⟨(M c).1,by have:=(M c).2;omega⟩) _ (O2 X W b a i j) lemma B8x1v (e:ػ) (x:ؼ) (h:ε x=0\/(e˧<=γ x/\γ x-e˧<=7)):((B8x1 e x)˧:ٴ)=2^31+sv x*2^(γ x-e˧) /\ (B8x1 e x)˧<2^32:=by have:=B8v e x 7 ב h 0x80000000 ד ד;unfold B8x1;exact this lemma B8x2v (e:ػ) (x:ؼ) (h:ε x=0\/(e˧<=γ x/\γ x-e˧<=39)):((B8x2 e x)˧:ٴ)=2^63+sv x*2^(γ x-e˧):=by have:=B8v e x 39 ב h 0x8000000000000000 ד ד;unfold B8x2;exact this.1 noncomputable def B8Q (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ) (k:ٳ):ٳ -> ٳ | 0=>0 | m+1=>(B8x1 e X[bX+k]!*B8x1 ew W[bW+k]!)˧+B8Q X W bX bW e ew (k+1) m lemma B8H (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ):∀m k,(∀t,k<=t->t(ε X[bX+t]! =0\/(e˧<=γ X[bX+t]!/\γ X[bX+t]!-e˧<=7)) /\ (ε W[bW+t]! =0\/(ew˧<=γ W[bW+t]!/\γ W[bW+t]!-ew˧<=7))) -> (B8Q X W bX bW e ew k m:ٴ)-2^31*(B8Y X bX e k m)-2^31*(B8Y W bW ew k m)+m*2^62=YB X W bX bW (e˧+ew˧) k m:=by intro m;induction m with |zero=>intro k h;simp[B8Q,B8Y,B8Y,YB] |succ m N=> intro k h;have p:=N (k+1) (λt a b=>h t א א);obtain⟨hx,hw⟩:=h k le_rfl א obtain⟨u,u'⟩:=B8x1v e _ hx;obtain⟨v,v'⟩:=B8x1v ew _ hw have m1:(B8x1 e X[bX+k]!*B8x1 ew W[bW+k]!)˧=(B8x1 e X[bX+k]!)˧*(B8x1 ew W[bW+k]!)˧:=by rw[ϯ];exact ν (by have:=BP u' v';omega) simp only[B8Q,B8Y,B8Y,YB];push_cast;rw[m1];push_cast;rw[u,v,<-p] have q:sv X[bX+k]!*2^(γ X[bX+k]!-e˧)*(sv W[bW+k]!*2^(γ W[bW+k]!-ew˧))=sv X[bX+k]!*sv W[bW+k]!*2^(γ X[bX+k]!+γ W[bW+k]!-(e˧+ew˧)):=by rcases hx with hx|hx;· simp[sv,hx] rcases hw with hw|hw;· simp[sv,hw] rw[show γ X[bX+k]!+γ W[bW+k]!-(e˧+ew˧)=(γ X[bX+k]!-e˧)+(γ W[bW+k]!-ew˧) by omega,pow_add];ring rw[<-q];ring lemma B8D (d a e b:ػ):((((d-e-(if arename_i h<;>rw[Ψ]at h<;>simp only[Τ,Da,Ϝ]<;>push_cast<;>omega lemma B8p (q:ػ):(q>>>33)˧*2^64+(q<<<31)˧=q˧*2^31:=by have:=q܉;rw[Ξ,ό];simp only[Bc,Α,ψ,BY];omega lemma B8r (n:ػ):(n>>>2)˧*2^64+(n<<<62)˧=n˧*2^62:=by have:=n܉;rw[Ξ,ό];simp only[show ((2:ػ))˧=2 from rfl,show ((62:ػ))˧%64=62 from rfl,Α,ψ,BY];omega lemma B8F1a (a c q n:ػ):((((c-(q>>>33)-(if a<(q<<<31) then (1:ػ) else 0))+(n>>>2)+(if (a-(q<<<31))+(n<<<62)<(a-(q<<<31)) then (1:ػ) else 0))˧*2^64+((a-(q<<<31))+(n<<<62))˧:ٳ):ٴ)%2^128=((c˧*2^64+a˧:ٳ)-(q˧*2^31:ٳ)+(n˧*2^62:ٳ):ٴ)%2^128:=by rw[D8,Ϫ,B8D,<-Ϫ,By];have:=B8p q;have:=B8r n;push_cast;omega lemma B8Y64 (X W:ؽ δ) (xa wa L:ٳ) (hL:64<=L):∀m k,(∀t,k<=t->tε X[xa+t]!*ε W[wa+t]!≠0->L<=γ X[xa+t]!+γ W[wa+t]!)->YB X W xa wa (L-64) k m=2^64*YB X W xa wa L k m:=by intro m;induction m with |zero=>intros;simp[YB] |succ m N=> intro k h;simp only[YB];rw[N (k+1) (λt a c=>h t א א),mul_add];congr 1 by_cases e:ε X[xa+k]!*ε W[wa+k]! =0 ·rcases Ax.1 e with e|e<;>simp only[sv,e,CP,neg_zero,ite_self,zero_mul,mul_zero] have:=h k le_rfl א e;rw[show γ X[xa+k]!+γ W[wa+k]!-(L-64)=(γ X[xa+k]!+γ W[wa+k]!-L)+64 by omega,pow_add];ring lemma B8Gv (X W b:ؽ δ) (a i j:ٳ) (relu:ف) (lo w2 w1 w0:ػ) (T:ٴ) (C:i*a+a<=Xٽ) (D:j*a+a<=Wٽ) (y:i*a+a<=ހ) (z:j*a+a<=ހ) (g:a<ށ) (q:∀t,t < a->θ X[i*a+t]!≠255) (r:∀t,t < a->θ W[j*a+t]!≠255) (u:θ b[j]!≠255) (G0:∀t,t < a->ε X[i*a+t]!*ε W[j*a+t]!≠0->lo˧<=γ X[i*a+t]!+γ W[j*a+t]!/\γ X[i*a+t]!+γ W[j*a+t]!<=lo˧+58) (hT:T=YB X W (i*a) (j*a) lo˧ 0 a) (hA:((Yx w2 w1 w0:ٳ):ٴ)%2^192=T%2^192) (hB:-2^127<=T/\T<2^127) : B8G X W b a i j relu b[j]! lo w2 w1 w0=act relu (Γ (a+1) (λt=>if t < a then X[i*a+t]! else ζ) (λt=>if t < a then W[j*a+t]! else b[j]!)):=by unfold B8G;congr 1;split;. rename_i c;exact R5n X W b a i j lo w2 w1 w0 T C D y z g q r u (λt h e=>⟨(G0 t h e).1,by have:=(G0 t h e).2;omega⟩) (K7 _ _ (by simp only[Ϸ,beq_iff_eq,Ω,decide_eq_true_eq]at c;exact c)) hT hA split . rename_i c0 c;simp only[Ω,decide_eq_true_eq]at c;obtain⟨c1,c2⟩:=c;have l1:=Ψ.1 c1;have l2:=ϐ.1 c2;have e:=ZM b[j]!;rw[Τ,e,show ((64:ػ))˧=64 from rfl]at l2;rw[e]at l1;have x:=lo܉;have e1:γ ζ+γ b[j]!by have:=G0 t h e;rw[f];omega) (λh=>by rw[f];omega) ?_ ?_;. rw[hT,f,B8Y64 X W (i*a) (j*a) lo˧ א a 0 (λt _ c e=>(G0 t א e).1)] . have h1:((Yx w1 w0 0:ٳ):ٴ)=2^64*((Yx w2 w1 w0:ٳ):ٴ)+(2^192)*(-(w2˧:ٴ)):=by unfold Yx;push_cast;ring rw[h1,CA];exact Int.ModEq.mul_left _ hA . rw[O2] lemma B8Yb (W:ؽ δ) (bW:ٳ) (e:ػ):∀m k,(∀t,k<=t->tε W[bW+t]! =0\/(e˧<=γ W[bW+t]!/\γ W[bW+t]!-e˧<=7))->B8Y W bW e k m<=m*2^32:=by intro m;induction m with |zero=>intros;simp[B8Y] |succ m N=>intro k h;have p:=N (k+1) (λt a c=>h t א א);have:=(B8x1v e _ (h k le_rfl א)).2;simp only[B8Y];omega lemma B8Qb (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ):∀m k,B8Q X W bX bW e ew k m<=m*2^64:=by intro m;induction m with |zero=>intro k;simp[B8Q] |succ m N=>intro k;have p:=N (k+1);have:=(B8x1 e X[bX+k]!*B8x1 ew W[bW+k]!)܉;simp only[B8Q];omega lemma B8E1 (X W b:ؽ δ) (inW i j:ٳ) (relu:ف) (a c sx sw:ػ) (C:i*inW+inW<=Xٽ) (D:j*inW+inW<=Wٽ) (y:i*inW+inW<=ހ) (z:j*inW+inW<=ހ) (g:inW<ށ) (rx1:(Yc X inW i&&&ޅ)≠255) (rx2:Yk (Yc X inW i>>>16)<=Yk (Yc X inW i&&&ޅ)) (rx3:(QYF (Yc X inW i))˧<=7) (rw1:(Yc W inW j&&&ޅ)≠255) (rw2:Yk (Yc W inW j>>>16)<=Yk (Yc W inW j&&&ޅ)) (rw3:(QYF (Yc W inW j))˧<=7) (u:θ b[j]!≠255) (hA:((c˧*2^64+a˧:ٳ):ٴ)%2^128=(B8Q X W (i*inW) (j*inW) (Yk (Yc X inW i>>>16)) (Yk (Yc W inW j>>>16)) 0 inW:ٴ)%2^128) (hx:sx˧=B8Y X (i*inW) (Yk (Yc X inW i>>>16)) 0 inW) (hw:sw˧=B8Y W (j*inW) (Yk (Yc W inW j>>>16)) 0 inW) : B8F1 X W b inW i j relu b[j]! (Yk (Yc X inW i>>>16)) (Yk (Yc W inW j>>>16)) a c sx sw=act relu (Γ (inW+1) (λt=>if t < inW then X[i*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!)):=by have cx:=C7 X inW i 7 C y rx1 rx2 rx3;have cw:=C7 W inW j 7 D z rw1 rw2 rw3;have lo:=E6 (Yc X inW i>>>16) (Yc W inW j>>>16);rw[<-Zq,<-Zq]at lo;generalize Yk (Yc X inW i>>>16)=e at cx hA hx lo⊢;generalize Yk (Yc W inW j>>>16)=ew at cw hA hw lo⊢;have H:=B8H X W (i*inW) (j*inW) e ew inW 0 (λt _ h=>⟨(cx t א).1,(cw t א).1⟩);generalize hT:YB X W (i*inW) (j*inW) (e˧+ew˧) 0 inW=T at H;have bX:=B8Yb X (i*inW) e inW 0 (λt _ h=>(cx t א).1);have bY:=B8Yb W (j*inW) ew inW 0 (λt _ h=>(cw t א).1);have bQ:=B8Qb X W (i*inW) (j*inW) e ew inW 0;have q:(sx+sw)˧=sx˧+sw˧:=by rw[ξ];omega have n:inW߸˧=inW:=CG (Ag g ד);unfold B8F1;dsimp only;have F1:=B8F1a a c (sx+sw) inW߸;rw[q,n,hx,hw]at F1;have hb:-2^127<=T/\T<2^127:=by rw[<-H];clear* -bX bY bQ g;push_cast;omega have E:=E9 _ _ 0 _ rfl ((F1.trans ((Int.ModEq.sub_right _ hA).add_right _)).trans (by rw[<-H];push_cast;congr 1;ring)) hb.1 hb.2;simp only[Ϝ,ϑ]at E;refine B8Gv X W b inW i j relu (e+ew) _ _ _ _ C D y z g (λt h=>(cx t h).2) (λt h=>(cw t h).2) u (λt h p=>?_) (by rw[lo,hT]) E hb;obtain⟨a,c⟩:=mul_ne_zero_iff.1 p;have:=(cx t h).1.resolve_left a;have:=(cw t h).1.resolve_left c;rw[lo];omega noncomputable def B8s (r:ٳ) (t:δ × δ × δ × δ × δ × δ × δ × δ):δ:=if r=0 then t.1 else if r=1 then t.2.1 else if r=2 then t.2.2.1 else if r=3 then t.2.2.2.1 else if r=4 then t.2.2.2.2.1 else if r=5 then t.2.2.2.2.2.1 else if r=6 then t.2.2.2.2.2.2.1 else t.2.2.2.2.2.2.2 noncomputable def B8g1 (X W b XL:ؽ δ) (inW i0:ٳ) (relu:ف) (BX BV:ؽ ؼ) (F:ٳ -> ٳ -> δ) (S:ؽ ػ) (r j:ٳ):δ:=if h:B8W W b inW j BV[j]! = true/\XLٽ=8*inW then B8s r (B8K1 X W b XL inW i0 j relu BX BV S h) else F (i0+r) j lemma B8K1g (X W b XL:ؽ δ) (inW i0 j:ٳ) (relu:ف) (BX BV:ؽ ؼ) (S:ؽ ػ) (h:B8W W b inW j BV[j]! = true/\XLٽ=8*inW) (r:ٳ) (hr:r<8):∃ hX gX hW gW hr',B8s r (B8K1 X W b XL inW i0 j relu BX BV S h)=B8F1 X W b inW (i0+r) j relu b[j]! (Yk (BX[i0+r]!>>>16)) (Yk (BV[j]!>>>16)) (B1J XL W 0 (j*inW).toUSize inW.toUSize 8 r.toUSize hX gX hW gW hr' (Yk (BV[j]!>>>16)) 0 0 0).1 (B1J XL W 0 (j*inW).toUSize inW.toUSize 8 r.toUSize hX gX hW gW hr' (Yk (BV[j]!>>>16)) 0 0 0).2 S[r]! (B1S W (j*inW).toUSize inW.toUSize hW gW (Yk (BV[j]!>>>16)) 0 0):=by unfold B8K1;rw[B8J1];interval_cases r<;>exact⟨_,_,_,_,_,rfl⟩ lemma B8C1v (X W b XL:ؽ δ) (inW outW i0:ٳ) (relu:ف) (BX BV:ؽ ؼ) (F:ٳ->ٳ->δ) (S:ؽ ػ):∀d j (O0 O1 O2 O3 O4 O5 O6 O7:ؽ δ),outW-j=d -> (B8C1 X W b XL inW outW i0 relu BX BV F S j O0 O1 O2 O3 O4 O5 O6 O7).toList=(O0.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 0))++(O1.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 1))++(O2.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 2))++(O3.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 3))++(O4.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 4))++(O5.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 5))++(O6.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 6))++(O7.toList++(Bd j d).map (B8g1 X W b XL inW i0 relu BX BV F S 7)):=by intro d;induction d with |zero=>intros;rw[B8C1,if_neg א];simp |succ d N=> intro j;intros;rw[B8C1,if_pos א];split ·rename_i h;dsimp only;rw[N (j+1) _ _ _ _ _ _ _ _ א];simp only[Array.toList_push,Ϩ,CR,CL,List.cons_append,EB,B8g1,dif_pos h];rfl rename_i h;rw[N (j+1) _ _ _ _ _ _ _ _ א];simp only[Array.toList_push,Ϩ,CR,CL,List.cons_append,EB,B8g1,dif_neg h] lemma B8XLK {α:Type} [Inhabited α] (K:ٳ) (A:ؽ α) (blk:ٳ->List α) (hb:∀t,(blk t).length=K) (n u r:ٳ) (hu:urfl lemma B8ZQ (XL X W:ؽ δ) (bX bW r:ٳ) (e ew:ػ):∀m k,(∀t,k<=t->tXL[0+8*t+r]! =(B8x1 e X[bX+t]!).toUInt32 /\ (ε X[bX+t]! =0\/(e˧<=γ X[bX+t]!/\γ X[bX+t]!-e˧<=7)))->B8Z XL W 0 bW 8 r ew k m=B8Q X W bX bW e ew k m:=by intro m;induction m<;>intro k h;simp[B8Z,B8Q];next m N=>simp only[B8Z,B8Q];rw[N (k+1) λt a c=>h t א א];obtain⟨p,q⟩:=h k le_rfl א;have:=(B8x1v e _ q).2;rw[p,show (B8x1 e X[bX+k]!)՜܅=B8x1 e X[bX+k]! from σ.1 (by rw[AG,AA];omega)] lemma B8UX (X:ؽ δ) (bX:ٳ) (e:ػ):∀m k,m<2^20->(∀t,k<=t->tε X[bX+t]! =0\/(e˧<=γ X[bX+t]!/\γ X[bX+t]!-e˧<=7))->(B8U X bX e k m)˧=B8Y X bX e k m:=by intro m;induction m<;>intro k g h;simp[B8U,B8Y];next m N=>simp only[B8U,B8Y];have p:=N (k+1) א λt a c=>h t א א;have q:=(B8x1v e _ (h k le_rfl א)).2;have r:=B8Yb X bX e m (k+1) λt a c=>h t א א;rw[ξ,p];omega lemma B8core (X W b XL:ؽ δ) (inW i j r:ٳ) (relu:ف) (bx bv:ؼ) (S:ؽ ػ) (ru:ؾ) (hrr:ru؛=r) (hX:(0:ؾ)؛+(8:ؾ)؛*inW.toUSize؛<=XLٽ) (gX:(0:ؾ)؛+(8:ؾ)؛*inW.toUSize؛<Λ) (hW:(j*inW).toUSize؛+inW.toUSize؛<=Wٽ) (gW:(j*inW).toUSize؛+inW.toUSize؛<Λ) (hr:ru؛<(8:ؾ)؛) (hbx:bx=Yc X inW i) (hbv:bv=Yc W inW j) (hc:B8W W b inW j bv=true) (rx1:(bx&&&ޅ)≠255) (rx2:Yk (bx>>>16)<=Yk (bx&&&ޅ)) (rx3:(QYF bx)˧<=7) (C:i*inW+inW<=Xٽ) (y:i*inW+inW<=ހ) (hXL:∀t,t < inW->XL[0+8*t+r]! =(B8x1 (Yk (bx>>>16)) X[i*inW+t]!)՜) (sx:ػ) (hS:sx=(0:ػ)+B8U X (i*inW) (Yk (bx>>>16)) 0 inW) : B8F1 X W b inW i j relu b[j]! (Yk (bx>>>16)) (Yk (bv>>>16)) (B1J XL W 0 (j*inW).toUSize inW.toUSize 8 ru hX gX hW gW hr (Yk (bv>>>16)) 0 0 0).1 (B1J XL W 0 (j*inW).toUSize inW.toUSize 8 ru hX gX hW gW hr (Yk (bv>>>16)) 0 0 0).2 sx (B1S W (j*inW).toUSize inW.toUSize hW gW (Yk (bv>>>16)) 0 0)=act relu (Γ (inW+1) (λt=>if t < inW then X[i*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!)):=by obtain⟨w1,w2,w3,u,D,z,g⟩:=B8Wv W b inW j bv hc;subst hbx hbv;have cx:=C7 X inW i 7 C y rx1 rx2 rx3;have nI:inW.toUSize؛=inW:=Za inW א;have jI:(j*inW).toUSize؛=j*inW:=Za _ א;have A:=B1Jv _ _ _ _ _ _ _ hX gX hW gW hr (Yk (Yc W inW j>>>16)) _ 0 0 0 rfl;have B:=B1Sv _ _ _ hW gW (Yk (Yc W inW j>>>16)) _ 0 0 rfl;simp only[nI,jI,hrr,Ϝ,show (0:ؾ)؛=0 by simp,show (8:ؾ)؛=8 by simp,Ai,ϸ,Β]at A B;rw[B8ZQ XL X W (i*inW) (j*inW) r _ _ inW 0 (λt _ h=>⟨by rw[Β]at h;have:=hXL t h;simpa using this,(cx t א).1⟩)]at A;have bY:=B8Yb W (j*inW) (Yk (Yc W inW j>>>16)) inW 0 (λt _ h=>((C7 W inW j 7 D z w1 w2 w3) t א).1);exact B8E1 _ _ _ _ _ _ _ _ _ _ _ C D y z g rx1 rx2 rx3 w1 w2 w3 u (by simpa using A) (by rw[hS,UInt64.zero_add];exact B8UX X (i*inW) _ inW 0 א (λt _ h=>(cx t א).1)) (by rw[B];exact ν א) lemma B8Rv (X:ؽ δ) (inW i:ٳ) (bx:ؼ) (c:ػ) (h:B8R X inW i bx c=true):(bx&&&ޅ)≠255 /\ Yk (bx>>>16)<=Yk (bx&&&ޅ) /\ (QYF bx)˧<=c˧ /\ i*inW+inW<=Xٽ /\ i*inW+inW<=ހ:=by simp only[B8R,Ω,bne_iff_ne,ne_eq,decide_eq_true_eq]at h;obtain⟨⟨⟨⟨a,d⟩,e⟩,f⟩,g⟩:=h;exact⟨a,d,ϐ.1 e,f,g⟩ lemma B8R8v (X:ؽ δ) (inW ch:ٳ) (BX:ؽ ؼ) (c:ػ) (h:B8R8 X inW ch BX c=true) (r:ٳ) (hr:r<8):B8R X inW (ch+r) BX[ch+r]! c=true:=by simp only[B8R8,Ω]at h;obtain⟨⟨⟨⟨⟨⟨⟨q0,q1⟩,q2⟩,q3⟩,q4⟩,q5⟩,q6⟩,q7⟩:=h;interval_cases r;exacts[q0,q1,q2,q3,q4,q5,q6,q7] lemma B8Yak (c hw:ٳ) (f:ٳ->ٳ->δ) (ch:ٳ) (a:ؽ δ) (h:chunfold Yak;rw[if_pos h] noncomputable def B8UL (X:ؽ δ) (b:ٳ) (e:ػ) (t:ٳ):ٳ -> ػ | 0=>0 | m+1=>(B8x2 e X[b+t]!&&&ހ)+B8UL X b e (t+1) m noncomputable def B8UH (X:ؽ δ) (b:ٳ) (e:ػ) (t:ٳ):ٳ -> ػ | 0=>0 | m+1=>(B8x2 e X[b+t]!>>>32)+B8UH X b e (t+1) m lemma B8P2v (X:ؽ δ) (inW:ٳ) (b0 b1 b2 b3 b4 b5 b6 b7:ٳ) (e0 e1 e2 e3 e4 e5 e6 e7:ػ):∀d t (XA XB:ؽ δ) (l0 l1 l2 l3 l4 l5 l6 l7 h0 h1 h2 h3 h4 h5 h6 h7:ػ),inW-t=d -> (B8P2 X inW b0 b1 b2 b3 b4 b5 b6 b7 e0 e1 e2 e3 e4 e5 e6 e7 t XA XB l0 l1 l2 l3 l4 l5 l6 l7 h0 h1 h2 h3 h4 h5 h6 h7).1.toList=XA.toList++(Bd t d).flatMap (λu=>[(B8x2 e0 X[b0+u]!)՜,(B8x2 e1 X[b1+u]!)՜,(B8x2 e2 X[b2+u]!)՜,(B8x2 e3 X[b3+u]!)՜,(B8x2 e4 X[b4+u]!)՜,(B8x2 e5 X[b5+u]!)՜,(B8x2 e6 X[b6+u]!)՜,(B8x2 e7 X[b7+u]!)՜]) /\ (B8P2 X inW b0 b1 b2 b3 b4 b5 b6 b7 e0 e1 e2 e3 e4 e5 e6 e7 t XA XB l0 l1 l2 l3 l4 l5 l6 l7 h0 h1 h2 h3 h4 h5 h6 h7).2.1.toList=XB.toList++(Bd t d).flatMap (λu=>[((B8x2 e0 X[b0+u]!)>>>32)՜,((B8x2 e1 X[b1+u]!)>>>32)՜,((B8x2 e2 X[b2+u]!)>>>32)՜,((B8x2 e3 X[b3+u]!)>>>32)՜,((B8x2 e4 X[b4+u]!)>>>32)՜,((B8x2 e5 X[b5+u]!)>>>32)՜,((B8x2 e6 X[b6+u]!)>>>32)՜,((B8x2 e7 X[b7+u]!)>>>32)՜]) /\ (B8P2 X inW b0 b1 b2 b3 b4 b5 b6 b7 e0 e1 e2 e3 e4 e5 e6 e7 t XA XB l0 l1 l2 l3 l4 l5 l6 l7 h0 h1 h2 h3 h4 h5 h6 h7).2.2=#[l0+B8UL X b0 e0 t d,l1+B8UL X b1 e1 t d,l2+B8UL X b2 e2 t d,l3+B8UL X b3 e3 t d,l4+B8UL X b4 e4 t d,l5+B8UL X b5 e5 t d,l6+B8UL X b6 e6 t d,l7+B8UL X b7 e7 t d,h0+B8UH X b0 e0 t d,h1+B8UH X b1 e1 t d,h2+B8UH X b2 e2 t d,h3+B8UH X b3 e3 t d,h4+B8UH X b4 e4 t d,h5+B8UH X b5 e5 t d,h6+B8UH X b6 e6 t d,h7+B8UH X b7 e7 t d]:=by intro d;induction d with |zero=>intros;rw[B8P2,if_neg א];simp[B8UL,B8UH] |succ d N=> intro t;intros;rw[B8P2,if_pos א];dsimp only obtain⟨p,q,w⟩:=N (t+1) _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ א;rw[p,q,w];refine⟨?_,?_,?_⟩<;>simp only[Array.toList_push,Ϩ,List.flatMap_cons,CL,List.cons_append,EB,B8UL,B8UH,CY] lemma B8g (g:ػ):(g>>>1)˧*2^64+(g<<<63)˧=g˧*2^63:=by have:=g܉;rw[Ξ,ό];simp only[Bc,Α,ψ,BY];omega lemma B8hx (hh hl:ػ) (h:hh˧<2^32):((hh<<<32)+(hl>>>32))˧*2^64+(hl<<<32)˧=hh˧*2^96+hl˧*2^32:=by have:=hl܉;rw[ξ,ό,Ξ,ό];simp only[Bc,BY,Α,ψ];omega lemma B8n30 (n:ػ) (hn:n˧<2^34):(n<<<30)˧=n˧*2^30:=by rw[ό];simp only[Bc,Α,BY];omega lemma B8F2a (ll lh hl hh sl g n x1 x0 y1 y0 q1 q0 z1 z0 t1:ػ) (hx1:x1=(hh<<<32)+(hl>>>32)) (hx0:x0=hl<<<32) (hy0:y0=x0+ll) (hy1:y1=x1+lh+(if y0>>33)+(g>>>1)+(if q0<(sl<<<31) then (1:ػ) else 0)) (hz0:z0=y0-q0) (hz1:z1=y1-q1-(if y0 ٳ | 0=>0 | m+1=>(B8x2 e X[bX+k]!)˧*(B8x1 ew W[bW+k]!)˧+B8Q2 X W bX bW e ew (k+1) m noncomputable def B8X2 (X:ؽ δ) (bX:ٳ) (e:ػ) (k:ٳ):ٳ -> ٳ | 0=>0 | m+1=>(B8x2 e X[bX+k]!)˧+B8X2 X bX e (k+1) m noncomputable def B8QL (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ) (k:ٳ):ٳ -> ٳ | 0=>0 | m+1=>(B8x2 e X[bX+k]!)˧%2^32*(B8x1 ew W[bW+k]!)˧+B8QL X W bX bW e ew (k+1) m noncomputable def B8QH (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ) (k:ٳ):ٳ -> ٳ | 0=>0 | m+1=>(B8x2 e X[bX+k]!)˧/2^32*(B8x1 ew W[bW+k]!)˧+B8QH X W bX bW e ew (k+1) m lemma B8H2 (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ):∀m k,(∀t,k<=t->t(ε X[bX+t]! =0\/(e˧<=γ X[bX+t]!/\γ X[bX+t]!-e˧<=39)) /\ (ε W[bW+t]! =0\/(ew˧<=γ W[bW+t]!/\γ W[bW+t]!-ew˧<=7))) -> (B8Q2 X W bX bW e ew k m:ٴ)-2^31*(B8X2 X bX e k m)-2^63*(B8Y W bW ew k m)+m*2^94=YB X W bX bW (e˧+ew˧) k m:=by intro m;induction m with |zero=>intros;simp[B8Q2,B8X2,B8Y,YB] |succ m N=> intro k h;have p:=N (k+1) (λt a b=>h t א א);obtain⟨hx,hw⟩:=h k le_rfl א have u:=B8x2v e _ hx;have v:=(B8x1v ew _ hw).1 simp only[B8Q2,B8X2,B8Y,YB];push_cast;rw[u,v,<-p] have q:sv X[bX+k]!*2^(γ X[bX+k]!-e˧)*(sv W[bW+k]!*2^(γ W[bW+k]!-ew˧))=sv X[bX+k]!*sv W[bW+k]!*2^(γ X[bX+k]!+γ W[bW+k]!-(e˧+ew˧)):=by rcases hx with hx|hx;·simp[sv,hx] rcases hw with hw|hw;·simp[sv,hw] rw[mul_mul_mul_comm,<-pow_add];congr 2;omega rw[<-q];ring lemma B8QLH (X W:ؽ δ) (bX bW:ٳ) (e ew:ػ):∀m k,B8QL X W bX bW e ew k m+2^32*B8QH X W bX bW e ew k m=B8Q2 X W bX bW e ew k m:=by intro m;induction m<;>intro k;simp[B8QL,B8QH,B8Q2];next m N=>simp only[B8QL,B8QH,B8Q2];have:=N (k+1);have e:=Ez (B8x2 e X[bX+k]!)˧ (2^32);rw[<-this];nlinarith[e] noncomputable def B8SL (X:ؽ δ) (bX:ٳ) (e:ػ) (k:ٳ):ٳ -> ٳ | 0=>0 | m+1=>(B8x2 e X[bX+k]!)˧%2^32+B8SL X bX e (k+1) m noncomputable def B8SH (X:ؽ δ) (bX:ٳ) (e:ػ) (k:ٳ):ٳ -> ٳ | 0=>0 | m+1=>(B8x2 e X[bX+k]!)˧/2^32+B8SH X bX e (k+1) m lemma B8ZL (XL X W:ؽ δ) (bX bW s r:ٳ) (e ew:ػ):∀m k,(∀t,k<=t->tXL[0+s*t+r]! =(B8x2 e X[bX+t]!)՜ /\ (ε W[bW+t]! =0\/(ew˧<=γ W[bW+t]!/\γ W[bW+t]!-ew˧<=7)))->B8Z XL W 0 bW s r ew k m=B8QL X W bX bW e ew k m:=by intro m;induction m with |zero=>intros;simp[B8Z,B8QL] |succ m N=> intro k h;simp only[B8Z,B8QL];rw[N (k+1) (λt a c=>h t א א)];obtain⟨p,q⟩:=h k le_rfl א;have v:=(B8x1v ew _ q).2 rw[p,ϯ,AG,AA];congr 1;have:(B8x2 e X[bX+k]!)˧%2^32<2^32:=Ε _ ב;exact ν (by have:=BP this v;omega) lemma B8ZH (XL X W:ؽ δ) (bX bW s r:ٳ) (e ew:ػ):∀m k,(∀t,k<=t->tXL[0+s*t+r]! =((B8x2 e X[bX+t]!)>>>32)՜ /\ (ε W[bW+t]! =0\/(ew˧<=γ W[bW+t]!/\γ W[bW+t]!-ew˧<=7)))->B8Z XL W 0 bW s r ew k m=B8QH X W bX bW e ew k m:=by intro m;induction m with |zero=>intros;simp[B8Z,B8QH] |succ m N=> intro k h;simp only[B8Z,B8QH];rw[N (k+1) (λt a c=>h t א א)];obtain⟨p,q⟩:=h k le_rfl א;have v:=(B8x1v ew _ q).2 have a:=(B8x2 e X[bX+k]!)܉ have s:(((B8x2 e X[bX+k]!)>>>32)՜܅)˧=(B8x2 e X[bX+k]!)˧/2^32:=by rw[AG,AA,Ξ];simp only[Bc,ψ,BY];omega rw[p,ϯ,s];congr 1;exact ν (by have:(B8x2 e X[bX+k]!)˧/2^32<2^32:=א;have:=BP this v;omega) lemma B8ULv (X:ؽ δ) (bX:ٳ) (e:ػ):∀m k,m<2^20->(B8UL X bX e k m)˧=B8SL X bX e k m:=by intro m;induction m<;>intro k g;simp[B8UL,B8SL];next m N=>simp only[B8UL,B8SL];have p:=N (k+1) א;have q:((B8x2 e X[bX+k]!)&&&ހ)˧=(B8x2 e X[bX+k]!)˧%2^32:=(by rw[BR];simp only[show ((ހ:ػ))˧=2^32-1 from rfl];exact ϡ _ 32);have b:∀m k,B8SL X bX e k m<=m*2^32:=(by intro m;induction m<;>intro k;simp[B8SL];next m N=>simp only[B8SL];have:=N (k+1);have:(B8x2 e X[bX+k]!)˧%2^32<2^32:=Ε _ ב;omega);have:=b m (k+1);rw[ξ,p,q];omega lemma B8UHv (X:ؽ δ) (bX:ٳ) (e:ػ):∀m k,m<2^20->(B8UH X bX e k m)˧=B8SH X bX e k m:=by intro m;induction m with |zero=>intros;simp[B8UH,B8SH] |succ m N=> intro k g;simp only[B8UH,B8SH];have p:=N (k+1) א have q:((B8x2 e X[bX+k]!)>>>32)˧=(B8x2 e X[bX+k]!)˧/2^32:=by rw[Ξ];simp only[Bc,ψ,BY] have b:∀m k,B8SH X bX e k m<=m*2^32:=by intro m;induction m with |zero=>intro k;simp[B8SH] |succ m N=>intro k;simp only[B8SH];have:=N (k+1);have:=(B8x2 e X[bX+k]!)܉;have:(B8x2 e X[bX+k]!)˧/2^32<2^32:=א;omega have:=b m (k+1);rw[ξ,p,q];have:=(B8x2 e X[bX+k]!)܉;omega lemma B8SLH (X:ؽ δ) (bX:ٳ) (e:ػ):∀m k,B8SL X bX e k m+2^32*B8SH X bX e k m=B8X2 X bX e k m:=by intro m;induction m<;>intro k;simp[B8SL,B8SH,B8X2];next m N=>simp only[B8SL,B8SH,B8X2];have:=N (k+1);have e:=Ez (B8x2 e X[bX+k]!)˧ (2^32);omega lemma B8Bd (X W:ؽ δ) (bX bW inW:ٳ) (e ew:ػ) (hw:∀t,t<0+inW->ε W[bW+t]! =0\/(ew˧<=γ W[bW+t]!/\γ W[bW+t]!-ew˧<=7)):B8QH X W bX bW e ew 0 inW<=inW*2^64 /\ B8QL X W bX bW e ew 0 inW<=inW*2^64 /\ B8Q2 X W bX bW e ew 0 inW<=inW*2^96 /\ B8X2 X bX e 0 inW<=inW*2^64:=by have G:∀m k,(∀t,k<=t-> t ε W[bW+t]! =0\/(ew˧<=γ W[bW+t]!/\γ W[bW+t]!-ew˧<=7))-> B8QH X W bX bW e ew k m<=m*2^64/\B8QL X W bX bW e ew k m<=m*2^64/\B8Q2 X W bX bW e ew k m<=m*2^96/\B8X2 X bX e k m<=m*2^64:=by intro m;induction m<;>intro k h;simp[B8QH,B8QL,B8Q2,B8X2];next m N=>obtain⟨a,b,c,d⟩:=N (k+1) λt x y=>h t א א;have v:=(B8x1v ew _ (h k le_rfl א)).2;have x:=(B8x2 e X[bX+k]!)܉;have p1:=BP (show (B8x2 e X[bX+k]!)˧/2^32<2^32 by omega) v;have p2:=BP (Ε (B8x2 e X[bX+k]!)˧ (show 2^32>0 by norm_num)) v;have p3:=BP x v;simp only[B8QH,B8QL,B8Q2,B8X2];omega exact G inW 0 λt _ h=>hw t h lemma B8SHb (X:ؽ δ) (bX:ٳ) (e:ػ):∀m k,B8SH X bX e k m<=m*2^32 /\ B8SL X bX e k m<=m*2^32:=by intro m;induction m with |zero=>intro k;simp[B8SH,B8SL] |succ m N=>intro k;obtain⟨a,b⟩:=N (k+1);have x:=(B8x2 e X[bX+k]!)܉;have:(B8x2 e X[bX+k]!)˧%2^32<2^32:=Ε _ ב;simp only[B8SH,B8SL];omega lemma B8E2 (X W b:ؽ δ) (inW i j:ٳ) (relu:ف) (ll lh hl hh sl sh sw:ػ) (C:i*inW+inW<=Xٽ) (D:j*inW+inW<=Wٽ) (y:i*inW+inW<=ހ) (z:j*inW+inW<=ހ) (g:inW<ށ) (rx1:(Yc X inW i&&&ޅ)≠255) (rx2:Yk (Yc X inW i>>>16)<=Yk (Yc X inW i&&&ޅ)) (rx3:(QYF (Yc X inW i))˧<=39) (rw1:(Yc W inW j&&&ޅ)≠255) (rw2:Yk (Yc W inW j>>>16)<=Yk (Yc W inW j&&&ޅ)) (rw3:(QYF (Yc W inW j))˧<=7) (u:θ b[j]!≠255) (hAL:((lh˧*2^64+ll˧:ٳ):ٴ)%2^128=(B8QL X W (i*inW) (j*inW) (Yk (Yc X inW i>>>16)) (Yk (Yc W inW j>>>16)) 0 inW:ٴ)%2^128) (hAH:((hh˧*2^64+hl˧:ٳ):ٴ)%2^128=(B8QH X W (i*inW) (j*inW) (Yk (Yc X inW i>>>16)) (Yk (Yc W inW j>>>16)) 0 inW:ٴ)%2^128) (h1:sl˧=B8SL X (i*inW) (Yk (Yc X inW i>>>16)) 0 inW) (h2:sh˧=B8SH X (i*inW) (Yk (Yc X inW i>>>16)) 0 inW) (hw:sw˧=B8Y W (j*inW) (Yk (Yc W inW j>>>16)) 0 inW) : B8F2 X W b inW i j relu b[j]! (Yk (Yc X inW i>>>16)) (Yk (Yc W inW j>>>16)) ll lh hl hh sl sh sw=act relu (Γ (inW+1) (λt=>if t < inW then X[i*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!)):=by have cx:=C7 X inW i 39 C y rx1 rx2 rx3;have cw:=C7 W inW j 7 D z rw1 rw2 rw3;have lo:=E6 (Yc X inW i>>>16) (Yc W inW j>>>16);rw[<-Zq,<-Zq]at lo;generalize Yk (Yc X inW i>>>16)=e at cx hAL hAH h1 h2 lo⊢;generalize Yk (Yc W inW j>>>16)=ew at cw hAL hAH hw lo⊢;have H:=B8H2 X W (i*inW) (j*inW) e ew inW 0 (λt _ h=>⟨(cx t א).1,(cw t א).1⟩);generalize hT:YB X W (i*inW) (j*inW) (e˧+ew˧) 0 inW=T at H;obtain⟨bH,-,bQ,bX⟩:=B8Bd X W (i*inW) (j*inW) inW e ew (λt h=>(cw t א).1);have bY:=B8Yb W (j*inW) ew inW 0 (λt _ h=>(cw t א).1);have ex:hh˧*2^96+hl˧*2^32=2^32*B8QH X W (i*inW) (j*inW) e ew 0 inW:=by have q1:=hh܉;have q2:=hl܉;clear* -hAH bH g q1 q2;push_cast at hAH;omega have h32:hh˧<2^32:=א;have gg:(sh+sw)˧=sh˧+sw˧:=by have:=(B8SHb X (i*inW) e inW 0).1;rw[ξ];omega have n:inW߸˧=inW:=CG (Ag g ד);unfold B8F2;dsimp only;have F1:=B8F2a ll lh hl hh sl (sh+sw) inW߸ _ _ _ _ _ _ _ _ _ rfl rfl rfl rfl rfl rfl rfl rfl rfl h32 (by rw[n];omega);rw[gg,n,h1,h2,hw,ex]at F1;have hb:-2^127<=T/\T<2^127:=by rw[<-H];clear* -bQ bX bY g;push_cast;omega have E:=E9 _ _ 0 _ rfl ((F1.trans (((((Int.ModEq.refl _).add hAL).sub_right _).sub_right _).add_right _)).trans (by rw[<-H,<-B8QLH,<-B8SLH];push_cast;congr 1;ring)) hb.1 hb.2;simp only[Ϝ,ϑ]at E;refine B8Gv X W b inW i j relu (e+ew) _ _ _ _ C D y z g (λt h=>(cx t h).2) (λt h=>(cw t h).2) u (λt h p=>?_) (by rw[lo,hT]) E hb;obtain⟨a,c⟩:=mul_ne_zero_iff.1 p;have:=(cx t h).1.resolve_left a;have:=(cw t h).1.resolve_left c;rw[lo];omega lemma B8core2 (X W b XA XB:ؽ δ) (inW i j r s:ٳ) (relu:ف) (bx bv:ؼ) (ru S:ؾ) (hrr:ru؛=r) (hS:S؛=s) (hX:(0:ؾ)؛+S؛*inW.toUSize؛<=XAٽ) (gX:(0:ؾ)؛+S؛*inW.toUSize؛<Λ) (hX':(0:ؾ)؛+S؛*inW.toUSize؛<=XBٽ) (gX':(0:ؾ)؛+S؛*inW.toUSize؛<Λ) (hW:(j*inW).toUSize؛+inW.toUSize؛<=Wٽ) (gW:(j*inW).toUSize؛+inW.toUSize؛<Λ) (hr:ru؛>>16)<=Yk (bx&&&ޅ)) (rx3:(QYF bx)˧<=39) (C:i*inW+inW<=Xٽ) (y:i*inW+inW<=ހ) (hXL:∀t,t < inW->XA[0+s*t+r]! =(B8x2 (Yk (bx>>>16)) X[i*inW+t]!)՜ /\ XB[0+s*t+r]! =((B8x2 (Yk (bx>>>16)) X[i*inW+t]!)>>>32)՜) (sl sh:ػ) (hS1:sl=(0:ػ)+B8UL X (i*inW) (Yk (bx>>>16)) 0 inW) (hS2:sh=(0:ػ)+B8UH X (i*inW) (Yk (bx>>>16)) 0 inW) : B8F2 X W b inW i j relu b[j]! (Yk (bx>>>16)) (Yk (bv>>>16)) (B1J XA W 0 (j*inW).toUSize inW.toUSize S ru hX gX hW gW hr (Yk (bv>>>16)) 0 0 0).1 (B1J XA W 0 (j*inW).toUSize inW.toUSize S ru hX gX hW gW hr (Yk (bv>>>16)) 0 0 0).2 (B1J XB W 0 (j*inW).toUSize inW.toUSize S ru hX' gX' hW gW hr' (Yk (bv>>>16)) 0 0 0).1 (B1J XB W 0 (j*inW).toUSize inW.toUSize S ru hX' gX' hW gW hr' (Yk (bv>>>16)) 0 0 0).2 sl sh (B1S W (j*inW).toUSize inW.toUSize hW gW (Yk (bv>>>16)) 0 0)=act relu (Γ (inW+1) (λt=>if t < inW then X[i*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!)):=by obtain⟨w1,w2,w3,u,D,z,g⟩:=B8Wv W b inW j bv hc;subst hbx hbv;have cw:=C7 W inW j 7 D z w1 w2 w3;have A:=B1Jv XA W 0 (j*inW)۞ inW۞ S ru hX gX hW gW hr (Yk (Yc W inW j>>>16)) _ 0 0 0 rfl;have A':=B1Jv XB W 0 (j*inW)۞ inW۞ S ru hX' gX' hW gW hr' (Yk (Yc W inW j>>>16)) _ 0 0 0 rfl;have B:=B1Sv W (j*inW)۞ inW۞ hW gW (Yk (Yc W inW j>>>16)) _ 0 0 rfl;simp only[Za inW א,Za (j*inW) א,hrr,Ϝ,show (0:ؾ)؛=0 by simp,hS,Ai,ϸ,Β]at A A' B;rw[B8ZL XA X W (i*inW) (j*inW) s r _ _ inW 0 (λt _ h=>⟨by simpa using(hXL t א).1,(cw t א).1⟩)]at A;rw[B8ZH XB X W (i*inW) (j*inW) s r _ _ inW 0 (λt _ h=>⟨by simpa using(hXL t א).2,(cw t א).1⟩)]at A';have bY:=B8Yb W (j*inW) (Yk (Yc W inW j>>>16)) inW 0 (λt _ h=>(cw t א).1);exact B8E2 X W b inW i j relu _ _ _ _ sl sh _ C D y z g rx1 rx2 rx3 w1 w2 w3 u (by simpa using A) (by simpa using A') (by rw[hS1,UInt64.zero_add];exact B8ULv _ _ _ _ _ א) (by rw[hS2,UInt64.zero_add];exact B8UHv _ _ _ _ _ א) (by rw[B];exact ν א) noncomputable def B8g2 (X W b XA XB:ؽ δ) (inW i0:ٳ) (relu:ف) (BX BV:ؽ ؼ) (F:ٳ -> ٳ -> δ) (S:ؽ ػ) (r j:ٳ):δ:=if h:B8W W b inW j BV[j]! = true/\XAٽ=8*inW/\XBٽ=8*inW then B8s r (B8K2 X W b XA XB inW i0 j relu BX BV S h) else F (i0+r) j lemma B8K2g (X W b XA XB:ؽ δ) (inW i0 j:ٳ) (relu:ف) (BX BV:ؽ ؼ) (S:ؽ ػ) (h:B8W W b inW j BV[j]! = true/\XAٽ=8*inW/\XBٽ=8*inW) (r:ٳ) (hr:r<8):∃ hX gX hW gW hr hX' gX' hr',B8s r (B8K2 X W b XA XB inW i0 j relu BX BV S h)=B8F2 X W b inW (i0+r) j relu b[j]! (Yk (BX[i0+r]!>>>16)) (Yk (BV[j]!>>>16)) (B1J XA W 0 (j*inW).toUSize inW.toUSize 8 r.toUSize hX gX hW gW hr (Yk (BV[j]!>>>16)) 0 0 0).1 (B1J XA W 0 (j*inW).toUSize inW.toUSize 8 r.toUSize hX gX hW gW hr (Yk (BV[j]!>>>16)) 0 0 0).2 (B1J XB W 0 (j*inW).toUSize inW.toUSize 8 r.toUSize hX' gX' hW gW hr' (Yk (BV[j]!>>>16)) 0 0 0).1 (B1J XB W 0 (j*inW).toUSize inW.toUSize 8 r.toUSize hX' gX' hW gW hr' (Yk (BV[j]!>>>16)) 0 0 0).2 S[r]! S[8+r]! (B1S W (j*inW).toUSize inW.toUSize hW gW (Yk (BV[j]!>>>16)) 0 0):=by unfold B8K2;rw[B8J1,B8J1];interval_cases r<;>exact⟨_,_,_,_,_,_,_,_,rfl⟩ lemma B8C2v (X W b XA XB:ؽ δ) (inW outW i0:ٳ) (relu:ف) (BX BV:ؽ ؼ) (F:ٳ->ٳ->δ) (S:ؽ ػ):∀d j (O0 O1 O2 O3 O4 O5 O6 O7:ؽ δ),outW-j=d -> (B8C2 X W b XA XB inW outW i0 relu BX BV F S j O0 O1 O2 O3 O4 O5 O6 O7).toList=(O0.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 0))++(O1.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 1))++(O2.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 2))++(O3.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 3))++(O4.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 4))++(O5.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 5))++(O6.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 6))++(O7.toList++(Bd j d).map (B8g2 X W b XA XB inW i0 relu BX BV F S 7)):=by intro d;induction d with |zero=>intro j O0 O1 O2 O3 O4 O5 O6 O7 e;rw[B8C2,if_neg א];simp |succ d N=> intro j O0 O1 O2 O3 O4 O5 O6 O7 e;rw[B8C2,if_pos א];split . rename_i h;dsimp only;rw[N (j+1) _ _ _ _ _ _ _ _ א];simp only[Array.toList_push,Ϩ,CR,CL,List.cons_append,EB,List.singleton_append,B8g2,dif_pos h];rfl . rename_i h;rw[N (j+1) _ _ _ _ _ _ _ _ א];simp only[Array.toList_push,Ϩ,CR,CL,List.cons_append,EB,List.singleton_append,B8g2,dif_neg h] lemma B8pt2 (X W b XA XB:ؽ δ) (inW outW rows ch j r:ٳ) (relu:ف) (BX BV:ؽ ؼ) (S:ؽ ػ) (F:ٳ->ٳ->δ) (ru:ؾ) (hrr:ru؛=r) (hr8:r<8) (hj:j < outW) (hrows:ch+7 < rows) (hBX:∀i,i < rows->BX[i]! =Yc X inW i) (hBV:∀j,j < outW->BV[j]! =Yc W inW j) (h2:B8R8 X inW ch BX 39=true) (hc:B8W W b inW j BV[j]! = true) (hXL:∀t,t < inW->XA[0+8*t+r]! =(B8x2 (Yk (BX[ch+r]!>>>16)) X[(ch+r)*inW+t]!)՜ /\ XB[0+8*t+r]! =((B8x2 (Yk (BX[ch+r]!>>>16)) X[(ch+r)*inW+t]!)>>>32)՜) (hS1:S[r]! =(0:ػ)+B8UL X ((ch+r)*inW) (Yk (BX[ch+r]!>>>16)) 0 inW) (hS2:S[8+r]! =(0:ػ)+B8UH X ((ch+r)*inW) (Yk (BX[ch+r]!>>>16)) 0 inW) (hF:F (ch+r) j=act relu (Γ (inW+1) (λt=>if t < inW then X[(ch+r)*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!))) (v:δ) (hv:∃ hX gX hW gW hr hX' gX' hr',v=B8F2 X W b inW (ch+r) j relu b[j]! (Yk (BX[ch+r]!>>>16)) (Yk (BV[j]!>>>16)) (B1J XA W 0 (j*inW).toUSize inW.toUSize 8 ru hX gX hW gW hr (Yk (BV[j]!>>>16)) 0 0 0).1 (B1J XA W 0 (j*inW).toUSize inW.toUSize 8 ru hX gX hW gW hr (Yk (BV[j]!>>>16)) 0 0 0).2 (B1J XB W 0 (j*inW).toUSize inW.toUSize 8 ru hX' gX' hW gW hr' (Yk (BV[j]!>>>16)) 0 0 0).1 (B1J XB W 0 (j*inW).toUSize inW.toUSize 8 ru hX' gX' hW gW hr' (Yk (BV[j]!>>>16)) 0 0 0).2 S[r]! S[8+r]! (B1S W (j*inW).toUSize inW.toUSize hW gW (Yk (BV[j]!>>>16)) 0 0)):v=F (ch+r) j:=by obtain⟨hX,gX,hW,gW,hr,hX',gX',hr',e⟩:=hv;rw[e,hF];obtain⟨a1,a2,a3,a4,a5⟩:=B8Rv _ _ _ _ _ (B8R8v _ _ _ _ _ h2 r hr8);exact B8core2 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ hrr (by simp) hX gX hX' gX' hW gW hr hr' (hBX _ א) (hBV j hj) hc a1 a2 a3 a4 a5 hXL _ _ hS1 hS2 lemma B8pt (X W b XL:ؽ δ) (inW outW rows ch j r:ٳ) (relu:ف) (BX BV:ؽ ؼ) (S:ؽ ػ) (F:ٳ->ٳ->δ) (ru:ؾ) (hrr:ru؛=r) (hr8:r<8) (hj:j < outW) (hrows:ch+7 < rows) (hBX:∀i,i < rows->BX[i]! =Yc X inW i) (hBV:∀j,j < outW->BV[j]! =Yc W inW j) (h2:B8R8 X inW ch BX 7=true) (hc:B8W W b inW j BV[j]! = true) (hXL:∀t,t < inW->XL[0+8*t+r]! =(B8x1 (Yk (BX[ch+r]!>>>16)) X[(ch+r)*inW+t]!)՜) (hS:S[r]! =(0:ػ)+B8U X ((ch+r)*inW) (Yk (BX[ch+r]!>>>16)) 0 inW) (hF:F (ch+r) j=act relu (Γ (inW+1) (λt=>if t < inW then X[(ch+r)*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!))) (v:δ) (hv:∃ hX gX hW gW hr,v=B8F1 X W b inW (ch+r) j relu b[j]! (Yk (BX[ch+r]!>>>16)) (Yk (BV[j]!>>>16)) (B1J XL W 0 (j*inW).toUSize inW.toUSize 8 ru hX gX hW gW hr (Yk (BV[j]!>>>16)) 0 0 0).1 (B1J XL W 0 (j*inW).toUSize inW.toUSize 8 ru hX gX hW gW hr (Yk (BV[j]!>>>16)) 0 0 0).2 S[r]! (B1S W (j*inW).toUSize inW.toUSize hW gW (Yk (BV[j]!>>>16)) 0 0)):v=F (ch+r) j:=by obtain⟨hX,gX,hW,gW,hr,rfl⟩:=hv;rw[hF];obtain⟨a1,a2,a3,a4,a5⟩:=B8Rv X inW (ch+r) BX[ch+r]! 7 (B8R8v X inW ch BX 7 h2 r hr8);exact B8core X W b XL inW (ch+r) j r relu BX[ch+r]! BV[j]! S ru hrr hX gX hW gW hr (hBX _ א) (hBV j hj) hc a1 a2 (by simpa using a3) a4 a5 hXL S[r]! hS lemma B8Tv (rows inW outW:ٳ) (relu:ف) (X W b:ؽ δ) (BX BV:ؽ ؼ) (F:ٳ->ٳ->δ) (hBX:∀i,i < rows->BX[i]! =Yc X inW i) (hBV:∀j,j < outW->BV[j]! =Yc W inW j) (hF:∀i j,i < rows->j < outW->F i j=act relu (Γ (inW+1) (λt=>if t < inW then X[i*inW+t]! else ζ) (λt=>if t < inW then W[j*inW+t]! else b[j]!))):∀d ch (acc:ؽ δ),rows-ch=d->B8T rows inW outW relu X W b BX BV F ch acc=Yak rows outW F ch acc:=by intro d;refine Nat.strong_induction_on d λd N ch acc e=>?_;rw[B8T];split . rename_i h;dsimp only;repeat rw[B8Yak _ _ _ _ _ א] rw[N (rows-(ch+8)) א (ch+8) _ rfl];congr 1;apply ϻ;generalize hq:B8P1 X inW _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _=q;obtain⟨Q1,Q2⟩:q.1.toList=_/\q.2=_:=by rw[<-hq];exact B8P1v _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl have m:∀r<8,(Bd 0 outW).map (B8g1 X W b q.1 inW ch relu BX BV F q.2 r)=(Bd 0 outW).map (F (ch+r)):=by intro r hr;apply Ck;intro j hj;simp only[List.mem_range'_1]at hj;unfold B8g1;split;rename_i hc;exact B8pt _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (Za r א) hr א א hBX hBV h.2 hc.1 (λt ht=>by rw[Β,B8XLK 8 q.1 (λu=>(ϒ 8).map λk=>(B8x1 (Yk (BX[ch+k]!>>>16)) X[(ch+k)*inW+u]!)՜) (λu=>rfl) inW t r ht hr (by rw[Q1];rfl)];interval_cases r<;>rfl) (by rw[Q2];interval_cases r<;>rfl) (hF _ _ א א) _ (B8K1g _ _ _ _ _ _ _ _ _ _ _ hc r hr);rfl simp(disch:=decide)only[Array.toList_append,B8C1v _ _ _ _ _ _ _ _ _ _ _ _ _ 0 _ _ _ _ _ _ _ _ rfl,EB,m,D3 _ _ _ _ 0 _ rfl,Ai,ϑ,CL,BU,Nat.reduceAdd] split . rename_i h0 h;dsimp only;repeat rw[B8Yak _ _ _ _ _ א] rw[N (rows-(ch+8)) א (ch+8) _ rfl];congr 1;apply ϻ;generalize hq:B8P2 X inW _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _=q;obtain⟨Q1,Q3,Q2⟩:q.1.toList=_/\q.2.1.toList=_/\q.2.2=_:=by rw[<-hq];exact B8P2v _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl have m:∀r<8,(Bd 0 outW).map (B8g2 X W b q.1 q.2.1 inW ch relu BX BV F q.2.2 r)=(Bd 0 outW).map (F (ch+r)):=by intro r hr;apply Ck;intro j hj;simp only[List.mem_range'_1]at hj;unfold B8g2;split;rename_i hc;exact B8pt2 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (Za r א) hr א א hBX hBV h.2 hc.1 (λt ht=>by rw[Β,B8XLK 8 q.1 (λu=>(ϒ 8).map λk=>(B8x2 (Yk (BX[ch+k]!>>>16)) X[(ch+k)*inW+u]!)՜) (λu=>rfl) inW t r ht hr (by rw[Q1];rfl),B8XLK 8 q.2.1 (λu=>(ϒ 8).map λk=>((B8x2 (Yk (BX[ch+k]!>>>16)) X[(ch+k)*inW+u]!)>>>32)՜) (λu=>rfl) inW t r ht hr (by rw[Q3];rfl)];interval_cases r<;>exact⟨rfl,rfl⟩) (by rw[Q2];interval_cases r<;>rfl) (by rw[Q2];interval_cases r<;>rfl) (hF _ _ א א) _ (B8K2g _ _ _ _ _ _ _ _ _ _ _ _ hc r hr);rfl simp(disch:=decide)only[Array.toList_append,B8C2v _ _ _ _ _ _ _ _ _ _ _ _ _ _ 0 _ _ _ _ _ _ _ _ rfl,EB,m,D3 _ _ _ _ 0 _ rfl,Ai,ϑ,CL,BU,Nat.reduceAdd] rfl lemma ZcC:YaV=linearSpec:=by funext m a o p X W b;unfold YaV linearSpec linearWith;dsimp only;have Q:∀f,Yak m o f 0 (AY (m*o))=YT m o f:=λf=>rfl;split;swap;rw[B8Tv m a o p X W b _ _ _ (Ze m (Yc X a)) (Ze o (Yc W a)) (λi j hi hj=>by rw[O2]) m 0 _ א,Q,ZB _ _ _ rfl];congr 1;funext q;rw[O2] rw[Zk4 _ _ _ _ _ (λi j=>by simp only[QWc4]) m 0 _ א,Q,ZB _ _ _ rfl];congr 1;funext q;have f:=q.isLt;have h:=CU (Ek f);have e:=ϕ (f.trans_eq (Θ m o));rw[Ze m (Yc X a) _ e,Ze o (Yc W a) _ (Ε q܂ h)];have k:q܂/o=0:=Υ (by have:m*o<=1*o:=ω o א;omega);rw[I9];split . rw[ح _ (q܂/o) (by simp only[Bw,Ω,ת,AE,Fin.is_lt,ح,AD];omega)];simp only[AD];split;. exact⟨λ_ t g d=>by simp only[CK,Dr]at d;omega,(absurd rfl ·)⟩ split . rename_i l;simp only[Ω,ת]at l;refine⟨λc=>absurd c (by dsimp only;omega),λ_=>⟨?_,λu n d=>?_⟩⟩;. rw[J0 _ _ _ 0 _ rfl];simp only[Bw,Array.toList_empty,Cd,ne_eq,decide_not,tsub_zero,<-Ca,EB] rw[D2,ح _ u (by rw[AE];omega)];simp only[Bw,AD];rw[Ze m _ _ e] exact⟨λ_ t g d=>by rw[D2,ح _ t (by simp only[AE];omega)];simp only[AD];rw[Ze m _ _ e],(absurd rfl ·)⟩ rw[ح _ _ (by simp only[DN];omega),CW];exact⟨λ_ t g d=>by simp only[CK,Dr]at d;omega,(absurd rfl ·)⟩ noncomputable def MYba (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit -> ℚ):δ := if sv dw <= 0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let c:=Yap (η w) (n*(ε w*p2 (γ w-b0))) (!(S1 < 0)) S1.natAbs let D:=n*ε dw let t1:=c.2*ε gw let k1:=p2 (b0+γ gw-c2) let ra:=t1%D*k1 let Q:=Y3 (c.1 != η gw) (t1/D*k1+ra/D) (ra%D) (η bw) (ε bw*p2 (γ bw+γ dw-c2)) D if 16777216 <= Q.2.1 then Ya9 Q.1 (2*Q.2.1+(if Q.2.2=0 then 0 else 1)) ((c2:ٴ)-150-γ dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:ٴ)-149-γ dw) lemma Zdf (n:ٳ):lg n=n܀:=by unfold lg;dsimp only;split;rename_i h;by_cases h0:n߸=0;have:n=0:=by rw[<-h,h0];rfl subst this;decide;rw[Zj _ h0,h];rfl lemma Zbo:fl2=Br:=by funext a b;simp only[fl2,Br,Zdf,U6,U5] lemma Zdr (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit->ℚ) (hn:0 < n) : MYba n w gw bw b0 S1 dw mean=elL n w gw bw b0 S1 dw mean:=by unfold MYba elL;split;rfl;rename_i d;have a:η dw=false:=by by_contra c;simp at c;exact d (by simp[sv,c]) have b:0<ε dw:=by by_contra c;exact d (by simp[sv,a];omega) simp only[U2];generalize min (b0+γ gw) (γ bw+γ dw)=z;generalize f:Yap (η w) (n*(ε w*p2 (γ w-b0))) (!decide (S1<0)) S1.natAbs=c;have p:∀e,(2:ٴ)^e=((p2 e:ٳ):ٴ):=λe=>by rw[ZE];push_cast;rfl rw[(by rw[<-f,U1,U0,Z3,T9,YaF,CV,ZF,ZE];push_cast;ring:(n:ٴ)*YaF w b0-S1=Yh c.1 c.2),(by simp[sv,a]:sv dw=ε dw),ZF gw,ZF bw,CV,CV,p,p];generalize p2 (b0+γ gw-z)=k;generalize p2 (γ bw+γ dw-z)=l;have g:=ϊ hn b;rw[show Yh c.1 c.2*(Yh (η gw) (ε gw)*(k:ٴ))+n*Yh (η bw) (ε bw)*(ε dw*(l:ٴ))=Yh (c.1 !=η gw) (c.2*ε gw*k)+Yh (η bw) (ε bw*l*(n*ε dw)) by rw[Z3,M2,Z3,Z3];push_cast;ring];generalize c.2*ε gw=t;generalize ε bw*l=B;generalize n*ε dw=D at g⊢;obtain⟨v,r⟩:=T7 (c.1 !=η gw) (t/D*k+t%D*k/D) (t%D*k%D) (η bw) B D (Ε _ g);rw[T6]at v;rw[<-v,M4,M3];generalize Y3 (c.1 !=η gw) (t/D*k+t%D*k/D) (t%D*k%D) (η bw) B D=Q at r⊢;split;next q=>have h:(Q.2.1*D+Q.2.2)/D=Q.2.1:=(by rw[Ϟ,ϔ _ _ g,Υ r,Β]);have i:=Zc3 Q.1 (Q.2.1*D+Q.2.2) D ((z:ٴ)-149-γ dw) g (by rw[h];exact q);rw[h,(by rw[Ϟ,ϲ,ν r]:(Q.2.1*D+Q.2.2)%D=Q.2.2),(א:(z:ٴ)-149-γ dw-1=(z:ٴ)-150-γ dw)]at i;rw[G2,i,(ו:(Q.2.1*D+Q.2.2 !=0)=true),Bool.and_true] rw[G2] noncomputable def elS (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit -> ℚ):δ := if sv dw <= 0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else let c2:=min (b0+γ gw) (γ bw+γ dw) let c:=Yap (η w) (n*(ε w*p2 (γ w-b0))) (!(S1 < 0)) S1.natAbs let D:=n*ε dw let r0:=c.2%D*ε gw let k1:=p2 (b0+γ gw-c2) let ra:=r0%D*k1 let Q:=Y3 (c.1 != η gw) ((c.2/D*ε gw+r0/D)*k1+ra/D) (ra%D) (η bw) (ε bw*p2 (γ bw+γ dw-c2)) D if 16777216 <= Q.2.1 then Ya9 Q.1 (2*Q.2.1+(if Q.2.2=0 then 0 else 1)) ((c2:ٴ)-150-γ dw) else let N:=Q.2.1*D+Q.2.2 YN (Q.1&&N != 0) N D ((c2:ٴ)-149-γ dw) lemma elS_eq (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit->ℚ): elS n w gw bw b0 S1 dw mean=MYba n w gw bw b0 S1 dw mean:=by unfold elS MYba;dsimp only;generalize Yap (η w) (n*(ε w*p2 (γ w-b0))) (!decide (S1<0)) S1.natAbs=c;generalize n*ε dw=D;rw[(J8 c.2 (ε gw) D).1,(J8 c.2 (ε gw) D).2] @[inline] def u2a (h l t:ػ):ػ×ػ:=let l':=l+t;(h+(if l' < l then 1 else 0),l') lemma u2a_v (h l t:ػ) (hb:h˧*18446744073709551616+l˧+t˧ < 340282366920938463463374607431768211456) : (u2a h l t).1˧*18446744073709551616+(u2a h l t).2˧=h˧*18446744073709551616+l˧+t˧:=by unfold u2a;dsimp only;have hl:=l܉;have ht:=t܉;have hh:=h܉;by_cases c:l˧+t˧< 18446744073709551616 . have e:(l+t)˧=l˧+t˧:=by rw[ξ];exact ν c have nc:¬(l+t< l):=by rw[Ψ,e];omega simp only[nc,if_false,e];rw[ξ];simp;omega . have e:(l+t)˧=l˧+t˧-18446744073709551616:=by rw[ξ];omega have cc:l+t< l:=by rw[Ψ,e];omega simp only[cc,if_true,e];rw[ξ];simp;omega lemma qsplit (m s:ٳ) (hm:m < 2^24) (hs:s <= 36) : (if 2*s߸ < 64 then ((m߸*m߸)>>>1)>>>(63-2*s߸) else (m߸*m߸)<<<(2*s߸-64))˧*18446744073709551616+(if 2*s߸ < 64 then (m߸*m߸)<<<(2*s߸) else 0)˧=m*m*2^(2*s):=by have hq:m*m<2^48:=by nlinarith have eq:(m߸*m߸)˧=m*m:=by rw[ϯ,CG (by unfold Fd;omega)];exact ν א have es:(2*s߸)˧=2*s:=by rw[ϯ,CG (by unfold Fd;omega)];simp;omega have h64:(64:ػ)˧=64:=rfl;split_ifs with c<;>rw[Ψ,es,h64]at c . have e63:(63-2*s߸)˧=63-2*s:=by rw[Η _ _ (by rw[ϐ,es];show 2*s<=63;omega),es];rfl rw[Ξ,Ξ,ό,eq,es,e63];simp only[ψ,Α,show (1:ػ)˧=1 from rfl];rw[ν (א:63-2*s<64),ν c,ϧ,show m*m/(2^(1%64)*2^(63-2*s))=m*m*2^(2*s)/2^64 by rw[show (2:ٳ)^64=(2^(1%64)*2^(63-2*s))*2^(2*s) by rw[<-Κ,<-Κ];congr 1;omega,Nat.mul_div_mul_right _ _ ה]];omega . rw[ό,eq,show(2*s߸-64)˧=2*s-64 by rw[Η _ _ (by rw[ϐ,es,h64];omega),es,h64],Α,ν (א:2*s-64<64),ν (show m*m*2^(2*s-64)<2^64 by have:=Ι (ב:0<2) (א:2*s-64<=8);have:=Aj hq (Δ (2*s-64));omega),show (2:ٳ)^(2*s)=2^(2*s-64)*2^64 by rw[<-Κ];congr 1;omega];norm_num;ring noncomputable def rsU (x:ؽ δ) (base n b0 j:ٳ) (ph pl nh nl qh ql:ػ) (ok:ف):ف×ٳ×ٳ×ٳ:= if j < n then let w:=x[base+j]! let m:=(ε w)߸ let s:=(γ w-b0)߸ let t:=m<<>>1)>>>(63-2*s) else q<<<(2*s-64)) let ok':=ok&&(ε w=0||γ w-b0 <= 36) if η w then let p:=u2a nh nl t; rsU x base n b0 (j+1) ph pl p.1 p.2 qh' a.2 ok' else let p:=u2a ph pl t; rsU x base n b0 (j+1) p.1 p.2 nh nl qh' a.2 ok' else (ok&&n<256,ph˧<<<64+pl˧,nh˧<<<64+nl˧,qh˧<<<64+ql˧) termination_by n-j lemma rsU_ok (x:ؽ δ) (base n b0:ٳ):∀k j ph pl nh nl qh ql ok, n-j=k -> (rsU x base n b0 j ph pl nh nl qh ql ok).1=true->ok=true /\ n < 256 /\ ∀t,j <= t->t < n->(ε x[base+t]! = 0 \/ γ x[base+t]!-b0 <= 36):=by intro k;induction k with |zero=>intro j _ _ _ _ _ _ _ _ h;unfold rsU at h;rw[if_neg א]at h;simp at h;exact⟨h.1,h.2,λt h1 h2=>א⟩ |succ k ih=> intro j _ _ _ _ _ _ _ _ h;unfold rsU at h;rw[if_pos א]at h;dsimp only at h split at h all_goals obtain⟨o1,o2,o3⟩:=ih _ _ _ _ _ _ _ _ א h;simp only[Ω,Ϸ,ת]at o1;refine⟨o1.1,o2,λt h1 h2=>?_⟩;rcases Ap h1 with h1|rfl;exact o3 t א h2;exact o1.2 lemma rsU_val (x:ؽ δ) (base n b0:ٳ):∀k j ph pl nh nl qh ql ok, n-j=k -> (∀t,j <= t->t < n->(ε x[base+t]! = 0 \/ γ x[base+t]!-b0 <= 36)) -> ph˧*18446744073709551616+pl˧+((Bd j (n-j)).map λt=>if η x[base+t]! then 0 else ε x[base+t]!*2^(γ x[base+t]!-b0)).sum < 340282366920938463463374607431768211456 -> nh˧*18446744073709551616+nl˧+((Bd j (n-j)).map λt=>if η x[base+t]! then ε x[base+t]!*2^(γ x[base+t]!-b0) else 0).sum < 340282366920938463463374607431768211456 -> qh˧*18446744073709551616+ql˧+((Bd j (n-j)).map λt=>ε x[base+t]!*ε x[base+t]!*2^(2*(γ x[base+t]!-b0))).sum < 340282366920938463463374607431768211456 -> (rsU x base n b0 j ph pl nh nl qh ql ok).2.1=ph˧*18446744073709551616+pl˧+((Bd j (n-j)).map λt=>if η x[base+t]! then 0 else ε x[base+t]!*2^(γ x[base+t]!-b0)).sum /\ (rsU x base n b0 j ph pl nh nl qh ql ok).2.2.1=nh˧*18446744073709551616+nl˧+((Bd j (n-j)).map λt=>if η x[base+t]! then ε x[base+t]!*2^(γ x[base+t]!-b0) else 0).sum /\ (rsU x base n b0 j ph pl nh nl qh ql ok).2.2.2=qh˧*18446744073709551616+ql˧+((Bd j (n-j)).map λt=>ε x[base+t]!*ε x[base+t]!*2^(2*(γ x[base+t]!-b0))).sum:=by intro k;induction k<;>intro j ph pl nh nl qh ql ok hk hg bP bN bQ ·unfold rsU;rw[if_neg א];simp[hk,Α] rename_i k ih;simp only[hk,Ϩ,CR,DV]at bP bN bQ⊢;obtain rfl:n-(j+1)=k:=א;unfold rsU;rw[if_pos א];dsimp only;have hgj:=hg j le_rfl א;generalize x[base+j]! =w at hgj bP bN bQ⊢;have hm:=Ϛ w;have:=iB w;have em:(ε w)߸˧=ε w:=CG (by unfold Fd;omega);have es:(γ w-b0)߸˧=γ w-b0:=CG (by unfold Fd;omega);have et:((ε w)߸<<<(γ w-b0)߸)˧=ε w*2^(γ w-b0):=hgj.elim (λh0=>by rw[h0];simp) λh=>by rw[ό,em,es,Α,ν (א:γ w-b0<64)];exact ν (Ag (Nat.mul_lt_mul_of_lt_of_le hm (Ι ב h) ה) ב) have eq2:=hgj.elim (λh0=>by rw[h0];simp) (qsplit _ _ hm);generalize (ε w)߸=E,(γ w-b0)߸=S at et eq2⊢;generalize (if 2*S<64 then (E*E)<<<(2*S)else 0)=LO,(if 2*S<64 then ((E*E)>>>1)>>>(63-2*S)else (E*E)<<<(2*S-64))=HI at eq2⊢;have ea:=u2a_v qh ql LO (by clear bP bN;omega);generalize u2a qh ql LO=A at ea⊢;have eqh:(A.1+HI)˧=A.1˧+HI˧:=by rw[ξ];apply ν;clear bP bN;omega by_cases hs:η w=true<;>simp only[hs,φ,ר,ש,Β]at bP bN⊢;. have ep:=u2a_v nh nl (E<<hg t א) bP (by rw[ep,et,BU];exact bN) (by rw[eqh];linarith);rw[r1,r2,r3];clear bP bN;omega . have ep:=u2a_v ph pl (E<<hg t א) (by rw[ep,et,BU];exact bP) bN (by rw[eqh];linarith);rw[r1,r2,r3];clear bP bN;omega lemma sumB (l:List ٳ) (f:ٳ->ٳ) (B:ٳ) (h:∀t ∈ l,f t <= B):(l.map f).sum <= l.length*B:=by have:=List.sum_le_card_nsmul (l.map f) B (λy hy=>by obtain⟨t,ht,rfl⟩:=EZ.1 hy;exact h t ht);simpa using this lemma sdif (l:List ٳ) (f g:ٳ->ٳ) (F:ٳ->ٴ) (h:∀t,(f t:ٴ)-g t=F t):((l.map f).sum:ٴ)-(l.map g).sum=(l.map F).sum:=by induction l with |nil=>simp |cons a l ih=>simp only[CR,DV];push_cast;have:=h a;push_cast at ih;linarith lemma rsU_lim (x:ؽ δ) (base n b0:ٳ) (h:(rsU x base n b0 0 0 0 0 0 0 0 true).1=true) : ((rsU x base n b0 0 0 0 0 0 0 0 true).2.1:ٴ)-(rsU x base n b0 0 0 0 0 0 0 0 true).2.2.1=(limbValA (Y7 x base n b0).1:ٴ)-limbValA (Y7 x base n b0).2 /\ (rsU x base n b0 0 0 0 0 0 0 0 true).2.2.2=limbValA (Y6 x base n b0):=by obtain⟨-,hn,g⟩:=rsU_ok x base n b0 _ 0 0 0 0 0 0 0 true rfl h;have P:∀t∈Bd 0 (n-0),ε x[base+t]!*2^(γ x[base+t]!-b0)<=2^60:=λt e=>by have:=List.mem_range'_1.1 e;rcases g t א א with e|e;simp[e];exact(Ar (Ϛ _).le (Ι ב e)).trans ב have A:=sumB _ (λt=>if η x[base+t]! then 0 else ε x[base+t]!*2^(γ x[base+t]!-b0)) (2^60) (λt e=>by split;exact Nat.zero_le _;exact P t e);have B:=sumB _ (λt=>if η x[base+t]! then ε x[base+t]!*2^(γ x[base+t]!-b0)else 0) (2^60) (λt e=>by split;exact P t e;exact Nat.zero_le _);have C:=sumB _ (λt=>ε x[base+t]!*ε x[base+t]!*2^(2*(γ x[base+t]!-b0))) (2^120) (λt e=>by have:=Ar (P t e) (P t e);rw[two_mul,pow_add];linarith);norm_num at A B C;obtain⟨a,b,c⟩:=rsU_val x base n b0 _ 0 0 0 0 0 0 0 true rfl (λt _ e=>g t א e) ו ו ו;have z:ϋ (Χ 18 0).toList=0:=ד;simp only[Ϝ,ϸ,Β,Ai,<-Ca]at a b c;constructor;rw[a,b];unfold Y7;rw[limbValA_eq,limbValA_eq,(lP x base b0 _ (λ_ _=>rfl) (ϒ n) _ _ ג ג).2.2,z];simp only[CP,sub_zero,zero_add];exact sdif _ _ _ _ (λt=>by simp only[sv];split_ifs<;>push_cast<;>ring);rw[c];unfold Y6;rw[limbValA_eq,(lS (λj=>ε x[base+j]! *ε x[base+j]!) (λj=>2*(γ x[base+j]! -b0)) (λj=>by have:=Ϛ x[base+j]!;nlinarith) (λj=>by have:=iB x[base+j]!;omega) _ _ ג).2,z,zero_add] def Y2L (x:ؽ δ) (base n j b:ٳ):ٳ:= if jY2L x base n j b=(Bd j d).foldl (λb j=>let w:=x[base+j]!;if ε w=0 then b else min b (γ w)) b by rw[H n 0 255 א,Ca] intro d;induction d<;>intro j b h;rw[Y2L,if_neg א];rfl;rename_i d i;rw[Y2L,if_pos א,i (j+1) _ א,Ϩ];rfl lemma Tn (n X:ٳ) (S:ٴ):((n:ٴ)*X-S*S)پ=n*X-S.natAbs*S.natAbs:=by rw[<-Int.natAbs_mul_self' S,<-Int.natCast_mul,<-Int.natCast_mul,Int.toNat_sub] @[inline] def m64 (a b:ػ):ػ×ػ:= let a0:=a&&&ހ;let a1:=a>>>32;let b0:=b&&&ހ;let b1:=b>>>32 let p00:=a0*b0;let p01:=a0*b1;let p10:=a1*b0;let p11:=a1*b1 let mid:=(p00>>>32)+(p01&&&ހ)+(p10&&&ހ) (p11+(p01>>>32)+(p10>>>32)+(mid>>>32),(mid<<<32)|||(p00&&&ހ)) @[inline] def lg128 (h l:ػ):ػ:=if h != 0 then 64+Yj h else Yj l @[inline] def shl128 (h l s:ػ):ػ×ػ:= (if s==0 then h else if s<64 then (h<<>>(64-s)) else l<<<(s-64),if s==0 then l else if s<64 then l<<>>s else 0,if s==0 then l else if s<64 then (l>>>s)|||(h<<<(64-s)) else h>>>(s-64)) @[inline] def lowz128 (h l s:ػ):ف:= if s==0 then true else if s<64 then l&&&((1<<>>32);let q1:=x1/m;let r:=x1%m let x0:=(r<<<32)|||(l&&&ހ);let q0:=x0/m;let r:=x0%m (qh,(q1<<<32)|||q0,r) noncomputable def absd (ph pl nh nl:ػ):ػ×ػ:= (if nh>>62 != 0 then ߿ else FY DQ.2.1˧ DQ.2.2˧ (((shr128 shh sl (2*k-2)߸).2&&&3)˧) (lowz128 shh sl (2*k-2)߸) m c t def FW (shh sl:ػ) (m c:ٳ):ػ:= let t:ٴ:=(47-((lg128 shh sl)˧:ٴ)+m܀+1)/2 if 0<=t||64<=(-t)׆ then ߿ else FX shh sl m c t (-t)׆ @[inline] def FTk {β:Type} (ph pl nh nl qh ql:ػ) (n:ٳ) (k:ػ -> ػ -> ف -> β):β:= let ge:=nh ػ -> ف -> β):β:= let bt:=if th==0&&tl==0 then 0 else lg128 th tl+1 let be:=if E==0 then 0 else Yj E+1 let T2:=shl128 th tl d1߸ let E2:=shl128 0 E d2߸ let sl:=T2.2+E2.2 let sh0:=T2.1+E2.1 k (sh0+(if sl if ok then let c:=YF b0 (γ eps) FNk th tl (2*b0-c) (γ eps+149-c) (n*n*ε eps)߸ λshh sl ok2=> if ok2 then FW shh sl (n*n) c else ߿ else ߿ def FFr (qh ql:ػ) (n b0:ٳ) (eps:δ):ػ:= if 0 if ok2 then FW shh sl n c else ߿ else ߿ @[specialize] def rsV {β:Type} (kont:ف -> ػ -> ػ -> ػ -> ػ -> ػ -> ػ -> β) (x:ؽ δ) (base n b0 j:ٳ) (ph pl nh nl qh ql:ػ) (ok:ف):β:= if j < n then let w:=x[base+j]! let m:=(ε w)߸ let s:=(γ w-b0)߸ let t:=m<<>>1)>>>(63-2*s) else q<<<(2*s-64)) let ok':=ok&&(ε w=0||γ w-b0 <= 36) if η w then let p:=u2a nh nl t; rsV kont x base n b0 (j+1) ph pl p.1 p.2 qh' a.2 ok' else let p:=u2a ph pl t; rsV kont x base n b0 (j+1) p.1 p.2 nh nl qh' a.2 ok' else kont (ok&&n<256) ph pl nh nl qh ql termination_by n-j theorem lo32 (x:ػ):(x&&&(ހ:ػ))˧=x˧%2^32:=by rw[BR];exact ϡ x˧ 32 theorem hi32 (x:ػ):(x>>>(32:ػ))˧=x˧/2^32:=by rw[Ξ];simp[ψ] theorem sh32 (x:ػ):(x<<<(32:ػ))˧=x˧%2^32*2^32:=by rw[ό,show(32:ػ)˧%64=32 from rfl,Α];have:=x܉;omega theorem or32 (x y:ػ) (h:y˧<2^32):((x<<<(32:ػ))|||y)˧=x˧%2^32*2^32+y˧:=by rw[Du,sh32,<-Α,Bq h] theorem mul32 (x y:ػ) (hx:x˧<2^32) (hy:y˧<2^32):(x*y)˧=x˧*y˧:=by rw[ϯ];exact ν (by have:=BP hx hy;omega) theorem mulsplit (a b:ٳ):a*b=a/2^32*(b/2^32)*2^64+(a%2^32*(b/2^32)+a/2^32*(b%2^32))*2^32+a%2^32*(b%2^32):=by nth_rw 1[<-Aq a (2^32),<-Aq b (2^32)];ring theorem m64N (p00 p01 p10 p11:ٳ):(p11+p01/2^32+p10/2^32+(p00/2^32+p01%2^32+p10%2^32)/2^32)*2^64+((p00/2^32+p01%2^32+p10%2^32)%2^32*2^32+p00%2^32)=p11*2^64+(p01+p10)*2^32+p00:=א theorem m64_v (a b:ػ):(m64 a b).1˧*2^64+(m64 a b).2˧=a˧*b˧:=by have ha:=a܉;have hb:=b܉;have hlt:=BP ha hb;have la0:=lo32 a;have la1:=hi32 a;have lb0:=lo32 b;have lb1:=hi32 b;unfold m64;dsimp only;generalize a&&&(ހ:ػ)=a0 at la0⊢;generalize a>>>32=a1 at la1⊢;generalize b&&&(ހ:ػ)=b0 at lb0⊢;generalize b>>>32=b1 at lb1⊢;have e00:=mul32 a0 b0 א א;have e01:=mul32 a0 b1 א א;have e10:=mul32 a1 b0 א א;have e11:=mul32 a1 b1 א א;have hAB:a˧*b˧=a1˧*b1˧*2^64+(a0˧*b1˧+a1˧*b0˧)*2^32+a0˧*b0˧:=by rw[la0,lb0,la1,lb1];exact mulsplit _ _ generalize a0*b0=P00 at e00⊢;generalize a0*b1=P01 at e01⊢;generalize a1*b0=P10 at e10⊢;generalize a1*b1=P11 at e11⊢;have b00:=P00܉;rw[<-e00,<-e01,<-e10,<-e11]at hAB;have mid:(P00>>>32+(P01&&&(ހ:ػ))+(P10&&&(ހ:ػ)))˧=P00˧/2^32+P01˧%2^32+P10˧%2^32:=by rw[ξ,ξ,hi32,lo32,lo32];clear* -b00;omega generalize P00>>>32+(P01&&&(ހ:ػ))+(P10&&&(ހ:ػ))=MD at mid⊢;rw[or32 _ _ (by rw[lo32];omega),lo32,mid];have K:=m64N P00˧ P01˧ P10˧ P11˧;have hh:(P11+P01>>>32+P10>>>32+MD>>>32)˧=P11˧+P01˧/2^32+P10˧/2^32+(P00˧/2^32+P01˧%2^32+P10˧%2^32)/2^32:=by rw[ξ,ξ,ξ,hi32,hi32,hi32,mid];clear* -K hAB hlt;omega rw[hh,K,hAB] theorem lg_step (n k:ٳ) (h:2^k<=n):n܀=k+(n/2^k)܀:=by have p:=Δ k;rw[Af (א:n≠0)];exact⟨by rw[Ϟ,Κ];exact (Am p).1 (ϰ (Nat.div_pos h p).ne'),by rw[Ϟ k,Cv,Κ];exact (An p).1 Ak⟩ theorem shl_v (x s:ػ) (h:s˧<64):(x<<>>s)˧=x˧/2^s˧:=by rw[Ξ,ν h,ψ] theorem orpw (a b k:ٳ) (hb:b<2^k):a*2^k|||b=a*2^k+b:=by rw[<-Α,Bq hb] theorem shl128_v (h l s:ػ) (hs:s˧<128) (hv:(h˧*2^64+l˧)*2^s˧<2^128): (shl128 h l s).1˧*2^64+(shl128 h l s).2˧=(h˧*2^64+l˧)*2^s˧:=by have hl:=l܉;unfold shl128;by_cases cA:s==0;. simp at cA;subst cA;simp by_cases cB:s<64 . simp only[cA,cB,φ,ש,ר];have s0:s˧≠0:=by intro e;apply cA;simp;exact σ.1 (by rw[e];rfl) have s64:s˧<64:=by simpa[Ψ]using cB have t64:(64-s)˧=64-s˧:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp rw[Du,shl_v _ _ s64,shr_v _ _ א,shl_v _ _ s64,t64];generalize s˧=k at s0 s64 hv⊢;have p64:2^64=2^(64-k)*2^k:=by rw[<-Κ];congr 1;omega have hhk:h˧*2^k<2^64:=by by_contra c;have:2^64*2^64<=(h˧*2^64+l˧)*2^k:=Cp (ω (2^64) (DZ.1 c)) (by rw[Nat.mul_right_comm];exact ω _ (ώ _ _));omega rw[ν hhk];have ldiv:l˧/2^(64-k)<2^k:=by rw[An (Δ _),Θ,<-p64];exact hl rw[orpw _ _ _ ldiv];have lsplit:l˧=l˧/2^(64-k)*2^(64-k)+l˧%2^(64-k):=(϶ _ _).symm;generalize l˧/2^(64-k)=a at lsplit ldiv⊢;generalize gb:l˧%2^(64-k)=b at lsplit;have bl:b<2^(64-k):=by rw[<-gb];exact Ε _ (Δ _) have lm:l˧*2^k%2^64=b*2^k:=by rw[lsplit,ϟ,ϣ,<-p64,Ϟ,ϲ];exact ν (by rw[p64];exact Aj bl (Δ _)) rw[lm,lsplit,p64];ring . simp only[cA,cB,φ,ש];have s64:64<=s˧:=by simpa[Ψ]using cB have t64:(s-64)˧=s˧-64:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp rw[shl_v _ _ א,t64];generalize s˧=k at s64 hs hv⊢;have pk:2^k=2^(k-64)*2^64:=by rw[<-Κ];congr 1;omega have h0:h˧=0:=by by_contra c;have:2^64*2^64<=(h˧*2^64+l˧)*2^k:=Ar (Cp (Nat.le_mul_of_pos_left _ א) (ώ _ _)) (Ι ב s64);omega simp only[h0,ϸ,Β]at hv⊢;have lt:l˧*2^(k-64)<2^64:=by by_contra c;rw[pk,<-ϣ]at hv;have:2^64*2^64<=l˧*2^(k-64)*2^64:=ω _ א;omega rw[ν lt,pk];simp;ring theorem shr128_v (h l s:ػ) (hs:s˧<128): (shr128 h l s).1˧*2^64+(shr128 h l s).2˧=(h˧*2^64+l˧)/2^s˧:=by have hl:=l܉;unfold shr128;by_cases cA:s==0;. simp at cA;subst cA;simp by_cases cB:s<64 . simp only[cA,cB,φ,ש,ר];have s0:s˧≠0:=by intro e;apply cA;simp;exact σ.1 (by rw[e];rfl) have s64:s˧<64:=by simpa[Ψ]using cB have t64:(64-s)˧=64-s˧:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp rw[Du,shr_v _ _ s64,shr_v _ _ s64,shl_v _ _ א,t64];generalize s˧=k at s0 s64⊢;have pk:0<2^k:=Δ k;have p64:2^64=2^(64-k)*2^k:=by rw[<-Κ];congr 1;omega have hsplit:h˧=h˧/2^k*2^k+h˧%2^k:=(϶ _ _).symm;generalize h˧/2^k=a at hsplit⊢;generalize gb:h˧%2^k=b at hsplit;have bl:b<2^k:=by rw[<-gb];exact Ε _ pk have hm:h˧*2^(64-k)%2^64=b*2^(64-k):=by rw[hsplit,ϟ,ϣ,Θ (2^k),<-p64,Ϟ,ϲ];exact ν (by rw[p64,Θ (2^(64-k))];exact Aj bl (Δ _)) have ld:l˧/2^k<2^(64-k):=by rw[An pk,<-p64];exact hl rw[hm,Nat.or_comm,orpw _ _ _ ld,show(h˧*2^64+l˧)/2^k=h˧*2^(64-k)+l˧/2^k by rw[p64,<-ϣ,Ϟ,ϔ _ _ pk,Ϟ],hsplit,p64];ring . simp only[cA,cB,φ,ש];have s64:64<=s˧:=by simpa[Ψ]using cB have t64:(s-64)˧=s˧-64:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp rw[shr_v _ _ א,t64];generalize s˧=k at s64 hs⊢;have pk:2^k=2^64*2^(k-64):=by rw[<-Κ];congr 1;omega rw[pk,<-ϧ,show(h˧*2^64+l˧)/2^64=h˧ by rw[Ϟ,ϔ _ _ (Δ 64),Υ hl];simp];simp theorem bzU (x:ػ):(x==0)=decide (x˧=0):=by rw[AB];simp only[beq_iff_eq,ת];exact⟨λe=>by rw[e];rfl,λe=>σ.1 (by rw[e];rfl)⟩ theorem msk_v (x s:ػ) (hs:s˧<64):(x&&&((1<<c3 (by simp;exact σ.1 (by rw[e];rfl));simp[Ψ]at c2;omega have t64:(s-64)˧=s˧-64:=by rw[Η _ _ (by rw[ϐ];simp;omega)];simp rw[bzU,bzU,msk_v _ _ (by rw[t64];omega),t64,show 2^s˧=2^64*2^(s˧-64) by rw[<-Κ];congr 1;omega,DH,show(h˧*2^64+l˧)/2^64=h˧ by rw[Ϟ,ϔ _ _ (Δ 64),Υ hl];simp,m64e,AB];simp only[Ω,ת];generalize h˧%2^(s˧-64)=w;omega theorem orpw2 (a b k:ٳ) (hb:b < 2^k):a*2^k|||b=a*2^k+b:=by rw[<-Α,Bq hb] theorem dv128_v (h l m:ػ) (m0:0 < m˧) (m32:m˧ < 2^32): (dv128 h l m).1˧*2^64+(dv128 h l m).2.1˧=(h˧*2^64+l˧)/m˧ /\ (dv128 h l m).2.2˧=(h˧*2^64+l˧)%m˧:=by have:=l܉;unfold dv128;dsimp only;have r:=Ε h˧ m0;generalize e:(h%m)<<<(32:ػ)|||l>>>(32:ػ)=x;have i:x˧=h˧%m˧*2^32+l˧/2^32:=by simp only[<-e,Du,ό,Ξ,UInt64.toNat_mod,Bc,BY,Α,ψ];rw[ν א];exact orpw2 _ _ _ א have s:=Ε x˧ m0;generalize f:(x%m)<<<(32:ػ)|||l&&&(ހ:ػ)=y;have j:y˧=x˧%m˧*2^32+l˧%2^32:=by simp only[<-f,Du,ό,BR,UInt64.toNat_mod,Bc,BY,Α];rw[ν א,show ހ=2^32-1 from rfl,ϡ];exact orpw2 _ _ _ (Ε _ ד) have a:x˧/m˧<2^32:=by rw[An m0,i];omega have b:y˧/m˧<2^32:=by rw[An m0,j];omega have c:((x/m)<<<(32:ػ)|||y/m)˧=x˧/m˧*2^32+y˧/m˧:=by simp only[Du,ό,UInt64.toNat_div,Bc,BY,Α];rw[ν א];exact orpw2 _ _ _ b rw[c,UInt64.toNat_div,UInt64.toNat_mod];have d:=Aq h˧ m˧;have e:=Aq x˧ m˧;have f:=Aq y˧ m˧;exact((Nat.div_mod_unique m0).2 ⟨(by simp only[Nat.mul_add,<-ϣ];have:=Aq l˧ (2^32);clear* -d e f i j this;omega:y˧%m˧+m˧*(h˧/m˧*2^64+(x˧/m˧*2^32+y˧/m˧))=h˧*2^64+l˧),Ε _ m0⟩).imp Eq.symm Eq.symm theorem qE1 (q R X D:ٳ) (hD:0 < D) (hX:X < D):(q*D+X=R*D) ↔ (q=R/\X=0):=by refine⟨λe=>?_,by rintro⟨a,b⟩;subst a b;omega⟩;obtain h|rfl|h:=lt_trichotomy q R;. have:(q+1)*D<=R*D:=ω _ h;rw[ϟ]at this;omega . omega . have:(R+1)*D<=q*D:=ω _ h;rw[ϟ]at this;omega theorem qE2 (q S X D:ٳ) (hD:0 < D) (hX:X < D):(4*(q*D+X) < D*(4*S+1)) ↔ (q < S\/(q=S/\4*X < D)):=by rw[(by ring:D*(4*S+1)=4*(S*D)+D)];obtain h|rfl|h:=lt_trichotomy q S;. have:(q+1)*D<=S*D:=ω _ h;rw[ϟ]at this;constructor<;>intro<;>omega . constructor<;>intro<;>omega have:(S+1)*D<=q*D:=ω _ h;rw[ϟ]at this;constructor<;>intro<;>omega theorem qE3 (q S X D:ٳ) (hD:0 < D) (hX:X < D):(4*(q*D+X)=D*(4*S+1)) ↔ (q=S/\4*X=D):=by have e:D*(4*S+1)=4*(S*D)+D:=by ring rw[e];rcases lt_trichotomy q S with h|h|h;. have:(q+1)*D<=S*D:=ω _ h;rw[ϟ]at this;constructor<;>intro a<;>omega . subst h;constructor<;>intro a<;>omega . have:(S+1)*D<=q*D:=ω _ h;rw[ϟ]at this;constructor<;>intro a<;>omega theorem qX (r1 b2 rest K m:ٳ) (hK:0 < K) (hrest:rest < K): ((r1*(4*K)+b2*K+rest=0) ↔ (r1=0/\b2=0/\rest=0)) /\ ((4*(r1*(4*K)+b2*K+rest) < m*(4*K)) ↔ (4*r1+b2 < m)) /\ ((4*(r1*(4*K)+b2*K+rest)=m*(4*K)) ↔ (4*r1+b2=m/\rest=0)):=by have e1:4*(r1*(4*K)+b2*K+rest)=4*((4*r1+b2)*K+rest):=by ring have e2:m*(4*K)=4*(m*K):=by ring refine⟨by have:=qE1 (4*r1+b2) 0 rest K hK hrest;omega,?_,?_⟩<;>rw[e1,e2]<;>generalize 4*r1+b2=t;. exact⟨λh=>by by_contra c;have:m*K<=t*K:=ω _ א;omega,λh=>by have:(t+1)*K<=m*K:=ω _ h;rw[ϟ]at this;omega⟩ . have:=qE1 t m rest K hK hrest;omega theorem sqA_q (num den root q r1 b2 rest K m:ٳ) (hK:0 < K) (hm:0 < m) (hden:den=m*(4*K)) (hnum:num=q*(m*(4*K))+(r1*(4*K)+b2*K+rest)) (hr1:r1 < m) (hb2:b2 < 4) (hrest:rest < K) : sqA num den root=if q=root*root&&r1==0&&b2==0&&rest==0 then 0 else if q < root*root+root||(q=root*root+root&&4*r1+b2 < m) then 1 else if q=root*root+root&&4*r1+b2==m&&rest==0 then 2 else 3:=by have a:0< m*(4*K):=ה;have b:r1*(4*K)+b2*K+rest< m*(4*K):=by have:=ω K (א:b2<=3);have:=ω (4*K) hr1;rw[Ah]at this;omega obtain⟨x,y,z⟩:=qX r1 b2 rest K m hK hrest;unfold sqA;rw[hden,hnum,(by ring:(2*root+1)*(2*root+1)=4*(root*root+root)+1)];simp only[qE1 _ _ _ _ a b,qE2 _ _ _ _ a b,qE3 _ _ _ _ a b,x,y,z,Ω,beq_iff_eq,ת,Ϸ,and_assoc] theorem Yjv (x:ػ):(Yj x)˧=x˧܀:=by by_cases a:x=0;subst a;rfl;exact Zj x a theorem lg128_v (h l:ػ):(lg128 h l)˧=(h˧*2^64+l˧)܀:=by have hl:=l܉;unfold lg128;split . rename_i c;have c0:h≠0:=by simpa using c have c1:h˧≠0:=λe=>c0 (σ.1 (by rw[e];rfl)) have g:2^64<=h˧*2^64+l˧:=Cp (Nat.le_mul_of_pos_left _ (Ο c1)) (ώ _ _);rw[lg_step _ 64 g,show(h˧*2^64+l˧)/2^64=h˧ by rw[Ϟ,ϔ _ _ (Δ 64),Υ hl];simp,ξ,Yjv,show (64:ػ)˧=64 from rfl];have:=(Ϻ c1).2 h܉;omega . rename_i c;simp at c;subst c;simp[Yjv] theorem sqW_V (num den root:ٳ) (e:ٴ) (hd:0 < den) (h:sqV (sqA num den root) root e < ߿):(sqV (sqA num den root) root e)՜=sqW num den root e:=by unfold sqV at h⊢;unfold sqW;dsimp only at h⊢;by_cases hC:ރ<=root/\root<33554432/\1<=e+(if root<ނ then 0 else 1:ٳ)+150/\e+(if root<ނ then 0 else 1:ٳ)+150<=253;. rw[if_pos hC];simp only[hC.1,hC.2.1,hd,hC.2.2.1,hC.2.2.2,and_self,ite_true];simp . rw[if_neg hC]at h;simp at h theorem FY_v (num den q r1 b2 rest K m c:ٳ) (t:ٴ) (z:ف) (hK:0 < K) (hm:0 < m) (hden:den=m*(4*K)) (hnum:num=q*(m*(4*K))+(r1*(4*K)+b2*K+rest)) (hr1:r1 < m) (hb2:b2 < 4) (hrest:rest < K) (hz:z=(rest==0)) (hf:FY q r1 b2 z m c t < ߿) : (FY q r1 b2 z m c t)՜=sqW num den (Nat.sqrt q) (((c:ٴ)-298)/2-t):=by have sa:=sqA_q num den (Nat.sqrt q) q r1 b2 rest K m hK hm hden hnum hr1 hb2 hrest;have d0:0< den:=by rw[hden];positivity subst hz;unfold FY at hf⊢;dsimp only at hf⊢;rw[<-sa]at hf⊢;exact sqW_V _ _ _ _ d0 hf theorem FY_root (q r1 b2:ٳ) (z:ف) (m c:ٳ) (t:ٴ) (hf:FY q r1 b2 z m c t < ߿):8388608<=Nat.sqrt q:=by unfold FY sqV at hf;dsimp only at hf;by_contra hc;rw[if_neg (by intro h;exact hc h.1)]at hf;simp at hf theorem nsplit (N m K:ٳ):N=N/(m*(4*K))*(m*(4*K))+(N/(4*K)%m*(4*K)+N/K%4*K+N%K):=by have a1:=Aq N (4*K);have a2:=Aq (N/(4*K)) m;have a3:N%(4*K)=N%K+K*(N/K%4):=by rw[Θ 4 K];exact DH rw[ϧ,Θ (4*K)]at a2;rw[a3,<-a2]at a1;conv_lhs=>rw[<-a1] ring theorem FX_v (shh sl:ػ) (m c k:ٳ) (t:ٴ) (hk1:1<=k) (hk:k < 64) (hm:0 < m) (hm32:m < 2^32) (hf:FX shh sl m c t k < ߿) : (FX shh sl m c t k)՜=sqW (shh˧*2^64+sl˧) (m*4^k) (Nat.sqrt ((shh˧*2^64+sl˧)/(m*4^k))) (((c:ٴ)-298)/2-t) /\ 8388608<=Nat.sqrt ((shh˧*2^64+sl˧)/(m*4^k)):=by have mu:m߸˧=m:=ו have s1:(2*k)߸˧=2*k:=ו have s2:(2*k-2)߸˧=2*k-2:=ו unfold FX at hf⊢;dsimp only at hf⊢;have Av:=shr128_v shh sl (2*k)߸ ו;generalize shr128 shh sl (2*k)߸=A at hf Av⊢;rw[s1]at Av;have Dv:=dv128_v A.1 A.2 m߸ ו ו;generalize dv128 A.1 A.2 m߸=DQ at hf Dv⊢;rw[mu,Av]at Dv;split at hf;. simp at hf rename_i cq;rw[if_neg cq];simp only[Ϸ,bne_iff_ne,ne_eq,not_or,Decidable.not_not]at cq;rw[cq.1,Ϝ,ϸ,Β]at Dv;obtain⟨N,num0⟩:∃N,shh˧*2^64+sl˧=N:=⟨_,rfl⟩;rw[num0]at Av Dv⊢;have K0:0<4^(k-1):=ה;have p4:4^k=4*4^(k-1):=by rw[<-pow_succ'];congr 1;omega have p2:2^(2*k)=4^k:=by rw[pow_mul];norm_num have p2':2^(2*k-2)=4^(k-1):=by rw[show 2*k-2=2*(k-1) by omega,pow_mul];norm_num rw[p2]at Dv;have B:((shr128 shh sl (2*k-2)߸).2&&&3)˧=N/4^(k-1)%4:=by have v:=shr128_v shh sl (2*k-2)߸ ו;rw[s2,num0,p2']at v;rw[BR,show (3:ػ)˧=2^2-1 from rfl,ϡ,<-v];omega have Z:lowz128 shh sl (2*k-2)߸=(N%4^(k-1)==0):=by rw[lowz128_v _ _ _ ו,s2,num0,p2',AB];simp rw[B,Z]at hf⊢;have qv:DQ.2.1˧=N/(m*4^k):=by rw[Dv.1,ϧ,Θ] rw[qv]at hf⊢;exact⟨FY_v N (m*4^k) (N/(m*4^k)) DQ.2.2˧ (N/4^(k-1)%4) (N%4^(k-1)) (4^(k-1)) m c t (N%4^(k-1)==0) K0 hm (by rw[p4]) (by rw[Dv.2,p4];exact nsplit N m _) (by rw[Dv.2];exact Ε _ hm) (Ε _ ד) (Ε _ K0) rfl hf,FY_root _ _ _ _ _ _ _ hf⟩ theorem FW_v (shh sl:ػ) (m c:ٳ) (fb:Unit->δ) (hm:0 < m) (hm32:m < 2^32) (hf:FW shh sl m c < ߿) : (FW shh sl m c)՜=YaD (shh˧*2^64+sl˧) m (((c:ٴ)-298)/2) fb:=by unfold FW at hf⊢;dsimp only at hf⊢;rw[lg128_v]at hf⊢;split at hf;. simp at hf rename_i ct;simp only[Ϸ,decide_eq_true_eq,not_or,not_le]at ct;rw[if_neg (by simp only[Ϸ,decide_eq_true_eq,not_or,not_le];exact ct)];generalize ht:(47-((shh˧*2^64+sl˧)܀:ٴ)+m܀+1)/2=t at ct hf⊢;have k1:1<=(-t)׆:=א;obtain⟨fx,rt⟩:=FX_v shh sl m c (-t)׆ t k1 ct.2 hm hm32 hf;rw[fx];unfold YaD;dsimp only;rw[ht];have nt:¬(0<=t):=א;simp only[nt,if_false];have dn:m<<<(2*(-t)׆)=m*4^(-t)׆:=by rw[Α,pow_mul];norm_num rw[dn];have sr:Ϗ (shh˧*2^64+sl˧) (m*4^(-t)׆)=Nat.sqrt ((shh˧*2^64+sl˧)/(m*4^(-t)׆)):=rfl;rw[sr,if_pos rt] theorem sub128 (ah al bh bl:ػ) (hge:bh˧*2^64+bl˧<=ah˧*2^64+al˧) : (ah-bh-(if al < bl then 1 else 0))˧*2^64+(al-bl)˧=(ah˧*2^64+al˧)-(bh˧*2^64+bl˧):=by have ha:=ah܉;have hl:=al܉;have hb:=bh܉;have hbl:=bl܉;split . rename_i c;have c':al˧< bl˧:=Ψ.1 c;have g:bh˧< ah˧:=by by_contra hc;have:ah˧*2^64<=bh˧*2^64:=ω _ א;omega rw[Η _ _ (by rw[ϐ];simp;rw[Η _ _ (ϐ.2 א)];omega), Η _ _ (ϐ.2 א),Τ];simp omega . rename_i c;have c':bl˧<=al˧:=by have:=Ψ.not.1 c;omega have g:bh˧<=ah˧:=by by_contra hc;have:(ah˧+1)*2^64<=bh˧*2^64:=ω _ א;rw[ϟ]at this;omega simp only[UInt64.sub_zero];rw[Η _ _ (ϐ.2 g),Η _ _ (ϐ.2 c'),Nat.sub_mul];omega theorem absd_v (ph pl nh nl:ػ):(absd ph pl nh nl).1˧*2^64+(absd ph pl nh nl).2˧=(((ph˧*2^64+pl˧:ٳ):ٴ)-((nh˧*2^64+nl˧:ٳ):ٴ)).natAbs:=by have a1:=ph܉;have a2:=pl܉;have a3:=nh܉;have a4:=nl܉;unfold absd;by_cases cc:(nhsimp only[cc,φ,ר,ש]<;>simp only[Ϸ,Ω,beq_iff_eq,ת,Ψ,ϐ,<-σ,not_or,not_and]at cc<;>rw[sub128 _ _ _ _ א]<;>omega theorem mulq_v (qh ql:ػ) (n:ٳ) (hn:n < 2^64) (h:(mulq qh ql n).2.2=true):(mulq qh ql n).1˧*2^64+(mulq qh ql n).2.1˧=n*(qh˧*2^64+ql˧):=by have nu:n߸˧=n:=ו;unfold mulq at h⊢;dsimp only at h⊢;have e0:=m64_v ql n߸;have e1:=m64_v qh n߸;rw[nu]at e0 e1;generalize m64 ql n߸=Q0 at e0 h⊢;generalize m64 qh n߸=Q1 at e1 h⊢;simp only[Ω,beq_iff_eq,ת]at h;obtain⟨h1,h2⟩:=h;have b1:=Q1.2܉;have b0:=Q0.1܉;have nw:Q1.2˧+Q0.1˧<2^64:=by have:=ϐ.1 h2;rw[ξ]at this;by_contra hc;rw[Nat.mod_eq_sub_mod א,ν א]at this;omega rw[ξ,ν nw];rw[h1,Ϝ,ϸ,Β]at e1;rw[show n*(qh˧*2^64+ql˧)=qh˧*n*2^64+ql˧*n by ring,<-e1,<-e0];ring theorem FT_v (ph pl nh nl qh ql:ػ) (n:ٳ) (h:(FT ph pl nh nl qh ql n).2.2=true) : (FT ph pl nh nl qh ql n).1˧*2^64+(FT ph pl nh nl qh ql n).2.1˧=n*(qh˧*2^64+ql˧)-(((ph˧*2^64+pl˧:ٳ):ٴ)-((nh˧*2^64+nl˧:ٳ):ٴ)).natAbs*(((ph˧*2^64+pl˧:ٳ):ٴ)-((nh˧*2^64+nl˧:ٳ):ٴ)).natAbs:=by unfold FT at h⊢;dsimp only at h⊢;have av:=absd_v ph pl nh nl;generalize absd ph pl nh nl=D at av h⊢;simp only[Ω,beq_iff_eq,ת,Ϸ]at h;obtain⟨⟨⟨h1,h2⟩,h3⟩,h4⟩:=h;rw[h1,Ϝ,ϸ,Β]at av;have nq:=mulq_v qh ql n א h3;generalize mulq qh ql n=NQ at nq h4⊢;have d2:=m64_v D.2 D.2;rw[av]at d2;generalize m64 D.2 D.2=D2 at d2 h4⊢;have ge:D2.1˧*2^64+D2.2˧<=NQ.1˧*2^64+NQ.2.1˧:=by rcases h4 with c|⟨c,d⟩;have:D2.1˧c (by simp only[Ω,beq_iff_eq];constructor<;>apply σ.1<;>rw[Ϝ]<;>omega) have:=(Ϻ v).2 (by have:=th܉;have:=tl܉;omega:_<2^128);rw[ξ,lg128_v,Da,ν א]at h;exact Ag (Aj Ak (Δ d)) (by rw[<-Κ];exact Ι ד א) theorem add128 (ah al bh bl:ػ) (h3:ah<=ah+bh) (h4:ah+bh<=ah+bh+(if al+blrename_i c<;>rw[Ψ,ξ]at c<;>split<;>first|rfl|omega rw[ϐ,ξ]at h3;rw[ϐ,ξ (ah+bh),ξ ah bh,cy]at h4;rw[ξ (ah+bh),ξ ah bh,cy,ξ al bl];by_cases c:2^64<=al˧+bl˧<;>simp only[c,ite_true,ite_false]at h4⊢<;>omega theorem FN_v (th tl:ػ) (d1 d2:ٳ) (E:ػ) (h:(FN th tl d1 d2 E).2.2=true) : (FN th tl d1 d2 E).1˧*2^64+(FN th tl d1 d2 E).2.1˧=(th˧*2^64+tl˧)*2^d1+E˧*2^d2:=by unfold FN at h⊢;dsimp only at h⊢;obtain⟨h123,h4⟩:=(Ω _ _).mp h;obtain⟨h12,h3⟩:=(Ω _ _).mp h123;obtain⟨h1,h2⟩:=(Ω _ _).mp h12;replace h1:=of_decide_eq_true h1;replace h2:=of_decide_eq_true h2;replace h3:=of_decide_eq_true h3;replace h4:=of_decide_eq_true h4;have u1:d1߸˧=d1:=by simp;omega have u2:d2߸˧=d2:=by simp;omega have bE:(0*2^64+E˧)*2^d2< 2^128:=by have:=bitlen_v 0 E d2 (by have e:(if (0:ػ)==0&&E==0 then 0 else lg128 0 E+1)=(if E==0 then 0 else Yj E+1):=by split<;>split<;>simp_all[lg128] rw[e];exact h2) simpa using this have T2v:=shl128_v th tl d1߸ (by rw[u1];omega) (by rw[u1];exact bitlen_v th tl d1 h1);rw[u1]at T2v;have E2v:=shl128_v 0 E d2߸ (by rw[u2];omega) (by rw[u2];simpa using bE);rw[u2]at E2v;simp only[Ϝ,zero_mul,zero_add]at E2v;rw[add128 _ _ _ _ h3 h4,T2v,E2v] theorem FT_n (ph pl nh nl qh ql:ػ) (n:ٳ) (h:(FT ph pl nh nl qh ql n).2.2=true):n < 256:=by unfold FT at h;dsimp only at h;exact of_decide_eq_true ((Ω _ _).mp ((Ω _ _).mp ((Ω _ _).mp h).1).1).2 theorem FTk_eq {β:Type} (ph pl nh nl qh ql:ػ) (n:ٳ) (k:ػ->ػ->ف->β):FTk ph pl nh nl qh ql n k=k (FT ph pl nh nl qh ql n).1 (FT ph pl nh nl qh ql n).2.1 (FT ph pl nh nl qh ql n).2.2:=by unfold FTk FT absd mulq;rfl theorem FNk_eq {β:Type} (th tl:ػ) (d1 d2:ٳ) (E:ػ) (k:ػ->ػ->ف->β):FNk th tl d1 d2 E k=k (FN th tl d1 d2 E).1 (FN th tl d1 d2 E).2.1 (FN th tl d1 d2 E).2.2:=rfl theorem FF_v (ph pl nh nl qh ql:ػ) (n b0:ٳ) (eps:δ) (fb:Unit->δ) (hn:0 < n) (hf:FF ph pl nh nl qh ql n b0 eps < ߿) : (FF ph pl nh nl qh ql n b0 eps)՜=YaD ((n*(qh˧<<<64+ql˧)-(((ph˧<<<64+pl˧:ٳ):ٴ)-((nh˧<<<64+nl˧:ٳ):ٴ)).natAbs*(((ph˧<<<64+pl˧:ٳ):ٴ)-((nh˧<<<64+nl˧:ٳ):ٴ)).natAbs)<<<(2*b0-YF b0 (γ eps))+(n*n*ε eps)<<<(γ eps+149-YF b0 (γ eps))) (n*n) (((YF b0 (γ eps):ٴ)-298)/2) fb:=by simp only[Α];unfold FF at hf⊢;rw[FTk_eq]at hf⊢;dsimp only at hf⊢;split at hf;swap;simp at hf;rename_i hT;rw[if_pos hT];have n256:=FT_n _ _ _ _ _ _ _ hT;have tv:=FT_v _ _ _ _ _ _ _ hT;rw[FNk_eq]at hf⊢;split at hf;swap;simp at hf;rename_i hN;rw[if_pos hN];have Eu:(n*n*ε eps)߸˧=n*n*ε eps:=by have:=BP (BP n256 n256) (Ϛ eps);simp;omega have nv:=FN_v _ _ _ _ _ hN;rw[Eu,tv]at nv;rw[FW_v _ _ _ _ fb ה (by have:=BP n256 n256;omega) hf,nv] theorem FFr_v (qh ql:ػ) (n b0:ٳ) (eps:δ) (fb:Unit->δ) (hf:FFr qh ql n b0 eps < ߿) : (FFr qh ql n b0 eps)՜=YaD ((qh˧<<<64+ql˧)<<<(2*b0-YF b0 (γ eps))+(n*ε eps)<<<(γ eps+149-YF b0 (γ eps))) n (((YF b0 (γ eps):ٴ)-298)/2) fb:=by simp only[Α];unfold FFr at hf⊢;dsimp only at hf⊢;by_cases h:(0∃ ok' ph' pl' nh' nl' qh' ql',(∀ {β:Type} (kont:ف->ػ->ػ->ػ->ػ->ػ->ػ->β),rsV kont x base n b0 j ph pl nh nl qh ql ok=kont ok' ph' pl' nh' nl' qh' ql') /\ rsU x base n b0 j ph pl nh nl qh ql ok=(ok',ph'˧<<<64+pl'˧,nh'˧<<<64+nl'˧,qh'˧<<<64+ql'˧):=by intro k;induction k with |zero=>intro j ph pl nh nl qh ql ok hk;have c:¬jby rw[rsV,if_neg c],by rw[rsU,if_neg c]⟩ |succ k ih=>intro j ph pl nh nl qh ql ok hk;have c:jobtain⟨A,B,C,D,E,F,G,V,U⟩:=ih (j+1) _ _ _ _ _ _ _ א<;>exact⟨A,B,C,D,E,F,G,λk=>by rw[rsV,if_pos c];simp only[hs,φ,ר,ש];exact V k,by rw[rsU,if_pos c];simp only[hs,φ,ר,ש];exact U⟩ @[inline] def Y8f (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):ٳ × ٴ × δ := let b0:=Y2L x (r*n) n 0 255 rsV (λok ph pl nh nl qh ql=> let S1:ٴ:=if ok then ((ph˧<<<64+pl˧:ٳ):ٴ)-((nh˧<<<64+nl˧:ٳ):ٴ) else (limbValA (Y7 x (r*n) n b0).1:ٴ)-limbValA (Y7 x (r*n) n b0).2 let f:=if ok&&0 Ac (ϫ n x r (rowMean n x r)+ς eps))) x (r*n) n b0 0 0 0 0 0 0 0 true lemma Y8f_eq (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):Y8f x n eps r=Y8 x n eps r:=by unfold Y8f Y8;rw[Y2L_eq];dsimp only;obtain⟨o,a,b,c,d,e,f,V,U⟩:=rsV_ex x (r*n) n (Y2 x (r*n) n) _ 0 0 0 0 0 0 0 true rfl;rw[V,Tn];cases o;. simp only[Bool.false_and,φ,ש];rw[if_neg ד] obtain⟨g,h⟩:=rsU_lim x (r*n) n (Y2 x (r*n) n) (by rw[U]);rw[U]at g h;dsimp only at g h;simp only[ר,Bool.true_and];by_cases i:0 ℚ):δ := if sv dw <= 0 then roundRational ((ς w-mean ())*ς gw/ς dw+ς bw) else MYa7b n w gw bw b0 S1 dw lemma shm (w:UInt32) (m:ػ) (k:ٳ) (hk:k <= 38) (h:ε w=0\/(m˧ <= γ w/\γ w-m˧ <= k)) : (Yf w<<<(Yd w-m))˧=ε w*2^(γ w-m˧) /\ ε w*2^(γ w-m˧) < 2^(24+k):=by rcases h with h0|⟨h1,h2⟩;. rw[(σ.1 (by rw[Zk,h0];rfl):Yf w=0),h0];simp . have hp:ε w*2^(γ w-m˧)<2^(24+k):=by rw[Κ];exact Ag (Aj (Ϛ w) (Δ _)) (Ci _ (Ι ב h2)) refine⟨?_,hp⟩;rw[ό,Η _ _ (ϐ.2 (by rw[Zf];exact h1)),Zf,Zk,ν (א:γ w-m˧<64),Α];exact ν (Ag hp (Ι ב א)) end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Float.Model.UnpackedFloat @[inline] def rqU (a b:ػ):ػ := let q:=a/b let tw:=2*(a%b) if tw < b then q else if b < tw then q+1 else if q%2==0 then q else q+1 @[inline] def rrsG (s:ف) (N D U V:ػ) (fb:Unit -> δ):δ := let i:=Yj N-Yj D let R:=if N < D<<>>k=0):x < 2^k:=by rwa[ψ,Nat.div_eq_zero_iff_lt ה]at h end 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) lemma flr (P Dm r:ٳ) (hD:Dm≠0) (hP:P≠0) (h1:2^r*Dm <= P) (h2:P < 2^(r+1)*Dm):fl2 P Dm = (r:ٴ):=by rw[Zbo];obtain⟨a,b⟩:=floorLog2_bounds P Dm hP hD;have c:(0:ℝ) omega rw[if_neg א,if_neg א,if_neg א];by_cases hk2:m=ނ;. simp only[hk2,beq_self_eq_true,ite_true]at hx⊢;rw[if_neg א] . have:(m==ނ)=false:=by simpa using hk2 simp only[hk2,this,ite_false,φ]at hx⊢;rw[if_neg א];simp lemma rqUe2 (a b:ػ) (hb0:0 < b˧) (hb:b˧ < 2^63) (hq:a˧/b˧ < 2^63) : (rqU a b)˧ = AP a˧ b˧:=by unfold rqU AP;dsimp only;have hq0:=UInt64.toNat_div a b;have hr:=UInt64.toNat_mod a b;have hrl:=Ε a˧ hb0;have htw:(2*(a%b))˧=2*(a˧%b˧):=by rw[ϯ,hr];simp;omega have hq1:(a/b+1)˧=a˧/b˧+1:=by rw[ξ,hq0];simp;omega have hm2:((a/b)%2)˧=(a˧/b˧)%2:=by rw[UInt64.toNat_mod,hq0];rfl have e3:((a/b)%2==0)=true↔(a˧/b˧)%2=0:=by simp only[beq_iff_eq];rw[<-hm2];exact⟨λh=>by rw[h];rfl,λh=>σ.mp (by rw[h];rfl)⟩ by_cases c1:2*(a˧%b˧)c3 (e3.mp h)),if_neg (by simpa using c3),hq1] lemma p2le (a b:ٳ) (h:a <= b):2^a <= 2^b:=Ι ב h lemma rRe (N D:ػ) (hD0:0 < D˧) (hND:D˧ <= N˧) (hD:D˧ < 2^40) : let R:=if Nby rw[h]at hND;simp at hND;omega);have hld:=Zj D (λh=>by rw[h]at hD0;simp at hD0) have bN:=(Af (א:N˧≠0)).mp rfl;have bD:=(Af (א:D˧≠0)).mp rfl;generalize N˧܀=ln at bN hln;generalize D˧܀=ld at bD hld have hle:ld<=ln:=Ao.1 ((Nat.pow_lt_pow_iff_right (ב:1<2)).1 (Ρ (Cp bD.1 hND) bN.2)) have hl63:ln<=63:=by by_contra h;have:=p2le 64 ln א;have:N˧<2^64:=N܉;omega have hi:(Yj N-Yj D)˧=ln-ld:=by rw[Η _ _ (by rw[ϐ,hln,hld];exact hle),hln,hld] have h1:D˧*2^(ln-ld)<2^(ln+1):=by rw[<-show 2^(ld+1)*2^(ln-ld)=2^(ln+1) by rw[<-Κ,(א:ld+1+(ln-ld)=ln+1)]];exact Aj bD.2 ה have hsh:(D<<<(Yj N-Yj D))˧=D˧*2^(ln-ld):=by rw[ό,hi,ν (א:ln-ld<64),Α];exact ν (Ag h1 (p2le _ _ א)) have up:N˧<2^(ln-ld+1)*D˧:=by have:=Ci (2^(ln-ld+1)) bD.1;rw[<-Κ,(א:ln-ld+1+ld=ln+1)]at this;omega by_cases c:NX) = X:=by unfold rrsG;dsimp only;obtain⟨a,b,c⟩:=rRe N D hD0 hND hD;generalize (if Nomega obtain⟨j,k⟩:(if M==ނ then (1:ػ)else 0)˧=(if M˧=ނ then 1 else 0)/\((if (if M==ނ then (1:ػ)else 0)==1 then ރ else M)-ރ)˧=(if M˧=ނ then ރ else M˧)-ރ:=by by_cases h:M˧=ނ;. simp[σ.1 (by rw[h];rfl:M˧=(ނ:ػ)˧)] . have:¬M=ނ:=λe=>h (by rw[e];rfl) refine⟨by simp[this,h],?_⟩;simp only[this,h,beq_iff_eq,ש,(ד:¬(0:ػ)=1)];rw[Η _ _ (by rw[ϐ];simp;omega)];simp generalize (if M==ނ then (1:ػ)else 0)=K at j k⊢;have l:(if M˧=ނ then 1 else 0)<=1:=by split<;>omega have m:(R+U)˧=R˧+U˧:=by rw[ξ];omega have n:(R+U+K)˧=R˧+U˧+(if M˧=ނ then 1 else 0):=by rw[ξ,m,j];omega by_cases h:(decide (Vsimp_all<;>omega),x,k];congr 1;split<;>simp_all<;>omega . rw[if_neg h] lemma eok (w:Word) (h:(expOf w).toUInt64-1 < 254):1 <= (expOf w)پ ∧ (expOf w)پ <= 254:=by have h0:=expOf_toNat_lt w;rw[Ψ]at h;by_cases hz:(θ w)پ=0;have:(θ w)܅=0:=σ.mp (by simp[AG,hz]);simp[this]at h;rw[Η _ _ (by rw[ϐ];simp[AG];omega)]at h;simp[AG]at h;omega lemma mok (w:Word) (h:1 <= (expOf w)پ):mantOf w = 2^23+(fracOf w)پ ∧ idxOf w = (expOf w)پ-1:=by have e:θ w≠0:=(λe=>by simp[e]at h);unfold ε γ;exact⟨if_neg e,if_neg e⟩ end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats @[inline] def Ya7G (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit -> ℚ) (nU b0U:ػ) (S1n:ف) (S1a:ػ):δ := let ed:=(expOf dw)܅ if ed-1 < 254 && !η dw && 0 < nU && nU < 4096 && S1a < 0x1000000000000000 && expOf w != 255 && expOf gw != 255 && expOf bw != 255 then let iw:=Yd w let ig:=Yd gw let ib:=Yd bw let idd:=ed-1 let mw:=Yf w if mw == 0 || (b0U <= iw && iw-b0U <= 24) then let x:=nU*(mw<<<(iw-b0U)) let cs:ف:=if η w == S1n then η w else if S1a <= x then η w else S1n let cv:=if η w == S1n then x+S1a else if S1a <= x then x-S1a else S1a-x let D:=nU*Yf dw let c2:=if b0U+ig <= ib+idd then b0U+ig else ib+idd let ks:=b0U+ig-c2 let bs:=ib+idd-c2 let q0:=cv/D let r0:=cv%D*Yf gw let qq:=q0*Yf gw+r0/D if ks <= 8 && qq < (1:ػ)<<<(61-ks) && bs <= 37 then let ra:=(r0%D)<<MYa7 n w gw bw b0 S1 dw mean) else let N:=qi*D+qr if N == 0 then 0 else if N < D then MYa7 n w gw bw b0 S1 dw mean else rrsG qs N D (c2+1) (idd+23) (λ_=>MYa7 n w gw bw b0 S1 dw mean) else MYa7 n w gw bw b0 S1 dw mean else MYa7 n w gw bw b0 S1 dw mean else MYa7 n w gw bw b0 S1 dw mean end 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) lemma u64m2 (a b:ػ) (h:a˧*b˧ < 2^64):(a*b)˧=a˧*b˧:=by rw[ϯ,ν h] lemma u64a2 (a b:ػ) (h:a˧+b˧ < 2^64):(a+b)˧=a˧+b˧:=by rw[ξ,ν h] lemma u64s2 (a b:ػ) (h:b˧ <= a˧):(a-b)˧=a˧-b˧:=by rw[Η _ _ (ϐ.mpr h)] lemma u64sh (a s:ػ) (hs:s˧ < 64) (h:a˧*2^s˧ < 2^64):(a<<f (ϐ.mp h);simp only[f,f',ש];by_cases g:rr˧=0;have g':rr=0:=σ.mp (by rw[g];rfl);simp only[g,g',beq_self_eq_true,ר];rw[u64s2 _ _ א];simp;have g':(rr==0)=false:=by simp only[beq_eq_false_iff_ne];intro h;apply g;rw[h];rfl simp only[g,g',ש,φ];rw[u64s2 _ _ (by rw[u64s2 _ _ א];simp;omega),u64s2 _ _ א,u64s2 _ _ א];simp lemma Ya7Ge (n:Nat) (w gw bw:Word) (b0:Nat) (S1:Int) (dw:Word) (mean:Unit->ℚ) (nU b0U:UInt64) (S1n:Bool) (S1a:UInt64) (hn:0 < nU.toNat → nU.toNat=n) (hb:b0U.toNat=b0) (hb255:b0 < 256) (hs:S1n=!(decide (S1 < 0))) (ha:S1a.toNat < 2^60 → S1a.toNat=S1.natAbs) : Ya7G n w gw bw b0 S1 dw mean nU b0U S1n S1a = MYa7 n w gw bw b0 S1 dw mean:=by simp only[Ya7G];rw[ite_eq_right_iff];intro c1;simp only[EK,Ω,ϵ,ת,bne_iff_ne,ne_eq,Ψ,Bc]at c1;obtain⟨ca,cb,cc,cd,ce,_⟩:=c1;replace hn:=hn cc;have hed:=eok dw (Ψ.2 ca);obtain⟨hmd,hid⟩:=mok dw hed.1;have hn0:0(first|rw[u64a2 _ _ א]|rw[u64s2 _ _ א])<;>exact⟨rfl,א⟩ have hDb:2^23<=n*ε dw/\n*ε dw<2^36:=⟨Cp (by rw[hmd];omega) (Nat.le_mul_of_pos_left _ hn0),(BP hn1 (Ϛ dw)).trans_eq ב⟩;generalize hd:nU*Yf dw=D;have hD:D˧=n*ε dw:=by rw[<-hd,u64m2 _ _ (by rw[hn,Zk];omega),hn,Zk] have hbg:(b0U+Yd gw)˧=b0+γ gw:=by rw[u64a2 _ _ (by rw[hb,Zf];omega),hb,Zf] have hbd:(Yd bw+idd)˧=γ bw+γ dw:=by rw[u64a2 _ _ (by rw[Zf,hidd];omega),Zf,hidd] generalize hc:(if b0U+Yd gw<=Yd bw+idd then b0U+Yd gw else Yd bw+idd)=c2;have hc2:c2˧=min (b0+γ gw) (γ bw+γ dw):=by subst hc;split<;>rename_i h<;>rw[ϐ]at h<;>omega generalize hk:b0U+Yd gw-c2=ks;have hks:ks˧=b0+γ gw-min (b0+γ gw) (γ bw+γ dw):=by rw[<-hk,u64s2 _ _ א];omega generalize hk:Yd bw+idd-c2=bs;have hbs:bs˧=γ bw+γ dw-min (b0+γ gw) (γ bw+γ dw):=by rw[<-hk,u64s2 _ _ א];omega have hDp:0simp at hY1<;>omega have hY7:MYa7 n w gw bw b0 S1 dw mean=if ނ<=qi˧then YN qs (2*qi˧+(if qr˧=0 then 0 else 1)) 1 (c2˧-150-γ dw)else YN (qs&&qi˧*D˧+qr˧ !=0) (qi˧*D˧+qr˧) D˧ (c2˧-149-γ dw):=by simp only[MYa7,MYa7b,if_neg hsv,hyah];rw[<-hD,ZE,ZE,<-hks,<-hbs,<-hc2,<-hqq,<-hra,<-hqa,<-hrr,<-hB,hY1] have hV:(idd+23)˧=γ dw+23:=by rw[u64a2 _ _ ו,hidd];rfl split<;>rename_i h16<;>simp only[ϐ,Bc]at h16;clear* -hc2 hV hY7 h16 hqib i3 i4;have hM:(2*qi+(if qr==0 then 0 else 1))˧=2*qi˧+(if qr˧=0 then 0 else 1):=by have h2q:(2*qi)˧=2*qi˧:=(by rw[ϯ];simp;omega);by_cases e:qr˧=0;simp only[(σ.mp (by rw[e];rfl):qr=0),e,beq_self_eq_true,ר];rw[u64a2 _ _ (by rw[h2q];simp;omega),h2q];simp;simp only[(by simp only[beq_eq_false_iff_ne];intro h;apply e;rw[h];rfl:(qr==0)=false),e,φ,ש];rw[u64a2 _ _ (by rw[h2q];simp;omega),h2q];simp exact rrsGe _ _ _ _ _ (c2˧-150-γ dw) _ ג (by rw[hM];simp;omega) ג א א א (by rw[hY7,if_pos h16,hM];rfl);have hqD:qi˧*D˧<2^60:=(BP (show qi˧<2^24 by omega) (show D˧<2^36 by omega)).trans_eq ב;have hNv:(qi*D+qr)˧=qi˧*D˧+qr˧:=by rw[u64a2 _ _ (by rw[u64m2 _ _ א];omega),u64m2 _ _ א] split;rename_i hN0;rw[hY7,if_neg h16,<-hNv,eq_of_beq hN0];unfold YN;simp[show D˧≠0 by omega];rename_i hN0;simp only[beq_iff_eq,<-σ,hNv,Bc]at hN0;rw[ite_eq_left_iff];intro hND;rw[Ψ,hNv]at hND;clear* -hDp hD hDb hNv hND hc2 hV hY7 h16 hN0 i3 i4;have hU:(c2+1)˧=c2˧+1:=u64a2 _ _ ו;exact rrsGe _ _ _ _ _ (c2˧-149-γ dw) _ hDp א א א א א (by rw[hY7,if_neg h16,hNv,(by simpa using hN0:(qi˧*D˧+qr˧ !=0)=true),Bool.and_true]) end section open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats lemma YTle (x:ؽ δ) (base n:ٳ):Y2 x base n <= 255:=by unfold Y2;suffices∀(l:List ٳ) b,b<=255->l.foldl (λb j=>let w:=x[base+j]!;if ε w=0 then b else min b (γ w)) b<=255 from this _ _ le_rfl intro l;induction l<;>intro b h;exact h;rename_i ih;simp only[AO];apply ih;split<;>omega end section lemma Ya7_eq (n:ٳ) (w gw bw:δ) (b0:ٳ) (S1:ٴ) (dw:δ) (mean:Unit->ℚ): MYa7 n w gw bw b0 S1 dw mean=MYba n w gw bw b0 S1 dw mean:=by rw[<-elS_eq];unfold MYa7 MYa7b elS;simp only[U2] end def MYbc (rows n:ٳ) (eps:δ) (x g b:ؽ δ):ؽ δ := if stableNormDomain rows n eps x g&&b.size==n&&b.all finiteWord then let st:=AF (n:=rows) λr=>Y8f x n eps r.val let aux:=AF (n:=rows) λr=> let s:=st[r.val]! let a:=s.2.1.natAbs ((!(s.2.1 < 0)),(if a>>>60 == 0 then a߸ else 0x1000000000000000),s.1߸) let nU:=if n < 4096 then n߸ else 0 YT rows n λr j=>let s:=st[r]!;let u:=aux[r]!;Ya7G n x[r*n+j]! g[j]! b[j]! s.1 s.2.1 s.2.2 (λ_=>rowMean n x r) nU u.2.2 u.1 u.2.1 else layernormLegacyWith Yn rows n eps x g b lemma Zdt:MYbc=layernormSpec:=by funext rows n eps x g b;unfold MYbc layernormSpec layernormWith;split . rename_i hd;simp only[Ω]at hd;obtain⟨⟨h0,-⟩,-⟩:=hd;obtain⟨hn,he⟩:=M1 rows n eps x g h0;unfold layernormStable;rw[ZB _ _ _ rfl];dsimp only;congr 1;funext q;rw[϶];have hr:q܂/n(let s:=(AF (n:=rows) λr=>Y8f x n eps r.val)[r]!;let a:=s.2.1.natAbs ((!(s.2.1<0)),(if a>>>60==0 then a߸else 0x1000000000000000),s.1߸))) _ hr];dsimp only;rw[gO rows (λr=>Y8f x n eps r) _ hr,Y8f_eq,Ya7Ge n _ _ _ _ _ _ _ _ _ _ _ (by intro h;split at h<;>simp_all[Nat.toUInt64_eq];omega) (by unfold Y8;simp[Nat.toUInt64_eq];omega) (by unfold Y8;simp;omega) rfl (by split;(rename_i h0;intro h;simp only[beq_iff_eq]at h0;have:=sh0 _ _ h0;simp[Nat.toUInt64_eq];omega);intro h;simp at h),Ya7_eq,gO rows (λr=>Ac (ϫ n x r (AF (n:=rows) λi=>rowMean n x i.val)[r]! +ς eps)) _ hr,gO rows (λr=>rowMean n x r) _ hr,Zdr _ _ _ _ _ _ _ _ hn,U8 _ _ _ _ _ _ _ _ hn (λhm=>by have:=Z2 x (q܂/n*n) n (q܂%n) (Ε _ hn) (by rwa[hq]);rwa[hq]at this) (V0 x n eps _ hn),V1 x n eps _ hn he] . simp only[Zi] @[inline] def YaEf (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):δ:= let b0:=Y2L x (r*n) n 0 255 rsV (λok _ _ _ _ qh ql=> let f:=if ok then FFr qh ql n b0 eps else ߿ if f<߿ then f՜ else let c:=YF b0 (γ eps) YaD ((if ok then qh˧<<<64+ql˧ else limbValA (Y6 x (r*n) n b0))<<<(2*b0-c)+(n*ε eps)<<<(γ eps+149-c)) n (((c:ٴ)-298)/2) λ_=>Ac (ϫ n x r 0+ς eps)) x (r*n) n b0 0 0 0 0 0 0 0 true lemma YaEf_eq (x:ؽ δ) (n:ٳ) (eps:δ) (r:ٳ):YaEf x n eps r=YaE x n eps r:=by unfold YaEf YaE;rw[Y2L_eq];dsimp only;obtain⟨o,a,b,c,d,e,f,V,U⟩:=rsV_ex x (r*n) n (Y2 x (r*n) n) _ 0 0 0 0 0 0 0 true rfl;rw[V];cases o;. simp only[φ,ש];rw[if_neg ד] obtain⟨-,h⟩:=rsU_lim x (r*n) n (Y2 x (r*n) n) (by rw[U]);rw[U]at h;dsimp only at h;simp only[ר];split;rename_i j;rw[FFr_v _ _ _ _ _ _ j,h];rw[h] def Ybb2 (rows n:ٳ) (eps:δ) (x g:ؽ δ):ؽ δ:= if stableNormDomain rows n eps x g then let den:=AF (n:=rows) λr=>YaEf x n eps r.val;YT rows n λr j=>Ya7 x[r*n+j]! g[j]! den[r]! else rmsnormLegacyWith Yn rows n eps x g lemma T4b:Ybb2=rmsnormSpec:=by funext c n a x g;unfold Ybb2 rmsnormSpec rmsnormWith;split;rename_i d;obtain⟨e,f⟩:=M1 c n a x g d;unfold rmsnormStable;rw[ZB _ _ _ rfl];congr 1;funext q;rw[϶];have b:q܂/nYaEf x n a r) _ b,gO c (λr=>Ac (ϫ n x r 0+ς a)) _ b,YaEf_eq,V2 x n a _ e f,T8,U9];simp only[Zi] def kernels:Kernels:=⟨specCore,⟨YaV,gemmSpec⟩,specConv,specElem,⟨Ybb2,MYbc⟩⟩ theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specDense,specNorm,ZcC,T4b,Zdt] end Submission