import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open Nat renaming shiftRight_eq_div_pow->β,mod_eq_of_lt->γ,and_two_pow_sub_one_eq_mod->ζ,mul_le_mul_right->ι,shiftLeft_eq->ο,pow_le_pow_right->Θ,zero_add->Κ,add_mul_mod_self_right->Μ,succ_mul->Ο,add_mul_div_right->Ρ,add_comm->Τ,mod_lt->ϊ,div_eq_of_lt->ώ,mul_comm->Ϗ,mul_lt_mul_of_pos_right->ϐ,add_zero->ϑ,mul_lt_mul''->ϕ,lt_log2_self->ϙ,mul_assoc->Ϛ,div_add_mod->ϛ,and_le_right->ϝ,div_lt_of_lt_mul->Ϟ,zero_le->ϟ,add_mul->Ϡ,toUInt64_eq->Ϣ,two_pow_add_eq_or_of_lt->Ϥ,mul_le_mul->ϧ,div_le_div_right->ϭ,mul_pos->Ϯ,log2_self_le->ϰ,add_sub_cancel_left->ϱ,zero_mul->ϳ,pos_of_ne_zero->ϵ,two_pow_pos->϶,div_lt_iff_lt_mul->ϸ,mul_one->ϻ open USize renaming lt_iff_toNat_lt->ε,le_size->ς,toNat_zero->Ϧ open UInt64 renaming toNat_add->η,le_iff_toNat_le->θ,lt_iff_toNat_lt->μ,toNat_shiftRight->ν,toNat_inj->ξ,toNat_sub_of_le->χ,toNat_shiftLeft->ψ,toNat_ofNat_of_lt'->Α,toNat_and->Ε,toNat_sub->Ζ,toNat_zero->ϋ,toNat_mul->ύ,le_trans->ϗ,toNat_toUInt32->Ϫ open Bool renaming false_eq_true->υ,and_eq_true->Η,eq_iff_iff->ϓ open UInt32 renaming toNat_inj->Β,lt_iff_toNat_lt->Ι,toNat_and->Ξ,toNat_shiftRight->Υ,toNat_toUInt64->ϩ,toNat_shiftLeft->ϴ open Array renaming getElem_ofFn->Λ,size_ofFn->Ϝ,size_push->ϣ open Finset renaming sum_range_succ->Ν,sum_congr->ϔ,mem_range->ϥ open Model renaming isNaN_eq_false_of_toDyadic?_some->Χ,toReal_roundDyadic_eq_roundAt->ό,toModel_ofFloatModel->ϒ,isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite->Ϙ,isInf_eq_false_of_toDyadic?_some->ϡ,abs_signed_mul_bpow_le_toReal_posMaxFinite->ϫ,roundDyadicGeneral_eq_roundDyadic->Ϻ open FloatLib.Numerics.Dyadic renaming cast_toRat->ϖ,toRat_eq_zero_iff->ϲ open Int renaming natAbs_mul->Ϩ,abs_eq_natAbs->Ϲ open Model.Reduction renaming dotWithStatus_eq_zero_of_finite->Ϭ open Model.Reduction.Internal renaming dotState_exact_toRat->ϯ open List renaming foldl_cons->Ϸ local postfix:max "а"=>UInt64.toNat local postfix:max "б"=>USize.toNat local postfix:max "в"=>Array.size local postfix:max "г"=>UInt32.toNat local postfix:max "д"=>FloatArray.size local postfix:max "е"=>Nat.toUSize local postfix:max "ж"=>Nat.toUInt64 local postfix:max "з"=>Nat.log2 local postfix:max "и"=>Fin.val local postfix:max "й"=>UInt64.toUInt32 local postfix:max "к"=>Int.natAbs local postfix:max "л"=>Int.toNat local postfix:max "м"=>Int64.toInt local postfix:max "н"=>UInt32.toUInt64 local postfix:max "о"=>UInt32.toUSize open UInt64 renaming reduceToNat->kA,ofNat->lh,toNat->lq,toNat_div->ml,toNat_or->my,toNat_ofNat->mY,toNat_mod->nB,toNat_toBitVec->nR,size->n0,toNat_one->pS open ExactRuntime renaming expOf->kB,Word->kF,idxOf->kG,mantOf->kM,toDyadic_ofUInt32->kV,toWord->kW,signOf->k9,oneW->ld,windowAt->ll,mantOf_lt_24->lB,decodeD_toRat->lG,ofW->lI,fracOf->lK,ConvShape->lR,Fmt->lU,finishWord->md,finishWord_of_ne->mf,linearSpec->mj,stableNormDomain->mq,dotOf->ms,sqrtRational->mK,expOf_toNat_lt->mO,isFinite_ofUInt32->m6,ofIntDyadic->nb,decodeD->nh,rowMean->no,dallNZ->nC,poolAt->nI,avgpoolSpec->n9,avgpoolWith->pa,ofUInt32_bits->pu,act->p8 open FloatLib.Floats.Formats.BinaryInterchange.FloatFormat renaming binary64->kC open USize renaming reduceToNat->kD,size->kX,toNat_add->lJ,toNat_one->mA,ofNat_add->mC,size_eq_two_pow->nT open FloatLib.Floats.Formats.BinaryInterchange.Model renaming roundDyadic->kE,ofFloatModel->kI,ofUInt32->kT,toReal->ls,unpackedToReal->lw,roundedMantissa_shift_quotient->lF,roundDyadic_of_representable->lL,roundAt_mono->lM,toReal_add_eq_roundAt->mH,isFinite->mN,toNatBits_lt_two_pow->mQ,posMaxFinite->mR,modelSignBit->mS,ofNatBits_toNatBits->m3,roundAt->ns,maximum->nt,ofFloatModel_pack->nu,ofFloat32Model->n5,roundRatScaled->n6,add->pb,fma->pd,div->pf,ofModel->pv,roundAt_zero->pD,pow2->p7 open Nat renaming reduceMod->kH,pow_lt_pow_right->lu,mul_lt_mul_of_lt_of_le->ly,add_right_comm->lO,testBit_eq_decide_div_mod_eq->lW,toUSize_eq->lX,div_div_eq_div_mul->lY,le_mul_of_pos_left->lZ,succ_le_of_lt->l7,le_div_iff_mul_le->mc,le_log2->mu,add_mul_div_left->mv,log2_eq_iff->mz,div_eq_of_lt_le->mG,and_one_is_mod->mP,pow_add->m7,log2_lt->m9,one_shiftLeft->na,reducePow->nr,abs_cast->nE,add_one_mul->nO,cast_ofNat->nZ,one_mul->n4,div_le_div_left->pq,div_mul_le_self->pr,add_assoc->pA,cast_one->pJ,cast_sub->pO,sub_zero->pQ open FloatArray renaming emptyWithCapacity->kJ,size->kS,uget->nN,set!->pY open Array renaming ofFn->kK,getElem?_eq_getElem->lC,emptyWithCapacity->lQ,getElem?_eq_none->l5,ext->mi,replicate->mB,getElem?_ofFn->mE,ext_getElem?->mU,size_map->m0,all_eq_true->np,getElem_push_lt->nU,getElem_push_eq->nV,uset_eq_set->pP open Float.Model.UnpackedFloat renaming unpack->kL,mul->lc,accuracyOfFraction->lP,roundWithAccuracy->nk,unpackExponent->nX,round->pp,isFinite->pE,compare->pI,Sign->pK,pack->pT open UInt32 renaming reduceToNat->kN,ofNat->lA,toNat_ofNat'->lE,toNat_add->mh,toNat->mJ,toNat_zero->nj,toNat_max->nw,toNat_sub_of_le->nG,toNat_or->nK,lt_asymm->nP,toNat_sub->pU open FloatLib.Numerics renaming binaryRadix->kO,shiftRightJam->kQ,Dyadic->kU,roundQuotientEven->la,roundShiftRightEven_shiftRightJam->lS open Finset renaming range->kP,sum_range_succ'->lV,sum_sub_distrib->nF,sum_add_distrib->nJ,sum_mul->n8 open FloatLib.Numerics.Dyadic renaming ofScaledInt->kR,signedSignificand->lr,toReal->mb,cast_signedSignificand->nf,ofScaledInt_toRat->nD,add_toRat->pF,mul_toRat->pG,toRat->pR open Float.Model renaming totalExponent->kY,add->pW,mul->pX open FloatLib.Floats.Formats.Flocq renaming bpow->kZ open Float.Model.Format renaming binary64->k0,binary32->li open FloatLib.Numerics.RationalBinary renaming floorLog2->lf,scaleByPowerOfTwo->l9,scaleByPowerOfTwo_ofNat->mw,lessThanPowerOfTwo->mM,atLeastPowerOfTwo->mZ open List renaming range->lj,foldl_append->l6,range_succ->mD,foldl_nil->mT,range'->pV open FloatLib.Numerics.FixedWord renaming roundShiftRightEven->lk open Float.Model.UnpackedFloat.ExtendedMantissa renaming shiftRightOne->lm open BitVec renaming toInt_eq_toNat_cond->lv open Float32 renaming ofBits->lx open Int renaming cast_zero->lH,cast_abs->mI,ofNat_eq_natCast->nY,ModEq->pe,log->ph open Bool renaming false_ne_true->lN,or_eq_true->nM open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState->lT,State->me open FloatLib.Floats.ExecFloat.Binary renaming toModel_ofFloat_int64ToFloat->ma,toModel_ofFloat->m5 open FloatLib.Numerics.Radix renaming toReal->mg open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->mL,finiteDotSlice->nQ open MulZeroClass renaming zero_mul->nv open System.Platform renaming numBits->nx open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec->ny open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled->nA,toUInt32_ofFields->n7,toUInt32->ps,roundRatScaled->pC open Option renaming some->pj open Min renaming min->po open Decidable renaming not_not->pM open Or renaming inl->pZ open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div->p0 open _root_ renaming zpow_natCast->AA,getElem!_pos->AB,ite_eq_right->AC,ite_eq_left->AD,mul_le_mul_of_nonneg_right->AE,pow_add->AF,zpow_le_zpow_right₀->AG,mul_lt_mul_of_pos_right->AI,decide_eq_true_eq->AJ,zpow_add₀->AK,two_ne_zero->AL,bne_iff_ne->AM,lt_of_lt_of_le->AN,lt_of_le_of_lt->AO,le_rfl->AP,beq_iff_eq->AQ,dite_eq_left->AT,pow_le_pow_right₀->AU,one_div_pow_le_one_div_pow_of_le->AV,abs_of_pos->AW,lt_irrefl->AX,abs_sub_abs_le_abs_sub->AY,le_trans->AZ,abs_nonneg->Aa,zpow_sub₀->Ac,abs_of_nonneg->Ad,abs_mul->Ae,mul_nonneg->Af,abs_add_le->Ag,zero_add->Ai,ne_eq->Ak,ite_false->Am,getElem!_neg->An,lt_trans->Ao,mul_assoc->Ap,decide_eq_true_iff->As,add_zero->Av,abs_sub_comm->Aw,apply_ite->Ax,beq_self_eq_true->Az,abs_le->A3,pow_succ->A4,abs_zero->A5,decide_eq_true->A6,gt_iff_lt->BC,abs_neg->BE,lt_of_mul_lt_mul_right->BF open USize renaming reduceToNat->AH,size->Al,toNat_mul->BO,ofNat_mul->BP open FloatArray renaming emptyWithCapacity->AR open Array renaming emptyWithCapacity->AS,replicate->Ah,ofFn->Aj,mkEmpty->A0,size_uset->BT,size_set!->BU open Nat renaming log2->Aq,div_add_mod'->Au,mod_le->Ay,mul_zero->A7,pos_iff_ne_zero->BD,shiftLeft_zero->BH,one_le_two_pow->BI,eq_or_lt_of_le->BJ,add_sub_cancel->BK,add_sub_of_le->BQ open Model renaming div->Ar,ofFloatModel->BB,toReal_eq->BR open Or renaming inr->BA open UInt32 renaming ofBitVec->BG open Float32 renaming ofBits->BL open Bool renaming not_eq_true'->BM open ZMod renaming natCast_mod->BN open List renaming range'_succ->BS open Float.Model.Format renaming targetExponent->BV section open FloatLib.Numerics @[irreducible] def cm(s:Bool)(m:Nat)(e:Int)(j:Nat)(h:j+25<=mз): kE lU ⟨s,kQ m j,e+j⟩=kE lU ⟨s,m,e⟩:=by have g:m≠0:=by rintro rfl;simp at h have o:2^mз<=m:=ϰ g;have u:2^(j+1)<=m:=AZ (Θ (by norm_num) (by omega)) o;have d:(kQ m j)з=mз-j:=log2_shiftRightJam m j u;have t:kQ m j≠0:=shiftRightJam_ne_zero m j (AZ (Θ (by norm_num) (by omega)) u);rw[<-Ϻ,<-Ϻ];unfold Model.roundDyadicGeneral;simp only[t,g,AQ,Am,d];clear d o u t g;rw[((by omega):((mз-j:Nat):Int)+(e+j)=(mз:Int)+e),show Fmt.fracWidth=23 from rfl,show Fmt.minSubnormalExponent=-149 from rfl,show Fmt.minNormalExponent=-126 from rfl];split_ifs<;>try omega rfl;congr 1;obtain⟨a,v⟩:∃a:Nat,e- -149=Int.negSucc a:=⟨(-(e+149)-1)л,(by omega)⟩;have w:e+j- -149=Int.negSucc (a-j):=(by omega);rw[v,w];dsimp only;rw[((by omega):a-j+1=(a+1)-j)];exact lS m j (a+1) (by omega);congr 1;rw[((by omega):mз-j-23=(mз-23)-j)];exact lS m j _ (by omega) end @[irreducible] def ab(n:Nat)(f:Nat->UInt32)(k:Nat)(d:kf iи)[k]! =f k:=by rw[AB _ k (by simpa using d),Λ] @[noinline]def zPd(a:Array UInt32)(n:Nat):Array UInt32:=if a.size==n then a else a|>.push 1000|>.push 1001|>.push 1002|>.push 1003 @[irreducible] def zI(a:Array UInt32)(n:Nat)(h:a.size=n):zPd a n=a:=by simp[zPd,h] namespace Core noncomputable def tm(a b:Word):Int:=sv a*sv b*2^(idxOf a+idxOf b) noncomputable def af(n:Nat)(fa fb:Nat->Word):Int:=∑k∈Finset.range n,tm (fa k) (fb k) noncomputable def aG(n:Nat)(fa fb:Nat->Word):Prop:=∀k,kexpOf (fa k)≠255/\expOf (fb k)≠255 @[irreducible] def aK(n:Nat)(d e:Nat->kF): af (n+1) d e=af n d e+tm (d n) (e n):=by unfold af;rw[Ν] @[irreducible] def gm(A B:Array UInt32)(i c:Nat): dsum A B i c=∑k∈kP c,tm A[i+k]! B[i+k]!:=by induction c generalizing i with |zero=>simp[dsum] |succ c d=> rw[dsum,d (i+1),lV,add_comm];exact congrArg₂ _ (ϔ rfl λk _=>by rw[((by omega):i+1+k=i+(k+1))]) rfl @[irreducible] def cH(n:Nat)(d e:Nat->kF): dsum (kK (n:=n) λi=>d iи) (kK (n:=n) λi=>e iи) 0 n= af n d e:=by rw[gm,af];exact ϔ rfl λk g=>by rw[ϥ]at g;rw[Κ,ab n d k g,ab n e k g] @[irreducible] def bI(n:Nat)(o p:Nat->kF)(u:aG n o p): ms n o p=md (af n o p) (-298) (decide (n≠0)&& nC (kK (n:=n) λi=>o iи) (kK (n:=n) λi=>p iи) 0 n):=by rw[ms];set A:=kK (n:=n) (o ·и)with q;set B:=kK (n:=n) (p ·и)with t;have m:∀k,kkB A[k]!≠255/\kB B[k]!≠255:=λk j=>by rw[q,t,ab n o k j,ab n p k j];exact u k j have x:∀X:Array kF,Xв=n->(∀k,kkB X[k]!≠255)->∀k (j:k<(X.map (kT (fmt:=lU)))в),mN (X.map (kT (fmt:=lU)))[k]=true:=λX G h k j=>by have w:k(m k j).1;have g:=x B (by simp[t]) λk j=>(m k j).2;have j:∀k,0<=k->k<0+Lв->kB A[k]!≠255/\kB B[k]!≠255:=λk _ F=>m k (by simpa[r,q]using F);have d:nQ L R 0 Lв (by simp) (by simp[l])=(af n o p:ℚ)*2^(-298:ℤ):=(finiteDotSlice_eq A B 0 Lв (by simp[r]) (by simp[r,q,t]) j).trans (by simp[r,q,t,cH]);have y:=ϯ (destination:=lU) L R l e g;rw[dotSpec,Model.dot];by_cases v:af n o p=0;rw[v,finishWord_zero,Ϭ lU L R .nearestEven l e g ((ϲ _).1 (by simp[y,d,v]))];have⟨z,D⟩:=dotStateLoop_flags A B ({}:me lU) 0 Lв (by simp[r]) (by simp[r,q,t]) j;rw[lT,z,D];simp[r,q];rfl;rw[Model.Reduction.dotWithStatus_eq_round_of_finite_nonzero lU L R .nearestEven l e g (by simp[mL L R l,d,v])];exact(mf _ _ _ _ v (by rw[y,d])).symm @[irreducible] def bT(n:Nat)(d e:Nat->kF)(g:aG n d e) (h:af n d e≠0): ms n d e=md (af n d e) (-298) false:=by rw[bI n d e g];simp only[md,h,Am] @[inline]def f5(w:UInt32):UInt64:=if(w>>>23)&&&255!=0 then 1 else 0 @[inline]def mW(w:UInt32):UInt64:=(w&&&8388607)н|||(f5 w<<<23) @[inline]def iW(w:UInt32):UInt64:=((w>>>23)&&&255)н-f5 w noncomputable def ae(x:UInt64):Int:=x.toBitVec.toInt @[irreducible] def gr(w:UInt32):(w&&&8388607)г<2^23:=by rw[Ξ];exact AO ϝ (by decide) @[irreducible] def an(w:UInt32):(mW w)а=kM w:=by have g:=gr w;rw[mW,f5,kM,kB,lK];by_cases d:(w>>>23)&&&255=0 .simp[d] .have e:((w>>>23)&&&255!=0)=true:=by simpa using d simp only[e,d,ite_true,ite_false];rw[my,ϩ,show((1:UInt64)<<<23)а=2^23*1 from rfl,Nat.or_comm,<-Ϥ g,ϻ,Τ] @[irreducible] def am(w:UInt32):(iW w)а=kG w:=by rw[iW,f5,kG,kB];have g:=mO w;rw[kB]at g;by_cases e:(w>>>23)&&&255=0;simp[e];have d:1<=((w>>>23)&&&255)г:=BD.2 λh=>e (Β.1 (by simpa using h));simp only[(by simpa using e:((w>>>23)&&&255!=0)=true),e,ite_true,ite_false];rw[χ _ _ (θ.2 (by simpa[ϩ]using d)),ϩ];rfl @[irreducible] def ap(w:UInt32):k9 w=true↔2^31<=wг:=by rw[k9];have e:=w.toNat_lt;have d:(w&&&0x80000000)г=wг&&&2^31:=by rw[Ξ];rfl rw[Nat.and_two_pow,lW]at d;rw[AM,Ak,<-Β,d];by_cases h:wг/2^31%2=1<;>simp[h]<;>omega @[irreducible] def fy(w:UInt32):(w>>>31!=0)=k9 w:=by have d:(w>>>31)г=wг/2^31:=by rw[Υ];simp[β] have:=w.toNat_lt;rw[ϓ,AM,Ak,<-Β,d,ap];simp @[inline]def sx(k x:UInt64):UInt64:=bif x>>>k==0 then x else x>>>k @[inline]def sr(k x r:UInt64):UInt64:=bif x>>>k==0 then r else r+k @[inline]def ai(x0:UInt64):UInt64:= let x1:=sx 32 x0 let r1:=sr 32 x0 0 let x2:=sx 16 x1 let r2:=sr 16 x1 r1 let x3:=sx 8 x2 let r3:=sr 8 x2 r2 let x4:=sx 4 x3 let r4:=sr 4 x3 r3 let x5:=sx 2 x4 let r5:=sr 2 x4 r4 sr 1 x5 r5 noncomputable def f7(value shift:UInt64):UInt64:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then quotient+1 else if(quotient&&&1)==0 then quotient else quotient+1 @[inline]def de(value shift:UInt64):UInt64:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then 1 else 0) @[inline]def aW(value shift:UInt64):UInt64:= if shift==0 then value else if shift<64 then de value shift else if shift==64 then(if value>0x8000000000000000 then 1 else 0) else 0 @[inline]def c9(sign:Bool)(e f:UInt32):UInt32:= (if sign then(0x80000000:UInt32)else 0)|||((e&&&255)<<<23)|||(f&&&8388607) @[inline]def d0(n:UInt64):UInt32:= (if n<8388608 then 0 else n-8388608)й @[inline]def az(sign:Bool)(product scale:UInt64):UInt32:= if product==0 then if sign then 0x80000000 else 0 else let leading:=ai product let position:=leading+scale if position<172 then let fraction:= if scale<149 then aW product (149-scale)else product<<<(scale-149) if fraction==0 then(if sign then 0x80000000 else 0) else if fraction==8388608 then c9 sign 1 0 else c9 sign 0 fractionй else let roundedMantissa:= if leading<23 then product<<<(23-leading)else aW product (leading-23) let carry:=roundedMantissa==16777216 let normalizedPosition:=if carry then position+1 else position if normalizedPosition>425 then(if sign then 0xff800000 else 0x7f800000) else let normalizedMantissa:=if carry then 8388608 else roundedMantissa c9 sign (normalizedPosition-171)й (d0 normalizedMantissa) open Model.NativeBinary32 in @[irreducible] def bo(n k:Nat)(h:n>>>k≠0):nз=k+(n>>>k)з:=by rw[β]at h⊢;have e:=(mc (϶ k)).1 (ϰ h);have d:=(ϸ (϶ k)).1 (ϙ (n:=n/2^k));rw[mz (by rintro rfl;simp at h)];simp only[Nat.pow_succ,m7]at d⊢;constructor<;>nlinarith @[irreducible] def d7(x:UInt64):xаз<64:=by by_cases h:xа=0 .simp[h] .exact(m9 h).mpr x.toNat_lt @[irreducible] def cx(j r x k:UInt64)(p:kа<=32)(o:0>>k)а=xа>>>kа:=by rw[ν,γ (by omega)] rw[sx,sr];by_cases g:x>>>k=0;simp only[g,Az,Bool.cond_true];use d;simpa[e,β,Nat.div_eq_zero_iff]using congrArg lq g;simp only[(by simpa using g:(x>>>k==0)=false),Bool.cond_false];have q:=bo xа kа λh=>g (ξ.mp (by simpa[e]using h));have l:=d7 j;use(by rw[η,γ (by omega),e];omega);rw[e,β];exact Ϟ (m7 _ _ _▸m.trans_eq (by congr 1;omega)) @[irreducible] def dr(n:Nat)(h:n<2):nз=0:=by rw[Nat.log2_def,AC (by omega)] @[irreducible] def aA(x:UInt64):ai x=x.log2:=by apply ξ.mp;rw[show x.log2а=xазfrom rfl];have d:xа<2^(2*(32:UInt64)а):=x.toNat_lt;have⟨o,e⟩:=cx x 0 x 32 (by decide) (by decide) ((by simp)) d;obtain⟨p,g⟩:=cx x _ _ 16 (by decide) (by decide) o (by simpa using e);obtain⟨q,h⟩:=cx x _ _ 8 (by decide) (by decide) p (by simpa using g);obtain⟨r,j⟩:=cx x _ _ 4 (by decide) (by decide) q (by simpa using h);obtain⟨t,l⟩:=cx x _ _ 2 (by decide) (by decide) r (by simpa using j);obtain⟨u,m⟩:=cx x _ _ 1 (by decide) (by decide) t (by simpa using l);rw[dr (sx 1 (sx 2 (sx 4 (sx 8 (sx 16 (sx 32 x))))))а (by simpa using m)]at u;unfold ai;dsimp only;clear*-u;omega @[irreducible] def gH(v s:UInt64)(o:s≠0)(h:s<64):de v s=f7 v s:=by have g:sа<64:=h;have m:(2:Nat)^sа<0x10000000000000000:=AN (lu (by decide) g) (by rfl);have e:(v&&&((1<<simp[θ,γ g,na,γ m,ζ,BI] have d:((v>>>s)&&&1)а=(v>>>s)а%2:=by simp[Ε,mP] have p:=ϊ vа (϶ sа);have j:((v&&&((1<<>>s)&&&1))а=vа%2^sа+(v>>>s)а%2:=by rw[η,e,d,γ (by omega)] have l:((v>>>s)&&&1==0)=decide ((v>>>s)а%2=0):=by rw[<-d,ϓ,AQ,As,<-ξ,ϋ] unfold de f7;simp only[BC,μ,j,e,l,AJ];clear e d j l m;split_ifs<;>first|rfl|omega|simp @[irreducible] def eP(e d:UInt64): aW e d=lk e dа:=by rw[(by rw[aW];split_ifs with a b<;>first|rfl|exact gH _ _ (by simpa using a) b:aW e d=(if d==0 then e else if d<64 then f7 e d else if d==64 then(if e>0x8000000000000000 then 1 else 0) else 0)),f7,lk];have p:=d.toNat_lt;by_cases g:d=0;subst g;rfl;have j:dа≠0:=λh=>g (ξ.1 (by simpa using h));simp only[g,AQ,j,reduceIte,UInt64.ofNat_toNat,(by apply ξ.1;rw[χ _ _ (by simp[θ];omega)];simp;omega:lh (dа-1)=d-1),<-show(d<64)↔dа<64 from μ,(by rw[<-ξ];rfl:d=64↔dа=64)] open Model.NativeBinary32 in @[irreducible] def eJ(d:Bool)(e f:Nat): c9 d (lA e) (lA f)=mkBits d e f:=by rw[c9,mkBits];cases d<;>rfl @[irreducible] def bY(x:UInt64):xй=lA xа:=(by rfl) @[irreducible] def c5(n:UInt64):d0 n=lA (nа-8388608):=by rw[d0];split<;>rename_i h<;>rw[μ]at h<;>rw[bY] .rw[show nа-8388608=0 by simp at h;omega];rfl .rw[χ _ _ (by rw[θ];simp at h⊢;omega)];rfl open Model.NativeBinary32 in @[irreducible] def bE(g:Bool)(d e:UInt64): az g d e=roundProduct g d e:=by unfold az roundProduct;simp only[aA,eP,c5,bY];rw[show(1:UInt32)=lA 1 from rfl,show(0:UInt32)=lA 0 from rfl];simp only[eJ] open Model.NativeBinary32 in @[irreducible] def bD(w:UInt32):kW (ofUInt32 w)=w:=by have h:=toUInt32_ofUInt32 w;unfold ps at h;unfold kW;conv_rhs=>rw[<-h] exact Β.mp (γ (BitVec.isLt _)) open Model.NativeBinary32 in @[irreducible] def aJ(g:Bool)(m d:UInt64)(h:dа<=506): az g m d=kW (kE lU ⟨g,mа,(dа:Int)-298⟩):=by rw[bE,roundProduct_eq_roundDyadic _ _ _ h,show kE lU ⟨g,mа,(dа:Int)-298⟩=ofUInt32 (roundDyadic ⟨g,mа,Int.ofNat dа-298⟩) from(ofUInt32_roundDyadic _).symm,bD] noncomputable def aw(hi lo:UInt64):Int:=ae hi*2^64+loа @[inline]def aF(hi lo:UInt64):UInt64:=if hi>>>63!=0 then(0:UInt64)-lo else lo @[inline]def aQ(hi lo:UInt64):UInt64:= if hi>>>63!=0 then(if lo==0 then(0:UInt64)-hi else~~~hi)else hi @[irreducible] def gB(d:UInt64):(d>>>63!=0)=decide (2^63<=dа):=by have e:(d>>>63)а=dа/2^63:=by rw[ν];simp[β] have:=d.toNat_lt;rw[ϓ,AM,Ak,<-ξ,e,As];simp @[irreducible] def bN(d e:UInt64): aw d e=(dа*2^64+eа:Int)-(if 2^63<=dаthen 2^128 else 0):=by rw[aw,ae];rw[lv,nR];omega @[irreducible] def fk(e d:UInt64): (aw e d)к=(aQ e d)а*2^64+(aF e d)а/\ decide (aw e d<0)=(e>>>63!=0):=by have m:=e.toNat_lt;have o:=d.toNat_lt;rw[aQ,aF,bN,gB];by_cases j:2^63<=eа;simp only[j,decide_true,ite_true];by_cases g:d=0;subst g;simp only[Az,ite_true,ϋ];rw[Ζ];simp;omega;have l:dа≠0:=λh=>g (ξ.1 (by simpa using h));simp only[show(d==0)=false by simpa using g,υ,Am];rw[Ζ,UInt64.toNat_not];simp;omega;simp only[j,decide_false,υ,ite_false];simp;omega @[inline]def au(hi lo B:UInt64):UInt64:= if hi==0&&lo==0 then 4294967296 else if B>442 then 4294967296 else let neg:=hi>>>63!=0 let mlo:=aF hi lo let mhi:=aQ hi lo if mhi==0 then(az neg mlo B)н else if mhi>>>32==0 then let q:=(mhi<<<32)+(mlo>>>32) (az neg (if mlo&&&0xFFFFFFFF==0 then q else q|||1) (B+32))н else(az neg (if mlo==0 then mhi else mhi|||1) (B+64))н @[irreducible] def toUInt32_toUInt64(x:UInt32):xнй=x:=(by simp) @[irreducible] def i6(e d:UInt64)(h:eа<2^32): (if d&&&0xFFFFFFFF==0 then(e<<<32)+(d>>>32) else((e<<<32)+(d>>>32))|||1)а= kQ (eа*2^64+dа) 32:=by have j:=d.toNat_lt;have l:((e<<<32)+(d>>>32))а=eа*2^32+dа/2^32:=by simp[η,ο,β];omega have g:(d&&&0xFFFFFFFF)а=dа%2^32:=by rw[Ε];exact ζ _ 32 unfold kQ;simp only[((by omega):(eа*2^64+dа)/2^32=eа*2^32+dа/2^32),((by omega):(eа*2^64+dа)%2^32=dа%2^32),(by rw[<-g,ϓ,AQ,As,<-ξ,ϋ]:(d&&&0xFFFFFFFF==0)=decide (dа%2^32=0))];split_ifs<;>simp_all[my] @[irreducible] def i7(e d:UInt64): (if d==0 then e else e|||1)а= kQ (eа*2^64+dа) 64:=by have l:=d.toNat_lt;have g:(eа*2^64+dа)/2^64=eа:=(by omega);have h:(eа*2^64+dа)%2^64=dа:=(by omega);rw[kQ];rw[g,h];by_cases j:dа=0<;>simp[j,my,<-ξ] @[irreducible] def eN(s:Bool)(q B J:UInt64)(M:Nat) (e:qа=kQ M Jа)(h:Bа<=442)(j:Jа<=64) (d:2^(Jа+25)<=M): az s q (B+J)=kW (kE lU ⟨s,M,(Bа:Int)-298⟩):=by have g:(B+J)а=Bа+Jа:=by simp[η];omega rw[aJ _ _ _ (by omega),e,g,<-cm s M _ Jа ((mu (BD.1 (AN (by positivity) d))).2 d)];congr 3;omega @[irreducible] def dq(d e B:UInt64)(h:au d e B<4294967296): aw d e≠0/\Bа<=442/\ (au d e B)й= kW (kE lU (nb (aw d e) ((Bа:Int)-298))):=by obtain⟨m,o⟩:=fk d e;rw[au]at h⊢;by_cases t:(d==0&&e==0)=true;simp[t]at h;simp only[t,υ,ite_false]at h⊢;have w:aw d e≠0:=λj=>t (by rw[bN]at j;simp only[Η,AQ,<-ξ,ϋ];clear m o h;have:=e.toNat_lt;have:=d.toNat_lt;split at j<;>omega);by_cases p:B>442;simp[p]at h;simp only[p,ite_false]at h⊢;have g:Bа<=442:=by simpa[μ]using p refine⟨w,g,?_⟩;rw[nb,o,m];have r:=ν (aQ d e) 32;rw[β]at r;split;rename_i j;rw[(by simpa using congrArg lq (AQ.1 j):(aQ d e)а=0),ϳ,Κ,toUInt32_toUInt64,aJ _ _ _ (by omega)];rename_i j;have v:(aQ d e)а≠0:=λl=>j (by simp[<-ξ,l]);split;rename_i l;have q:(aQ d e)а<2^32:=by have:=congrArg lq (AQ.1 l);simp at this r;omega rw[toUInt32_toUInt64];exact eN _ _ _ 32 _ (i6 _ _ q) g (by decide) (by simp;omega) rename_i l;have u:2^32<=(aQ d e)а:=by by_contra x;apply l;simp[<-ξ];clear*-x;omega rw[toUInt32_toUInt64];exact eN _ _ _ 64 _ (i7 _ _) g (by decide) (by simp;omega) @[irreducible] def aY(n:Nat)(e g:Nat->kF)(l m B:UInt64) (j:aG n e g)(d:af n e g=aw l m*2^Bа) (h:au l m B<4294967296):ms n e g=(au l m B)й:=by have⟨q,r,p⟩:=dq l m B h;have o:af n e g≠0:=d▸mul_ne_zero q (by positivity) rw[bT n e g j o,p];refine mf _ _ _ _ o ?_;rw[toRat_ofIntDyadic,d];push_cast;rw[Ac AL,AA];field_simp @[inline]def ar(N:UInt64):UInt64:=(N+(0x3FFFFFFFFF:UInt64)+((N>>>39)&&&1))>>>39 noncomputable def a8(lb v B:UInt64):UInt64:= let m:=aF v v let L:=ai m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then((v>>>63)<<<31)+((E<<<23)+ar (m<<<(62-L))) else 4294967296 noncomputable def bP(hi lo B:UInt64):UInt64:= let r:=if hi=(0:UInt64)-(lo>>>63)then a8 1 lo B else 4294967296 if r=4294967296 then au hi lo B else r @[irreducible] def gA(n:Bool)(e f:UInt32): (c9 n e f)г=(if n then 2^31 else 0)+eг%2^8*2^23+fг%2^23:=by have h:=ϊ fг ((by positivity):0<2^23);have j:=ϊ eг ((by positivity):0<2^8);have g:((e&&&255)<<<23)г=2^23*(eг%2^8):=by rw[ϴ,Ξ,show(255:UInt32)г=2^8-1 from rfl,ζ,ο,Ϗ];exact γ (by simp;omega) have d:((e&&&255)<<<23|||(f&&&8388607))г=2^23*(eг%2^8)+fг%2^23:=by rw[nK,g,Ξ,show(8388607:UInt32)г=2^23-1 from rfl,ζ,<-Ϥ h] rw[c9,UInt32.or_assoc];cases n .simp only[υ,ite_false,UInt32.zero_or,d];clear*-;omega simp only[ite_true,nK,d];rw[show(0x80000000:UInt32)г=2^31*1 from rfl,<-Ϥ (by omega)];clear*-;omega @[irreducible] def bM(n:Bool)(N g:UInt64)(o:2^62<=Nа)(p:Nа<2^63)(w:110<=gа) (v:gа<363): (az n N g)г=(if n then 2^31 else 0)+((gа-110)*2^23+(ar N)а)/\ 2^23<=(ar N)а/\(ar N)а<=2^24:=by have l:(N>>>39)а=Nа/2^39:=by rw[ν,β];rfl have j:((N>>>39)&&&1)а=Nа/2^39%2:=by rw[Ε,l];exact mP _ have m:(ar N)а=(Nа+274877906943+Nа/2^39%2)/2^39:=by rw[ar,ν,η,η,j,β];simp only[kA,kH];rw[γ (by clear*-p;omega:Nа+274877906943<2^64),γ (by clear*-p;omega)] have e:2^23<=(ar N)а/\(ar N)а<=2^24:=by rw[m];clear*-o p;omega have h:(aW N (62-23))а=(ar N)а:=by show(de N 39)а=_;rw[de,m];simp only[show((1:UInt64)<<<39)-1=0x7FFFFFFFFF from rfl,show(1:UInt64)<<<(39-1)=0x4000000000 from rfl,BC,μ,η,(by rw[Ε];exact ζ _ 39:(N&&&0x7FFFFFFFFF)а=Nа%2^39),j,l,Ax lq,kA,γ (lt_trans (Nat.add_lt_add (ϊ _ (by decide)) (ϊ _ (by decide))) (by decide):Nа%2^39+Nа/2^39%2<2^64)] clear*-p;generalize Nа=x at p⊢;have y:=ϛ x (2^39);have z:=ϊ x ((by decide):2^39>0);generalize x/2^39=q at*;generalize x%2^39=r at*;have i:=ϊ q ((by decide):2>0);generalize q%2=b at*;split ·rw[γ (by omega)];exact(mG (by omega) (by omega)).symm ·rw[γ (by omega)];exact(mG (by omega) (by omega)).symm have q:ai N=62:=by rw[aA];apply ξ.1;rw[show N.log2а=Nазfrom rfl,mz (by omega)];exact⟨o,p⟩ have r:(N==0)=false:=beq_eq_false_iff_ne.2 λk=>by rw[k]at o;exact absurd o (by decide) have x1:(62+g)а=62+gа:=by rw[η];exact γ (by show 62+gа<2^64;clear*-v;omega) refine⟨?_,e⟩;rw[az] simp only[q,r,show¬62+g<172 by rw[μ,x1];show¬62+gа<172;clear*-w;omega,((by decide):¬(62:UInt64)<23),ite_false,υ];generalize aW N (62-23)=R at h⊢;rw[<-h]at e⊢;clear l j m h q o p obtain⟨k,hk⟩:=Nat.exists_eq_add_of_le w;rw[hk]at v x1 by_cases c:R=16777216 ·subst c;have x2:(62+g+1)а=62+(110+k)+1:=by rw[η,x1];exact γ (by show 62+(110+k)+1<2^64;clear*-v;omega) simp only[Az,ite_true] rw[AC (by rw[BC,μ,x2];show¬425<62+(110+k)+1;clear*-v;omega),gA,c5,Ϫ,lE,χ _ _ (by rw[θ,x2];show 171<=62+(110+k)+1;clear*-;omega),x2,hk,ϱ] simp only[kA,Nat.sub_self,Nat.zero_mod] rw[show 62+(110+k)+1-171=k+2 by clear*-;omega,γ (by clear*-v;omega:k+2<2^32),γ (by clear*-v;omega:k+2<2^8)];clear*-;omega ·simp only[AQ,c,ite_false] rw[AC (by rw[BC,μ,x1];show¬425<62+(110+k);clear*-v;omega),gA,c5,Ϫ,lE,χ _ _ (by rw[θ,x1];show 171<=62+(110+k);clear*-;omega),x1,hk,ϱ] obtain⟨s,hs⟩:=Nat.exists_eq_add_of_le (show 8388608<=Rа from e.1);rw[hs]at e⊢ have c':s<2^23:=by have:8388608+s≠16777216:=λi=>c (ξ.1 (hs.trans i));clear*-this e;omega simp only[kA];rw[ϱ,show 62+(110+k)-171=k+1 by clear*-;omega,γ (by clear*-v;omega:k+1<2^32),γ (by clear*-v;omega:k+1<2^8),γ (lt_trans c' (by decide)),γ c'];clear*-;omega @[irreducible] def cl(n:Bool)(M σ:UInt64)(e:Mа≠0)(d:σа<=506): az n M σ=md ((if n then-(Mа:Int)else Mа)*2^σа) (-298) false:=by rw[aJ _ _ _ d];refine(mf _ _ _ _ (mul_ne_zero (by split<;>omega) (by positivity)) ?_).symm;cases n<;>simp[pR,lr,Ac]<;>field_simp @[irreducible] def f9(v:UInt64):(v>>>63=0/\vа<2^63)\/(v>>>63=1/\2^63<=vа):=by have:=v.toNat_lt;simp only[<-ξ,ν];simp[β];omega @[irreducible] def dZ(p v B:UInt64)(r:1<=pа)(g:pа<=2^63)(h:a8 p v B≠4294967296): pа<=(aF v v)а/\(aF v v)а<2^63/\110<=Bа/\Bа<=424/\ a8 p v B=(az (v>>>63!=0) (aF v v) B)н:=by unfold a8 at h⊢;dsimp only at h⊢;split at h;swap;exact absurd rfl h;rename_i E;rw[AD E];have⟨F,q⟩:=E;generalize aF v v=m at F q⊢;have j:pа<=mа/\mа<2^63:=by have:=m.toNat_lt;rw[μ,Ζ,Ζ]at F;simp only[kA]at F;clear*-F r g this;omega have o:mа≠0:=(Nat.lt_of_lt_of_le r j.1).ne';have r:(ai m)а=mаз:=by rw[aA];rfl have t:=ϰ o;have g:=@ϙ mа;have A:=(m9 o).2 j.2;generalize ai m=L at r q⊢;generalize mаз=l at r t g A;have x:(L+B-172)а=l+Bа-172/\172<=l+Bа/\l+Bа<425:=by rw[μ]at q;rw[Ζ,η,r]at q⊢;have:=B.toNat_lt;simp only[kA]at q⊢;clear*-q A this;omega refine⟨j.1,j.2,by clear*-x A;omega,by clear*-x;omega,?_⟩;have D:(62-L)а=62-l:=by rw[Ζ,r];simp only[kA];clear*-A;omega have z:mа*2^(62-l)<2^63:=AN (ϐ g (϶ _)) (by rw[<-AF];exact Θ (by decide) (by clear*-A;omega));have w:(m<<<(62-L))а=mа*2^(62-l):=by rw[ψ,D,ο,γ (by clear*-;omega:62-l<64),γ (lt_trans z (by decide))] have y:2^62<=mа*2^(62-l):=AZ (le_of_eq (by rw[<-AF,BQ (by clear*-A;omega)])) (ι _ t);have u:(B-(62-L))а=Bа-(62-l):=by rw[χ _ _ (by rw[θ,D];clear*-x;omega),D] have⟨K,M,N⟩:=bM (v>>>63!=0) (m<<<(62-L)) (B-(62-L)) (w▸y) (w▸z) (by rw[u];clear*-x A;omega) (by rw[u];clear*-x A;omega);rw[<-ξ,ϩ];have G:az (v>>>63!=0) m B=az (v>>>63!=0) (m<<<(62-L)) (B-(62-L)):=by rw[cl _ m B o (by clear*-x;omega),cl _ (m<<<(62-L)) (B-(62-L)) (by rw[w];exact(Ϯ (ϵ o) (϶ _)).ne') (by rw[u];clear*-x;omega),w,u];refine congrArg (fun t=>md t (-298) false) ?_;obtain⟨d,J⟩:=Nat.exists_eq_add_of_le (by clear*-x A;omega:62-l<=Bа);rw[J,ϱ,AF];generalize(v>>>63!=0)=c;cases c ·simp only[υ,ite_false];rw[Nat.cast_mul,Nat.cast_pow,Nat.cast_ofNat,mul_assoc] ·simp only[ite_true];rw[Nat.cast_mul,Nat.cast_pow,Nat.cast_ofNat,neg_mul,neg_mul,mul_assoc] rw[G,K,u];have H:((v>>>63)<<<31)а=(if(v>>>63!=0)then 2^31 else 0):=by rcases f9 v with⟨e,-⟩|⟨e,-⟩<;>rw[e]<;>rfl have I:((L+B-172)<<<23)а=(l+Bа-172)*2^23:=by rw[ψ,x.1];simp only[kA,kH,ο];exact γ (by clear*-x;omega) rw[η,η,H,I];have T:(if(v>>>63!=0)then 2^31 else 0)<=2^31:=by split;exact le_rfl;exact ϟ _ rw[γ (by clear*-x N;omega:(l+Bа-172)*2^23+(ar (m<<<(62-L)))а<2^64),γ (by clear*-x N T;omega),show Bа-(62-l)-110=l+Bа-172 by clear*-x A;omega] @[irreducible] def fd(d v B:UInt64)(o:1<=dа)(j:dа<=2^63)(h:a8 d v B≠4294967296): a8 d v B=au ((0:UInt64)-(v>>>63)) v B:=by obtain⟨m,-,-,p,e⟩:=dZ d v B o j h;rw[e];have l:v≠0:=by rintro rfl;exact absurd m (by show¬dа<=0;omega) have g:¬B>442:=by simp[μ];omega symm;unfold au aQ aF;rcases f9 v with⟨e,-⟩|⟨e,-⟩;simp[e,l,g];rw[e,show(0:UInt64)-1=0xFFFFFFFFFFFFFFFF from rfl];simp[l,g,show(0xFFFFFFFFFFFFFFFF:UInt64)>>>63=1 from rfl,show~~~(0xFFFFFFFFFFFFFFFF:UInt64)=0 from rfl] @[irreducible] def dY(g d B:UInt64):bP g d B=au g d B:=by unfold bP;dsimp only;by_cases e:g=(0:UInt64)-(d>>>63) .rw[AD e];split .rfl .rename_i h;rw[e];exact fd 1 d B (by decide) (by decide) h .rw[AC e,AD rfl] end Core open Core @[irreducible] def cn(w:kF):kW (lI w)=w:=by apply Β.mp;rw[kW,lI,Model.toNatBits,pu,lE];exact γ w.toBitVec.isLt @[irreducible] def aR(z:Model lU):lI (kW z)=z:=by have h:z.toNatBits<2^32:=mQ z;rw[lI,kW,kT,lE,γ h];exact m3 z namespace Dense @[irreducible] def ac{k n:USize}(h:ksplit<;>push_cast<;>omega @[inline]def bj(x:UInt32):UInt32:=x&&&0x7FFFFFFF @[irreducible] def aM(x:UInt32):(bj x)г=xг%2^31:=by rw[bj];rw[Ξ];exact ζ _ 31 @[irreducible] def aN(x:UInt32):(kB x)г=(bj x)г/2^23:=by have:(kB x)г=xг/2^23%2^8:=by unfold kB;rw[Ξ,Υ];simp only[kN,kH,β];exact ζ _ 8 rw[this,aM,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] @[irreducible] def eZ(x:UInt32):kB x=0↔(bj x)г<2^23:=by rw[<-Β,aN];simp;try omega @[irreducible] def jO(x:UInt32):kG x=(bj x)г/2^23-1:=by have:=aN x;rw[kG];split<;>rename_i h .have:=(eZ x).mp h;omega .have:=mt (eZ x).mpr h;omega @[irreducible] def aT(x:UInt32):kG x=(kB x)г-1:=by rw[jO,aN] @[irreducible] def jW(w:UInt32):wг/2^23=(kB w)г+256*(wг/2^31):=by rw[aN,aM];have:=w.toNat_lt;omega @[irreducible] def bm(x:UInt32):(kB x)г<256:=by rw[aN,aM];omega @[irreducible] def fe(w:UInt32):(w&&&8388607)г=wг%2^23:=by rw[Ξ];exact ζ _ 23 @[irreducible] def eR(w:UInt32):|sv w|<2^24:=by have:=lB w;rw[sv];split<;>simp<;>omega def lz(y n:UInt64):UInt64:=if y=0 then n else lz (y>>>1) (n+1) termination_by yа decreasing_by have:yа≠0:=λe=>by simp_all[<-ξ] rw[ν];simp[β];omega noncomputable abbrev bl(k:Nat):Nat:=if k=0 then 0 else kз+1 @[irreducible] def iZ(y:UInt64):bl yа<=64:=by rw[bl];split;. omega rename_i h;have:=(m9 h).mpr y.toNat_lt;omega @[irreducible] def ed(y:UInt64):(y>>>1)а=yа/2:=by rw[ν];simp[β] @[irreducible] def dA(k:Nat):bl (k/2)=kз:=by rw[bl];rw[Nat.log2_def k];by_cases d:2<=k .rw[AC (by omega),AD d] .rw[AD (by omega),AC d] @[irreducible] def dD(y n:UInt64)(h:nа+bl yа<=64):(lz y n)а=nа+bl yа:=by rw[lz];by_cases d:y=0 .rw[AD d];subst d;simp .rw[AC d];have g:yа≠0:=λe=>d (ξ.mp (by simpa using e));have l:bl yа=bl (yа/2)+1:=by rw[dA];simp[bl,g] have j:(n+1)а=nа+1:=by rw[η];simp;omega rw[dD (y>>>1) (n+1) (by rw[j,ed];omega),j,ed];omega termination_by yа decreasing_by rw[ed];omega @[inline]def lg(x:UInt64):UInt64:=lz (x>>>1) 0 @[irreducible] def i8(x:UInt64):lg x=x.log2:=by apply ξ.mp;rw[lg,dD _ _ (by have:=iZ (x>>>1);simpa using this),ed,dA,ϋ,Κ];rfl @[inline]def c0(lb v B:UInt64):UInt64:= let m:=Core.aF v v let L:=lg m let E:=L+B-172 if m-lb<0x8000000000000000-lb/\E<253 then((v>>>63)<<<31)+((E<<<23)+Core.ar (m<<<(62-L))) else 4294967296 @[irreducible] def ez:c0=a8:=by funext d v B;rw[c0,a8,aA,i8] @[inline]def b9(hi lo B:UInt64):UInt64:= let r:=if hi=(0:UInt64)-(lo>>>63)then c0 1 lo B else 4294967296 if r=4294967296 then Core.au hi lo B else r @[irreducible] def dp:b9=bP:=by funext d e B;rw[b9,bP,ez] @[irreducible] def cD{k:USize}{a:Array UInt32}(h:k>>1>>>(63-s))+(if l'simp only[kA]<;>omega @[specialize]def jG(fa fb:Nat->Word)(n t:Nat)(B:UInt64):UInt64:= if tWord)(n:Nat)(B:UInt64)(t:Nat)(pH pL nH nL:UInt64):UInt64:= if tsplit<;>omega @[irreducible] def fE(d g:Nat->kF)(n:Nat)(B:UInt64)(hn:n<2^18): ∀k t (r u o p:UInt64),n-t=k->t<=n->aG t d g-> rа*2^64+uа<=t*2^108->oа*2^64+pа<=t*2^108-> af t d g=(((rа*2^64+uа:Nat):Int)-((oа*2^64+pа:Nat):Int))* 2^Bа-> dl d g n B t r u o p<4294967296->ms n d g=(dl d g n B t r u o p)й:=by intro k;induction k<;>intro t r u o p hk ht S I G J j .obtain rfl:t=n:=(by omega);rw[dl,AC (by omega)]at j⊢;exact aY _ _ _ _ _ _ S (by rw[J,ku _ _ _ _ (by omega) (by omega)]) j rename_i k e;have X:tby rw[AD h]at j;exact absurd j (by decide) rw[AC Y]at j⊢;simp only[nM,AQ,Η,AM,Ak,AJ,not_or,not_and,μ,kA]at Y;obtain⟨⟨K,M⟩,hw⟩:=Y;have x:aG (t+1) d g:=λs E=>if h:ssimp only[h,Nat.cast_zero,neg_zero,ite_self,zero_mul,mul_zero],Av] rw[AC F]at j⊢;obtain⟨R,O⟩:=hw λh=>F (by simp[h]);have:=idxOf_le _ K;have:=idxOf_le _ M;have Q:(iW (d t)+iW (g t))а=kG (d t)+kG (g t):=by rw[η,am,am,γ (by omega)] rw[Q]at R;have E:(iW (d t)+iW (g t)-B)а=kG (d t)+kG (g t)-Bа:=by rw[χ _ _ (by rw[θ,Q];omega),Q] rw[E]at O;have l:kM (d t)*kM (g t)*2^(kG (d t)+kG (g t)-Bа)<=2^108:=(ϧ v.le (Θ (by norm_num) ((by omega):_<=60))).trans_eq (by norm_num);have W:(2:Int)^(kG (d t)+kG (g t))=2^(kG (d t)+kG (g t)-Bа)*2^Bа:=by rw[<-AF];congr 1;omega generalize w:kM (d t)*kM (g t)*2^(kG (d t)+kG (g t)-Bа)=T at l;have A:tm (d t) (g t)=(if k9 (d t)==k9 (g t)then(T:Int)else-T)*2^Bа:=by rw[<-w];unfold tm sv;rw[W];cases k9 (d t)<;>cases k9 (g t)<;>simp only[beq_iff_eq,υ,Bool.true_eq_false,↓reduceIte]<;>push_cast<;>ring have V:=λH L (ah:Hа*2^64+Lа<=t*2^108)=>fD H L _ _ (by rw[E];omega) (by rw[U,E,w];omega);rw[U,E,w]at V;cases c:(k9 (d t)==k9 (g t))<;>simp only[c,ite_true,Am,υ]at A j⊢ .have q:=V o p G;refine e (t+1) r u _ _ y z x (I.trans m) (by rw[q];exact Ο t _▸Nat.add_le_add G l) ?_ j;rw[D,J,q,A];push_cast;ring have q:=V r u I;refine e (t+1) _ _ o p y z x (by rw[q];exact Ο t _▸Nat.add_le_add I l) (G.trans m) ?_ j;rw[D,J,q,A];push_cast;ring @[inline]def gf(n:Nat)(fa fb:Nat->Word):Word:= let r:=if n<262144 then dl fa fb n (jG fa fb n 0 1023) 0 0 0 0 0 else 4294967296 if r<4294967296 then rйelse dotOf n fa fb @[irreducible] def bO(n:Nat)(d e:Nat->kF):gf n d e=ms n d e:=by unfold gf;dsimp only;by_cases g:n<262144 .rw[AD g];split .exact(fE d e n _ (by omega) _ 0 0 0 0 0 rfl (by exact Nat.zero_le _) (λ_ h=>absurd h (by omega)) ((by simp)) ((by simp)) (by simp[af]) ‹_›).symm .rfl .rw[AC g,AC (by decide)] @[noinline]def aD(n:Nat)(relu:Bool)(X W b:@&Array Word)(xo s j:Nat):Word:= act relu (gf (n+1) (λt=>if tif trfl @[irreducible] def gV(x y:Float)(d:fv x)(e:fv y): kI (x+y).toModel=pb (kI x.toModel) (kI y.toModel):=by change kI (pW x.toModel y.toModel)=_;rw[pW,nu];have h:=Model.add_eq_ofModel_add_of_isFinite (fmt:=kC) (by decide) (kI x.toModel) (kI y.toModel) (by rw[ϒ];exact(fO x).1 d) (by rw[ϒ];exact(fO y).1 e);rw[ϒ,ϒ]at h;exact h.symm @[irreducible] def pm(E:Int)(e:E<=971):(2:ℝ)^E<=ls (mR kC):=by have h:=ϫ kC false 1 E (by decide) (e.trans_eq (by decide));simp only[υ,Am,pJ,one_mul]at h;change|(2:ℝ)^E|<=_ at h;simpa only[AW (zpow_pos ((by norm_num):(0:ℝ)<2) E)]using h open FloatLib.Floats.Formats.Flocq in @[irreducible] def re(x:ℝ)(E:Int)(g:-1021<=E)(e:|x|<(2:ℝ)^E): |Model.roundAt kC x-x|<=(2:ℝ)^(E-53)/2:=by by_cases d:x=0 .subst x;rw[pD,sub_zero,A5];positivity have h:magnitude kO x<=E:=magnitude_le_of_abs_lt_bpow _ x E d e;apply(Model.abs_roundAt_sub_le kC x).trans;apply div_le_div_of_nonneg_right _ (by norm_num);change ulp kO (Model.fexpOf kC) x<=(2:ℝ)^(E-53);rw[ulp.of_ne_zero _ _ x d];change(2:ℝ)^(max (magnitude kO x-53) (-1074))<=(2:ℝ)^(E-53);apply AG (by norm_num);omega @[irreducible] def ii(x y:Float)(d:fv x)(e:fv y)(j:|rv x+rv y|<=ls (mR kC)): fv (x+y)/\rv (x+y)=ns kC (rv x+rv y):=by have h:=gV x y d e;have g:=Model.isFinite_add_of_abs_toReal_add_le_posMaxFinite (kI x.toModel) (kI y.toModel) (by decide) d e j;exact⟨by rwa[fv,h],by rw[rv,h];exact mH _ _ (by decide) d e g⟩ @[irreducible] def e8(x y:Float)(l:fv x)(m:fv y)(E:Int)(j:-1021<=E)(d:E<=971) (e:|rv x+rv y|<(2:ℝ)^E): fv (x+y)/\|rv (x+y)-(rv x+rv y)|<=(2:ℝ)^(E-53)/2:=by have⟨g,h⟩:=ii x y l m (e.le.trans (pm E d));exact⟨g,by rw[h];exact re _ E j e⟩ @[irreducible] def rx(d:kU)(l:d.significand<2^53)(g:-1074<=d.exponent) (e:|d.toReal|<=(2:ℝ)^(971:Int)): ns kC d.toReal=d.toReal:=by have⟨h,j⟩:=lL kC (by decide) d d.significand 0 ((by simp)) l g (e.trans (pm 971 AP));rw[<-ό _ (by decide) d h,j] @[irreducible] def jJ(x y:Float)(o:fv x)(p:fv y)(d:kU)(g:d.toReal=rv x+rv y) (m:d.significand<2^53)(l:-1074<=d.exponent)(e:|d.toReal|<=(2:ℝ)^(971:Int)): fv (x+y)/\rv (x+y)=rv x+rv y:=by have⟨h,j⟩:=ii x y o p (by rw[<-g];exact e.trans (pm 971 AP));exact⟨h,by rw[j,<-g];exact rx d m l e⟩ @[irreducible] def dB(i:Int64)(e:iмк<2^53):fv i.toFloat/\rv i.toFloat=iм:=by have g:kI i.toFloat.toModel=kE kC (kR iм 0):=by have h:=ma i;rw[m5]at h;rw[h,<-Model.ofModel_ofInt_eq_intToFloat kC (by decide)];exact Model.ofModel_ofInt_eq_roundDyadic kC (by decide) _ have d:(kR iм 0).toReal=iм:=by rw[<-ϖ,nD];simp have⟨j,l⟩:=lL kC (by decide) (kR iм 0) iмк 0 (by simp[kR]) e (by simp[kR];decide) (by rw[d];exact AZ (((by rw[<-mI,Ϲ];exact_mod_cast e.le:|(iм:ℝ)|<=(2:ℝ)^(53:Nat)).trans_eq (AA _ _).symm).trans (AG (by norm_num) (by norm_num))) (pm 971 AP));exact⟨by rw[fv,g];exact j,by rw[rv,g,l,d]⟩ @[irreducible] def jP(x y:Float):kI (x*y).toModel= pv kC (lc k0 x.toModel.unpack y.toModel.unpack):=by change kI (pX x.toModel y.toModel)=_;rw[pX,nu] @[irreducible] def iR(b:BitVec 64)(s:pK)(m:Nat)(e:Int)(h:0< m) (d:kL k0 b=.finite s m e h): 2^52<=m\/e=-1074:=by revert d;rw[kL];dsimp only;split;split<;>intro d<;>cases d;split;split;intro d;cases d;rename_i l _;intro d;injection d with _ _ j;right;rw[<-j,l];decide;intro d;injection d with _ g _;left;rw[<-g,BitVec.toNat_append];exact AZ (by decide) Nat.left_le_or @[irreducible] def jo(x y:Float)(G:fv x)(H:fv y)(z:|rv x*rv y|<=(2:ℝ)^(971:Int)): fv (x*y)/\rv (x*y)=ns kC (rv x*rv y):=by have t:=(fO x).1 G;have u:=(fO y).1 H;have E:x.toModel.unpack=kL k0 x.toModel.toBits.toBitVec:=rfl;have F:y.toModel.unpack=kL k0 y.toModel.toBits.toBitVec:=rfl;rw[iL x,iL y]at z⊢;unfold fv rv;rw[jP];generalize x.toModel.unpack=X at t E z⊢;generalize y.toModel.unpack=Y at u F z⊢;cases X<;>cases Y<;>simp only[pE,υ]at t u case finite.finite l o g v m p h w=> have A:=iR _ l o g v E.symm;have B:=iR _ m p h w F.symm;have r:g+h<=BV k0 (kY (o*p) (g+h)):=by change g+h<=max ((Aq (o*p):Int)+1+(g+h)-53) (-1074);apply le_max_iff.2;rcases A with A|A;left;have:=(mu (by positivity)).2 (AZ A (Nat.le_mul_of_pos_right o w));omega;rcases B with B|B;left;have:=(mu (by positivity)).2 (AZ B (lZ p v));omega;right;omega let q:kU:=⟨mS (l*m),o*p,g+h⟩;have D:Model.modelSign (mS (l*m))=l*m:=by cases l<;>cases m<;>rfl have d:q.toReal=lw (.finite l o g v)*lw (.finite m p h w):=by cases l<;>cases m<;>simp only[q,mb,lr,Model.unpackedToReal_finite,mS]<;>simp[kZ,kO,mg,AK ((by norm_num):(2:ℝ)≠0)]<;>ring have j:=Ϙ kC (by decide) q (by rw[d];exact z.trans (pm 971 AP));rw[(by rw[lc,Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ r];simp only[kE,show kC.isIEEE=true from rfl,ite_true,Model.ieeeRoundDyadic,q,D];rfl:pv kC (lc k0 (.finite l o g v) (.finite m p h w))=kE kC q)];exact⟨j,by rw[ό _ (by decide) q j,d]⟩ all_goals simp only[lc,Model.isFinite_ofModel_zero kC (by decide),Model.toReal_ofModel_zero kC (by decide),Model.unpackedToReal_zero,nv,mul_zero,and_self,pD] @[irreducible] def bJ(s:Bool)(m:Nat)(e:Int): (⟨s,m,e⟩:kU).toReal=(if s then-(m:ℝ)else m)*(2:ℝ)^e:=by rw[mb,nf];split<;>simp def pw:Nat->Float | 0=>(1:Int64).toFloat | k+1=>let p:=pw k;p+p @[irreducible] def iJ(k:Nat)(g:k<=900):fv (pw k)/\rv (pw k)=(2:ℝ)^k:=by induction k with |zero=>have:=dB 1 (by decide);rw[F.pw];exact⟨this.1,by rw[this.2];simp⟩ |succ k e=> have⟨f,v⟩:=e (by omega);have d:(⟨false,1,((k+1:Nat):Int)⟩:kU).toReal=(2:ℝ)^(k+1):=by rw[bJ];simp only[υ,Am,pJ,one_mul];exact AA 2 (k+1) have:=jJ (F.pw k) (F.pw k) f f _ (by rw[d,v,A4];ring) ((by decide):(1:Nat)<2^53) ((by omega):(-1074:Int)<=((k+1:Nat):Int)) (by rw[d,AW (by positivity),<-AA];exact AG (by norm_num) (by omega));rw[F.pw];exact⟨this.1,by rw[this.2,v,A4];ring⟩ def nm:Float:=(-1:Int64).toFloat def P:FloatArray:=⟨Aj (n:=512) λi=>if iи<256 then pw (iи-1)else nm*pw (iи-256-1)⟩ @[irreducible] def gL:Pд=512:=by simp[P,kS] @[irreducible] def iV(i:USize)(h:iбif iи<256 then pw (iи-2)else nm*pw (iи-256-2)⟩ @[irreducible] def cp:P2д=512:=by simp[P2,kS] @[irreducible] def eh(i:USize)(h:iб>>24)г=wг/2^24:=by rw[Υ];simp[β] @[irreducible] def eS(w:UInt32):(kB w)г=(w<<<1)г/2^24:=by rw[aN,aM,ϴ];simp only[kN,kH,ο];have:=w.toNat_lt;omega @[irreducible] def dg(w:UInt32):(w>>>23)г=wг/2^23:=by rw[Υ];simp[β] @[inline]def dw(w:UInt32):Float:= (Core.mW w).toInt64.toFloat*P.uget (w>>>23)о (by rw[gL,aC,dg];have:=w.toNat_lt;omega) @[irreducible] def aV(z e:Int):(nb z e).toReal=(z:ℝ)*(2:ℝ)^e:=by rw[<-ϖ,toRat_ofIntDyadic];push_cast;rfl @[irreducible] def aE(x y:Float)(o:fv x)(p:fv y)(z e:Int)(g:rv x*rv y=(z:ℝ)*(2:ℝ)^e) (m:zк<2^53)(l:-1074<=e)(d:|(z:ℝ)*(2:ℝ)^e|<=(2:ℝ)^(971:Int)): fv (x*y)/\rv (x*y)=(z:ℝ)*(2:ℝ)^e:=by have⟨h,j⟩:=jo x y o p (by rw[g];exact d);have:=rx (nb z e) m l (by rw[aV];exact d);rw[aV]at this;exact⟨h,by rw[j,g,this]⟩ @[irreducible] def bg(w:UInt32):(sv w)к<2^24:=by have:=lB w;rw[sv];split<;>simp<;>omega @[irreducible] def bL(a b c:Nat)(e:a+b<=c)(h:c<=971)(z:Int)(g:zк<2^a): |(z:ℝ)*(2:ℝ)^(b:Int)|<=(2:ℝ)^(971:Int):=by rw[Ae,AW ((by positivity):(0:ℝ)<2^(b:Int)),AA];have d:|(z:ℝ)|<=2^a:=by rw[<-mI,Ϲ];exact_mod_cast g.le refine(AE d (by positivity)).trans ?_;rw[<-AF,<-AA];exact AG (by norm_num) (by omega) @[irreducible] def mV(u:UInt64)(n:Nat)(d:uа=n)(e:n<2^25): fv u.toInt64.toFloat/\rv u.toInt64.toFloat=(n:Int):=by have:u.toInt64м=n:=by rw[show u.toInt64м=ae u from rfl,ay,d];split<;>omega rw[<-this];exact dB _ (by rw[this];simp;omega) @[irreducible] def qV(c:Nat)(A:FloatArray)(m:∀i h,A.uget i h=if iб<256 then pw (iб-c)else nm*pw (iб-256-c)) (w:UInt32)(h):fv (A.uget (w>>>23)о h)/\∃σ:Int, (∀v,k9 v=k9 w->σ*kM v=sv v)/\σк=1/\ rv (A.uget (w>>>23)о h)=σ*2^((kB w)г-c):=by have:=bm w;have:=w.toNat_lt;have d:=ap w;have⟨j,l⟩:=iJ ((kB w)г-c) (by omega);rw[m,aC,dg,jW];split .rw[((by omega):(kB w)г+256*(wг/2^31)-c=(kB w)г-c)];exact⟨j,1,λv g=>by rw[sv,g,AC (by rw[d];omega)];ring,rfl,by rw[l];push_cast;ring⟩ .rw[((by omega):(kB w)г+256*(wг/2^31)-256-c=(kB w)г-c)];have e:=dB (-1) (by decide);rw[((by decide):(-1:Int64)м=-1)]at e;have:fv (nm*F.pw ((kB w)г-c))/\rv (nm*F.pw ((kB w)г-c))=((-1:Int):ℝ)*2^(((kB w)г-c:Nat):Int):=aE _ _ e.1 j _ _ (by rw[e.2,l,AA]) (by decide) (by omega) (bL 1 _ 971 (by omega) AP _ (by decide));exact⟨this.1,-1,λv g=>by rw[sv,g,AD (d.mpr (by omega))];ring,rfl,by rw[this.2,AA]⟩ @[irreducible] def dG(c q:Nat)(A:FloatArray)(o:∀i h,A.uget i h=if iб<256 then pw (iб-c)else nm*pw (iб-256-c)) (u:UInt64)(v w:UInt32)(h)(r:q<=2)(x:uа=q*kM v) (t:k9 v=k9 w)(p:(q:ℝ)*2^((kB w)г-c)=2^kG v): fv (u.toInt64.toFloat*A.uget (w>>>23)о h)/\ rv (u.toInt64.toFloat*A.uget (w>>>23)о h)=(sv v:ℝ)*2^kG v:=by have:=lB v;have:=ι (kM v) r;have:=bm w;have⟨g,j⟩:=mV u _ x (by omega);have⟨l,σ,d,m,y⟩:=qV c A o w h;have e:(((q*kM v:Nat):Int)*σ)к<2^25:=by rw[Ϩ,m];simp;omega have:=aE _ _ g l _ ((kB w)г-c:Nat) (by rw[j,y,AA];push_cast;ring) (Ao e (by decide)) (by omega) (bL 25 _ 971 (by omega) AP _ e);exact⟨this.1,by rw[this.2,<-p,AA,<-d v t];push_cast;ring⟩ @[irreducible] def cI(w:UInt32)(_:kB w≠255):fv (dw w)/\rv (dw w)=(sv w:ℝ)*2^kG w:= dG 1 1 P iV _ w w _ (by decide) (by simp[an]) rfl (by simp[aT]) @[irreducible] def dJ(x w:UInt32)(j:kB x≠255)(h:kB w≠255): fv (dw x*dw w)/\rv (dw x*dw w)=(tm x w:ℝ):=by have⟨e,l⟩:=cI x j;have⟨g,m⟩:=cI w h;have d:(sv x*sv w)к<2^48:=by rw[Ϩ];exact(ϕ (bg x) (bg w)).trans_eq (by rfl) have:=aE _ _ e g (sv x*sv w) (kG x+kG w:Nat) (by rw[l,m,AA,AF];push_cast;ring) (Ao d (by decide)) (by omega) (bL 48 _ 971 (by rw[aT,aT];have:=bm x;have:=bm w;omega) AP _ d);refine⟨this.1,?_⟩;rw[this.2,tm,AA];push_cast;ring @[inline]def eF(b:UInt64):UInt64:=(b>>>52)&&&2047 @[inline]def mF(b:UInt64):UInt64:=(b&&&0xfffffffffffff)|||0x10000000000000 @[irreducible] def jT(u:UInt64):(u&&&0x8000000000000000!=0)=(u>>>63!=0):=by apply ϓ.2;simp only[AM,Ak,<-ξ];rw[Ε,ν];change¬uа&&&2^63=0↔¬uа>>>63=0;rw[Nat.and_two_pow,β,lW];have d:uа/2^63<2:=by have:=u.toNat_lt;omega rw[γ d];by_cases e:uа/2^63=1<;>simp<;>omega @[irreducible] def ij(v:Float):kI v.toModel=Model.ofFields kC (v.toBits>>>63!=0) (((v.toBits>>>52)&&&2047)а) ((v.toBits&&&0xfffffffffffff)а):=by have d:Model.expField (kI v.toModel)=((v.toBits>>>52)&&&2047)а:=rfl;have e:Model.fracField (kI v.toModel)=(v.toBits&&&0xfffffffffffff)а:=rfl;have g:Model.signBit (kI v.toModel)=(v.toBits>>>63!=0):=by rw[<-jT];apply ϓ.mpr;simp only[Model.signBit,AM,Ak];rw[<-UInt64.toBitVec_inj];exact Iff.rfl rw[<-Model.ofFields_signBit_expField_fracField (kI v.toModel),d,e,g] @[irreducible] def fq(v:Float):((v.toBits>>>52)&&&2047)а<2^11/\(v.toBits&&&0xfffffffffffff)а<2^52:=by rw[Ε];exact⟨AO ϝ (by decide),AO ϝ (by decide)⟩ @[irreducible] def dV(v:Float)(e:fv v)(g:¬eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)а+2^52, ((eF v.toBits)а:Int)-1075⟩:kU).toReal:=by unfold F.eF at g⊢;have⟨j,l⟩:=fq v;have d:((v.toBits>>>52)&&&2047)а≠0:=λh=>g (ξ.mp (by simpa using h));unfold fv at e;unfold rv;rw[ij]at e⊢;rw[BR,Model.toDyadic?_ofFields_of_isFinite _ _ _ _ j l e,AC d];simp only[show kC.fracWidth=52 from rfl,show kC.exponentBias=1023 from rfl,Model.pow2_eq_two_pow];congr 2<;>(try simp only[nY,nZ])<;>ring @[irreducible] def aR(z:Model lU):lI (kW z)=z:=by have h:z.toNatBits<2^32:=mQ z;rw[lI,kW,kT,lE,γ h];exact m3 z @[irreducible] def ef(w:kF)(d:kB w≠255):ls (lI w)=(sv w:ℝ)*(2:ℝ)^((kG w:Int)-149):=by rw[lI,BR,kV w d];change (nh w).toReal=_;rw[<-ϖ,lG];push_cast;rfl @[irreducible] def iD(w:kF)(j:kB w≠255)(m:w&&&0x7FFFFFFF≠0):ls (lI w)≠0:=by rw[ef w j];refine mul_ne_zero ?_ (zpow_ne_zero _ (by norm_num));have l:kM w≠0:=by rw[kM];split;rename_i d;have e:=(eZ w).1 d;rw[aM]at e;have g:(bj w)г≠0:=λh=>m (Β.1 (h.trans nj.symm));rw[aM]at g;rw[lK,fe];omega;omega rw[sv];split<;>simp[l] @[irreducible] def iN(d e g:kU)(p:d.toReal<=e.toReal)(q:e.toReal<=g.toReal) (E:kW (kE lU d)=kW (kE lU g)) (w:kB (kW (kE lU d))≠255)(F:kW (kE lU d)&&&0x7FFFFFFF≠0) (D:|e.toReal|<=(2:ℝ)^(127:Int)): kW (kE lU e)=kW (kE lU d):=by have j:=aR (kE lU d);have m:=aR (kE lU g);rw[<-E]at m;have o:mN (kE lU d)=true:=by rw[<-j,lI,m6];simpa using w have v:=Ϙ lU (by decide) e (D.trans (by have h:=ϫ lU false (2^23) (127-23) (by decide) (by decide);simp only[υ,ite_false,one_mul]at h;change|((2^23:Nat):ℝ)*(2:ℝ)^((127:Int)-23)|<=_ at h;rwa[((by norm_num):((2^23:Nat):ℝ)*(2:ℝ)^((127:Int)-23)=(2:ℝ)^(127:Int)),AW (by positivity)]at h));have G:=ό lU (by decide) d o;have A:=ό lU (by decide) e v;have H:=ό lU (by decide) g (by rw[<-m,j];exact o);have y:=lM lU p;have z:=lM lU q;have l:=m.symm.trans j;rw[<-G,<-A]at y;rw[<-A,<-H,l]at z;have x:=le_antisymm z y;rw[Model.eq_of_toReal_eq_of_nonzero v o x (by rw[x,<-j];exact iD _ w F)] @[irreducible] def jx(x:Nat)(t:x<2^53)(m:x%2^29≠2^28): (ar (lh (x*2^10)))а=(x+2^28)/2^29:=by have d:(lh (x*2^10))а=x*2^10:=Α (by simp only[n0];omega);generalize lh (x*2^10)=N at d;unfold ar;simp only[ν,η,Ε,d,kA,kH,β,mP];rw[((by omega):x*2^10/2^39=x/2^29)];obtain⟨q,r,p,rfl⟩:∃q r,r<2^29/\x=2^29*q+r:=⟨x/2^29,x%2^29,ϊ _ (by decide),(ϛ x _).symm⟩;rw[((by omega):(2^29*q+r)/2^29=q)];rw[((by omega):(2^29*q+r)%2^29=r)]at m;have o:=ϊ q ((by decide):0<2);have l:q<2^24:=(by omega);rw[γ ((by omega):(2^29*q+r)*2^10+274877906943<2^64),γ ((by omega):(2^29*q+r)*2^10+274877906943+q%2<2^64),show(2^29*q+r)*2^10+274877906943+q%2=(r*2^10+274877906943+q%2)+2^39*q by ring,show 2^29*q+r+2^28=(r+2^28)+2^29*q by ring,mv _ _ (by decide),mv _ _ (by decide),(by grind:(r*2^10+274877906943+q%2)/2^39=(r+2^28)/2^29)] @[inline,irreducible]def ak(S:Float)(h:UInt64):UInt64:= let b:=S.toBits let f:=b&&&0xfffffffffffff let E:=eF b let d:=h+1075-E let g:=(1:UInt64)<<>>29 if d<=26&&E-1195<253&&u-(g+1)<536870911-(g+g)&&r&&&8388607!=0 then ((b>>>63)<<<31)+r-0x255000000 else 4294967296 @[irreducible] def rb(b:UInt64)(h:(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29&&&8388607!=0)=true): 2^28<=(b&&&0xfffffffffffff)а/\(b&&&0xfffffffffffff)а+2^28<2^52:=by simp only[AM,Ak,<-ξ,Ε,ν,η,kA,kH,β]at h⊢;have:=b.toNat_lt;rw[ζ _ 63,ζ _ 23,γ ((by omega):bа%2^63+268435456<2^64),((by omega):bа%2^63+268435456=(bа%2^52+2^28)+bа/2^52%2^11*2^23*2^29),Ρ _ _ (by norm_num),Μ]at h;rw[ζ _ 52];have:=ϊ bа ((by norm_num):0<2^52);clear*-h this;omega @[irreducible] def j3(h E f:UInt64)(w:hа<2^63)(u:Eа<2048)(v:fа<2^52) (o:h+1075-E<=26)(p:E-1195<253) (q:((f+268435456)&&&536870911)-(((1:UInt64)<<<(h+1075-E))+1)< 536870911-(((1:UInt64)<<<(h+1075-E))+((1:UInt64)<<<(h+1075-E)))) (t:2^28<=fа/\fа+2^28<2^52): Eа<=hа+1075/\hа+1075-Eа<=26/\1195<=Eа/\Eа<=1447/\ 2^(hа+1075-Eа)+1<=(fа+2^28)%2^29/\ (fа+2^28)%2^29+2^(hа+1075-Eа)<2^29/\ 2^(hа+1075-Eа)<=fа/\fа+2^(hа+1075-Eа)<2^52:=by rw[θ,Ζ,η]at o;rw[μ,Ζ]at p;simp only[kA]at o p;have g:(h+1075-E)а=hа+1075-Eа:=by rw[Ζ,η];simp only[kA];clear * -o w u;omega generalize y:hа+1075-Eа=k at g⊢;have d:k<=26:=(by clear * -o w u y;omega);have r:((1:UInt64)<<<(h+1075-E))а=2^k:=by rw[ψ,(by rw[g];omega:(h+1075-E)а%64=k),pS,na,γ (lu (by norm_num) (by omega))] have l:2^k<=2^26:=Θ (by norm_num) d;have j:1<=2^k:=BI;have m:∀x:Nat,x&&&536870911=x%2^29:=λx=>ζ x 29;simp only[μ,Ζ,η,Ε,r,kA,m]at q generalize 2^k=G at j l q⊢;clear r g;have z:G+1<=(fа+2^(28:Nat))%2^(29:Nat)/\(fа+2^(28:Nat))%2^(29:Nat)+G<2^(29:Nat):=by clear * -q l j v;rw[γ (by omega:G+1<2^(64:Nat)),γ (by omega:fа+268435456<2^(64:Nat)),γ (by omega:G+G<2^(64:Nat))]at q;omega have a:1195<=Eа/\Eа<=1447:=by clear * -p u;omega have b:G<=fа/\fа+G<2^(52:Nat):=by clear * -t l;omega exact⟨by clear * -o w u;omega,d,a.1,a.2,z.1,z.2,b.1,b.2⟩ @[irreducible] def j4(f G:Nat)(g:1<=G)(h:f<2^52)(j:G+1<=(f+2^28)%2^29) (l:(f+2^28)%2^29+G<2^29)(d:G<=f)(e:f+G<2^52): (f+2^52-G)%2^29≠2^28/\(f+2^52+G)%2^29≠2^28/\ (f+2^52-G+2^28)/2^29=2^23+(f+2^28)/2^29/\ (f+2^52+G+2^28)/2^29=2^23+(f+2^28)/2^29:=by omega @[irreducible] def g0(b:UInt64)(m:1195<=(eF b)а): (((b>>>63)<<<31)+(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-0x255000000)а= bа/2^63*2^31+(((eF b)а-1085-110)*2^23+ (2^23+((b&&&0xfffffffffffff)а+2^28)/2^29)):=by have h:=b.toNat_lt;have e:(F.eF b)а=bа/2^52%2^11:=by unfold F.eF;simp only[Ε,ν,kA,kH,β];exact ζ _ 11 have g:(b&&&0xfffffffffffff)а=bа%2^52:=by rw[Ε];exact ζ _ 52 have j:(b&&&0x7FFFFFFFFFFFFFFF)а=bа%2^63:=by rw[Ε];exact ζ _ 63 have l:(b>>>63)а=bа/2^63:=by simp only[ν,kA,kH,β] have d:bа%2^63=bа/2^52%2^11*2^52+bа%2^52:=(by omega);have q:bа/2^63<2:=(by omega);rw[e]at m⊢;rw[g,Ζ,η,ψ,l,ν,η,j,d];simp only[kA,kH,β,ο];have o:=ϊ (bа/2^52) ((by norm_num):0<2^11);have p:=ϊ bа ((by norm_num):0<2^52);generalize bа/2^52%2^11=E at*;generalize bа%2^52=f at*;generalize bа/2^63=s at*;clear e g j l d h;omega @[irreducible] def ce(S:Float)(hS:fv S)(h:UInt64)(hh:hа<2^63)(T:Int) (L:|rv S-(T:ℝ)|<=(2:ℝ)^(hа:Int))(aL:|(T:ℝ)|<=(2:ℝ)^(425:Int)) (hc:ak S h<4294967296):T≠0/\(ak S h)й=md T (-298) false:=by unfold ak at hc⊢;dsimp only at hc⊢;split at hc;swap;exact absurd hc (by decide);rename_i o;rw[AD o];simp only[Η,AJ]at o;obtain⟨⟨⟨c1,c2⟩,c3⟩,c4⟩:=o;have y:(F.eF S.toBits)а<2048:=(fq S).1;have v:=(fq S).2;obtain⟨d1,d2,e1,e2,X,Y,I,J⟩:=j3 h _ _ hh y v c1 c2 c3 (rb _ c4);clear c1 c2 c3 c4;have D:=g0 _ e1;have x:=dV _ hS (λh0=>by simp[h0]at e1);have A:(S.toBits>>>63)а=S.toBitsа/2^(63:Nat):=by simp only[ν,kA,kH,β] have O:(if(S.toBits>>>63!=0)=true then(2:Nat)^(31:Nat) else 0)=S.toBitsа/2^(63:Nat)*2^(31:Nat):=by have:=S.toBits.toNat_lt;split<;>rename_i Q<;>simp only[AM,Ak,<-ξ,A,ϋ,pM]at Q<;>clear * -this Q<;>omega rw[<-O]at D;clear O A;have d:(F.eF S.toBits-1085)а=(F.eF S.toBits)а-1085:=χ _ _ (θ.mpr (by simp only[kA];omega));have j:(F.eF S.toBits-1085)а<=506:=(by omega);generalize (S.toBits>>>63!=0)=E,F.eF S.toBits-1085=e5 at D x d j;generalize a2:(F.eF S.toBits)а=l at d j D x d1 d2 e1 e2 X Y I J y;generalize hg:2^(hа+1075-l)=G at X Y I J;generalize a3:(S.toBits&&&0xfffffffffffff)а=g at D x X Y I J v;have as:1<=G:=hg▸϶ _ obtain⟨b1,b2,b3,b4,b5,b6,K,z,hq,al,b7,b9⟩:2^(62:Nat)<=(g+2^(52:Nat)-G)*2^(10:Nat)/\(g+2^(52:Nat)-G)*2^(10:Nat)<2^(63:Nat)/\2^(62:Nat)<=(g+2^(52:Nat)+G)*2^(10:Nat)/\(g+2^(52:Nat)+G)*2^(10:Nat)<2^(63:Nat)/\110<=l-1085/\l-1085<363/\G<=g+2^(52:Nat)/\G>>63)<<<31)+(((S.toBits&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-0x255000000)й=R:=by apply Β.mp;rw[F,Ϫ,D,γ];have:(l-1085-110)*2^(23:Nat)<=252*2^(23:Nat):=ι _ al;clear * -this hq;split<;>omega have V:kB R≠255:=by unfold kB;intro Q;have p:=congrArg mJ Q;simp only[Ξ,Υ,F,kN,kH,β]at p;rw[ζ _ 8]at p;clear * -p al hq;split at p<;>omega have W:R&&&0x7FFFFFFF≠0:=by intro Q;have p:=congrArg mJ Q;simp only[Ξ,F,kN]at p;rw[ζ _ 31]at p;clear * -p al hq;split at p<;>omega rw[qv,hR]at*;rw[aJ _ _ _ j,U,d]at V W⊢;rw[aJ _ _ _ j,aJ _ _ _ j,U,n3,d]at r;clear F w3 U n3 qv D d j;generalize g+2^(52:Nat)=Mn at x K z V W r⊢;generalize rv S=sr at x L;rw[bJ]at x;have hU:(2:ℝ)^(hа:Int)=(G:ℝ)*(2:ℝ)^((l:Int)-1075):=by rw[<-hg,Nat.cast_pow,nZ,<-AA,<-AK AL];exact congrArg _ (by clear * -d1;omega) have t(m:Nat):((m*2^(10:Nat):Nat):ℝ)*(2:ℝ)^(((l-1085:Nat):Int)-298)=(m:ℝ)*(2:ℝ)^((l:Int)-1075)*2^(-298:Int):=by have e:(2:ℝ)^(10:Int)*(2:ℝ)^(((l-1085:Nat):Int)-298)=(2:ℝ)^((l:Int)-1075)*(2:ℝ)^(-298:Int):=by rw[<-AK AL,<-AK AL,(by clear * -b5;omega:(10:Int)+(((l-1085:Nat):Int)-298)=((l:Int)-1075)+(-298))] rw[Nat.cast_mul,Nat.cast_pow,nZ,<-zpow_ofNat,mul_assoc,e,mul_assoc] have q:(0:ℝ)<(2:ℝ)^(-298:Int):=(by positivity);have N:|(nb T (-298)).toReal|<=(2:ℝ)^(127:Int):=by rw[aV,Ae,AW q];exact(AE aL q.le).trans_eq (AK AL _ _).symm have hu:(0:ℝ)<(2:ℝ)^((l:Int)-1075):=(by positivity);have aH:(G:ℝ)simp only[υ,Am,ite_true]at x<;>rw[x]at w B<;>have M:T≠0:=λh0=>by linarith only[w,B,mul_pos (sub_pos.2 aH) hu,(Int.cast_eq_zero.2 h0:(T:ℝ)=0)] all_goals refine⟨M,?_⟩;unfold md;rw[AC M] refine(iN _ _ _ ?_ ?_ r.symm V W N).symm;pick_goal 3;rw[<-r]at V W;refine((iN _ _ _ ?_ ?_ r V W N).trans r).symm all_goals (rw[aV,bJ];simp only[υ,Am,ite_true,neg_mul];rw[t];push_cast[pO K]) linear_combination (2:ℝ)^(-298:Int)*B;linear_combination (2:ℝ)^(-298:Int)*w;linear_combination (2:ℝ)^(-298:Int)*B;linear_combination (2:ℝ)^(-298:Int)*w noncomputable def ao(p:Nat->Float)(n t:Nat)(a:Float):Float:= if tInt)(e:Int)(B:ℝ)(g:∀tintro _;simpa using d |succ t h=> intro j;rw[Ν,<-add_assoc];push_cast;linarith[Ag ((e:ℝ)+∑s∈kP t,(z s:ℝ)) (z t),h (by exact Nat.le_of_lt (by assumption)),g t (by assumption)] structure A8 where a0:Float a1:Float a2:Float a3:Float a4:Float a5:Float a6:Float a7:Float local instance:Inhabited A8:=⟨⟨0,0,0,0,0,0,0,0⟩⟩ @[inline]def A8.f(s:A8):Nat->Float | 0=>s.a0 | 1=>s.a1 | 2=>s.a2 | 3=>s.a3 | 4=>s.a4 | 5=>s.a5 | 6=>s.a6 | _=>s.a7 structure A9 where a0:Float a1:Float a2:Float a3:Float a4:Float a5:Float a6:Float a7:Float o:Word @[inline]def A9.s(R:A9):A8:=⟨R.a0,R.a1,R.a2,R.a3,R.a4,R.a5,R.a6,R.a7⟩ local instance:Inhabited A9:=⟨⟨0,0,0,0,0,0,0,0,0⟩⟩ @[inline]def mX(w:UInt32):UInt64:=(((w&&&8388607)<<<1)+16777216)н @[inline]def dX(w:UInt32):Float:= (mX w).toInt64.toFloat*P2.uget (w>>>23)о (by rw[cp,aC,dg];have:=w.toNat_lt;omega) noncomputable def nW(w:Word):Word:=if expOf w=0 then w+16777216 else if expOf w=1 then w+8388608 else w noncomputable def di(x w:Word):Int:=Core.tm x (nW w) @[irreducible] def jt(w:kF):(nW w)г=wг+(2-(kB w)г)*2^23:=by have g:=aN w;have:=aM w;have:=w.toNat_lt;rw[nW];by_cases d:kB w=0;rw[d]at g;rw[AD d,mh,d];simp only[nj,kN]at g⊢;omega;by_cases e:kB w=1;rw[e]at g;rw[AC d,AD e,mh,e];simp only[UInt32.toNat_one,kN]at g⊢;omega;rw[AC d,AC e];have:(kB w)г≠0:=λh=>d (Β.1 (h.trans nj.symm));have:(kB w)г≠1:=λh=>e (Β.1 (h.trans UInt32.toNat_one.symm));omega @[irreducible] def eL(w:kF):(kB (nW w))г=max 2 (kB w)г/\k9 (nW w)=k9 w/\ kM (nW w)=2^23+wг%2^23/\kG (nW w)=max 2 (kB w)г-1:=by have n:=jt w;have e:=aN w;have:=aM w;have g:=aN (nW w);have:=aM (nW w);have:=w.toNat_lt;have d:(kB (nW w))г=max 2 (kB w)г:=(by omega);refine⟨d,ϓ.mpr (by rw[ap,ap];omega),?_,by rw[aT,d]⟩;rw[kM,lK,AC λh=>by rw[h]at d;simp at d;omega,fe];omega @[irreducible] def js(w:kF):nW w=w\/kG w=0/\kG (nW w)=1:=by by_cases h:(kB w)г<=1 .exact .inr ⟨by rw[aT];omega,by rw[(eL w).2.2.2];omega⟩ .exact .inl (Β.mp (by rw[jt];omega)) @[irreducible] def jr(w:UInt32):(mX w)а=2*kM (nW w):=by unfold mX;rw[(eL w).2.2.1,ϩ,mh,ϴ,fe];simp only[kN,kH,ο];omega @[irreducible] def j6(w:UInt32):fv (dX w)/\rv (dX w)=(sv (nW w):ℝ)*2^kG (nW w):=by obtain⟨-,d,-,e⟩:=eL w exact dG 2 2 P2 eh _ _ w _ AP (jr w) d (by rw[e,((by omega):max 2 (kB w)г-1=(kB w)г-2+1),A4];push_cast;ring) @[irreducible] def uk{i k:USize}{S:Nat}(d:kб<8)(h:iб+8<=S)(e:S<2^32): (i+k)бdX (W.uget i hi) @[specialize]def k8(W:Array Word)(X:FloatArray)(ou n:USize)(hs:Wв<2^32/\Xд<2^32) (hW:ouб+nб<=Wв) (t i:USize) (hi:iб+8*(nб-tб)<=Xд) (a0 a1 a2 a3 a4 a5 a6 a7:Float) (o:Word)(load:LD W:=ld0 W):A9:= if h:t>>24⟩ termination_by nб-tб decreasing_by have:=ε.mp h;rw[ac h];omega @[irreducible] def fU(W:Array kF)(X:FloatArray)(w n:USize)(K:Wв<2^32/\Xд<2^32) (G:wб+nб<=Wв) (B r:Nat) (Q:r<8): ∀m (t i:USize) (y:iб+8*(nб-tб)<=Xд) (d g j l p q u v:Float) (o:kF), nб-tб=m->iб=B+8*tб-> (λR:A9=>R.s.f r= ao (λs=>X.data[B+8*s+r]!*dX W[wб+s]!) nб tб (A8.f ⟨d,g,j,l,p,q,u,v⟩ r)/\ (∀s,tб<=s->s(kB W[wб+s]!)г<=R.oг)/\ oг/2^24<=R.oг) (k8 W X w n K G t i y d g j l p q u v o):=by intro m;induction m<;>intro t i y d g j l p q u v o J A have h:¬tby have:=ε.mp h;omega rw[k8,dif_neg h,ao,AC (by assumption)];exact⟨rfl,λs E D=>(by omega),(fu o).ge⟩;rename_i M;have h:tby rw[cC,aj (by have:=ς;omega)] rw[k8,AT h,ao,AD L];dsimp only;have I:=λ{d g j l p q u v o y}=>M (t+1) (i+8) y d g j l p q u v o (by rw[ac h];(clear*-J L;omega)) (by rw[ac h,F,A];ring);refine⟨I.1.trans ?_,λs E D=>?_,AZ (ϭ (by rw[nw];omega)) I.2.2⟩ .rw[ac h];congr 1;have N:∀(c:USize)(H:cб<8)(x:(i+c)бby rw[ug,aj (by have:=ς;omega),A] interval_cases r<;>(simp only[A8.f,ld0];rw[N _ (by simp only[kD];omega),z];simp only[kD]) by_cases e:s=tб .subst e;refine AZ ?_ I.2.2;rw[eS];apply ϭ;rw[nw,z];omega exact I.2.1 s (by rw[ac h];omega) D @[irreducible] def bW(Y:FloatArray)(v:Float):(Y.push v)д=Yд+1:=by rcases Y with⟨d⟩;simp[FloatArray.push,kS] @[irreducible] def jA(Y:FloatArray)(i:Nat)(v:Float):(Y.set! i v)д=Yд:=by rcases Y with⟨d⟩;simp[pY,kS] @[irreducible] def sg(Y:FloatArray)(i q:Nat)(v:Float)(e:qFloat)(N:Nat)(Y:FloatArray):FloatArray:= if YдFloat)(N:Nat):∀k (Y:FloatArray),N-Yд=k->Yд<=N-> (bQ f N Y)д=N/\(∀qq(bQ f N Y).data[q]! =f q:=by intro k;induction k<;>intro Y l j .rw[bQ,AC (by omega)];exact⟨(by omega),λq _=>rfl,λ_ _ _=>(by omega)⟩ rename_i p;rw[bQ,AD (by omega)];have r:=bW Y (f Yд);have⟨m,g,o⟩:=p (Y.push (f Yд)) (by omega) (by omega);refine⟨m,λq e=>?_,λq h d=>?_⟩;rw[g q (by omega),pg _ _ _ (by omega),AD e];by_cases e:q=Yд;subst e;rw[g _ (by omega),pg _ _ _ (by omega),AC (AX _)];exact o q (by omega) d def DR(W:Array Word):FloatArray:= bQ (fun i=>dX W[i]!) W.size (FloatArray.emptyWithCapacity W.size) @[irreducible] def DRok(W:Array Word): (DR W).size=W.size∧∀idX W[i]!) W.size W.size (FloatArray.emptyWithCapacity W.size) (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) exact⟨h.1,fun i hi=>h.2.2 i (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) hi⟩ @[noinline]def DPEq(a b:@&Array Word):Bool:=withPtrEq a b (fun _=>a==b) (fun h=>by subst b;simp) @[irreducible] def DPEq_ok{a b:Array Word}(h:DPEq a b=true):a=b:=by change (a==b)=true at h exact eq_of_beq h @[irreducible] def jp(v:Float)(h:(eF v.toBits)а<2047):fv v:=by rw[fv,ij,Model.isFinite_ofFields _ _ _ _ (fq v).1 (fq v).2];change(v.toBits>>>52&&&2047)а<2047 at h;rw[show kC.encoding=.ieee from rfl,((by decide):kC.expAllOnesNat=2047),AM,Ak];omega @[irreducible] def fK(v:Float)(o:fv v):|rv v|<(2:ℝ)^(((eF v.toBits)а:Int)-1022):=by by_cases g:F.eF v.toBits=0 .have d:=(fq v).2;have l:((v.toBits>>>52)&&&2047)а=0:=by rw[F.eF]at g;rw[g];rfl rw[g,rv,ij,l,ϋ,Nat.cast_zero,zero_sub];generalize (v.toBits&&&0xfffffffffffff)а=m at d⊢;by_cases e:m=0 .rw[e,Model.toReal_eq_zero_of_isZero _ (by rw[Model.isZero_ofFields _ _ _ _ (by decide) (by decide)];rfl),A5];positivity rw[Model.toReal_ofFields_subnormal _ _ _ e d,((by decide):FloatFormat.binary64.minSubnormalExponent=-1074),kZ,kO,mg];have h:|(if v.toBits>>>63!=0 then(-1:ℝ)else 1)|=1:=by split<;>simp rw[Ae,Ae,h,one_mul,nE];have j:(m:ℝ)<2^(52:Nat):=by exact_mod_cast d rw[AW (by positivity)];push_cast;exact(AI j (by positivity)).trans_eq (by rw[<-AA,<-AK AL];norm_num) rw[dV v o g,bJ];have d:(v.toBits&&&0xfffffffffffff)а+2^52<2^53:=by have:=(fq v).2;omega generalize (v.toBits&&&0xfffffffffffff)а+2^52=M at d⊢;have h:|(if v.toBits>>>63!=0 then-(M:ℝ)else M)|=M:=by split<;>simp rw[Ae,h,Ad (by positivity)];have j:(M:ℝ)<2^(53:Nat):=by exact_mod_cast d exact(AI j (by positivity)).trans_eq (by rw[<-AA,<-AK AL];congr 1;push_cast;ring) @[irreducible] def jz(x y:Float)(r:fv x)(t:fv y)(q:fv (x+y))(E:Int)(l:-1074<=E)(u:E<=971) (h:|rv (x+y)|<(2:ℝ)^E):|rv x+rv y|<(2:ℝ)^E:=by have p:=gV x y r t;have v:=mH (kI x.toModel) (kI y.toModel) (by decide) r t (by rw[fv]at q;rwa[<-p]);have j:rv (x+y)=ns kC (rv x+rv y):=by unfold rv;rw[p,v] have m:|(2:ℝ)^E|<=(2:ℝ)^(971:Int):=by rw[AW (by positivity)];exact AG (by norm_num) u have g:=rx ⟨false,1,E⟩ (by norm_num) l (by rw[bJ];simpa using m);have e:=rx ⟨true,1,E⟩ (by norm_num) l (by rw[bJ];simpa using m);rw[bJ]at g e;simp only[υ,ite_false,ite_true,pJ,one_mul,neg_mul]at g e;rw[j]at h;have w:=abs_lt.mp h;by_contra o;push Not at o;rcases le_abs'.mp o with d|d<;>have:=lM kC d<;>simp only[e,g]at this<;>linarith @[specialize]def sT(p:Nat->Float)(n t:Nat)(a:Float)(m:UInt64):Float×UInt64:= if trename_i h<;>rw[μ]at h<;>omega @[irreducible] def jg(p:Nat->Float)(n:Nat):∀k t a m,n-t=k->mа<=(sT p n t a m).2а:=by intro k;induction k<;>intro t a m h<;>rw[sT];rw[AC (by omega)];rename_i d;rw[AD (by omega)];dsimp only;have:=d (t+1) (a+p t) (if mFloat)(z:Nat->Int)(u:Int)(n K:Nat)(x:1<=K)(y:K<=1993) (E:∀tt<=n->fv a-> |rv a-((u:ℝ)+∑s∈kP t,(z s:ℝ))|<=t*(2:ℝ)^((K:Int)-1076)-> (sT p n t a M).2а<=K-> fv (sT p n t a M).1/\ |rv (sT p n t a M).1-((u:ℝ)+∑s∈kP n,(z s:ℝ))|<=n*(2:ℝ)^((K:Int)-1076):=by intro m;induction m with |zero=>intro t a M D Q e o g;obtain rfl:t=n:=(by omega);rw[sT,AC (AX _)];exact⟨e,o⟩ |succ m G=> intro t a M D Q e o g;have d:tlinarith only[H,I,J,L,N] @[irreducible] def cw(n:Nat)(d e:Nat->kF)(g:aG n d e)(S:Float)(m:fv S)(h:UInt64) (q:hа<2^63)(o:|rv S-(af n d e:ℝ)|<=(2:ℝ)^(hа:Int)) (l:|(af n d e:ℝ)|<=(2:ℝ)^(425:Int))(p:ak S h<4294967296): (ak S h)й=ms n d e:=by have⟨j,r⟩:=ce S m h q _ o l p;rw[r,bT n d e g j] def aO(A:Array Word)(i:USize)(m:UInt32):UInt32:= if h:i>>23)&&&255 aO A (i+1) (if m mг<=(aO A i m)г/\∀q,iб<=q->q(kB A[q]!)г<=(aO A i m)г:=by intro k;induction k with |zero=>intro i m l;rw[aO,dif_neg (λh=>by have:=cD h;omega)];exact⟨AP,λq g d=>absurd d (by omega)⟩ |succ k v=> intro i m l;have h:iby split<;>rename_i j<;>rw[Ι]at j<;>omega have⟨t,u⟩:=v (i+1) (if m<(A.uget i (cD h)>>>23)&&&255 then(A.uget i (cD h)>>>23)&&&255 else m) (by rw[ac h];omega);rw[r]at t;refine⟨(by omega),λq g d=>?_⟩;by_cases o:q=iб;subst o;rw[<-cC A i (cD h),kB];omega;exact u q (by rw[ac h];omega) d @[irreducible] def bd(A:Array kF)(j:Aвby simp[e]at d g;omega,by rw[aT];omega⟩ noncomputable def bi(b:Bool)(x:Float)(w:UInt32):Float:= if b then(x*P2.uget (w>>>23)о (by rw[cp,aC,dg];have:=w.toNat_lt;omega))*(mX w).toInt64.toFloat else x*dX w @[irreducible] def iH(b:Bool)(x w:UInt32)(v:kB x≠255)(_:kB w≠255): fv (bi b (dw x) w)/\rv (bi b (dw x) w)=di x w:=by obtain⟨j,m⟩:=cI x v;obtain⟨-,-,l,q⟩:=eL w;have h1:=bm x;have h2:=bm w;have h3:=aT x;unfold bi di tm;split .obtain⟨e,s,u,r,h⟩:=qV 2 P2 eh w (by rw[cp,aC,dg];have:=w.toNat_lt;omega);obtain⟨o,p⟩:=mV _ _ (jr w) (by rw[l];omega);have t:kG (nW w)=(kB w)г-2+1:=by rw[q];clear * -q;omega have g:(sv x*s)к<2^24:=by rw[Ϩ,r,ϻ];exact bg x have d:(sv x*s*((2*kM (nW w):Nat):Int))к<2^49:=by rw[Ϩ];exact(ϕ g (by rw[l,Int.natAbs_natCast];clear * -l;omega:_<2^25)).trans_eq (by norm_num) have a:=aE _ _ j e (sv x*s) (kG x+((kB w)г-2):Nat) (by rw[m,h,AA,AF];push_cast;ring) (Ao g (by norm_num)) (by clear * -g;omega) (bL 24 _ 971 (by clear * -h1 h2 h3;omega) AP _ g);have b:=aE _ _ a.1 o (sv x*s*((2*kM (nW w):Nat):Int)) (kG x+((kB w)г-2):Nat) (by rw[a.2,p];push_cast;ring) (Ao d (by norm_num)) (by clear * -g;omega) (bL 49 _ 971 (by clear * -h1 h2 h3;omega) AP _ d);exact⟨b.1,by rw[b.2,t,<-u _ (eL w).2.1,AA];push_cast;ring⟩ obtain⟨e,h⟩:=j6 w;have d:(sv x*sv (nW w))к<2^48:=by rw[Ϩ];exact(ϕ (bg x) (bg _)).trans_eq (by norm_num) have:=aE _ _ j e (sv x*sv (nW w)) (kG x+kG (nW w):Nat) (by rw[m,h,AA,AF];push_cast;ring) (Ao d (by norm_num)) (by clear * -d;omega) (bL 48 _ 971 (by clear * -h1 h2 h3 q;omega) AP _ d);exact⟨this.1,by rw[this.2,AA];push_cast;ring⟩ noncomputable def bC(k:Nat->Bool)(p:Nat->Float)(n t:Nat)(a:Float):Float:= if tFloat)(n:Nat):∀m t a,n-t=m->ao p n t a=bC (λ_=>false) p n t a:=by intro m;induction m<;>intro t a h<;>rw[ao,bC] .grind .grind @[irreducible] def bz(w v:kF)(d:kB w≠255)(h:(dw w==0)=true):tm w v=0:=by change ((dw w).toModel.unpack.compare (0:Float).toModel.unpack==pj .eq)=true at h;rw[show(0:Float).toModel.unpack=.zero .positive from rfl]at h;have e:=(cI w d).2;rw[iL]at e;revert h e;rcases(dw w).toModel.unpack with(_|_)|_|s|⟨_|_,_,_,_⟩<;>simp+contextual[pI,lw,Model.unpackedToDyadic?,tm] @[irreducible] def dL(k:Nat->Bool)(p:Nat->Float)(z:Nat->Int)(d:Int)(P L n:Nat) (Q:∀tz t=0)(V:∀tt<=n->fv a-> |rv a-((d:ℝ)+∑s∈kP t,(z s:ℝ))|<=t*((2:ℝ)^(P+L)*2^(-54:Int))-> fv (bC k p n t a)/\ |rv (bC k p n t a)-((d:ℝ)+∑s∈kP n,(z s:ℝ))|<=n*((2:ℝ)^(P+L)*2^(-54:Int)):=by have K:=cv n z d _ V v;have X:(2:ℝ)^L*2^L*2^(-54:Int)<=1:=by rw[<-AF,<-AA,<-AK AL];exact zpow_le_one_of_nonpos₀ (by norm_num) (by push_cast;omega) have q:(0:ℝ)<2^(-54:Int):=(by positivity);have u:(0:ℝ)<2^P:=(by positivity);have r:(0:ℝ)<2^L:=(by positivity);intro m;induction m with |zero=>intro t a O S o j;obtain rfl:t=n:=(by omega);rw[bC,AC (AX _)];exact⟨o,j⟩ |succ m y=> intro t a O S o j;have h:tFloat)(h:oб+8?_⟩;unfold s8;simp(disch:=(simp only[AH];omega)) only[aj,kD];(iterate 7 rw[sg _ _ _ _ (by simp only[jA];exact d)]);rw[sg _ _ _ _ d];by_cases c:oб<=q/\qrfl;rw[AC c,AC (by omega:¬oб+7=q),AC (by omega:¬oб+6=q),AC (by omega:¬oб+5=q),AC (by omega:¬oб+4=q),AC (by omega:¬oб+3=q),AC (by omega:¬oб+2=q),AC (by omega:¬oб+1=q),AC (by omega:¬oб=q)] @[irreducible] def gD(X:Array kF)(k:Nat):X.getD k 0=X[k]!:=by rw[Array.getD];split<;>rename_i h .rw[AB X k h];rfl .rw[An X k h];rfl @[inline]def xr(X:Array Word)(q st:USize)(r:Nat):Float:=dw (X.getD (q+rе*st)б 0) def bx(X:Array Word)(st s:USize):Nat->USize->USize->FloatArray->FloatArray | 0,_,_,Y=>Y | k+1,q,o,Y=>bx X st s k (q+s) (o+8) (s8 Y o (xr X q st 0) (xr X q st 1) (xr X q st 2) (xr X q st 3) (xr X q st 4) (xr X q st 5) (xr X q st 6) (xr X q st 7)) @[irreducible] def gk(X:Array kF)(d s:USize):∀k (q o:USize) (Y:FloatArray), qб+k*sб+8*dб+oб+8*koб+8*k<=Yд-> (bx X d s k q o Y)д=Yд/\(∀pr<8->(bx X d s k q o Y).data[oб+8*τ+r]! =dw X[qб+τ*sб+r*dб]!:=by intro k;induction k with |zero=>intro q o Y _ _;exact⟨rfl,λ_ _=>rfl,λτ r h=>absurd h (by omega)⟩ |succ k y=> intro q o Y v A;rw[Ο]at v;have:=ς;have:=nT;obtain⟨l,t⟩:=gJ Y o (xr X q d) (by omega);have u:(q+s)б=qб+sб:=aj (by omega);have g:(o+8)б=oб+8:=by rw[aj (by simp;omega)];simp obtain⟨w,e,x⟩:=y (q+s) (o+8) _ (by omega) (by rw[l];omega);rw[g]at e;rw[u,g]at x;refine⟨by rw[bx,w,l],λp B=>by rw[bx,e p (by omega),t p (by omega),AC (by omega)],λτ r z j=>?_⟩;rw[bx];rcases τ with _|τ .have m:(rе*d)б=r*dб:=by rw[BO,aa (by omega),γ (by have:=ι dб j.le;omega)] rw[e _ (by omega),t _ (by omega),AD (by omega),((by omega):oб+8*0+r-oб=r),xr,aj (by rw[m];have:=ι dб j.le;omega),m,gD];simp .rw[(by clear * -j;omega:oб+8*(τ+1)+r=oб+8+8*τ+r),Ο τ sб,(by clear * -j;omega:qб+(τ*sб+sб)+r*dб=qб+sб+τ*sб+r*dб)];exact x τ r (Nat.lt_of_succ_lt_succ z) j def ZT:Array FloatArray:=Aj (n:=10) λk=>⟨Ah (2^(kи+7)) 0⟩ def zT(n:Nat):FloatArray:= let k:=Aq (8*n)+1-7 if k<10 then ZT[k]!else⟨Ah (8*n) 0⟩ @[irreducible] def jH(n:Nat):8*n<=(zT n)д/\((zT n)д=8*n\/(zT n)д<=2^16):=by unfold zT;dsimp only;split .rw[AB ZT _ (by simp[ZT];assumption)] simp only[ZT,Λ,kS,Array.size_replicate];exact⟨(ϙ (n:=8*n)).le.trans (Θ (by decide) (by omega)), .inr (Θ (by decide) (by omega))⟩ .simp[kS] def dQ(X:Array Word)(st s n b:Nat)(Z:FloatArray):FloatArray:= if b+n*s+s+8*st+8*n<=4294967295 then bx X stе sе n bе 0 Z else⟨Aj (n:=8*n) λp=>dw X[b+pи/8*s+pи%8*st]!⟩ @[irreducible] def fF(X:Array kF)(d s n b:Nat)(Z:FloatArray)(l:8*n<=Zд): 8*n<=(dQ X d s n b Z)д/\((dQ X d s n b Z)д=Zд\/(dQ X d s n b Z)д=8*n)/\ ∀τ r,τr<8->(dQ X d s n b Z).data[8*τ+r]! =dw X[b+τ*s+r*d]!:=by unfold dQ;split .have:=ς;have:=gk X dе sе n bе 0 ‹FloatArray›;simp only[Dense.aa ((by omega):dby rw[<-j τ r e g,Κ]⟩ .refine⟨by simp[kS],.inr (by simp[kS]),λτ r e g=>?_⟩;rw[AB _ _ (by simp;omega),Λ];dsimp only;rw[((by omega):(8*τ+r)/8=τ),((by omega):(8*τ+r)%8=r)] def bZ(t:Bool)(X:Array Word)(R n rb:Nat)(Z:FloatArray):FloatArray:= dQ X (if t then 1 else n) (if t then R else 1) n (if t then 8*rb else 8*rb*n) Z @[inline]def yR(XT:Array FloatArray)(n ow:Nat)(W b:Array Word)(hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв) (rb o:Nat)(work:=k8 W):A9:= let xt:=XT[rb]! let bp:=dw oneW*dw b[o]! if h:8*n<=xtд/\xtд<=4294967295/\oFloat)(bpf:Unit->Float)(aB:Unit->Word):Word:= let r:=sT p n 0 (bpf ()) 0 let c:=if 1<=r.2а/\r.2а<=1993/\1076<=r.2а+L then ak r.1 (r.2а+L-1076)жelse 4294967296 if c<4294967296 then act relu cйelse aB () @[inline]def tf(relu:Bool)(S:Float)(hh:UInt64)(sl:Unit->Word):Word:= let c:=ak S hh if c<4294967296 then act relu cйelse sl () @[inline]def tw(relu:Bool)(S:Float)(hh:UInt64)(L n:Nat)(p:Nat->Float)(bpf:Unit->Float) (aB:Unit->Word):Word:=tf relu S hh λ_=>tS relu L n p bpf aB @[inline]def hG(e:Word)(ix ib L:Nat):Bool×UInt64:= let p:=48+ix+max (eг-1) 55 (decide (e<255/\p+L<=425),(max p ib+2*L-54)ж) @[inline]def tG(relu:Bool)(S:Float)(e:Word)(ix ib L:Nat)(sl fb:Unit->Word):Word:= let h:=hG e ix ib L if h.1 then tf relu S h.2 sl else fb () @[irreducible] def jE(g:Bool)(n:Nat)(d e:Nat->kF)(p:Nat->Float)(h:Unit->Float)(u:UInt64)(P L:Nat) (B:Unit->kF) (K:∀sE s M.le) (E n AP) n AP).trans ?_;have y:(n:ℝ)+1<=2^L:=mod_cast((by omega):n+1<=2^L);refine(AE y (by positivity)).trans ?_;rw[<-AF,<-AA];exact AG (by norm_num) (by omega) unfold tw tf tS;dsimp only;split .rename_i w;rw[cw _ _ _ j _ I u (by omega) v o w] generalize A:sT p n 0 (h ()) 0=r;split .rename_i t;split .rename_i w;have⟨m,l⟩:=iM _ _ (tm (d n) (e n)) n r.2а t.1 t.2.1 K n 0 _ 0 rfl (by omega) q.1 (by simp[q.2]) (by rw[A]) rw[A,<-F]at l;rw[A]at m;have H:((r.2а+L-1076)ж)а=r.2а+L-1076:=by rw[Ϣ,Α (by rw[n0];omega)] refine congrArg _ (cw _ _ _ j _ m _ (by omega) (l.trans ?_) o w);rw[H];refine(AE y (by positivity)).trans_eq ?_;rw[<-AA,<-AK AL];exact congrArg (λz:Int=>(2:ℝ)^z) (by omega) .exact G .rw[AC (by decide)];exact G @[irreducible] def gb(g:Bool)(n j:Nat)(l:Nat->kF)(W b:Array kF)(p q:Nat->Float)(e:kF) (t E L F:Nat)(B:Unit->kF)(k:Nat->Bool) (A:∀s(kB W[j*n+s]!)г<=eг) (hf:eг<255->∀s(kB W[j*n+s]!)г<255)(K:kB b[j]!≠255/\kG b[j]!<=F)(al:174+F<=E)(H:n+2<=2^L)(r:L<=27) (S:E+L<=425) (hp:∀sfv (p s)/\rv (p s)=tm (l s) W[j*n+s]!) (hq:∀sfv (q s)/\rv (q s)=di (l s) W[j*n+s]!) (z:∀s∀v,tm (l s) v=0) (U:B ()=p8 g (ms (n+1) (λs=>if sif stS g L n p (λ_=>dw ld*dw b[j]!) B) B= p8 g (ms (n+1) (λs=>if sif skG W[j*n+s]!<=G):=λs d=>by cases m:k s;have:=hw s d m;exact⟨λh=>by rw[h]at this;simp at this;omega,λ_=>by rw[aT];omega⟩;exact⟨λh=>by have:=hf C s d m;simp[h]at this,nofun⟩ generalize T:max (48+t+G) E=P;have y:(P+2*L-54)жа=P+2*L-54:=by rw[Ϣ,Α (by rw[n0];omega)] have J:∀s≤n,|(tm ((λs=>if sif sby dsimp only;split;rename_i w;cases m:k s;exact(dh _ _ t G (A s w).2 ((o s w).2 m)).trans (AU (by norm_num) (by omega));rw[z s w m,lH,A5];positivity;exact(dh _ _ 126 F (by decide) K.2).trans (AU (by norm_num) (by omega)) have u:=dJ ld b[j]! (by decide) K.1;have⟨V,O⟩:=dL k q (λs=>di (l s) W[j*n+s]!) (tm ld b[j]!) P L n (λs d=>hq s d (o s d).1) (λs d h=>z s d h _) (λs d=>by rw[di];rcases js W[j*n+s]!with h|⟨-,h⟩;exacts[by rw[h];simpa only[AD d]using J s d.le,(dh _ _ t 1 (A s d).2 h.le).trans (AU (by norm_num) (by omega))]) (by simpa only[AX,Am]using J n AP) H r (by omega) n 0 _ rfl (ϟ _) u.1 (by rw[u.2,Finset.sum_range_zero,add_zero,sub_self,A5,Nat.cast_zero,zero_mul]);have X:∀c≤1,(2:ℝ)^(48+t+c)<=2^P*2^(-54:Int):=λc _=>by rw[<-AA,<-AA,<-AK AL];exact AG (by norm_num) (by omega) have Q:=cv n (λs=>tm (l s) W[j*n+s]!-di (l s) W[j*n+s]!) 0 (2^P*2^(-54:Int)+2^P*2^(-54:Int)) (λs d=>by rw[di];rcases js W[j*n+s]!with h|⟨Y,D⟩;rw[h,sub_self,lH,A5];positivity;push_cast;exact(abs_sub _ _).trans (add_le_add ((dh _ _ t 0 (A s d).2 Y.le).trans (X 0 (by omega))) ((dh _ _ t 1 (A s d).2 D.le).trans (X 1 AP)))) (by rw[lH,A5];positivity) n AP;simp only[lH,Ai,Int.cast_sub,nF]at Q;have R:(af (n+1) (λs=>if sif sby rw[AD (ϥ.1 d),AD (ϥ.1 d)]) have x:(0:ℝ)<2^P*2^(-54:Int):=(by positivity);have I:(0:ℝ)<2^L:=(by positivity);refine jE g n _ _ p _ _ P L B (λs d=>by rw[AD d,AD d];exact hp s d (o s d).1) (by rw[AC (AX n),AC (AX n)];exact u) (λs _=>by split;exacts[⟨(A s ‹_›).1,(o s ‹_›).1⟩,⟨(by decide),K.1⟩]) J H r (by omega) y U _ V ?_;rw[R,y,((by omega):((P+2*L-54:Nat):Int)=(P:Int)+L+L+(-54)),AK AL,AK AL,AK AL];rw[AF]at O;simp only[AA];have D:=sub_nonneg.2 (by exact_mod_cast H:(n:ℝ)+2<=2^L);rw[A3]at O Q⊢;have h1:=Af D (mul_pos x I).le;have h2:=Af D x.le;exact⟨by linear_combination O.1+Q.2+h1+2*h2+2*x,by linear_combination O.2+Q.1+h1+2*h2+2*x⟩ @[irreducible] def gg(X:FloatArray)(i:Nat):X.get! i=X.data[i]!:=by rcases X with⟨d⟩;rfl @[irreducible] def f8(v:Float)(r:Nat):A8.f ⟨v,v,v,v,v,v,v,v⟩ r=v:=by unfold A8.f;split<;>rfl @[inline]def us(a:Array Word)(ok:Bool)(p:Nat)(w:Unit->Word):Array Word:= if h:ok/\pNat->Array Word->Array Word)(u v:Nat)(a:Array Word): Array Word:= if uxb.get! (8*s+c)*dw W[o+s]!) (λ_=>dw oneW*dw b[j]!) λ_=>aD n relu X W b xo st j @[inline]def pN(t:Bool)(R C n:Nat)(relu:Bool)(X W b:Array Word)(XT:Array FloatArray)(h:Bool×UInt64) (L:Nat) (a:Array Word) (i j:Nat) (S:Float):Array Word:= us a (decide (iif h.1 then tf relu S h.2 (λ_=>sN n relu X W b XT L i j (if t then i else i*n) (if t then R else 1)) else aD n relu X W b (if t then i else i*n) (if t then R else 1) j @[inline]def b8(t:Bool)(R n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв) (XT:Array FloatArray) (rb o:Nat) (a:Array Word)(work:=k8 W):Array Word:= let s:=yR XT n ow W b hs hW rb o work let h:=hG s.o ix ib L let i:=8*rb pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L (pN t R ow n relu X W b XT h L a i o s.s.a0) (i+1) o s.s.a1) (i+2) o s.s.a2) (i+3) o s.s.a3) (i+4) o s.s.a4) (i+5) o s.s.a5) (i+6) o s.s.a6) (i+7) o s.s.a7 @[noinline,specialize]def L8(t:Bool)(R n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв)(XT:Array FloatArray)(work:=k8 W):Array Word:= l2 ((R+7)/8) ow (b8 (work:=work) t R n ow relu X W b ix ib L hs hW XT) 0 0 (Ah (R*ow) 0) @[inline]def c6(t:Bool)(R n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв)(work:=k8 W):Array Word:= let Z:=zT n L8 t R n ow relu X W b ix ib L hs hW (Aj (n:=(R+7)/8) λrb=>bZ t X R n rbи Z) work @[irreducible] def kt(a:Array kF)(d:Bool)(p:Nat)(w:Unit->kF):(us a d p w)в=aв:=by rw[us];split<;>simp @[irreducible] def ks(a:Array kF)(d:Bool)(p:Nat)(w:Unit->kF)(q:Nat): (us a d p w)[q]?=if d=true/\q=p/\qkF)(g:Array kF):∀(e:List (Bool×Nat×(Unit->kF))) (a:Array kF) (S:Nat->Prop),(∀x∈e,x.1=true->x.2.1x.2.2 ()=F x.2.1)->aв=gв-> (∀q,(a[q]?=g[q]?\/a[q]?=pj (F q))/\(S q->qa[q]?=pj (F q)))-> (e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)в=gв/\∀q, ((e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=g[q]?\/ (e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=pj (F q))/\ ((S q\/∃x∈e,x.1=true/\q=x.2.1)->q (e.foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=pj (F q)):=by intro e;induction e with |nil=>intro a S _ l m;simp only[mT];exact⟨l,λq=>⟨(m q).1,λd j=>(m q).2 (d.resolve_right (by simp)) j⟩⟩ |cons x e v=> intro a S p l m;rw[Ϸ];have:=v (us a x.1 x.2.1 x.2.2) (λq=>S q\/x.1=true/\q=x.2.1) (λy r=>p y (List.mem_cons_of_mem _ r)) (by rw[kt,l]) λq=>by rw[ks];split<;>rename_i h;obtain⟨o,rfl,t⟩:=h;rw[p x List.mem_cons_self o (l▸t)];exact⟨BA rfl,λ_ _=>rfl⟩;refine⟨(m q).1,λd j=>?_⟩;rcases d with d|⟨o,rfl⟩;exact(m q).2 d j;exact absurd ⟨o,rfl,l▸j⟩ h refine⟨this.1,λq=>⟨(this.2 q).1,λd j=>(this.2 q).2 ?_ j⟩⟩;rcases d with d|⟨y,r,u⟩;exact pZ (pZ d);grind -ring @[irreducible] def km(F:Nat->kF)(a:Array kF)(g:Nat->Bool×Nat×(Unit->kF)) (l:∀r,r<8->(g r).1=true->(g r).2.1(g r).2.2 ()=F (g r).2.1): (((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)в=aв/\∀q, ((((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=a[q]?\/ (((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=pj (F q))/\ ((∃r,r<8/\(g r).1=true/\q=(g r).2.1)->q (((lj 8).map g).foldl (λa x=>us a x.1 x.2.1 x.2.2) a)[q]?=pj (F q)):=by have:=kl F a ((lj 8).map g) a (λ_=>False) (by simp only[List.mem_map,List.mem_range];rintro x⟨r,d,rfl⟩;exact l r d) rfl λq=>⟨pZ rfl,False.elim⟩ exact⟨this.1,λq=>⟨(this.2 q).1,λ⟨r,d,e,h⟩ j=>(this.2 q).2 (BA ⟨g r,List.mem_map.mpr ⟨r,List.mem_range.mpr d,rfl⟩,e,h⟩) j⟩⟩ @[irreducible] def gy(U V:Nat)(f:Nat->Nat->Array kF->Array kF)(F:Nat->kF)(C:Nat->Nat->Nat->Prop) (x:∀u v a,uv(f u v a)в=aв/\∀q,((f u v a)[q]?=a[q]?\/ (f u v a)[q]?=pj (F q))/\(C u v q->q(f u v a)[q]?=pj (F q)))(u v:Nat)(a:Array kF): (∀q,(∃d g,dqa[q]?=pj (F q))-> (l2 U V f u v a)в=aв/\ ∀q,(∃d g,dq(l2 U V f u v a)[q]?=pj (F q):=by induction u,v,a using l2.induct U V f with |case1 u v a h p r=>intro o;rw[l2,AD h,AD p];have⟨y,B⟩:=x u v a h p;have⟨z,A⟩:=r (λ_ _ _=>by grind only[cases Or]);exact⟨z.trans y,λq w e=>A q w (by omega)⟩ |case2 u v a h p r=>intro o;rw[l2,AD h,AC p];exact r λq ⟨d,g,j,l,t,m⟩ e=>o q ⟨d,g,j,l,(by omega),m⟩ e |case3 u v a h=>intro o;rw[l2,AC h];exact⟨rfl,λq ⟨d,g,j,l,m⟩ e=>o q ⟨d,g,j,l,(by omega),m⟩ e⟩ @[irreducible] def ip(U V N:Nat)(f:Nat->Nat->Array kF->Array kF)(F:Nat->kF)(C:Nat->Nat->Nat->Prop) (l:∀u v a,uv(f u v a)в=aв/\∀q,((f u v a)[q]?=a[q]?\/ (f u v a)[q]?=pj (F q))/\(C u v q->q(f u v a)[q]?=pj (F q))) (j:∀q,q∃u v,uF qи:=by have⟨p,e⟩:=gy U V f F C l 0 0 (mB N 0) λq ⟨r,t,_,_,h,_⟩ _=>(by omega) apply mU;intro q;by_cases d:qkF) (y:∀i j,ijtG d ((yR l n h W b p m (i/8) j).s.f (i%8)) (yR l n h W b p m (i/8) j).o v u L (λ_=>sN n d X W b l L i j (if t then i else i*n) (if t then R else 1)) (λ_=>aD n d X W b (if t then i else i*n) (if t then R else 1) j)= F (if t then j*R+i else i*h+j))(g o:Nat)(z:oq (b8 t R n h d X W b v u L p m l g o a)[q]?=pj (F q)):=by have e:b8 t R n h d X W b v u L p m l g o a=((lj 8).map λr=>(decide (8*g+rtG d ((yR l n h W b p m g o).s.f r) (yR l n h W b p m g o).o v u L (λ_=>sN n d X W b l L (8*g+r) o (if t then 8*g+r else(8*g+r)*n) (if t then R else 1)) λ_=>aD n d X W b (if t then 8*g+r else(8*g+r)*n) (if t then R else 1) o)).foldl (λa x=>us a x.1 x.2.1 x.2.2) a:=(by rfl);rw[e];refine km F a _ λr A w _=>?_;have:=y (8*g+r) o (by simpa using w) z;rwa[(by clear * -A;omega:(8*g+r)/8=g),(by clear * -A;omega:(8*g+r)%8=r)]at this @[irreducible] def gz(t:Bool)(R n e:Nat)(d:Bool)(X W b:Array kF)(r p L:Nat) (m:Wв<2^32/\8*n<2^32)(l:e*n<=Wв)(N:Nat)(z:R*e=N)(F:Nat->kF) (B:∀i j,ij tG d ((yR (kK (n:=(R+7)/8) λg=>bZ t X R n gи (zT n)) n e W b m l (i/8) j).s.f (i%8)) (yR (kK (n:=(R+7)/8) λg=>bZ t X R n gи (zT n)) n e W b m l (i/8) j).o r p L (λ_=>sN n d X W b (kK (n:=(R+7)/8) λg=> bZ t X R n gи (zT n)) L i j (if t then i else i*n) (if t then R else 1)) (λ_=>aD n d X W b (if t then i else i*n) (if t then R else 1) j)= F (if t then j*R+i else i*e+j)): c6 t R n e d X W b r p L m l=kK (n:=N) λq=>F qи:=by subst z;unfold c6 L8;dsimp only;refine ip _ _ _ _ F _ (λu v a _ D=>gj t R n e d X W b r p L m l _ F B u v D a) λq o=>?_ have E:0by subst h;simp at o have A:0by subst h;simp at o cases t .have y:=ϛ q e;have w:q/ep8 e (ms (n+1) (λs=>if sif sp8 e (ms (n+1) (λs=>if sif s?_ have N(a c m:Nat)(h:c< m):(a*m+c)/m=a/\(a*m+c)%m=c:=⟨by rw[Τ,Ρ _ _ (by omega),ώ h,Κ],by rw[Τ,Μ,γ h]⟩;have o:=fF X (if t then 1 else n) (if t then d else 1) n (if t then 8*(i/8)else 8*(i/8)*n) _ (jH n).1;have w:8*n<=(bZ t X d n (i/8) (zT n))д/\(bZ t X d n (i/8) (zT n))д<=4294967295/\∀srw[h]<;>rcases(jH n).2 with h|h<;>omega,λs g=>?_⟩;rw[o.2.2 s (i%8) g (ϊ _ (by decide))];congr 2;cases t<;>simp only[↓reduceIte,υ] .rw[((by ring):8*(i/8)*n+s*1+i%8*n=(8*(i/8)+i%8)*n+s),ϛ] .omega have z:(kK (n:=(d+7)/8) λM=>bZ t X d n Mи (zT n))[i/8]! =bZ t X d n (i/8) (zT n):=by rw[AB _ _ (by simp;omega),Λ] unfold sN yR;simp only[gg,z];rw[AT ⟨w.1,w.2.1,F⟩];have G:nеб=n:=Dense.aa (by have:=ς;omega);have u:(j*n)еб=j*n:=by have I:(j+1)*n<=l*n:=ι n F;rw[Ο]at I;exact Dense.aa (by have:=ς;omega) rw[(fU _ _ _ _ _ _ 0 (i%8) (by omega) _ _ _ _ _ _ _ _ _ _ _ _ _ rfl ((by simp))).1];simp only[f8,G,u,Ϧ,Κ];rw[dM _ _ _ _ _ rfl];refine(gb e n j (λs=>X[if t then i+s*d else i*n+s]!) W b _ _ _ x v L y _ (λ_=>false) (λ_ _=>D _) (λs g _=>?_) (λ_ _ _ h=>absurd h lN) (K j) A J p r (λs g B=>?_) (λs g B=>?_) (λ_ _ h=>absurd h lN) (by cases t<;>simp only[aD,bO,ϻ,↓reduceIte,υ])).trans ?_ .calc(kB W[j*n+s]!)г=(kB W[(j*n)еб+s]!)г:=by rw[u] _<=_:=(fU _ _ _ _ _ _ 0 0 (by omega) _ _ _ _ _ _ _ _ _ _ _ _ _ rfl ((by simp))).2.1 s ((by simp)) (by rw[G];exact g) .rw[w.2.2 s g];exact dJ _ _ (D _).1 B .rw[w.2.2 s g];exact iH false _ _ (D _).1 B .cases t<;>simp only[↓reduceIte,υ,N j i d O,N i j l F] @[irreducible] def uo{d n t k:USize}{S:Nat}(m:kб<8)(h:dб+8*nб<=S)(o:S<2^32) (p:tбWord->Word)(h:Word->Word)(W:Array Word)(ou n t:USize)(hs:Wв<2^32) (hW:ouб+8*nб<=Wв) (ht:tбkF->kF)(h:kF->kF)(P:kF->Nat)(q:∀x y,P x<=P (g x y)/\P y<=P (g x y)) (W:Array kF)(d n t:USize)(l:Wв<2^32)(j:dб+8*nб<=Wв) (m:tбjF (c:=c) l j m u v;have L:∀{z x y},P z<=P x->P z<=P (g x y):=(·.trans (q _ _).1);have R:∀{z x y},P z<=P y->P z<=P (g x y):=(·.trans (q _ _).2);rw[m8];simp(disch:=simp) only[p,kD];exact⟨L AP,λr w=>by interval_cases r;exacts[R (L (L (L AP))),R (L (L (R AP))),R (L (R (L AP))),R (L (R (R AP))),R (R (L (L AP))),R (R (L (R AP))),R (R (R (L AP))),R (R (R (R AP)))]⟩ @[specialize]def kw(W:Array Word)(X:FloatArray)(ou n:USize)(hs:Wв<2^32) (hW:ouб+8*nб<=Wв) (hX:nб<=Xд) (z:Float) (t:USize) (a0 a1 a2 a3 a4 a5 a6 a7:Float) (o f:Word)(load:LD W:=ld0 W):A9:= if h:t>>24⟩ termination_by nб-tб decreasing_by all_goals (rw[ac h];omega) @[irreducible] def d5(W:Array kF)(X:FloatArray)(d n:USize)(K:Wв<2^32) (H:dб+8*nб<=Wв) (S:nб<=Xд) (z:Float) (r:Nat) (Q:r<8):∀m (t:USize) (g j l p q u v A:Float) (o f:kF),nб-tб=m-> (λR:A9=>R.s.f r= bC (λs=>X.data[s]! ==z) (λs=>bi false X.data[s]! W[dб+nб*r+s]!) nб tб (A8.f ⟨g,j,l,p,q,u,v,A⟩ r)/\ (∀s,tб<=s->s(X.data[s]! ==z)=false->(kB W[dб+nб*r+s]!)г<= R.oг)/\ oг/2^24<=R.oг/\ (R.oг<255->(kB f)г<255/\∀s,tб<=s->s(X.data[s]! ==z)=true-> (kB W[dб+nб*r+s]!)г<255)) (kw W X d n K H S z t g j l p q u v A o f):=by intro m;induction m<;>intro t g j l p q u v A o f V .have:¬tб(by omega),by split<;>simp only[fu,kN]<;>omega,λG=>⟨?_,λs N B _=>(by omega)⟩⟩;split at G;exacts[Ι.1 ‹_›,by simp only[fu,kN]at G<;>omega] rename_i ih;have h:tjF (c:=c) K H L D U;have M:=dE max (.<<<1) mJ (λx y=>by rw[nw];omega) W d n t K H L o;have F:=dE (. ||| ·) bj (λw=>(kB w)г) eo W d n t K H L f;have I:=λ{g j l p q u v A o f}=>ih (t+1) g j l p q u v A o f (by omega);rw[kw,AT h,bC,AD L];dsimp only by_cases D:(X.data[tб]! ==z)=true<;>simp only[Y,D,υ,↓reduceIte]<;>refine⟨I.1.trans ?_,λs N B E=>if e:s=tбthen(by subst e;first|exact Bool.noConfusion (D.symm.trans E)|exact AZ (by rw[eS];exact ϭ (M.2 r Q)) I.2.2.1)else I.2.1 s (by omega) B E,AZ (ϭ (by first|exact M.1|exact AP)) I.2.2.1,λG=>?_⟩<;>try(have J:=I.2.2.2 G;exact⟨by first|exact AO F.1 J.1|exact J.1,λs N B E=>if e:s=tбthen(by subst e;first|exact absurd E D|exact AO ((eA _).ge.trans (F.2 r Q)) J.1)else J.2 s (by omega) B E⟩) all_goals rw[ac h] congr 1;interval_cases r<;>(simp only[A8.f,kH,Nat.reduceBEq,ld0,bi,υ,↓reduceIte];rw[O _ _ (by simp only[kD];omega)];simp only[kD]) @[irreducible] def j8(g:Nat->Float)(r:Nat)(d:r<8): A8.f ⟨g 0,g 1,g 2,g 3,g 4,g 5,g 6,g 7⟩ r=g r:=by interval_cases r<;>rfl @[inline]def yW(xr:FloatArray)(n ow:Nat)(W b:Array Word)(hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв) (g:Nat)(work:=kw W):A9:= let bq:=λr=>dw oneW*dw b[min (8*g) (ow-8)+r]! if h:xrд=n/\8<=ow then work xr (min (8*g) (ow-8)*n)е nе hs.1 (by have h1:(min (8*g) (ow-8)+8)*n<=ow*n:=ι n (by omega);have:=ς;rw[Ϡ]at h1;rw[aa (by omega),aa (by omega)];omega) (by have:=ς;rw[aa (by omega)];omega) 0 0 (bq 0) (bq 1) (bq 2) (bq 3) (bq 4) (bq 5) (bq 6) (bq 7) 0 0 else default @[specialize]def da{α:Type}(f:Nat->α)(N:Nat)(a:Array α):Array α:= if aвα)(N:Nat): da f N (lQ N)=kK (n:=N) λq=>f qи:=by suffices h:∀k (a:Array α),N-aв=k->aв<=N->(∀i (h:i da f N a=kK (n:=N) λq=>f qиfrom h _ _ rfl ((by simp)) (λi h=>by simp at h) intro k;induction k with |zero=>intro a j g d;rw[da,AC (by omega)];exact mi (by simp;omega) λi e _=>by rw[d i e,Λ] |succ k l=>intro a j g d;rw[da,AD (by omega)];refine l _ (by simp;omega) (by simp;omega) λi h=>?_;rw[Array.getElem_push];split;exact d i ‹_›;grind @[specialize]def d6(n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:Wв<2^32/\8*n<2^32) (hW:ow*n<=Wв)(work:=kw W):Array Word:= if 8<=ow then let xr:=bQ (λk=>dw X[k]!) n (AR n) let Y:=da (λg=>yW xr n ow W b hs hW g work) ((ow+7)/8) (AS ((ow+7)/8)) da (λj=> let y:=Y[j/8]! let o:=j*n tG relu (y.s.f (j-min (8*(j/8)) (ow-8))) y.o ix ib L (λ_=>tS relu L n (λs=>xr.get! s*dw W[o+s]!) (λ_=>dw oneW*dw b[j]!) λ_=>aD n relu X W b (j/ow*n) 1 j) λ_=>aD n relu X W b (j/ow*n) 1 j) (1*ow) (AS (1*ow)) else linearSpec 1 n ow relu X W b @[irreducible] def dC(n e:Nat)(l:Bool)(X W b:Array kF)(O G L:Nat) (E:Wв<2^32/\8*n<2^32)(B:e*n<=Wв)(H:Nat) (F:∀q:Nat,kB X[q]!≠255/\kG X[q]!<=O)(hb:∀q:Nat,kB b[q]!≠255/\kG b[q]!<=H) (M:174+H<=G)(Y:n+2<=2^L)(x:L<=27)(z:G+L<=425): d6 n e l X W b O G L E B=mj 1 n e l X W b:=by unfold d6;split;rename_i V;swap;rfl;unfold mj linearWith;dsimp only;simp only[gg,iC];congr 1;funext q;have hq:=q.isLt;have al:0by subst h;simp at hq have hi:qи/e=0:=ώ (by omega);have Q:qиdw X[k]!) n _ (kJ n) rfl (by simp[kJ,kS]);have m:∀sdw X[k]!) n (kJ n)).data[s]! =dw X[0*n+s]!:=by intro s d;rw[p.2.2 _ (by simp[kJ,kS]) d];simp generalize bQ (λk=>dw X[k]!) n (kJ n)=u at p m⊢ have hY:(kK (n:=(e+7)/8) λg=> yW u n e W b E B gи)[j/8]! = yW u n e W b E B (j/8):=by rw[AB _ _ (by simp;omega),Λ] rw[hY];have hS:∀y,yW u n e W b E B (j/8)=y->y.s.f (j-po (8*(j/8)) (e-8))=bC (λs=>u.data[s]! ==0) (λs=>bi false u.data[s]! W[j*n+s]!) n 0 (dw ld*dw b[j]!)/\(∀s(kB W[j*n+s]!)г<=y.oг)/\(y.oг<255->∀s(kB W[j*n+s]!)г<255):=by rintro _ rfl;rw[yW];dsimp only;rw[AT ⟨p.1,V⟩];have D:nеб=n:=aa (by have:=ς;omega);set c:=po (8*(j/8)) (e-8)with ah;have v:j-c<8/\c+(j-c)=j/\c+8<=e:=(by omega);have A:(c*n)еб=c*n:=by have U:(c+8)*n<=e*n:=ι n v.2.2;rw[Ϡ]at U;exact aa (by have:=ς;omega) have S:c*n+n*(j-c)=j*n:=by grind only[cases Or] have w:∀s,(kB W[j*n+s]!)г=(kB W[(c*n)еб+nеб*(j-c)+s]!)г:=λs=>by rw[D,A,S] refine⟨?_,λs d N=>?_,λhR s d N=>?_⟩ .rw[(d5 _ _ _ _ _ _ _ _ (j-c) v.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).1,j8 (λr=>dw ld*dw b[c+r]!) _ v.1,D,A,Ϧ,v.2.1,S] .exact(w s).trans_le ((d5 _ _ _ _ _ _ _ _ (j-c) v.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.1 s ((by simp)) (by rw[D];exact d) N) .exact(w s).trans_lt (((d5 _ _ _ _ _ _ _ _ (j-c) v.1 _ _ _ _ _ _ _ _ _ _ _ _ rfl).2.2.2 hR).2 s ((by simp)) (by rw[D];exact d) N) have⟨I,J,K⟩:=hS _ rfl;rw[I];refine gb l n j (λt=>X[0*n+t]!) W b _ _ _ O G L H _ _ (λs _=>F _) J K (hb j) M Y x z (λs d w=>?_) (λs d w=>?_) (λs d h=>?_) (by unfold aD;simp only[bO,ϻ]) .rw[m s d];exact dJ _ _ (F _).1 w .rw[m s d];exact iH _ _ _ (F _).1 w .rw[m s d]at h;exact λ_=>bz _ _ (F _).1 h @[irreducible] def dN(n:Nat)(e d:Nat->kF):∀c i,i+c=n-> nC (kK (n:=n+1) λt=>if tиif tиe tи) (kK (n:=n) λt=>d tи) i c:=by intro c;induction c with |zero=>intro i h;obtain rfl:i=n:=(by omega);simp only[nC,ab (i+1) (λt=>if t< i then d t else ld) i (by omega),ab (i+1) (λt=>if t< i then e t else 0x80000000) i (by omega),AX,Am];rfl |succ c g=>intro i h;rw[nC,g (i+1) (by omega),nC,ab (n+1) (λt=>if tif tkF)(h:0if tif tby split;exacts[(g t ‹_›).symm,(by decide)],bI _ _ _ g,aK,dN n d e n 0 (by omega)];congr 1 .simp only[AX,Am,((by decide):tm ld 0x80000000=0),Av];exact ϔ rfl λt j=>by simp only[AD (ϥ.mp j)];unfold tm;rw[Τ];ring simp[h.ne'] /- Parameter-only contiguous eight-output tiles. The retained key includes the complete immutable weight array and both layout dimensions. -/ def TR(W:Array Word)(n ow:Nat):FloatArray:= let N:=((ow+7)/8)*n*8 bQ (fun i=>dX W[(min (8*(i/(n*8))) (ow-8)+i%8)*n+(i/8)%n]!) N (FloatArray.emptyWithCapacity N) def TPure(W:Array Word)(n ow:Nat):FloatArray×Word:= (TR W n ow,aO W 0 0) abbrev TP(W:Array Word)(n ow:Nat):={p:FloatArray×Word//p=TPure W n ow} @[irreducible] def TRok(W:Array Word)(n ow:Nat): (TR W n ow).size=((ow+7)/8)*n*8∧ ∀i<((ow+7)/8)*n*8,(TR W n ow).data[i]! = dX W[(min (8*(i/(n*8))) (ow-8)+i%8)*n+(i/8)%n]!:=by let N:=((ow+7)/8)*n*8 have h:=bk (fun i=>dX W[(min (8*(i/(n*8))) (ow-8)+i%8)*n+(i/8)%n]!) N N (FloatArray.emptyWithCapacity N) (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) exact⟨h.1,fun i hi=>h.2.2 i (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) hi⟩ @[irreducible] def tileIndex(n blocks g t r:Nat)(hg:g !(DPEq W e.W && decide (n=e.n) && decide (ow=e.ow)))).take 15) (Void.mk ())).val if old.length<999999999 then v else ⟨TSlow W n ow,rfl⟩ def TPFind(W:@&Array Word)(n ow:Nat)(st:@&List TPEntry):Option (TP W n ow):= match st with |[]=>none |e::es=> if hn:e.n=n then if ho:e.ow=ow then if hw:DPEq W e.W=true then let v:TP W n ow:=⟨e.p,by have he:e.W=W:=(DPEq_ok hw).symm simpa only[hn,ho,he] using e.ok⟩ some (withPtrAddr W (fun p=>withPtrAddr e.W (fun q=>if p=q then v else TPut W n ow v) (fun _ _=>TPSame _ _)) (fun _ _=>TPSame _ _)) else TPFind W n ow es else TPFind W n ow es else TPFind W n ow es @[noinline]def TPGet(W:Array Word)(n ow:Nat):TP W n ow:= if W.size≤1048576 then let st:=(ST.Prim.Ref.get TPC (Void.mk ())).val match TPFind W n ow st with |some v=>v |none=>TPut W n ow ⟨TPure W n ow,rfl⟩ else ⟨TPure W n ow,rfl⟩ @[specialize] def qT (D X : FloatArray) (n : USize) (hd : D.size < 2^32) (hx : n.toNat ≤ X.size) (z : Float) (t i : USize) (hi : i.toNat + 8*(n.toNat-t.toNat) ≤ D.size) (a0 a1 a2 a3 a4 a5 a6 a7 : Float) (e : Word) : A9 := if h : t < n then have ht := USize.lt_iff_toNat_lt.mp h have hI : i.toNat + 8 ≤ D.size := by omega have hn : (i+8).toNat + 8*(n.toNat-(t+1).toNat) ≤ D.size := by rw [ac h, aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; omega let x := X.uget t (by omega) if x == z then qT D X n hd hx z (t+1) (i+8) hn a0 a1 a2 a3 a4 a5 a6 a7 e else qT D X n hd hx z (t+1) (i+8) hn (a0+x*D.uget (i+0) (uk (by simp) hI hd)) (a1+x*D.uget (i+1) (uk (by simp) hI hd)) (a2+x*D.uget (i+2) (uk (by simp) hI hd)) (a3+x*D.uget (i+3) (uk (by simp) hI hd)) (a4+x*D.uget (i+4) (uk (by simp) hI hd)) (a5+x*D.uget (i+5) (uk (by simp) hI hd)) (a6+x*D.uget (i+6) (uk (by simp) hI hd)) (a7+x*D.uget (i+7) (uk (by simp) hI hd)) e else ⟨a0,a1,a2,a3,a4,a5,a6,a7,e⟩ termination_by n.toNat-t.toNat decreasing_by all_goals have := USize.lt_iff_toNat_lt.mp h; rw [ac h]; omega @[irreducible] def qT_accum (D X : FloatArray) (n : USize) (hd : D.size < 2^32) (hx : n.toNat ≤ X.size) (z : Float) (lo r : Nat) (hr : r < 8) : ∀ m (t i : USize) (hi : i.toNat+8*(n.toNat-t.toNat) ≤ D.size) (a0 a1 a2 a3 a4 a5 a6 a7 : Float) (e : Word), n.toNat-t.toNat=m → i.toNat=lo+8*t.toNat → (qT D X n hd hx z t i hi a0 a1 a2 a3 a4 a5 a6 a7 e).s.f r = bC (fun s => X.data[s]! == z) (fun s => X.data[s]!*D.data[lo+8*s+r]!) n.toNat t.toNat (A8.f ⟨a0,a1,a2,a3,a4,a5,a6,a7⟩ r) ∧ (qT D X n hd hx z t i hi a0 a1 a2 a3 a4 a5 a6 a7 e).o=e := by intro m; induction m with | zero => intro t i hi a0 a1 a2 a3 a4 a5 a6 a7 e hm hbase have hn : ¬t.toNat hn (USize.lt_iff_toNat_lt.mp h) rw [qT, dif_neg h, bC, if_neg hn] exact ⟨rfl,rfl⟩ | succ m ih => intro t i hi a0 a1 a2 a3 a4 a5 a6 a7 e hm hbase have ht : t.toNat ug X t p have dd : ∀ (c : USize) (hc : c.toNat<8) p, D.uget (i+c) p=D.data[lo+8*t.toNat+c.toNat]! := by intro c hc p rw [ug, aj (by have := USize.le_size; omega), hbase] rw [qT, dif_pos h, bC, if_pos ht] dsimp only rw [dx] by_cases hz : (X.data[t.toNat]! == z)=true · rw [if_pos hz, if_pos hz] simpa only [ac h] using ih (t+1) (i+8) hremain a0 a1 a2 a3 a4 a5 a6 a7 e hmnext hnext · rw [if_neg hz, if_neg hz] have hrec := ih (t+1) (i+8) hremain (a0+X.data[t.toNat]!*D.uget (i+0) (uk (by simp) hI hd)) (a1+X.data[t.toNat]!*D.uget (i+1) (uk (by simp) hI hd)) (a2+X.data[t.toNat]!*D.uget (i+2) (uk (by simp) hI hd)) (a3+X.data[t.toNat]!*D.uget (i+3) (uk (by simp) hI hd)) (a4+X.data[t.toNat]!*D.uget (i+4) (uk (by simp) hI hd)) (a5+X.data[t.toNat]!*D.uget (i+5) (uk (by simp) hI hd)) (a6+X.data[t.toNat]!*D.uget (i+6) (uk (by simp) hI hd)) (a7+X.data[t.toNat]!*D.uget (i+7) (uk (by simp) hI hd)) e hmnext hnext refine ⟨hrec.1.trans ?_,hrec.2⟩ rw [ac h] congr 1 interval_cases r <;> simp only [A8.f] <;> rw [dd _ (by simp)] <;> simp only [USize.reduceToNat] @[inline]def yWT(xr:FloatArray)(n ow:Nat)(W b:Array Word) (hs:W.size<2^32∧8*n<2^32)(p:TP W n ow)(g:Nat):A9:= let D:=p.val.1 let lo:=g*n*8 let bq:=fun r=>dw oneW*dw b[min (8*g) (ow-8)+r]! if h:xr.size=n∧g<(ow+7)/8∧D.size<2^32∧lo+8*n≤D.size then qT D xr n.toUSize h.2.2.1 (by rw[Dense.aa (by have := USize.le_size; omega)];omega) 0 0 lo.toUSize (by rw[Dense.aa (by have := USize.le_size; omega),Dense.aa (by have := USize.le_size; omega)];simpa using h.2.2.2) (bq 0) (bq 1) (bq 2) (bq 3) (bq 4) (bq 5) (bq 6) (bq 7) p.val.2 else default @[irreducible] def bC_congr(k:Nat→Bool)(p q:Nat→Float)(n:Nat)(h:∀s intro t a hm have ht:¬trw[bC,if_neg ht] conv_rhs=>rw[bC,if_neg ht] |succ m ih=> intro t a hm have ht:trw[bC] conv_rhs=>rw[bC] rw[if_pos ht,if_pos ht] by_cases hk:k t=true · simp only[hk,Bool.true_eq,if_true];exact ih (t+1) a (by have := USize.le_size; omega) · simp only[hk,if_false];rw[h t ht];exact ih (t+1) (a+q t) (by have := USize.le_size; omega) @[irreducible] def yWT_ok(xr:FloatArray)(n ow:Nat)(W b:Array Word) (hs:W.size<2^32∧8*n<2^32)(p:TP W n ow)(g r:Nat) (hx:xr.size=n)(hg:g<(ow+7)/8)(hr:r<8) (hc:((ow+7)/8)*n*8<2^32): (yWT xr n ow W b hs p g).s.f r= bC (fun s=>xr.data[s]! ==0) (fun s=>bi false xr.data[s]! W[(min (8*g) (ow-8)+r)*n+s]!) n 0 (dw oneW*dw b[min (8*g) (ow-8)+r]!)∧ (yWT xr n ow W b hs p g).o=p.val.2:=by have hd:p.val.1=TR W n ow:=congrArg Prod.fst p.property have hdsize:p.val.1.size=((ow+7)/8)*n*8:=by rw[hd,(TRok W n ow).1] have hlo:g*n*8+8*n≤p.val.1.size:=by rw[hdsize] have h:=Nat.mul_le_mul_right (n*8) (show g+1≤(ow+7)/8 by have := USize.le_size; omega) simpa only[Nat.add_mul,Nat.one_mul,Nat.mul_assoc,Nat.mul_comm 8 n] using h have hguard:xr.size=n∧g<(ow+7)/8∧p.val.1.size<2^32∧g*n*8+8*n≤p.val.1.size:= ⟨hx,hg,by rwa[hdsize],hlo⟩ unfold yWT dsimp only rw[dif_pos hguard] have hn:n.toUSize.toNat=n:=Dense.aa (by have := USize.le_size; omega) have hl:(g*n*8).toUSize.toNat=g*n*8:=Dense.aa (by have := USize.le_size; omega) have H:=qT_accum p.val.1 xr n.toUSize (by rwa[hdsize]) (by rw[hn,hx]) 0 (g*n*8) r hr n 0 (g*n*8).toUSize (by simpa only[hl,hn,USize.toNat_zero,Nat.sub_zero] using hlo) (dw oneW*dw b[min (8*g) (ow-8)+0]!) (dw oneW*dw b[min (8*g) (ow-8)+1]!) (dw oneW*dw b[min (8*g) (ow-8)+2]!) (dw oneW*dw b[min (8*g) (ow-8)+3]!) (dw oneW*dw b[min (8*g) (ow-8)+4]!) (dw oneW*dw b[min (8*g) (ow-8)+5]!) (dw oneW*dw b[min (8*g) (ow-8)+6]!) (dw oneW*dw b[min (8*g) (ow-8)+7]!) p.val.2 (by simpa only[hn,USize.toNat_zero,Nat.sub_zero]) (by simpa only[hl,USize.toNat_zero,Nat.mul_zero,Nat.add_zero]) simp only[hn,USize.toNat_zero,j8 (fun r=>dw oneW*dw b[min (8*g) (ow-8)+r]!) r hr] at H refine⟨H.1.trans ?_,H.2⟩ apply bC_congr _ _ _ n (fun s hs=>?_) n 0 _ rfl rw[hd] have hi:g*n*8+8*s+r=(g*n+s)*8+r:=by ring rw[hi,TRget W n ow g s r hg hs hr] rfl noncomputable def d6T(n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:W.size<2^32∧8*n<2^32)(hw:ow*n≤W.size):Array Word:= if h:8≤ow∧0dw X[k]!) n (FloatArray.emptyWithCapacity n) let Y:=da (fun g=>yWT xr n ow W b hs p g) ((ow+7)/8) (Array.emptyWithCapacity ((ow+7)/8)) da (fun j=> let y:=Y[j/8]! let o:=j*n tG relu (y.s.f (j-min (8*(j/8)) (ow-8))) y.o ix ib L (fun _=>tS relu L n (fun s=>xr.get! s*dw W[o+s]!) (fun _=>dw oneW*dw b[j]!) (fun _=>aD n relu X W b (j/ow*n) 1 j)) (fun _=>aD n relu X W b (j/ow*n) 1 j)) (1*ow) (Array.emptyWithCapacity (1*ow)) else d6 n ow relu X W b ix ib L hs hw else d6 n ow relu X W b ix ib L hs hw @[irreducible] def dCT(n e:Nat)(l:Bool)(X W b:Array Word)(O G L:Nat) (E:W.size<2^32∧8*n<2^32)(B:e*n≤W.size)(H:Nat) (F:∀q:Nat,expOf X[q]!≠255∧idxOf X[q]!≤O) (hb:∀q:Nat,expOf b[q]!≠255∧idxOf b[q]!≤H) (M:174+H≤G)(Y:n+2≤2^L)(x:L≤27)(z:G+L≤425): d6T n e l X W b O G L E B=linearSpec 1 n e l X W b:=by unfold d6T split · rename_i hg dsimp only split · rename_i hf generalize hpk:TPGet W n e=pk at * unfold linearSpec linearWith dsimp only simp only[gg,iC] congr 1 funext q have hq:=q.isLt have al:0dw X[k]!) n _ (FloatArray.emptyWithCapacity n) rfl (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) have m:∀sdw X[k]!) n (FloatArray.emptyWithCapacity n)).data[s]! =dw X[0*n+s]!:=by intro s hs rw[px.2.2 s (by simp[FloatArray.emptyWithCapacity,FloatArray.size]) hs] simp generalize bQ (fun k=>dw X[k]!) n (FloatArray.emptyWithCapacity n)=u at px m⊢ have hY:(Array.ofFn (n:=(e+7)/8) (fun g=>yWT u n e W b E pk g.val))[j/8]! = yWT u n e W b E pk (j/8):=by rw[getElem!_pos _ _ (by simp;omega),Array.getElem_ofFn] rw[hY] set c:=min (8*(j/8)) (e-8) with hc have hv:j-c<8∧c+(j-c)=j∧c+8≤e:=by (clear*-hg Q;omega) have hgidx:j/8<(e+7)/8:=by omega have hsums:=yWT_ok u n e W b E pk (j/8) (j-c) px.1 hgidx hv.1 hg.2.2.2 have hsum:(yWT u n e W b E pk (j/8)).s.f (j-c)= bC (fun s=>u.data[s]! ==0) (fun s=>bi false u.data[s]! W[j*n+s]!) n 0 (dw oneW*dw b[j]!):=by have hs:=hsums.1 change (yWT u n e W b E pk (j/8)).s.f (j-c)= bC (fun s=>u.data[s]! ==0) (fun s=>bi false u.data[s]! W[(c+(j-c))*n+s]!) n 0 (dw oneW*dw b[c+(j-c)]!) at hs simpa only[hv.2.1] using hs have hmeta:pk.val.2=aO W 0 0:=by simpa only[TPure] using congrArg Prod.snd pk.property have hsize:W.sizeX[0*n+t]!) W b _ _ _ O G L H _ _ (fun s _=>F _) (fun s hs _=>hw s hs) hzero (hb j) M Y x z (fun s hs hw=>?_) (fun s hs hw=>?_) (fun s hs hz=>?_) (by unfold aD;simp only[bO,Nat.mul_one]) · rw[m s hs];exact dJ _ _ (F _).1 hw · rw[m s hs];exact iH _ _ _ (F _).1 hw · rw[m s hs] at hz;exact fun _=>bz _ _ (F _).1 hz · exact dC n e l X W b O G L E B H F hb M Y x z · exact dC n e l X W b O G L E B H F hb M Y x z /- One row-major decoded parameter payload for B8. The cache does not call TPGet and therefore does not construct an unused B1 tile layout. -/ def B8Pure(W:Array Word):FloatArray×Word:=(DR W,aO W 0 0) abbrev B8P(W:Array Word):={p:FloatArray×Word//p=B8Pure W} @[irreducible] def B8P_data(W:Array Word)(p:B8P W):p.val.1=DR W:= congrArg Prod.fst p.property @[irreducible] def B8P_exp(W:Array Word)(p:B8P W):p.val.2=aO W 0 0:= congrArg Prod.snd p.property @[noinline]def B8Slow(W:Array Word):FloatArray×Word:=B8Pure W structure B8Entry where W:Array Word p:FloatArray×Word ok:p=B8Pure W @[noinline]def B8C:ST.Ref Unit (List B8Entry):= (ST.Prim.mkRef ([]:List B8Entry) (Void.mk ())).val @[irreducible] def B8Same{W:Array Word}(x y:B8P W):x=y:= Subtype.ext (x.2.trans y.2.symm) @[noinline]def B8Put(W:Array Word)(v:B8P W):B8P W:= let st:=(ST.Prim.Ref.get B8C (Void.mk ())).val let old:=(ST.Prim.Ref.swap B8C (⟨W,v.1,v.2⟩::(st.filter (fun e=> !(DPEq W e.W))).take 15) (Void.mk ())).val if old.length<999999999 then v else ⟨B8Slow W,rfl⟩ def B8Find(W:@&Array Word)(st:@&List B8Entry):Option (B8P W):= match st with |[]=>none |e::es=> if h:DPEq W e.W=true then let v:B8P W:=⟨e.p,e.ok.trans (congrArg B8Pure (DPEq_ok h).symm)⟩ some (withPtrAddr W (fun p=>withPtrAddr e.W (fun q=>if p=q then v else B8Put W v) (fun _ _=>B8Same _ _)) (fun _ _=>B8Same _ _)) else B8Find W es @[noinline]def B8Get(W:Array Word):B8P W:= if W.size≤1048576 then let st:=(ST.Prim.Ref.get B8C (Void.mk ())).val match B8Find W st with |some v=>v |none=>B8Put W ⟨B8Pure W,rfl⟩ else ⟨B8Pure W,rfl⟩ structure A16 where a0:Float a1:Float a2:Float a3:Float a4:Float a5:Float a6:Float a7:Float b0:Float b1:Float b2:Float b3:Float b4:Float b5:Float b6:Float b7:Float local instance:Inhabited A16:=⟨⟨0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0⟩⟩ @[irreducible] def ao_congr(p q:Nat→Float)(n:Nat)(h:∀s intro t a hm have ht:¬trw[ao,if_neg ht] conv_rhs=>rw[ao,if_neg ht] |succ m ih=> intro t a hm have ht:trw[ao] conv_rhs=>rw[ao] rw[if_pos ht,if_pos ht,h t ht] exact ih (t+1) (a+q t) (by omega) /- Completed XT and output-group arrays cross a real noinline boundary. This prevents input transposition from sinking into each output iteration. -/ /- Generic cached NR1: ordered eight-row accumulation, shared input pack, original finishing. -/ /- Exact ordered eight-lane MAC recurrence over decoded parameters. -/ @[specialize] def qNR (D X : FloatArray) (ou n : USize) (hd : D.size < 2^32) (hD : ou.toNat+n.toNat ≤ D.size) (hx : X.size < 2^32) (t i : USize) (hi : i.toNat+8*(n.toNat-t.toNat) ≤ X.size) (a0 a1 a2 a3 a4 a5 a6 a7 : Float) (e : Word) : A9 := if h : t < n then have ht := USize.lt_iff_toNat_lt.mp h have hI : i.toNat+8 ≤ X.size := by omega have hn : (i+8).toNat+8*(n.toNat-(t+1).toNat) ≤ X.size := by rw [Dense.ac h,Dense.aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; omega let w := D.uget (ou+t) (by rw [Dense.aj (by have := USize.le_size; omega)]; omega) let x0 := X.uget (i+0) (uk (by simp) hI hx) let x1 := X.uget (i+1) (uk (by simp) hI hx) let x2 := X.uget (i+2) (uk (by simp) hI hx) let x3 := X.uget (i+3) (uk (by simp) hI hx) let x4 := X.uget (i+4) (uk (by simp) hI hx) let x5 := X.uget (i+5) (uk (by simp) hI hx) let x6 := X.uget (i+6) (uk (by simp) hI hx) let x7 := X.uget (i+7) (uk (by simp) hI hx) qNR D X ou n hd hD hx (t+1) (i+8) hn (a0+x0*w) (a1+x1*w) (a2+x2*w) (a3+x3*w) (a4+x4*w) (a5+x5*w) (a6+x6*w) (a7+x7*w) e else ⟨a0,a1,a2,a3,a4,a5,a6,a7,e⟩ termination_by n.toNat-t.toNat decreasing_by have := USize.lt_iff_toNat_lt.mp h; rw [Dense.ac h]; omega @[irreducible] def qNR_accum (D X : FloatArray) (ou n : USize) (hd : D.size < 2^32) (hD : ou.toNat+n.toNat ≤ D.size) (hx : X.size < 2^32) (B r : Nat) (hr : r < 8) : ∀ m (t i : USize) (hi : i.toNat+8*(n.toNat-t.toNat) ≤ X.size) (a0 a1 a2 a3 a4 a5 a6 a7 : Float) (e : Word), n.toNat-t.toNat=m → i.toNat=B+8*t.toNat → (qNR D X ou n hd hD hx t i hi a0 a1 a2 a3 a4 a5 a6 a7 e).s.f r = ao (fun s => X.data[B+8*s+r]!*D.data[ou.toNat+s]!) n.toNat t.toNat (A8.f ⟨a0,a1,a2,a3,a4,a5,a6,a7⟩ r) ∧ (qNR D X ou n hd hD hx t i hi a0 a1 a2 a3 a4 a5 a6 a7 e).o=e := by intro m induction m with | zero => intro t i hi a0 a1 a2 a3 a4 a5 a6 a7 e hm hbase have hn : ¬t.toNat < n.toNat := by omega have h : ¬t < n := fun h => hn (USize.lt_iff_toNat_lt.mp h) rw [qNR,dif_neg h,ao,if_neg hn] exact ⟨rfl,rfl⟩ | succ m ih => intro t i hi a0 a1 a2 a3 a4 a5 a6 a7 e hm hbase have ht : t.toNat < n.toNat := by omega have h : t < n := USize.lt_iff_toNat_lt.mpr ht have hI : i.toNat+8 ≤ X.size := by omega have hnext : (i+8).toNat=B+8*(t+1).toNat := by rw [Dense.ac h,Dense.aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; omega have hmnext : n.toNat-(t+1).toNat=m := by rw [Dense.ac h]; omega have hremain : (i+8).toNat+8*(n.toNat-(t+1).toNat) ≤ X.size := by rw [Dense.ac h,Dense.aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; clear * - hi ht; omega have dx : ∀ (v : USize) (hv : v.toNat < 8) p, X.uget (i+v) p=X.data[B+8*t.toNat+v.toNat]! := by intro v hv p rw [ug,Dense.aj (by have := USize.le_size; omega),hbase] have dw_eq : ∀ p, D.uget (ou+t) p=D.data[ou.toNat+t.toNat]! := by intro p; rw [ug,Dense.aj (by have := USize.le_size; omega)] rw [qNR,dif_pos h,ao,if_pos ht] dsimp only have hw : (ou+t).toNat < D.size := by rw [Dense.aj (by have := USize.le_size; omega)]; omega have hrec := ih (t+1) (i+8) hremain (a0+X.uget (i+0) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a1+X.uget (i+1) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a2+X.uget (i+2) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a3+X.uget (i+3) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a4+X.uget (i+4) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a5+X.uget (i+5) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a6+X.uget (i+6) (uk (by simp) hI hx)*D.uget (ou+t) hw) (a7+X.uget (i+7) (uk (by simp) hI hx)*D.uget (ou+t) hw) e hmnext hnext refine ⟨hrec.1.trans ?_,hrec.2⟩ rw [Dense.ac h] rw [dx 0 (by simp),dx 1 (by simp),dx 2 (by simp),dx 3 (by simp),dx 4 (by simp),dx 5 (by simp),dx 6 (by simp),dx 7 (by simp),dw_eq] simp only [USize.reduceToNat] congr 1 interval_cases r <;> rfl noncomputable abbrev NRWork(W:Array Word):= (X:FloatArray)→(ou n:USize)→(W.size<2^32∧X.size<2^32)→ (ou.toNat+n.toNat≤W.size)→(t i:USize)→ (i.toNat+8*(n.toNat-t.toNat)≤X.size)→ Float→Float→Float→Float→Float→Float→Float→Float→Word→A9 @[irreducible] def b8_generic(t:Bool)(R n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:W.size<2^32∧8*n<2^32)(hw:ow*n≤W.size)(XT:Array FloatArray) (work:NRWork W)(F:Nat→Word) (point:∀i j,isN n relu X W b XT L i j (if t then i else i*n) (if t then R else 1)) (fun _=>aD n relu X W b (if t then i else i*n) (if t then R else 1) j)= F (if t then j*R+i else i*ow+j)) (g o:Nat)(ho:o(decide (8*g+rtG relu ((yR (work:=work) XT n ow W b hs hw g o).s.f r) (yR (work:=work) XT n ow W b hs hw g o).o ix ib L (fun _=>sN n relu X W b XT L (8*g+r) o (if t then 8*g+r else(8*g+r)*n) (if t then R else 1)) (fun _=>aD n relu X W b (if t then 8*g+r else(8*g+r)*n) (if t then R else 1) o))).foldl (fun a x=>us a x.1 x.2.1 x.2.2) a:=by rfl rw[step] refine km F a _ (fun r hr hmask hout=>?_) have H:=point (8*g+r) o (by simpa using hmask) ho rwa[show(8*g+r)/8=g by clear * - hr;omega,show(8*g+r)%8=r by clear * - hr;omega] at H @[irreducible] def c6_generic(t:Bool)(R n ow:Nat)(relu:Bool)(X W b:Array Word)(ix ib L:Nat) (hs:W.size<2^32∧8*n<2^32)(hw:ow*n≤W.size)(work:NRWork W)(F:Nat→Word) (point:∀i j,ibZ t X R n g.val (zT n)); tG relu ((yR (work:=work) XT n ow W b hs hw (i/8) j).s.f (i%8)) (yR (work:=work) XT n ow W b hs hw (i/8) j).o ix ib L (fun _=>sN n relu X W b XT L i j (if t then i else i*n) (if t then R else 1)) (fun _=>aD n relu X W b (if t then i else i*n) (if t then R else 1) j)= F (if t then j*R+i else i*ow+j)): c6 (work:=work) t R n ow relu X W b ix ib L hs hw=Array.ofFn (n:=R*ow) (fun q=>F q.val):=by unfold c6 L8 dsimp only refine ip _ _ _ _ F _ (fun u v a hu hv=>b8_generic t R n ow relu X W b ix ib L hs hw _ work F point u v hv a) ?_ intro q hq have how:0 qNR p.val.1 X ou n (by rw[B8P_data,(DRok W).1];exact hs.1) (by rw[B8P_data,(DRok W).1];exact hW) hs.2 t i hi a0 a1 a2 a3 a4 a5 a6 a7 p.val.2 @[irreducible] def yNR_ok(XT:Array FloatArray)(xt:FloatArray)(n ow:Nat)(W b:Array Word) (hs:W.size<2^32∧8*n<2^32)(hw:ow*n≤W.size)(p:B8P W)(rb o r:Nat) (hlook:(XT[rb]!) = xt)(hxt:8*n≤xt.size)(hx:xt.size<2^32)(ho:oxt.data[8*s+r]!*dX W[o*n+s]!) n 0 (dw oneW*dw b[o]!)∧ (yR (work:=nrWork W p) XT n ow W b hs hw rb o).o=p.val.2:=by have hn:n.toUSize.toNat=n:=Dense.aa (by have:=USize.le_size;omega) have hbound:o*n+n≤W.size:=by have H:=(Nat.mul_le_mul_right n (show o+1≤ow by assumption)).trans hw simpa only[Nat.add_mul,Nat.one_mul] using H have hou:(o*n).toUSize.toNat=o*n:=Dense.aa (by have:=USize.le_size;omega) have hd:p.val.1.size=W.size:=by rw[B8P_data,(DRok W).1] unfold yR simp only[hlook] rw[dif_pos (show 8*n≤xt.size∧xt.size≤4294967295∧o?_) n 0 _ rfl rw[B8P_data,(DRok W).2 (o*n+s) (by omega)] /- Reuse the original numerical certificate for every real output row/column. -/ @[irreducible] def csNR {t : Bool} (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hw : ow*n ≤ W.size) (p : B8P W) (H : Nat) (FX : ∀ q : Nat, expOf X[q]! ≠ 255 ∧ idxOf X[q]! ≤ ix) (FB : ∀ q : Nat, expOf b[q]! ≠ 255 ∧ idxOf b[q]! ≤ H) (hb : 174+H ≤ ib) (hn : n+2 ≤ 2^L) (hL : L ≤ 27) (hR : ib+L ≤ 425) : c6 (work:=nrWork W p) t R n ow relu X W b ix ib L hs hw = Array.ofFn (n:=R*ow) (fun q => act relu (dotOf (n+1) (fun s => if s < n then X[if t then q.val%R+s*R else q.val/ow*n+s]! else oneW) (fun s => if s < n then W[(if t then q.val/R else q.val%ow)*n+s]! else b[if t then q.val/R else q.val%ow]!))) := by refine c6_generic t R n ow relu X W b ix ib L hs hw (nrWork W p) (fun q => act relu (dotOf (n+1) (fun s => if s < n then X[if t then q%R+s*R else q/ow*n+s]! else oneW) (fun s => if s < n then W[(if t then q/R else q%ow)*n+s]! else b[if t then q/R else q%ow]!))) ?_ intro i j hi hj dsimp only have N (a c m : Nat) (h : c < m) : (a*m+c)/m=a ∧ (a*m+c)%m=c := by constructor · rw [Nat.add_comm,Nat.add_mul_div_right _ _ (by omega),Nat.div_eq_of_lt h,Nat.zero_add] · rw [Nat.add_comm,Nat.add_mul_mod_self_right,Nat.mod_eq_of_lt h] have raw := fF X (if t then 1 else n) (if t then R else 1) n (if t then 8*(i/8) else 8*(i/8)*n) (zT n) (jH n).1 have wx : 8*n ≤ (bZ t X R n (i/8) (zT n)).size ∧ (bZ t X R n (i/8) (zT n)).size ≤ 4294967295 ∧ ∀ s, s < n → (bZ t X R n (i/8) (zT n)).data[8*s+i%8]! = dw X[if t then i+s*R else i*n+s]! := by rw [bZ] refine ⟨raw.1,?_,?_⟩ · rcases raw.2.1 with h|h <;> rw [h] <;> rcases (jH n).2 with h|h <;> omega · intro s hsn rw [raw.2.2 s (i%8) hsn (Nat.mod_lt _ (by decide))] congr 2 cases t <;> simp only [ite_true,ite_false,Bool.false_eq_true] · rw [show 8*(i/8)*n+s*1+i%8*n=(8*(i/8)+i%8)*n+s by ring] rw [Nat.div_add_mod] · (clear*-;omega) have hlook : (Array.ofFn (n:=(R+7)/8) (fun g => bZ t X R n g.val (zT n)))[i/8]! = bZ t X R n (i/8) (zT n) := by rw [getElem!_pos _ _ (by simp; (clear*-hi;omega)),Array.getElem_ofFn] have ha := yNR_ok (Array.ofFn (n:=(R+7)/8) (fun g => bZ t X R n g.val (zT n))) (bZ t X R n (i/8) (zT n)) n ow W b hs hw p (i/8) j (i%8) hlook wx.1 (by omega) hj (Nat.mod_lt _ (by decide)) rw [ha.1,ha.2] unfold sN dsimp only rw [hlook] simp only [gg] rw [dM _ _ _ _ _ rfl] have hsize : W.size < USize.size := lt_of_lt_of_le hs.1 USize.le_size have hmeta : p.val.2=aO W 0 0 := B8P_exp W p have bound : ∀ s, s < n → (expOf W[j*n+s]!).toNat ≤ p.val.2.toNat := by intro s hsn rw [hmeta] have hm : j*n+n ≤ ow*n := by simpa only [Nat.add_mul,Nat.one_mul] using Nat.mul_le_mul_right n (show j+1 ≤ ow by assumption) exact (eY W hsize _ 0 0 rfl).2 (j*n+s) (by simp) (by omega) have out := gb relu n j (fun s => X[if t then i+s*R else i*n+s]!) W b (fun s => (bZ t X R n (i/8) (zT n)).data[8*s+i%8]!*dw W[j*n+s]!) (fun s => (bZ t X R n (i/8) (zT n)).data[8*s+i%8]!*dX W[j*n+s]!) p.val.2 ix ib L H (fun _ => aD n relu X W b (if t then i else i*n) (if t then R else 1) j) (fun _ => false) (fun s hsn => FX _) (fun s hsn _ => bound s hsn) (fun _ _ _ h => absurd h Bool.false_ne_true) (FB j) hb hn hL hR (fun s hsn hwf => by rw [wx.2.2 s hsn]; exact dJ _ _ (FX _).1 hwf) (fun s hsn hwf => by rw [wx.2.2 s hsn]; exact iH false _ _ (FX _).1 hwf) (fun _ _ h => absurd h Bool.false_ne_true) (by cases t <;> simp only [aD,bO,Nat.mul_one,ite_true,ite_false,Bool.false_eq_true]) refine out.trans ?_ cases t · simp only [Bool.false_eq_true,ite_false] rw [(N i j ow hj).1,(N i j ow hj).2] · simp only [ite_true] rw [(N j i R hi).1,(N j i R hi).2] end F @[irreducible] def kx(X:Array kF)(a n t:Nat)(d:tProp)(d:∀q:Nat,P X[q]!)(q:Nat): P (X.extract a e)[q]!:=by by_cases h:q<(X.extract a e)в;have g:a+qif tif tkB w≠255/\kG w<=(F.aO X 0 0)г-1) (F.bd X (by omega) l)) (F.bd b (by omega) m) AP q p o iterate 2 exact F.cs _ _ _ _ _ _ _ _ _ _ _ _ _ (F.bd X (by omega) l) (F.bd b (by omega) m) AP q p o rfl /- General cached NR1 controls only the legacy multirow route. -/ end Dense namespace Bn namespace NativeAdd @[irreducible] def en(x:Float32):n5 x.toModel=lI x.toBits:=by exact congrArg Model.mk (pu x.toBits).symm @[irreducible] def ja(x:Float32):kW (n5 x.toModel)=x.toBits:=by change lA x.toBitsг=x.toBits;exact UInt32.ofNat_toNat @[irreducible] def bK(a:kF)(h:kB a≠255): (lx a).toBits=a/\(lx a).isFinite=true:=by have j:nX (spec:=li) a.toBitVec≠-1#8:=by intro g;apply h;apply Β.mp;have e:=congrArg BitVec.toNat g;rwa[(by rw[kB,Ξ,Υ,BitVec.extractLsb'_toNat];exact ζ _ 8:(kB a)г=(a.toBitVec.extractLsb' 23 8).toNat)] have e:(lx a).toBits=a:=by change BG (pT li (kL li a.toBitVec))=a;rw[Model.pack_unpack_eq,AC (λd=>j d.1)] use e;change (kL li (lx a).toBits.toBitVec).isFinite=true;rw[e];simp only[kL,j,ite_false];split<;>(try split)<;>rfl @[noinline]def e9(relu:Bool)(a b:Word):Word:= act relu (toWord (Model.add (ofW a) (ofW b))) @[inline]def add(relu:Bool)(a b:Word):Word:= if expOf a !=255&&expOf b !=255 then act relu (BL a+BL b).toBits else e9 relu a b @[irreducible] def gW(d:Bool)(a b:kF): add d a b=p8 d (kW (pb (lI a) (lI b))):=by rw[add];split;rename_i h;simp only[Η,AM]at h;have g:=bK a h.1;have j:=bK b h.2;have e:=ExecFloat.Binary.toModel_ofFloat32_add_of_isFinite (lx a) (lx b) g.2 j.2;simp only[ExecFloat.Binary.toModel_ofFloat32,en,g.1,j.1]at e;rw[<-e,<-en,ja];rfl end NativeAdd @[irreducible] def eC(x s t:kF)(p:kB x≠255)(m:kB s≠255)(o:kB t≠255) (V:Int) (l:V=sv x*sv s*2^(kG x+kG s)+sv t*2^(kG t+149)) (j:V≠0): kW (pd (lI x) (lI s) (lI t))=md V (-298) false:=by have g:=kV x p;have d:=kV s m;have e:=kV t o;rw[Model.Proof.fma_eq_spec,Model.Spec.fma] have h:Model.chooseNaN3 (lI x) (lI s) (lI t)=none:=(Model.chooseNaN3_eq_none_iff _ _ _).2 ⟨Χ g,Χ d,Χ e⟩ simp only[lI]at h⊢;simp only[h,ϡ g,ϡ d,ϡ e,Bool.or_false,υ,Am,g,d,e];refine(mf _ V _ _ j ?_).symm;rw[Model.addDyadic,pF];erw[pG];rw[lG,lG,lG,l];push_cast;simp[Ac];field_simp;ring @[noinline]def jq(relu:Bool)(w s t:Word):Word:=act relu (toWord (Model.fma (ofW w) (ofW s) (ofW t))) @[inline]def ad(rb:UInt32)(a b:Word)(_slow:Unit->Word):Word:=NativeAdd.add (rb !=0) a b @[specialize]def cE(stop:USize)(f:(i:USize)->iбWord->Word)(i:USize) (x:Array Word) (h:stopб<=xв):Array Word:= if hi:iiбkF->kF)(F:Nat->kF->kF) (p:∀i e w,f i e w=F iб w)(i:USize)(x:Array kF)(h:dб<=xв): (cE d f i x h)в=xв/\ ∀j,(cE d f i x h)[j]?=if iб<=j/\jhave o:iб?_⟩;rw[l,Dense.ac e,pP,Array.getElem?_set o];by_cases m:iб=j;subst m;rw[AC (by omega),AD rfl,AD (by omega),lC o,Option.map_some,p];rfl;rw[AC m];clear o g;split_ifs<;>first|rfl|omega next i x h e=>exact⟨rfl,λj=>by rw[AC (by rw[ε]at e;omega)]⟩ @[inline]def wX(x:UInt64):UInt64:=((x>>>34)<<<31)+((x&&&0x3FFFFFFFF)-0x255000000) @[irreducible] def xw(A X:Nat)(Q:A<2^64)(M:X=(A+268435457)%2^64/2^29) (H:X=(A+268435453)%2^64/2^29)(J:(2^64-1195+X/2^23%2^11)%2^64<253) (K:X%2^23≠0): 1195<=A/2^52%2^11/\A/2^52%2^11<=1447/\2<=(A%2^52+2^28)%2^29/\ (A%2^52+2^28)%2^29+2<=2^29/\1<=A%2^52/\A%2^52+2<=2^52/\ X/2^34=A/2^63/\X%2^34=A/2^52%2^11*2^23+(A%2^52+2^28)/2^29:=by have u:A+268435457<2^64:=by clear*-M Q K;omega rw[γ u]at M;rw[γ (AO (Nat.add_le_add_left ((by norm_num):268435453<=268435457) _) u)]at H have a1:=ϛ (A+268435457) (2^29);rw[<-M]at a1;have a2:=ϊ (A+268435457) (϶ 29) have a3:=ϛ (A+268435453) (2^29);rw[<-H]at a3 have b1:=ϛ A (2^52);have b2:=ϊ A (϶ 52);have b3:=ϛ (A/2^52) (2^11);have b4:=ϊ (A/2^52) (϶ 11) rw[(lY A (2^52) (2^11):A/2^52/2^11=A/2^63)]at b3 have e1:=ϛ X (2^23);have e6:=ϊ X (϶ 23);have e2:=ϛ (X/2^23) (2^11);have e3:=ϊ (X/2^23) (϶ 11);rw[(lY X (2^23) (2^11):X/2^23/2^11=X/2^34)]at e2 have e4:=ϛ X (2^34) have d1:=ϛ (A%2^52+2^28) (2^29);have d2:=ϊ (A%2^52+2^28) (϶ 29) clear M H u generalize(A+268435457)%2^29=t1 at*;generalize(A+268435453)%2^29=t2 at* generalize(A%2^52+2^28)%2^29=w at*;generalize(A%2^52+2^28)/2^29=y at* generalize A/2^52%2^11=E at*;generalize A/2^52=g at*;generalize A%2^52=f at*;generalize A/2^63=s at* generalize X/2^23%2^11=Xm at*;generalize X/2^23=Xg at*;generalize X%2^23=Xl at*;generalize X/2^34=Xh at*;generalize X%2^34=Xr at* have m:1195<=Xm/\Xm<=1447:=by clear*-J e3;omega have h1:g=Xg:=by clear*-a3 b1 e1 K e6 a1 a2 b2;omega subst h1;obtain⟨rfl,rfl⟩:E=Xm/\s=Xh:=by clear*-b3 e2 b4 e3;omega obtain⟨rfl,rfl⟩:y=Xl/\w=t2+3:=by clear*-d1 d2 a1 a3 a2 b1 e1;omega exact⟨m.1,m.2,by clear*-;omega,by clear*-a1 a2 a3;omega,by clear*-a3 b1 e1 K;omega,by clear*-a3 b1 e1 e6 a1 a2;omega,rfl,by clear*-e4 e1 e2;omega⟩ @[irreducible] def wq(d E Q:Nat)(m:d<2)(g:1195<=E)(h:E<=1447)(j:Q<=2^23): d*2^31+((E-1085-110)*2^23+(2^23+Q))= (d*2^31%2^64+(2^64-10015997952+(E*2^23+Q))%2^64)%2^64:=by obtain⟨e,rfl⟩:∃e,E=1195+e:=⟨E-1195,(by omega)⟩;rw[((by omega):1195+e-1085-110=e)];have l:e*2^23<=252*2^23:=ι _ (by omega);interval_cases d<;>omega @[irreducible] def cX(S:Float) (h:((S.toBits+268435457)>>>29==(S.toBits+268435453)>>>29&& (((S.toBits+268435457)>>>29>>>23)&&&2047)-1195<253&& (S.toBits+268435457)>>>29&&&8388607!=0)=true): Dense.F.ak S (Dense.F.eF S.toBits-1075)=wX ((S.toBits+268435457)>>>29)/\ 1195<=(Dense.F.eF S.toBits)а/\(Dense.F.eF S.toBits)а<=1447/\ (Dense.F.ak S (Dense.F.eF S.toBits-1075))йг%2^31<255*2^23/\ Dense.F.ak S (Dense.F.eF S.toBits-1075)<4294967296:=by unfold Dense.F.ak;simp only[UInt64.sub_add_cancel,UInt64.sub_self,((by decide):((1:UInt64)<<<(0:UInt64))=1),((by decide):decide ((0:UInt64)<=26)=true),Bool.true_and] generalize S.toBits=a at h⊢;generalize H:(a+268435457)>>>29=x at h⊢;have j(x:Nat):x&&&2047=x%2^11:=ζ x 11;have l(x:Nat):x&&&8388607=x%2^23:=ζ x 23;have t(x:Nat):x&&&536870911=x%2^29:=ζ x 29;have u(x:Nat):x&&&17179869183=x%2^34:=ζ x 34;have e:xа=(aа+268435457)%2^64/2^29:=by rw[<-H];simp only[ν,η,kA,kH,β] simp only[Η,AQ,AJ,AM,Ak]at h;obtain⟨⟨D,o⟩,E⟩:=h;have d:=congrArg lq D;rw[e]at d;simp only[ν,η,kA,kH,β]at d;rw[μ,Ζ]at o;simp only[Ε,ν,kA,kH,β,j]at o;have g:xа%2^23≠0:=λB=>E (ξ.mp (by rw[Ε];simpa only[kA,l])) obtain⟨y,z,I,J,K,L,M,A⟩:=xw _ _ a.toNat_lt e (e.trans d) o g;have p:(Dense.F.eF a)а=aа/2^52%2^11:=by simp only[Dense.F.eF,Ε,ν,kA,kH,β,j] have w:(a&&&0xfffffffffffff)а=aа%2^52:=by rw[Ε];exact ζ _ 52 rw[AD];have m:=Dense.F.g0 a (p▸y);rw[p,w]at m;have r:aа/2^63<2:=(by clear*-M e;omega);have q:(aа%2^52+2^28)/2^29<=2^23:=(by clear*-;omega);have v:(aа/2^52%2^11-1085-110)*2^23<=252*2^23:=ι _ (by clear*-z;omega);refine⟨?_,p▸y,p▸z,?_,?_⟩ .apply ξ.mp;rw[m];unfold wX;simp only[η,ψ,ν,Ζ,Ε,kA,kH,β,ο,u,M,A];exact wq _ _ _ r y z q .rw[Ϫ,m];clear*-r q v;omega .rw[μ,m];simp only[kA];clear*-r q v;omega simp only[Η,AJ,UInt64.reduceAdd,UInt64.reduceSub,AM,Ak,<-ξ];simp only[μ,Ζ,Ε,η,ν,p,w,kA,kH,β,l,t];rw[ζ _ 63,(by clear*-;omega:aа%2^63=aа/2^52%2^11*2^52+aа%2^52)];clear*-y z I J K L A g;omega @[irreducible] def jf(d:Bool)(o:UInt32)(j:oг%2^31<255*2^23): (if o&&&(if d then 0x80000000 else 0)!=0 then 0 else o)=p8 d o:=by have g:kB o≠255:=λh=>by have e:=congrArg mJ h;simp only[kB,Ξ,Υ,kN,kH,β]at e;rw[show(255:Nat)=2^8-1 from rfl,ζ]at e;omega cases d<;>simp[p8,reluW,g] @[irreducible] def rk(a:UInt64):(((a+268435457)&&&536870911)>=4:Bool)=((a+268435457)>>>29==(a+268435453)>>>29):=by rw[(by rw[UInt64.sub_eq_add_neg];ac_rfl:a+268435453=a+268435457-4)];generalize a+268435457=s;have:=s.toNat_lt;have l:(s&&&536870911).toNat=s.toNat%2^29:=by rw[Ε];exact ζ _ 29 rw[ϓ];simp only[AJ,AQ,GE.ge,θ,<-ξ,ν,Ζ,l,UInt64.toNat_ofNat,β,Nat.reduceMod,Nat.reducePow];omega @[inline]def eB(g:Bool)(m:UInt32)(Y Z:Float)(w:Word)(slow:Unit->Word):Word:= if g&&((w>>>23)&&&255)-1<254 then let a:=(Dense.F.dw w*Y+Z).toBits let x:=(a+268435457)>>>29 if ((a+268435457)&&&536870911)>=4&&((x>>>23)&&&2047)-1195<253&&x&&&8388607!=0 then let o:=(wX x)й if o&&&m !=0 then 0 else o else slow () else slow () @[irreducible] def i4(d:Bool)(s t w:kF)(g:Unit->kF) (l:g ()=p8 d (kW (pd (lI w) (lI s) (lI t)))): eB ((s>>>23)&&&255!=255&&(t>>>23)&&&255!=255) (if d then 0x80000000 else 0) (Dense.F.dw s) (Dense.F.dw t*Dense.F.pw 149) w g=p8 d (kW (pd (lI w) (lI s) (lI t))):=by open Dense Dense.F in rw[Bn.eB];dsimp only;split;swap;exact l;rename_i G;simp only[Η,AM,Ak,AJ]at G;obtain⟨⟨x,y⟩,m⟩:=G;change¬kB s=255 at x;change¬kB t=255 at y;replace m:¬kB w=255:=λh=>by change (w>>>23)&&&255=255 at h;rw[h]at m;exact absurd m (by decide) rw[rk];split;swap;exact l;rename_i L;obtain⟨v,p,q,D,E⟩:=cX _ L;rw[<-v];have it:=aT t;have W:=bm t;have iw:=aT w;have X:=bm w;have Y:=aT s;have U:=bm s;obtain⟨A,M⟩:=dJ w s m x;obtain⟨H,N⟩:=cI t y;obtain⟨I,O⟩:=iJ 149 (by decide);obtain⟨B,Q⟩:=aE _ _ H I (sv t) ((kG t+149:Nat):Int) (by rw[N,O,AA,AF];ring) (Ao (bg t) (by decide)) (by omega) (bL 24 _ 971 (by clear*-it W;omega) AP _ (bg t));have o:=jp (dw w*dw s+dw t*F.pw 149) (by omega);have j:=jz _ _ A B o _ (by omega) (by omega) (fK _ o);obtain⟨-,e⟩:=e8 _ _ A B _ (by omega) (by omega) j;have J:rv (dw w*dw s)+rv (dw t*F.pw 149)=((sv w*sv s*2^(kG w+kG s)+sv t*2^(kG t+149):Int):ℝ):=by rw[M,Q,tm,AA];push_cast;ring rw[J]at j e;generalize u:(sv w*sv s*2^(kG w+kG s)+sv t*2^(kG t+149):Int)=V at j e;generalize dw w*dw s+dw t*F.pw 149=S at E p q D o j e⊢;have K:((F.eF S.toBits-1075)а:Int)=((F.eF S.toBits)а:Int)-1075:=by rw[χ _ _ (by rw[θ];simp only[kA];omega)];simp only[kA];omega obtain⟨r,z⟩:=ce S o (F.eF S.toBits-1075) (by omega) V (e.trans (by rw[K,div_le_iff₀ ((by norm_num):(0:ℝ)<2)];have:=AG ((by norm_num):(1:ℝ)<=2) (by clear*-;omega:((F.eF S.toBits)а:Int)-1022-53<=((F.eF S.toBits)а:Int)-1075);have:(0:ℝ)<(2:ℝ)^(((F.eF S.toBits)а:Int)-1075):=(by positivity);linarith)) (j.le.trans (AG (by norm_num) (by omega))) E rw[eC w s t m x y V u.symm r,<-z];exact jf d _ D def bH(relu:Bool)(hw c:Nat)(s t:Array Word)(ch:Nat)(x:Array Word):Array Word:= if ch>>23)&&&255!=255&&(tc>>>23)&&&255!=255 let Y:=Dense.F.dw sc let Z:=Dense.F.dw tc*Dense.F.pw 149 bH relu hw c s t (ch+1) (if h:stopб<=xвthen cE stop (λ_ _ w=>eB g m Y Z w λ_=>jq relu w sc tc) (ch*hw)е x h else x) else x termination_by c-ch @[irreducible] def dn(g:Bool)(e c:Nat)(s t:Array kF)(d:Nat)(x:Array kF) (p:xв=c*e)(r:c*ep8 g (kW (pd (lI w) (lI s[j/e]!) (lI t[j/e]!)))) else x[j]?:=by induction hk:c-d generalizing d x unfold bH;rw[AC (by omega)];split .have:c*e<=d*e:=ι _ (by omega);rw[l5 (by omega)];rfl rfl;rename_i v;have q:dp8 g (kW (pd (lI w) (lI s[d]!) (lI t[d]!)))) (λ_ _ w=>i4 g s[d]! t[d]! w (λ_=>jq g w s[d]! t[d]!) rfl) (d*e)е x (by rw[h];omega);rw[v (d+1) _ (by rw[m,p]) (by omega),o,l,h,nO d e];clear hk;split_ifs<;>first|omega|rw[mG (k:=d) (by omega) (by rw[Ο];omega)]|rfl def br(relu:Bool)(c hw:Nat)(x s t:Array Word):Array Word:= if xв=c*hw/\c*hwkF) (g:e ()=p8 d (kW (pb (lI a) (lI b)))): ad (if d then 1 else 0) a b e=p8 d (kW (pb (lI a) (lI b))):=by cases d<;>simp[ad,NativeAdd.gW] @[noinline]def jN(relu:Bool)(x y:Word):Word:=act relu (toWord (Model.add (ofW x) (ofW y))) def cq(relu:Bool)(a b:Array Word):Array Word:= if h:aв<=bв/\aв let y:=b.uget i (by rw[Dense.aa h.2]at hi;omega) ad rb x y λ_=>jN relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b @[irreducible] def dT:cq=addReluSpec:=by funext d a b;rw[cq];dsimp only;split;rename_i h;have g:aвеб=aв:=Dense.aa h.2;apply mU;intro j;rw[(cL _ _ (λj x=>p8 d (kW (pb (lI x) (lI b[j]!)))) (λi l x=>?_) 0 a _).2 j,addReluSpec,mE];by_cases e:jBool) (fa:Nat->kF) (bx:UInt64) (s:lR) (J:Bool) (I K b:Array kF) (D:Bool) (nc Y:Nat) (r d:kF) (x:UInt64) (v:Int) (B a:UInt64) (m:Nat) (e j:USize) (bw:UInt64) (u:UInt32) {α:Type} @[irreducible] def mo{a b:Nat}(h:arw[h]<;>norm_num @[irreducible] def j9{n:Nat}(h:n<2^32):n%2^nx=n:=mo (AN h dj) @[irreducible] def jV(a:Array UInt32):a.usizeб<=aв:=by exact Ay _ _ @[inline]def ok(w:UInt32):Bool:= expOf w !=255&&(mW w==0||iW w-E<=C) @[inline]def eG(a:Array UInt32):UInt64:= a.foldl (λm w=>if mW w !=0&&iW w< m then iW w else m) 255 @[inline]def ct(h l:UInt64):UInt64:=(h<<<25)+l @[inline]def d4(h l:UInt64):UInt64:= ((h+0x8000000000000000)>>>(39:UInt64))-(16777216:UInt64)-(l>>>(63:UInt64))+ (if ct h l>>31!=0 then 0-m else m @[specialize]def lp(H:Nat)(f:Nat->Nat->Array UInt32->Array UInt32): Nat->Nat->Nat->Array UInt32->Array UInt32 | 0,_,_,a=>a | n+1,o,y,a=> let a:=f o y a if y+1USize->UInt32)(s:USize)(x:Nat):Nat->USize->Array UInt32->Array UInt32 | 0,_,a=>a | m+1,e,a=>dc f s (x+1) m (e+s) (a.push (f x e)) @[inline]def eT(O H W:Nat)(f:Nat->Nat->Nat->UInt32):Array UInt32:= if 0dc (λx _=>f o y x) 0 0 W 0) (O*H) 0 0 (AS (O*(H*W))) else#[] @[irreducible] def uL{a:Array UInt32}{i:USize}(h:iif iif iWord->α)(I:Array Word)(w k:Nat):Nat->Nat->Nat->α->α | 0,_,_,acc=>acc | n+1,i,dx,acc=> let acc:=g acc I[i]! if dx+1UInt64):=wl λ(a:UInt64) x=>a+f x @[reducible]def wa:=wl λ(b:Bool) x=>b&&Q x @[noinline]def cU(ch y x:Nat):Word:= dotOf (k*k) (poolAt h w k I ch y x) λ_=>oneW @[inline]def wo(A H:UInt64)(g:Unit->Bool)(fb:Unit->Word)(d:Word):Word:= if A=0/\H=0 then(if g ()then 0x80000000 else 0) else let r:=Dense.b9 (d4 H A) (ct H A) (B+149) eX (if r<4294967296 then rйelse fb ()) d @[inline]def aq(w:Word):UInt64:=if mW w !=0 then iW w else 255 @[inline]def cV(x0 x1 x2 x3:Word):Bool:=Q x0&&Q x1&&Q x2&&Q x3 @[inline]def eF(u:Word):UInt64:=((u>>>23)&&&255)н @[inline]def gT(ch y x:Nat)(e:USize):Word:= let v:=wе if hb:ecV (.==0x80000000) x0 x1 x2 x3) (λ_=>cU h w 2 I ch y x) d else toWord (Ar (ofW (cU h w 2 I ch y x)) (ofW d)) else toWord (Ar (ofW (cU h w 2 I ch y x)) (ofW d)) def df(I:Array Word)(B:UInt64)(stop:USize)(hs:stopб<=Iв)(e:USize)(acc:UInt64):UInt64:= if h:edc (gT h w I d o y) 2 0 (w/2) ((o*h+y*2)*w)е) (c*(h/2)) 0 0 (AS (c*(h/2*(w/2)))) else let q:=cK (k*k) let bx:=eG I if bx<=255/\I.all (ok q bx)=true then eT c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k wo bx (fj I bx w k U) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>cU h w k I ch y x) d else eT c (h/k) (w/k) λch y x=> let U:=(ch*h+y*k)*w+x*k let B:=wl (λ(m:UInt64) v=>min m (aq v)) I w k (k*k) U 0 255 if B<=255/\wa (ok q B) I w k (k*k) U 0 true=true then wo B (cr (t1 B) I w k (k*k) U 0 0) 0 (λ_=>wa (.==0x80000000) I w k (k*k) U 0 true) (λ_=>cU h w k I ch y x) d else toWord (Ar (ofW (cU h w k I ch y x)) (ofW d)) else avgpoolSpec c h w k I @[irreducible] def eQ:ae x=(xа:Int)-2^64*(xа/2^63:Nat):=by rw[ae];rw[lv];have e:x.toBitVec.toNat=xа:=rfl;have:=x.toNat_lt;split<;>omega @[irreducible] def jC(h:(xа:Int)≡v [ZMOD2^64])(d:-2^63<=v) (e:v<2^63):ae x=v:=by rw[eQ];have:=x.toNat_lt;rw[pe]at h;omega noncomputable def Z:ZMod (2^64):=xа @[irreducible] def iB:(xа:Int)≡v [ZMOD2^64]↔Z x=v:=by rw[Z] rw[show((xа:ℕ):ZMod (2^64))=(((xа:ℤ)):ZMod (2^64)) by push_cast;rfl, ZMod.intCast_eq_intCast_iff] rfl @[irreducible] def sZ(h:Z x=v)(d:-2^63<=v)(e:v<2^63): ae x=v:=jC x v ((iB x v).mpr h) d e @[irreducible] def fI(b:UInt64):Z (a+b)=Z a+Z b:=by unfold Z;rw[η,BN];push_cast;ring @[irreducible] def iX(b:UInt64):Z (a-b)=Z a-Z b:=by have d:=b.toNat_lt;unfold Z;rw[Ζ,BN,Nat.cast_add,pO (by omega)];rw[show((2^64:Nat):ZMod (2^64))=0 from ZMod.natCast_self _];ring @[irreducible] def bF:Z 0=0:=by simp[Z] @[irreducible] def cB{B:UInt64}(h:B<=255):Bа<=255:=by simpa using θ.mp h noncomputable def bU(e:Nat)(w:UInt32):Int:=sv w*2^(idxOf w-e) @[irreducible] def cz(h:kM u=0):sv u=0:=by rw[sv];simp[h] @[irreducible] def kd(h:kM u=0):mW u=0:= ξ.mp (by rw[an,h];rfl) @[irreducible] def dI(w:UInt32)(m:Eа<=255)(l:Cа<=62)(h:ok C E w=true): kB w≠255/\(kM w=0\/(Eа<=kG w/\kG w<=Eа+Cа/\ (iW w-E)а=kG w-Eа)):=by rw[ok,Η,AM,Ak,nM,AQ]at h;refine⟨h.1,?_⟩;rcases h.2 with d|e .left;have:=an w;simp[d]at this;omega .right;have j:=am w;have g:=θ.mp (As.mp e);have:=idxOf_le w h.1;rw[Ζ,j]at g⊢;omega @[irreducible] def pw(v s c:Nat)(e:v<2^24)(d:s<=c):v*2^s<2^(24+c):=by rw[AF];exact ly e (Θ (by norm_num) d) (by positivity) @[irreducible] def fw(e:UInt64)(w:UInt32)(c:Nat)(p:c<=39) (h:kM w=0\/(eа<=kG w/\kG w<=eа+c/\ (iW w-e)а=kG w-eа)): (mW w<<<(iW w-e))а=kM w*2^(kG w-eа)/\ kM w*2^(kG w-eа)<2^(24+c):=by have j:=lB w;rcases h with d|⟨m,o,l⟩;rw[kd w d,d];simp;have g:=pw _ _ c j ((by omega):kG w-eа<=c);refine⟨?_,g⟩;rw[ψ,an,l,ο,γ (a:=kG w-eа) (by omega)];exact γ (AN g (Θ (by norm_num) (by omega))) @[irreducible] def jK(b:UInt64):((a+b)а:Int)≡(aа:Int)+bа [ZMOD2^64]:=by rw[pe];rw[η];omega @[irreducible] def g5(b:UInt64):((a-b)а:Int)≡(aа:Int)-bа [ZMOD2^64]:=by have:=b.toNat_lt;rw[pe];rw[Ζ];omega @[irreducible] def ji: (((a+(0x8000000000000000:UInt64))>>>(39:UInt64))а:Int)= (aа/2^39:Nat)+(if aа<2^63 then 2^24 else-2^24):=by have d:=a.toNat_lt;rw[ν,η];simp only[β,mY,nr,kH];split<;>omega @[irreducible] def eU(d e:UInt64): aw (d4 d e) (ct d e)=ae d*2^25+ae e:=by have j:=d.toNat_lt;have l:=e.toNat_lt have o:(ct d e)а=((dа%2^39)*2^25+eа)%2^64:=by unfold ct;rw[η,ψ];simp only[ο,mY,nr,kH];rw[(Nat.mul_mod_mul_right 33554432 dа 549755813888:dа*33554432%18446744073709551616=_)] have u:((d4 d e)а:Int)≡_ [ZMOD2^64]:=(jK _ _).trans (((g5 _ _).trans ((g5 _ _).sub_right _)).add_right _) have E2:(e>>>(63:UInt64))а=eа/2^63:=by rw[ν];simp only[β,mY,nr,kH] rw[ji,E2,show((16777216:UInt64)а:Int)=2^24 from rfl]at u have f1:=ϛ dа (2^39);have f2:=ϛ (dа%2^39*2^25+eа) (2^64);have f3:dа/2^63<2:=Ϟ j;have f4:eа/2^63<2:=Ϟ l;have f5:=ϊ dа (϶ 39);have f6:dа/2^39<2^25:=Ϟ j have f7:=ϛ dа (2^63);have f8:=ϊ dа (϶ 63) rw[aw,eQ d,eQ e,o] generalize hc:((if ct d esimp only[pS,ϋ]<;>omega have hy':y=16777216-33554432*(s:Int):=by rw[<-hy];clear*-f7 f8 j;split<;>omega subst hc' hy' have v:=jC _ _ u (by clear*-f3 f4 f6;omega) (by clear*-f3 f4 f6 f2 f5 l;omega);rw[v];clear*-f1 f2;omega @[irreducible] def fB(a b:UInt32)(d e:Nat)(g:kM a=0\/d<=kG a)(j:kM b=0\/e<=kG b):tm a b=bU d a*bU e b*2^(d+e):=by unfold tm bU;rcases g with g | g .simp[cz a g] rcases j with j | j .simp[cz b j] rw[((by omega):kG a+kG b=(kG a-d)+(kG b-e)+(d+e)),AF,AF];ring @[irreducible] def cJ(f:Nat->Int)(M:Int)(h:∀th t (mr d)).trans ((by simp))) noncomputable abbrev ag(g:Nat->UInt32):Array UInt32:=Aj (n:=m) λq=>g qи @[irreducible] def ec(g:Nat->UInt32):(ag m g).push (g m)=ag (m+1) g:=by simp[ag];rw[Array.ofFn_succ (f:=λq:Fin (m+1)=>g qи)];rfl @[irreducible] def cf(o y x H W:Nat)(g:yNat->Array UInt32->Array UInt32)(S:Nat->Array UInt32->Prop) (j:∀o y a,yS (o*H+y) a->S (o*H+y+1) (f o y a)): ∀n o y a,yS (o*H+y) a->S (o*H+y+n) (lp H f n o y a):=by intro n;induction n<;>intro o y a l h;exact h;rename_i n e;have d:=j o y a l h;simp[lp];split_ifs with g;exact(by ring:o*H+y+(n+1)=o*H+(y+1)+n)▸e _ _ _ g d;obtain rfl:H=y+1:=(by omega);exact(by ring:o*(y+1)+y+(n+1)=(o+1)*(y+1)+0+n)▸e _ _ _ (by omega) ((by ring:(o+1)*(y+1)+0=o*(y+1)+y+1)▸d) @[irreducible] def kb(H W n c:Nat)(d:Nat->Nat->Array UInt32->Array UInt32)(F:Nat->Nat->Nat->UInt32)(r:0o*H+y(∀jd o y (ag M g)=ag (M+W) g): lp H d n 0 0 (lQ c)=ag (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W):=by simpa[A7,ϳ,Κ,Ϗ W n]using iu H d (λk a=>k<=n->a=ag (W*k) λq=>F (q/(H*W)) (q/W%H) (q%W)) (λo y a e v A=>v (by omega)▸u _ _ _ _ e (by omega) λj x=>by obtain⟨l,m,p⟩:=cf o y j H W e x;simp[(by ring:W*(o*H+y)+j=(o*H+y)*W+j),l,m,p,Κ]) n 0 0 _ r λ_=>rfl @[irreducible] def iK(f:Nat->USize->UInt32)(g:Nat->UInt32)(s:USize):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jе))->dc f s x m e (ag M g)=ag (M+m) g:=by intro m;induction m<;>intro x e M l;rfl;rename_i o;have d:=l 0 (by omega);rw[ϑ,ϑ,show(0:Nat)е=0 from rfl,USize.mul_zero,USize.add_zero]at d;rw[dc,<-d,ec,o _ _ _ λj p=>by rw[((by omega):M+1+j=M+(j+1)),l _ (by omega),((by omega):x+(j+1)=x+1+j),show(j+1)е=jе+1 from mC j 1,USize.mul_add,USize.mul_one,USize.add_assoc,USize.add_comm (s*_)]];congr 1;omega @[irreducible] def d8(H W n c:Nat)(s:USize)(E:Nat->Nat->USize)(F:Nat->Nat->Nat->USize->UInt32)(d:0dc (F o y) s 0 W (E o y)) n 0 0 (lQ c)= ag (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)е):=kb H W n c _ (λo y x=>F o y x (E o y+s*xе)) d λ_ _ _ _ _ _ e=>iK _ _ _ _ _ _ _ λj g=>by rw[e j g,Κ] @[irreducible] def iO(O H W:Nat)(f:Nat->Nat->Nat->UInt32): eT O H W f=ag (O*(H*W)) λq=>f (q/(H*W)) (q/W%H) (q%W):=by rw[eT];split_ifs with h .rw[d8 _ _ _ _ 0 (λ_ _=>0) (λo y x _=>f o y x) h,Ϛ] .simp[ag,((by omega):H=0)] @[irreducible] def jl(g:α->kF->α)(I:Array kF)(w k U:Nat): ∀n j e d,ewl g I w k n (U+j*w+e) e d= (pV (j*k+e) n).foldl (λd t=>g d I[U+t/k*w+t%k]!) d:=by intro n;induction n<;>intro j e d l;rfl;rename_i m;rw[BS,Ϸ,wl,(by rw[Τ,Ρ _ _ (by omega),ώ l,Κ]:(j*k+e)/k=j),(by rw[Τ,Μ,Conv.mo l]:(j*k+e)%k=e)];split_ifs with h;exact m j (e+1) _ h;obtain rfl:k=e+1:=(by omega);rw[(by rw[nO];omega:U+j*w+e+w+1-(e+1)=U+(j+1)*w+0),m (j+1) 0 _ (by omega)];congr 2;ring @[irreducible] def gc(g:α->kF->α)(I:Array kF)(w k U n:Nat)(d:α)(e:0g d I[U+t/k*w+t%k]!) d:=by have:=jl g I w k U n 0 0 d e;simp[ϳ,ϑ,<-List.range_eq_range']at this;exact this @[irreducible] def aa(h:n<2^32):nеб=n:=j9 h @[irreducible] def fJ:Z x=((xа:Int):ZMod (2^64)):=by rw[Z];norm_cast @[irreducible] def gS:Z x=((ae x:Int):ZMod (2^64)):= (iB x _).mp (by rw[eQ];rw[pe];omega) @[irreducible] def jj(m:UInt64)(h:mа<2^62): ae (sg u m)=if k9 u then-(mа:Int)else mа:=by unfold sg;rw[fy];cases k9 u<;>simp only[fT,ite_true,ite_false] .exact sZ _ _ (fJ m) (by omega) (by omega) .exact sZ _ _ (by rw[iX,bF,fJ];push_cast;ring) (by omega) (by omega) @[irreducible] def gC:ok C E 0=true:=rfl @[irreducible] def gi(a:Array UInt32)(p:UInt32->Bool)(h:a.all p=true)(e:p 0=true)(q:Nat): p a[q]! =true:=by by_cases d:q⟨Ah (2^(kи+7)) (Dense.F.dw 0)⟩ def zPq(n:Nat):FloatArray:= let k:=Aq n+1-7 if k<10 then ZPq[k]!else⟨Ah n (Dense.F.dw 0)⟩ @[irreducible] def zPs(n:Nat):n<=(zPq n)д/\((zPq n)д<=2^16\/(zPq n)д=n)/\∀q<(zPq n)д,(zPq n).data[q]! =Dense.F.dw 0:=by dsimp only[zPq];split;rw[AB ZPq _ (by simp[ZPq];omega)];simp only[ZPq,Λ,kS,Array.size_replicate];refine⟨(ϙ (n:=n)).le.trans (Θ (by decide) (by omega)),.inl (Θ (by decide) (by omega)),λq h=>?_⟩;simp_all;simp_all[kS] @[irreducible] def uU{Y:FloatArray}{i:USize}(g:idб+nб<=Yд->Yд<2^32-> (fcU I p d n hs hp j Y)д=Yд/\∀q intro j Y e a b;have h:¬jby have:=ε.mp h;clear*-this e;omega rw[fcU,dif_neg h];exact⟨rfl,λq _=>by rw[if_neg (by omega)]⟩ | succ m ih=> intro j Y e a b;have h:j?_⟩;clear e a b rw[v q (by rw[sz];exact hq),Dense.ac h,Conv.uS _ _ _ _ _ hq,dj] by_cases c1:dб+(jб+1)<=q/\qrб<=nб->yб=rб%s.h->pб=rб*s.w->dб=(rб/s.h*(s.h+2)+rб%s.h+1)*(s.w+2)+1-> (s.cin*(s.h+2)+3)*(s.w+2)<=Yд->Yд<2^32-> (∀q (fRU I hs w V U h n r p d y Y)д=Yд/\∀q intro r p d y Y e a b c f N O J have E:=Nat.sub_eq_zero_iff_le.mp e have hr:¬rAX _ (AN (ε.mp h) E) rw[fRU,dif_neg hr];refine⟨rfl,λq hq=>?_⟩;rw[J q hq];congr 1 split;rfl rename_i k;unfold aI;rw[if_neg];rintro⟨u,v,x,-⟩ have:(q/((s.h+2)*(s.w+2))+1)*s.h<=s.cin*s.h:=ι _ u rw[Ϡ,one_mul]at this;clear*-k this hn E v x;omega | succ m ih=> intro r p d y Y e a b c f N O J have hr:rk (USize.toNat_inj.mp (by rw[y1];clear*-j hh;omega)) obtain⟨q1,q2⟩:=(Nat.div_mod_unique h0).mpr (⟨by clear*-rq;omega,by clear*-this b ym;omega⟩:rб%s.h+1+s.h*(rб/s.h)=rб+1/\rб%s.h+1omega .rw[if_neg (by clear*-k;omega),if_neg (by clear*-k;omega)] rw[yE,ed] obtain⟨u2,v2⟩:=ih (r+1) (p+w) d' y' (fcU I p d w hs hp 0 Y) (by rw[hR,<-Nat.sub_sub,e,BK]) (by rw[hR];exact R) (by rw[by',hR]) (by rw[hP,hR]) (by rw[bd',hR]) (by rw[u];exact N) (by rw[u];exact O) (by rw[u,hR];exact J') rw[u2,u];exact⟨rfl,λq hq=>v2 q (by rw[u];exact hq)⟩ @[irreducible] def iQ(A:Array Nat)(u:USize)(h:uбFloat):Dense.F.A8:=⟨f 0,f 1,f 2,f 3,f 4,f 5,f 6,f 7⟩ @[irreducible] def fW(f:Nat->Float)(r:Nat)(d:r<8):(eH f).f r=f r:=by rw[eH];interval_cases r<;>rfl @[irreducible] def kq(p:Nat->Float)(n t:Nat)(a:Float)(h:tFloat)(n t:Nat)(a:Float)(h:¬tomega @[irreducible] def jc(d t:Nat):px d t<=2:=by rw[px];split<;>omega @[irreducible] def jb(d t e:Nat)(g:d=9\/d=1)(j:tsimp<;>omega abbrev fP(s:ConvShape)(kk:Nat):Prop:= s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1/\kk=9\/s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\kk=1 structure CD where s:ConvShape I:Array Word K:Array Word b:Array Word X:FloatArray T:Array Nat D:Bool J:Bool k:Nat M:Nat L:Nat hh:UInt64 Y:Nat kk:Nat hX:Xд<2^32 @[irreducible] def cZ(n:Nat):(kJ n)д=0:=by simp[kJ,kS] def fQ:Bool:=System.Platform.target.startsWith "aarch64" structure CC(M:Nat)where Tz:Array Nat Wz:FloatArray wo:Nat n:Nat ni:Bool h1:n<=Tzв h2:wo+n<=Wzд h3:wo+n<2^32 h4:∀td.X.get! (q+d.T[t]!)*Dense.F.dw d.K[ko+t]!) (λ_=>Dense.F.dw oneW*Dense.F.dw d.b[o]!) λ_=>act d.J (aB d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x) @[inline]def dR(relu:Bool)(w:Word):Word:=if relu&&w&&&0x80000000!=0 then 0 else w @[irreducible] def jI(d:Bool)(w:kF)(e:kB w≠255):dR d w=p8 d w:=by rw[dR,p8,reluW];cases d<;>simp[e] @[irreducible] def ep(S:Float)(h:UInt64)(e:Dense.F.ak S h<4294967296): kB (Dense.F.ak S h)й≠255:=by unfold Dense.F.ak at e⊢;dsimp only at e⊢;split at e;swap;exact absurd e (by decide);rename_i d;rw[AD d];simp only[Η,AJ]at d;obtain⟨⟨⟨-,l⟩,-⟩,-⟩:=d;have m:(Dense.F.eF S.toBits)а<2048:=by unfold Dense.F.eF;rw[Ε];exact AO ϝ (by decide) have o:(S.toBits&&&0xfffffffffffff)а<2^52:=by rw[Ε];exact AO ϝ (by decide) rw[μ,Ζ]at l;simp only[kA]at l;have r:=Dense.F.g0 S.toBits ((by omega):1195<=(Dense.F.eF S.toBits)а);have q:S.toBitsа/2^63<2:=by have:=S.toBits.toNat_lt;clear*-this;omega rw[μ]at e;simp only[kA]at e;intro g;have j:=congrArg mJ g;rw[kB,Ξ,Υ,Ϫ]at j;simp only[kN,kH,β]at j;rw[ζ _ 8,γ e,r]at j;(clear*-l m o j;omega) noncomputable def bV(d:CD)(o y x:Nat)(S:Float):Word:= let c:=Dense.F.ak S d.hh if h:c<4294967296 then dR d.J cйelse ow d o y x S @[irreducible] def iE(d:CD)(o y x:Nat)(S:Float):bV d o y x S=ow d o y x S:=by unfold bV;dsimp only;split .rename_i e;rw[jI _ _ (ep _ _ e)];rw[ow,Dense.F.tw,Dense.F.tf];dsimp only;rw[AD e] .rfl @[inline]def ju(d:CD)(o y:Nat)(xb:USize)(r:Nat)(S:Float):Word:= let c:=Dense.F.ak S d.hh if c<4294967296 then dR d.J cйelse ow d o y (xbб+r) S @[irreducible] def iF(d:CD)(o y:Nat)(e:USize)(r:Nat)(S:Float):ju d o y e r S=bV d o y (eб+r) S:=rfl @[inline]def su(a:Array Word)(u:USize)(v:Word):Array Word:= if h:uWord)(n r q:Nat)(a:Array Word):Array Word:= if rkF)(n q:Nat):∀m r (a:Array kF),n-r=m->r<=n->(pl g n r q a)в=aв/\ ∀iintro r a l o;rw[pl,AC (by omega)];exact⟨rfl,λi e=>by rw[AC (by omega)]⟩ |succ m p=> intro r a l o;obtain⟨u,j⟩:=p (r+1) (a.set! (q+r) (g r)) (by omega) (by omega);rw[pl,AD (by omega),u,BU];refine⟨rfl,λi e=>?_⟩;rw[j i (by rwa[BU])];by_cases d:i=q+r;subst d;rw[Array.getElem!_set!_self _ _ _ e];clear*-l;split_ifs<;>first|rfl|omega|(congr 1;omega) rw[Array.getElem!_set!_ne _ _ _ _ (Ne.symm d)];clear*-d;split_ifs<;>first|rfl|omega @[inline]def ln(d:CD)(o y:Nat)(xb nq q r:USize)(S:Float)(a:Array Word):Array Word:= if rkF)(n q:Nat):∀m r (a:Array kF),n-r=m->r<=n-> pl g (n+1) r q a=(pl g n r q a).set! (q+n) (g n):=by intro m;induction m<;>intro r a d e;have:r=n:=(by omega);subst this;conv_lhs=>rw[pl,AD (by omega),pl,AC (by omega)] conv_rhs=>rw[pl,AC (by omega)] rename_i j;conv_lhs=>rw[pl,AD (by omega)] rw[j (r+1) _ (by omega) (by omega)];conv_rhs=>rw[pl,AD (by omega)] @[irreducible] def ka(d:CD)(o y:Nat)(g e q:USize)(A:Dense.F.A8)(a:Array kF)(p:qб+eбbV d o y (gб+r) (A.f r)) (po k eб) 0 qб a)= pl (λr=>bV d o y (gб+r) (A.f r)) (po (k+1) eб) 0 qб a:=by subst l;rw[ln];by_cases h:rbV d o y (gб+r) (A.f r)) (po 8 eб) 0 qб a:=by have L:=ka d o y g e q A a l;have j:=L 0 0 (by simp) A.a0 rfl;rw[Nat.zero_min,pl,AC (by decide)]at j;unfold a9 simp only[j,L 1 1 (by simp) A.a1 rfl,L 2 2 (by simp) A.a2 rfl,L 3 3 (by simp) A.a3 rfl,L 4 4 (by simp) A.a4 rfl,L 5 5 (by simp) A.a5 rfl,L 6 6 (by simp) A.a6 rfl,L 7 7 (by simp) A.a7 rfl,Nat.reduceAdd] @[irreducible] def l0(d:USize)(h:0Nat->Nat->USize->USize->USize->Dense.F.A8->Array Word->Array Word)(Wz X:@&FloatArray)(Tz:@&Array Nat)(wo n:USize)(M:Nat) (hs:Xд<2^32/\Wzд<2^32) (hn:nб<=Tzв) (hT:∀tNat->Nat->USize->USize->USize->Dense.F.A8->Array kF->Array kF)(g X:FloatArray)(e:Array Nat)(l n:USize)(M:Nat) (U:Xд<2^32/\gд<2^32) (hn:nб<=eв) (N:∀tX.data[iб+e[s]!+r]!*g.data[lб+s]!) nб tб (Dense.F.A8.f ⟨p,u,v,x,B,D,G,H⟩ r)): ey W g X e l n M U hn N hW i O d o y xb nq q a t p u v x B D G H=W d o y xb nq q A a:=by open Dense Dense.F in induction m generalizing t p u v x B D G H A have h:¬tby have:=ε.mp h;omega rw[ey,dif_neg h];congr 1;exact j2 _ _ λr I=>by rw[K r I,kp _ _ _ _ (by omega)] rename_i ih;have h:tby rw[ug,iQ,aj (by rw[L];have:=ς;clear*-O hM hc U this;omega),L] have J:∀j,g.uget (l+t) j=g.data[lб+tб]!:=λj=>by rw[ug,aj (by have:=ς;omega)] refine ih (t+1) _ _ _ _ _ _ _ _ A (by rw[ac h];omega) λr I=>?_;rw[K r I,kq _ _ _ _ Y,ac h];congr 1;interval_cases r<;>(simp only[A8.f];rw[rx _ (by simp only[kD];omega),J];simp only[kD]) @[noinline]def fC(d:CD)(o y:Nat)(xb nq q:USize)(A:Dense.F.A8)(a:Array Word):Array Word:= a9 d o y xb nq q A a noncomputable def dK(d:CD)(c:CC d.M)(o y xb r:Nat):Float:= Dense.F.ao (λt=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+xb+ c.Tz[t]!+r]!*c.Wz.data[c.wo+t]!) c.n 0 (Dense.F.dw oneW*Dense.F.dw d.b[o]!) @[inline]def gY(W:CD->Nat->Nat->USize->USize->USize->Dense.F.A8->Array Word->Array Word)(d:@&CD)(c:@&CC d.M)(o y:Nat)(xb nq q i:USize) (hi:iб+d.M+8<=d.Xд) (bp:Float) (a:Array Word):Array Word:= ey W c.Wz d.X c.Tz c.woе c.nе d.M ⟨d.hX,c.h5⟩ (by have:=ς;have:=c.h3;rw[Dense.aa (by omega)];exact c.h1) (by have:=ς;have:=c.h3;rw[Dense.aa (by omega)];exact c.h4) (by have:=ς;have:=c.h3;rw[Dense.aa (by omega),Dense.aa (by omega)];exact c.h2) i hi d o y xb nq q a 0 bp bp bp bp bp bp bp bp @[irreducible] def gZ(d:CD)(c:CC d.M)(o y:Nat)(e m q i:USize)(p:iб+d.M+8<=d.Xд)(l:Float) (a:Array kF) (j:iб=(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+eб) (g:l=Dense.F.dw ld*Dense.F.dw d.b[o]!): gY a9 d c o y e m q i p l a=a9 d o y e m q (eH (dK d c o y eб)) a:=by subst g;unfold gY;have:=ς;have:=c.h3;refine g9 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>?_;rw[fW _ _ u];unfold dK;simp only[j,Dense.aa ((by omega):c.woNat->Nat->USize->USize->USize->Dense.F.A8->Array Word->Array Word)(d:@&CD)(c:@&CC d.M)(o y:Nat)(xb nq q i:USize)(bp:Float)(a:Array Word) (hI:iб+nqб+d.M+7<=d.Xд):Array Word:= if h:0kF) (G:∀g x,g<=x->xxbV d o y x (dK d c o y g (x-g))=F x): ∀m (g e q i:USize) (a:Array kF) (v:iб+eб+d.M+7<=d.Xд),eб<=m-> gб+eб=d.s.w-> iб=(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+gб-> qб+eб<=aв->aв<2^32-> (rB a9 d c o y g e q i u a v)в=aв/\∀jintro g e q i a v hm hx L hq J;rw[rB,dif_neg (λh=>by have:=l0 e h;omega)];exact⟨rfl,λj _=>by rw[AC (by omega)]⟩ |succ m ih=> intro g e q i a v hm hx L hq J;have S:=ς;have:=d.hX;by_cases h:0bV d o y (gб+r) ((eH (dK d c o y gб)).f r)) (po 8 eб) qб _ 0 a rfl (ϟ _);have I:∀j,qб<=j->jbV d o y (gб+(j-qб)) ((eH (dK d c o y gб)).f (j-qб))=F (gб+(j-qб)):=λj _ _=>by rw[fW _ _ (by omega),<-G gб _ (by omega) (by omega) (by omega),ϱ] by_cases l:8?_⟩;rw[Y j (by rwa[p]),K j A,N,O,U];clear L hx hm J N O e4 this S;split_ifs<;>first|rfl|omega|(congr 1;omega)|exact I j (by omega) (by omega) have B:¬8l (ε.2 (by simp only[kD];omega));rw[dif_neg l];refine⟨p,λj A=>?_⟩;rw[K j A];clear L hx hm J this S;split_ifs<;>first|rfl|omega|exact I j (by omega) (by omega) have h0:eб=0:=by have:=mt ε.2 h;simp only[kD]at this;omega rw[rB,dif_neg h];exact⟨rfl,λj _=>by rw[AC (by omega)]⟩ @[specialize]def c8(h len:Nat)(V:USize)(i0:Nat)(hN:i0+h*Vбy(q:Nat)->(i:USize)->iб=i0+y*Vб->Array Word->Array Word) (y q:Nat) (i:USize) (hi:iб=i0+y*Vб) (a:Array Word):Array Word:= if hy:yy(q:Nat)->(i:USize)->iб=o+y*Vб->Array kF->Array kF) (r N:Nat) (G:Nat->kF) (F:∀y (g:yaв=N-> (f y g q i e a)в=aв/\∀jy<=h->q=r+y*d->aв=N-> (c8 h d V o x f y q i e a)в=aв/\ ∀jintro y q i e a H g p l .have u:y=h:=(by omega);subst u;rw[c8,dif_neg (AX _)];exact⟨rfl,λj _=>by rw[AC (by omega)]⟩ rename_i K;have g:y?_⟩;rw[D j (v▸A),B j A];clear*-J I p;split_ifs<;>first|rfl|omega @[specialize]def db(W:CD->Nat->Nat->USize->USize->USize->Dense.F.A8->Array Word->Array Word)(d:@&CD)(c:@&CC d.M)(o q:Nat)(bp:Float)(a:Array Word):Array Word:= let V:=d.s.w+2 let i0:=(if d.D then o else 0)*((d.s.h+2)*V) if hb:i0+(d.s.h-1)*V+d.s.w+d.M+7<=d.Xдthen c8 d.s.h d.s.w Vе i0 (by have:=d.hX;have:=ς;have:=Nat.sub_one_mul d.s.h V;have hV:V=d.s.w+2:=rfl;rw[Dense.aa (by omega)];omega) (λy hy q i hi a=>rB W d c o y 0 d.s.wе qе i bp a (by have:=d.hX;have:=ς;have:=ι V (Nat.le_sub_one_of_lt hy) have hV:V=d.s.w+2:=rfl;rw[Dense.aa (by omega)]at hi;rw[Dense.aa (by omega)];omega)) 0 q i0е (by have:=d.hX;have:=ς;rw[Dense.aa (by omega)];simp) a else a @[irreducible] def iG(d:CD)(c:CC d.M)(o q:Nat)(l:Float)(a:Array kF)(N:Nat)(G:Nat->kF) (m:∀y (v:yq'=q+y*d.s.w->eв=N-> (rB a9 d c o y 0 d.s.wе q'е i l e u)в=eв/\ ∀j(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+(d.s.h-1)*(d.s.w+2)+d.s.w+d.M+7<=d.Xд): (db a9 d c o q l a)в=aв/\ ∀jm y v q' i e _ (by rw[F,Dense.aa H]) r p) _ 0 q _ _ a rfl (ϟ _) (by simp) A;rw[dif_neg g];use rfl,λj _=>by rw[(pM.mp λh=>g (B (ϵ h)):d.s.h=0),ϳ,ϑ,AC (by omega)] def bA(K:Array Word)(T:Array Nat)(M ok k:Nat)(hT:∀tby rw[ϣ]at hj by_cases hjs:jNat, (∀jℝ,(∀sz s=0)->∑j∈range Tzв,z (ix j)=∑s∈range t,z s @[irreducible] def ft(K:Array kF)(T:Array Nat)(M A k:Nat)(H:∀tNZ K T A t Tz Wz-> NZ K T A k (bA K T M A k H I t Tz Wz p u v g).Tz (bA K T M A k H I t Tz Wz p u v g).Wz:=by intro m;induction m with |zero=>intro t Tz Wz p u v g L h;rw[bA,dif_neg (by omega)];rwa[((by omega):t=k)]at h |succ m J=>intro t Tz Wz p u v g L h;replace L:k=t+m+1:=(by omega);obtain⟨p,u,x,o,l⟩:=h;rw[bA,AT (by omega)];dsimp only;split<;>rename_i G;refine J (t+1) Tz Wz _ _ _ _ (by omega) ⟨p,(by omega),x,λj r=>⟨by have:=(o j r).1;omega,(o j r).2⟩,λz g=>?_⟩;rw[l z (λs D q=>g s (by omega) q),Ν,g t (by omega) G,Av];refine J (t+1) _ _ _ _ _ _ (by omega) ⟨by rw[ϣ,Dense.F.bW,p],by rw[ϣ];omega,λj=>if j?_,λz g=>?_⟩;rw[ϣ]at r;by_cases d:jby rw[AD (ϥ.1 r)]:∑j∈kP Tzв,z (if jg s (by omega) q),Ν] noncomputable def dF(d:CD)(Z:Bool)(Wd:FloatArray)(hT:∀tby simp at hj) else have hok:o*d.k+d.k<=d.Y*d.k:=by rw[<-Ο];exact ι _ ho ⟨d.T,Wd,o*d.k,d.k,fQ,hkT,hok.trans (hW.resolve_left hZ).1,(by omega),hT,(hW.resolve_left hZ).2⟩ @[irreducible] def eM(K:Array kF)(T:Array Nat)(M q k:Nat)(o:∀t (bA K T M q k o p t Tz d g e j l).n=(bA K T M q k o p t Tz d g e j l).Tzв/\ (bA K T M q k o p t Tz d g e j l).wo=0:=by intro m;induction m with |zero=>intros;rw[bA,dif_neg (by omega)];use rfl |succ m r=>intros;rw[bA,AT (by omega)];dsimp only;split<;>exact r _ _ _ _ _ _ _ (by omega) @[irreducible] def fm(d:CD)(Z:Bool)(p:FloatArray)(u:∀t∀qNat,c.n<=d.k/\ (∀jℝ,(∀sz s=0)-> ∑j∈kP c.n,z (m j)=∑s∈kP d.k,z s:=by by_cases D:Z=true .have⟨⟨l,L⟩,J,I,m,g,r⟩:(c.n=c.Tzв/\c.wo=0)/\NZ d.K d.T (o*d.k) d.k c.Tz c.Wz:=by subst O;rw[dF,AT D];exact⟨eM _ _ _ _ _ u v _ 0 _ _ _ _ _ _ rfl,ft _ _ _ _ _ u v _ 0 _ _ _ _ _ _ rfl ⟨by rw[cZ];simp,(by simp),id,λj e=>by simp at e,λz _=>(by simp)⟩⟩ refine⟨by rw[<-J];omega,m,l▸I,λj e=>by rw[L,Κ];exact g j (l▸e),l▸r⟩ have ah:o*d.k+d.k<=d.Y*d.k:=Ο _ _▸ι _ U;subst O;rw[dF,dif_neg D];use(by dsimp only;exact(X.resolve_left D).2),id,AP,(λj e=>by dsimp only at e⊢;exact⟨e,rfl,x (by simpa using D) (o*d.k+j) (by omega)⟩),λz _=>rfl @[irreducible] def gG(s:lR)(I:Array kF)(d:s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1) (y x t:Nat)(e:t/9first|rfl|omega @[irreducible] def gF(s:lR)(I:Array kF)(d:s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0) (y x t:Nat)(j:yfirst|rfl|omega @[irreducible] def iI(s:lR)(I:Array kF)(e:Nat)(q:fP s e)(y x t d:Nat)(u:y?_⟩;rw[z3 q hq];unfold aI;rw[if_neg (by simp[c])] have:s.h+2<=s.cin*(s.h+2):=Nat.le_mul_of_pos_left _ c;have:3*(s.w+2)<=(s.cin*(s.h+2)+3)*(s.w+2):=Nat.mul_le_mul_right _ (by omega);have:(s.cin*(s.h+2)+3)*1<=(s.cin*(s.h+2)+3)*(s.w+2):=Nat.mul_le_mul_left _ (by omega);have:s.cin*s.h<=s.cin*(s.h+2):=Nat.mul_le_mul_left _ (by omega);obtain⟨u,v⟩:=fRUs I s d s.wе (s.w+2)е (3*(s.w+2))е s.hе (s.cin*s.h)е (aa _ e) (aa _ (by omega)) (aa _ (by omega)) (aa _ (by omega)) (aa _ (by omega)) g hN h0 _ 0 0 (s.w+3)е 0 _ rfl (by simp) (by simp) (by simp) (by rw[aa _ (by omega),Ϧ,Nat.zero_div,Nat.zero_mod];ring) z1 Z (λq hq=>by rw[z3 q hq,if_neg (by simp)]);rw[xF,u];exact⟨z1,Z,v⟩ @[irreducible] def gX(h w d j l y m e V:Nat)(x:V=w+2)(g:e=(h+2)*V)(p:yNat) (hs:fP d.s d.kk) (a3:0ℝ,(∀sz s=0)-> ∑j∈kP c.n,z (l j)=∑s∈kP d.k,z s) (S:Float) (hS:S=Dense.F.ao (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) c.n 0 (Dense.F.dw ld*Dense.F.dw d.b[o]!)): bV d o y x S=p8 d.J (aB d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x):=by have a0:=hc o ho;have hB:=gX d.s.h d.s.w d.s.cin v (if d.D then o else 0) y x ((d.s.h+2)*(d.s.w+2)) (d.s.w+2) rfl rfl hy g a0 a3 have p:∀t[exact pZ h.2.2.2.2;exact BA h.2.2.2.2] have a7:(if d.D then o else 0)+pc d.kk tif tif tfalse) (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) (λj=>tm (ll d.s d.I y x ((if d.D then o else 0)*d.kk+l j)) d.K[o*d.k+l j]!) (tm ld d.b[o]!) P d.L c.n (λj g=>by obtain⟨i1,i2,i3⟩:=e j g;(try dsimp only);rw[i2,i3];exact p _ i1) (λ_ _ h=>absurd h lN) (λj g=>by have:=r (l j) (e j g).1.le;simpa only[AD (e j g).1]using this) (by have:=r d.k AP;simpa only[AX,Am]using this) (by clear*-bh hL;omega) m (by clear*-ah;omega) c.n 0 _ rfl (ϟ _) u.1 (by rw[u.2,Finset.sum_range_zero,Av,sub_self,A5,Nat.cast_zero,zero_mul]) have ba:((tm ld d.b[o]!:Int):ℝ)+∑j∈kP c.n, ((tm (ll d.s d.I y x ((if d.D then o else 0)*d.kk+l j)) d.K[o*d.k+l j]!:Int):ℝ)= (af (d.k+1) (λt=>if tif t(tm (if sby simp only[AD a5,tm,cz d.K[o*d.k+s]! (by rw[<-an,h0];rfl),mul_zero,zero_mul,Int.cast_zero])] simp only[AX,Am];rw[add_comm];exact congrArg (·+_) (ϔ rfl λj g=>by simp only[AD (e j (ϥ.mp g)).1]) rw[iE,hS];unfold ow;simp only[Dense.F.gg] refine(Dense.F.jE d.J d.k (λt=>if tif tDense.F.dw ld*Dense.F.dw d.b[o]!) d.hh P d.L (λ_=>p8 d.J (aB d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x)) (λt B=>by simp only[AD B];exact p t B) (by simpa only[AX,Am]using u) (λt _=>?_) r hL m ah G (by unfold aB;rw[Dense.bO]) _ fS ?_).trans (by unfold aB;rw[Dense.bO]) .dsimp only;split .exact⟨(iS d.s d.I A hx _ _ _).1,(hw _).1⟩ .exact⟨(by decide),(hb _).1⟩ .rw[<-ba] refine eS.trans ?_ rw[<-AA,<-AK AL] exact(AE bp (zpow_nonneg zero_le_two _)).trans (by rw[<-AA,<-AK AL];exact AG one_le_two (by rw[G];clear*-bb;omega)) noncomputable def g7(d:CD)(Z:Bool)(Wd:FloatArray)(hT:∀t let c:=dF d Z Wd hT hk hkT hW hY o ho if c.ni=true then db fC d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else db a9 d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a) 0 0 0 (by simp) (Ah (d.Y*(d.s.h*d.s.w)) 0) @[irreducible] def g8(d:CD)(Z:Bool)(p:FloatArray)(hW:Z=true\/d.Y*d.k<=pд/\pд<2^32)(G IX IW IB P:Nat) (hs:fP d.s d.kk) (al:0∀qp8 d.J (aB d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w)else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w)):=by rw[g7] obtain⟨aL,ba⟩:=eE d.Y (d.s.h*d.s.w) 0 0 (by have:=ς;simp only[kD,A7];clear*-this U;omega) (λo A q _ _ a=> let c:=dF d Z p hT l m hW j o A if c.ni=true then db fC d c o q (Dense.F.dw ld*Dense.F.dw d.b[o]!) a else db a9 d c o q (Dense.F.dw ld*Dense.F.dw d.b[o]!) a) 0 (d.Y*(d.s.h*d.s.w)) (λq=>p8 d.J (aB d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w)else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w))) (λo A q _ _ a hq hN=>by try dsimp only generalize bv:dF d Z p hT l m hW j o A=c;obtain⟨bG,ix,a7,bp,aH⟩:=fm d Z p hT l m hW j a4 o A c bv;have:=ς;have hV:d.s.w+2<=d.Xд:=le_trans (lZ _ (Nat.succ_pos _)) r have bs:(o+1)*(d.s.h*d.s.w)<=d.Y*(d.s.h*d.s.w):=ι _ A;rw[Ο]at bs;rw[show fC=a9 from rfl,ite_self] refine iG d c o q _ a _ _ (λy hy H i a' hI hi bw O=>?_) hN (by omega) (λbb=>by have a6:=gX _ d.s.w _ G _ (d.s.h-1) (d.s.w-1) _ _ rfl rfl (Nat.sub_lt bb Nat.one_pos) (Nat.sub_lt bB Nat.one_pos) (hc o A) al rw[<-hM]at a6;omega) try dsimp only have bt:(y+1)*d.s.w<=d.s.h*d.s.w:=ι _ hy;rw[Ο]at bt;have e:(o*d.s.h+y)*d.s.w=H:=by rw[Ϡ,Ϛ,bw,hq,Κ] have B:d.s.wp8 d.J (aB d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x)) (λxb x h1 h2 h3=>jQ d c G IX IW IB P ix hs al bq hc hM a3 hT r a5 hx hw hb a0 a1 hL N a2 bh o y x A hy h3 a7 bp aH _ (by rw[dK] exact congrArg (λf=>Dense.F.ao f c.n 0 _) (funext λt=>by rw[lO _ c.Tz[t]! (x-xb),pA _ xb (x-xb),BQ h1]))) _ 0 d.s.wе Hе i a' hI AP (by rw[Dense.aa B];simp only[kD,Κ]) (by rw[hi];simp only[kD,ϑ]) (by rw[Dense.aa as,Dense.aa B,O];clear*-bs bt bw hq;omega) (by rw[O];exact U) simp only[Dense.aa as,Dense.aa B,kD,Κ]at u;refine⟨u.1,λi hi=>?_⟩ rw[u.2 i hi];by_cases g:H<=i/\i?_ have ah:i(wdU K i n Y)д=Yд:=by intro m;induction m with |zero=>intros;rw[wdU,dif_neg (λh=>by have:=ε.mp h;omega)] |succ m r=>intro i Y e;have h:isimp only[uZ] @[irreducible] def wdUs(K:Array kF)(n:USize)(hK:Kв<2^32):∀m (i:USize)(Y:FloatArray),nб-iб=m->nб<=Yд->Yд<2^32->(∀q ∀q intro i Y e a b c q hq;rw[wdU,dif_neg (λh=>by have:=ε.mp h;omega),c q (by omega),if_pos (by omega)] |succ m ih=> intro i Y e a b c;have h:i?_ rw[sz]at hq;rw[uS _ _ _ _ _ hq,Dense.ac h,c q hq];by_cases q1:iб=q .subst q1;rw[if_pos rfl,if_pos (by omega),kr] .rw[if_neg q1];by_cases q2:q< iб .rw[if_pos q2,if_pos (by omega)] .rw[if_neg q2,if_neg (by omega)] .rename_i k;refine ih (i+1) Y (by rw[Dense.ac h];omega) a b λq hq=>?_ rw[c q hq,Dense.ac h];by_cases q2:q< iб .rw[if_pos q2,if_pos (by omega)] .by_cases q3:q=iб .subst q3;rw[if_neg q2,if_pos (by omega),getElem!_neg K _ (λhh=>k (ε.mpr (by rw[kz];exact hh)))];rfl .rw[if_neg q2,if_neg (by omega)] def wd(Z:Bool)(K:Array Word)(n:Nat)(hn:n<2^32):{W:FloatArray//Z=true\/n<=Wд/\Wд<2^32}:= if hZ:Z=true then⟨AR 0,Or.inl hZ⟩ else⟨wdU K 0 nе (zPq n),BA ⟨by rw[wdUz _ _ _ _ _ rfl];exact(zPs n).1,by rw[wdUz _ _ _ _ _ rfl];rcases(zPs n).2.1 with z|z;omega;rw[z];exact hn⟩⟩ @[irreducible] def tB(kk nc A B:Nat)(g:kk=9\/kk=1):∀tpc kk t*A+py kk t*B+px kk t) (nc*kk) (AS (nc*kk)))[t]!<=(nc-1)*A+2*B+2:=by intro t h;rw[Dense.F.iC,AB _ _ (by simpa using h),Λ];dsimp only;have:=jb kk t nc g h;have:=jd kk t;have:=jc kk t;have:pc kk t*A<=(nc-1)*A:=ι _ (by omega);have:py kk t*B<=2*B:=ι _ (by omega);omega structure Qz where a0:Float a1:Float a2:Float a3:Float a4:Float a5:Float a6:Float a7:Float k:UInt8 @[inline]def Qy(R:Qz):Dense.F.A8:=⟨R.a0,R.a1,R.a2,R.a3,R.a4,R.a5,R.a6,R.a7⟩ def Qj(Wz X:@&FloatArray)(Tz:@&Array Nat)(wo n:USize)(M:Nat) (hs:Xд<2^32/\Wzд<2^32) (hn:nб<=Tzв) (hT:∀tX.data[iб+e[s]!+r]!*g.data[lб+s]!) nб tб (Dense.F.A8.f ⟨p,u,v,x,b,D,G,H⟩ r)): Qy (Qj g X e l n M U hn N hW i O B t p u v x b D G H)=A:=by open Dense Dense.F in induction m generalizing t p u v x b D G H have h:¬tby have:=ε.mp h;omega rw[Qj,dif_neg h];exact j2 _ _ λr I=>by rw[K r I,kp _ _ _ _ (by omega)];rfl rename_i ih;have h:tby rw[ug,iQ,aj (by rw[L];have:=ς;clear*-O hM hc U this;omega),L] have J:∀j,g.uget (l+t) j=g.data[lб+tб]!:=λj=>by rw[ug,aj (by have:=ς;omega)] refine ih (t+1) _ _ _ _ _ _ _ _ (by rw[ac h];omega) λr I=>?_;rw[K r I,kq _ _ _ _ Y,ac h];congr 1;interval_cases r<;>(simp only[A8.f];rw[rx _ (by simp only[kD];omega),J];simp only[kD]) @[irreducible] def Qq(d:CD)(c:CC d.M)(o y:Nat)(xb nq q i:USize)(hi:iб+d.M+8<=d.Xд)(bp:Float)(a:Array kF)(B:Qz): a9 d o y xb nq q (Qy (Qj c.Wz d.X c.Tz c.woе c.nе d.M ⟨d.hX,c.h5⟩ (by have:=ς;have:=c.h3;rw[Dense.aa (by omega)];exact c.h1) (by have:=ς;have:=c.h3;rw[Dense.aa (by omega)];exact c.h4) (by have:=ς;have:=c.h3;rw[Dense.aa (by omega),Dense.aa (by omega)];exact c.h2) i hi B 0 bp bp bp bp bp bp bp bp)) a=gY a9 d c o y xb nq q i hi bp a:=by unfold gY rw[Qb _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ (eH λr=>Dense.F.ao (λs=>d.X.data[iб+c.Tz[s]!+r]!*c.Wz.data[c.woеб+s]!) c.nеб (USize.toNat 0) bp) rfl (λr u=>by rw[fW _ _ u,Dense.F.f8])] exact (g9 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>by rw[fW _ _ u,Dense.F.f8]).symm def Qh(d:@&CD)(c:@&CC d.M)(o:@&Nat)(bp:Float)(V:USize)(i0:Nat)(hN:i0+d.s.h*Vбiuб+nqб+d.M+7<=d.Xд) (a:Array Word)(B:Qz):Array Word:= if hy:yby have:=hI hy;have:=l8 nq h8;have:=ς;have:=d.hX;rw[u8 iu (by omega),s8 nq h8];omega) a' A else Qh d c o bp V i0 hN hb (y+1) (qN+d.s.w) (iR+V) (by have:=ι Vб hy;rw[Ο]at this⊢;rw[Dense.aj (by omega),hi];omega) 0 d.s.wе (qN+d.s.w)е (iR+V) (λg=>by have h1:=ι Vб hy;have h2:=ι Vб (Nat.le_sub_one_of_lt g);rw[Ο]at h1 h2;have:=d.hX;have:=ς rw[Dense.aj (by omega),Dense.aa (by omega)];omega) a' A else Qh d c o bp V i0 hN hb (y+1) (qN+d.s.w) (iR+V) (by have:=ι Vб hy;rw[Ο]at this⊢;rw[Dense.aj (by omega),hi];omega) 0 d.s.wе (qN+d.s.w)е (iR+V) (λg=>by have h1:=ι Vб hy;have h2:=ι Vб (Nat.le_sub_one_of_lt g);rw[Ο]at h1 h2;have:=d.hX;have:=ς rw[Dense.aj (by omega),Dense.aa (by omega)];omega) a B else a termination_by (d.s.h-y,nqб) decreasing_by .apply Prod.Lex.right;have:=l8 nq h8;rw[s8 nq h8];omega .apply Prod.Lex.left;omega .apply Prod.Lex.left;omega @[irreducible] def Qhe(d:CD)(c:CC d.M)(o:Nat)(bp:Float)(V:USize)(i0:Nat)(hN:i0+d.s.h*Vб∀i:USize,iб=i0+y*Vб->iб+d.s.wеб+d.M+7<=d.Xд): ∀k y,d.s.h-y=k->∀m (xb nq qu iu:USize),nqб<=m->∀qN (iR:USize) (hi:iRб=i0+y*Vб) hI a B, Qh d c o bp V i0 hN hb y qN iR hi xb nq qu iu hI a B= if hy:yrB a9 d c o y 0 d.s.wе qе i bp a (hr y hy i hi)) (y+1) (qN+d.s.w) (iR+V) (by have:=ι Vб hy;rw[Ο]at this⊢;rw[Dense.aj (by omega),hi];omega) (rB a9 d c o y xb nq qu iu bp a (hI hy)) else a:=by intro k;induction k with |zero=>intro y e m xb nq qu iu _ qN iR hi hI a B;rw[Qh,dif_neg (by omega),dif_neg (by omega)] |succ k ih=> intro y e m;have hy:yrB a9 d c o y 0 d.s.wе qе i bp a (hr y hy i hi)) (y+1) (qN+d.s.w) (iR+V) hi' a:=λqN iR hi' hI' a B=>by rw[ih (y+1) (by omega) _ 0 d.s.wе (qN+d.s.w)е (iR+V) AP (qN+d.s.w) (iR+V) hi' hI' a B] conv_rhs=>rw[c8] induction m with |zero=> intro xb nq qu iu hm qN iR hi hI a B have h:¬0by have:=l0 nq h;omega rw[Qh,dif_pos hy,dif_neg h,dif_pos hy,R qN iR];congr 1;rw[rB,dif_neg h] |succ m im=> intro xb nq qu iu hm qN iR hi hI a B by_cases h:0rw[rB,dif_pos h,dif_pos h8] .rw[dif_neg h8,R qN iR];congr 1;conv_rhs=>rw[rB,dif_pos h,dif_neg h8] .rw[Qh,dif_pos hy,dif_neg h,dif_pos hy,R qN iR];congr 1;rw[rB,dif_neg h] def Ql(d:@&CD)(c:@&CC d.M)(o q:Nat)(bp:Float)(a:Array Word):Array Word:= let V:=d.s.w+2 let i0:=(if d.D then o else 0)*((d.s.h+2)*V) if hb:i0+(d.s.h-1)*V+d.s.w+d.M+7<=d.Xд then Qh d c o bp Vе i0 (by have:=d.hX;have:=ς;have:=Nat.sub_one_mul d.s.h V;have hV:V=d.s.w+2:=rfl;rw[Dense.aa (by omega)];omega) (by have:=d.hX;have:=ς;have hV:V=d.s.w+2:=rfl;rw[Dense.aa (by omega)];exact hb) 0 q i0е (by have:=d.hX;have:=ς;rw[Dense.aa (by omega)];simp) 0 d.s.wе qе i0е (λ_=>by have:=d.hX;have:=ς;rw[Dense.aa (by omega),Dense.aa (by omega)];omega) a ⟨bp,bp,bp,bp,bp,bp,bp,bp,0⟩ else a @[irreducible] def Qle(d:CD)(c:CC d.M)(o q:Nat)(bp:Float)(a:Array kF):Ql d c o q bp a=db a9 d c o q bp a:=by unfold Ql db;dsimp only;congr 1;funext hb rw[Qhe d c o bp _ _ _ _ (λy hy i hi=>by have:=d.hX;have:=ς;have:=ι (d.s.w+2) (Nat.le_sub_one_of_lt hy);rw[Dense.aa (by omega)]at hi;rw[Dense.aa (by omega)];omega) _ 0 rfl _ 0 d.s.wе qе _ AP q _ _ _ a _] conv_rhs=>rw[c8] def Qd(K:Array Word)(T:Array Nat)(M k Y:Nat)(Z:Bool)(Wd:FloatArray)(hT:∀tby simp at hj) else have hok:o*k+k<=Y*k:=by rw[<-Ο];exact ι _ ho ⟨T,Wd,o*k,k,fQ,hkT,hok.trans (hW.resolve_left hZ).1,(by omega),hT,(hW.resolve_left hZ).2⟩ def Qc(d:CD)(Z:Bool)(Wd:FloatArray)(hT:∀t if g:opc kk t*HV+py kk t*V+px kk t) (nc*kk) (AS (nc*kk)) let Z:=K.any λu=>Core.mW u==0 ⟨Dense.F.aO K 0 0,T,Z,Qw Z K (Y*(nc*kk)), if g:(kk=9\/kk=1)/\Y*(nc*kk)<2^32/\nc*kk<2^32/\nc*kk<=Tв then Array.ofFn (n:=Y) λo=>Qd K T ((nc-1)*HV+2*V+2) (nc*kk) Y Z (Qw Z K (Y*(nc*kk))) (tB kk nc HV V g.1) g.2.2.1 g.2.2.2 (Qs Z K _ g.2.1) g.2.1 o.1 o.2 else AS 0⟩ def Qo(K:Array Word)(kk nc HV V Y:Nat)(p:QV ((nc-1)*HV+2*V+2)):Prop:= ((kk=9\/kk=1)->∀tp.Z=true\/Y*(nc*kk)<=p.Wд/\p.Wд<2^32)/\ ((kk=9\/kk=1)->∀a b e f g,∀o (ho:otB kk nc HV V g,λg=>Qs _ K _ g,λg0 a b e f g o ho=>?_⟩ have u:(Qp K kk nc HV V Y).G=Array.ofFn (n:=Y) λo=>Qd K (Qp K kk nc HV V Y).T ((nc-1)*HV+2*V+2) (nc*kk) Y (Qp K kk nc HV V Y).Z (Qp K kk nc HV V Y).W a b e f g o.1 o.2:=dif_pos ⟨g0,g,b,e⟩ have v:o<(Qp K kk nc HV V Y).Gв:=by rw[u,Ϝ];exact ho refine⟨v,?_⟩;simp only[u,Λ] abbrev QS(K:Array Word)(kk nc HV V Y:Nat):={p:QV ((nc-1)*HV+2*V+2)//p=Qp K kk nc HV V Y} structure QE where K:Array Word kk:Nat nc:Nat HV:Nat V:Nat Y:Nat v:QS K kk nc HV V Y @[noinline]def Qr:ST.Ref Unit (List QE):=(ST.Prim.mkRef ([]:List QE) (Void.mk ())).val @[irreducible] def Qu{K:Array Word}{kk nc HV V Y:Nat}(x y:QS K kk nc HV V Y):x=y:=Subtype.ext (x.2.trans y.2.symm) @[noinline]def Qn(K:Array Word)(kk nc HV V Y:Nat):QS K kk nc HV V Y:=⟨Qp K kk nc HV V Y,rfl⟩ @[noinline]def Qi(K:Array Word)(kk nc HV V Y:Nat)(v:QS K kk nc HV V Y):QS K kk nc HV V Y:= let st:=(ST.Prim.Ref.get Qr (Void.mk ())).val let old:=(ST.Prim.Ref.swap Qr (⟨K,kk,nc,HV,V,Y,v⟩::(st.filter (fun e=> !(decide (kk=e.kk)&&decide (nc=e.nc)&&decide (HV=e.HV)&&decide (V=e.V)&&decide (Y=e.Y)&&Dense.F.DPEq K e.K))).take 15) (Void.mk ())).val if old.length<999999999 then v else Qn K kk nc HV V Y def Qf(K:@&Array Word)(kk nc HV V Y:Nat)(st:@&List QE):Option (QS K kk nc HV V Y):= match st with |[]=>none |e::es=> if g:e.kk=kk/\e.nc=nc/\e.HV=HV/\e.V=V/\e.Y=Y then if hw:Dense.F.DPEq K e.K=true then let v:QS K kk nc HV V Y:=by obtain⟨g1,g2,g3,g4,g5⟩:=g;have he:=Dense.F.DPEq_ok hw;subst g1 g2 g3 g4 g5 he;exact e.v some (withPtrAddr K (fun p=>withPtrAddr e.K (fun q=>if p=q then v else Qi K kk nc HV V Y v) (fun _ _=>Qu _ _)) (fun _ _=>Qu _ _)) else Qf K kk nc HV V Y es else Qf K kk nc HV V Y es @[noinline]def Qt(K:Array Word)(kk nc HV V Y:Nat):QS K kk nc HV V Y:= if Kв<=1048576 then let st:=(ST.Prim.Ref.get Qr (Void.mk ())).val match Qf K kk nc HV V Y st with |some v=>v |none=>Qi K kk nc HV V Y (Qn K kk nc HV V Y) else Qn K kk nc HV V Y def Qm(s:ConvShape)(J:Bool)(I K b:Array Word)(D:Bool)(nc Y:Nat)(p:QV ((nc-1)*((s.h+2)*(s.w+2))+2*(s.w+2)+2)) (hp:Qo K (s.kh*s.kw) nc ((s.h+2)*(s.w+2)) (s.w+2) Y p):Array Word:= let H:=s.h+2 let V:=s.w+2 let HV:=H*V let kk:=s.kh*s.kw let k:=nc*kk let ex:=Dense.F.aO I 0 0 let ew:=p.ew let eb:=Dense.F.aO b 0 0 let P:=max (48+(exг-1)+(ewг-1)) (174+(ebг-1)) let L:=Aq (k+1)+1 let M:=(nc-1)*HV+2*V+2 let T:=p.T if hg:fP s kk/\0[exact pZ h.2.2.2.2;exact BA h.2.2.2.2] have hT:∀tpc (s.kh*s.kw) t*((s.h+2)*(s.w+2))+py (s.kh*s.kw) t*(s.w+2)+px (s.kh*s.kw) t) (d*(s.kh*s.kw)) (AS (d*(s.kh*s.kw)))) (h3:p0.Z=K.any λu=>Core.mW u==0) (h4:∀g:Y*(d*(s.kh*s.kw))<2^32,p0.W=(wd p0.Z K (Y*(d*(s.kh*s.kw))) g).1) (hd:D=false/\d=s.cin/\Y=s.cout\/D=true/\d=1/\Y=s.cin): Qm s J I K b D d Y p0 hp=dS s J I K b D:=by obtain⟨ew,T,Z,W,G⟩:=p0;dsimp only at h1 h2 h3 h4;subst h1 h2 h3 unfold Qm;dsimp only;split swap;. rfl rename_i hg;obtain⟨hs,a2,aH,as,ah,X,U,H,p,G,aL,a1,u,A,v,x,al,hI,r⟩:=hg;dsimp only have h5:=h4 v;subst h5;rw[Qe] have hA:s.ho=s.h:=by rcases hs with⟨e,j,l,m,-⟩ | ⟨e,j,l,m,-⟩<;>simp[ConvShape.ho,e,j,l,m]<;>(clear*-a2;omega) have hB:s.wo=s.w:=by rcases hs with⟨e,j,l,m,-⟩ | ⟨e,j,l,m,-⟩<;>simp[ConvShape.wo,e,j,l,m]<;>(clear*-aH;omega) have hc:∀oby rcases hd with⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp<;>(clear*-ho;omega) obtain⟨g,g2,O⟩:=dP s I G A hI u a2 have L:∀tpc (s.kh*s.kw) t*((s.h+2)*(s.w+2))+ py (s.kh*s.kw) t*(s.w+2)+px (s.kh*s.kw) t) (d*(s.kh*s.kw)) (AS (d*(s.kh*s.kw))))[t]! = pc (s.kh*s.kw) t*((s.h+2)*(s.w+2))+py (s.kh*s.kw) t*(s.w+2)+px (s.kh*s.kw) t:=λt ht=>by rw[Dense.F.iC,AB _ _ (by simpa using ht),Λ] have a0:=@ϙ (d*(s.kh*s.kw)+1) rw[g8 _ _ _ _ d _ _ _ _ (by exact hs) as (by rfl) (by exact hc) (by rfl) (by exact L) (tB _ _ _ _ (by rcases hs with h|h<;>[exact pZ h.2.2.2.2;exact BA h.2.2.2.2])) (by exact al) (by exact x) (by exact v) (by exact g) (by exact g2) (by exact O) (λhZ=>by dsimp only;rw[hZ];unfold wd;rw[dif_neg lN];dsimp only obtain⟨z1,z2,z3⟩:=zPs (Y*(d*(s.kh*s.kw)));have:=aa _ v intro q hq;exact wdUs K _ aL _ 0 _ rfl (by rw[this];exact z1) (by rcases z2 with z|z;omega;rw[z];exact v) (λq hq=>by rw[z3 q hq,if_neg (by simp)]) q (by rw[this];exact hq)) (by exact Dense.F.bd I (by have:=ς;clear*-this G;omega) ah) (by exact Dense.F.bd K (by have:=ς;clear*-this aL;omega) X) (by exact Dense.F.bd b (by have:=ς;clear*-this a1;omega) U) (le_max_left _ _) (le_max_right _ _) (by dsimp only;omega) (by exact p) (by exact H) (by dsimp only;rw[Ϣ,Α (by simp only[n0];omega)]) (by exact aH) (by exact r)] rcases hd with⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp only[dS,fT,ite_true,ite_false] all_goals simp only[conv2dSpec,conv2dWith,depthwiseSpec,depthwiseWith,hA,hB] refine mi (by simp[hA,hB]) λq e _=>?_ rw[Ϝ]at e simp only[ag,Λ] congr 1 unfold aB;simp only[Dense.bO,Ϛ,n4,ϳ,Κ] @[irreducible] def ev(s:lR)(J:Bool)(I K b:Array kF)(D:Bool)(d Y:Nat) (hd:D=false/\d=s.cin/\Y=s.cout\/D=true/\d=1/\Y=s.cin): fL s J I K b D d Y=dS s J I K b D:= have q:=(Qt K (s.kh*s.kw) d ((s.h+2)*(s.w+2)) (s.w+2) Y).2 Qv s J I K b D d Y _ (by rw[q];exact Qk _ _ _ _ _ _) (by rw[q];rfl) (by rw[q];rfl) (by rw[q];rfl) (by rw[q];exact λg=>Qa _ K _ g) hd def er:Array Word:= fL s J I K b false s.cin s.cout def cG:Array Word:= fL s J I K b true 1 s.cin @[irreducible] def eu:er=conv2dSpec:=by funext s J I K b;exact ev s J I K b false s.cin s.cout (.inl ⟨rfl,rfl,rfl⟩) @[irreducible] def cY:cG=depthwiseSpec:=by funext s J I K b;exact ev s J I K b true 1 s.cin (.inr ⟨rfl,rfl,rfl⟩) @[irreducible] def aZ:(kB u)г=uг/2^23%256:=by rw[kB];rw[Ξ,Υ,show(255:UInt32)г=2^8-1 from rfl,ζ];simp[β] @[irreducible] def aP:(lK u)г=uг%2^23:=by rw[lK];rw[Ξ,show(8388607:UInt32)г=2^23-1 from rfl,ζ] noncomputable def Kf:Nat:= (if m/2^23=0 then m%2^23 else 2^23+m%2^23)*2^(if m/2^23=0 then 0 else m/2^23-1) @[irreducible] def iA:kM u*2^kG u=Kf (uг%2^31):=by have d:uг%2^31/2^23=(kB u)г:=by rw[aZ];omega have e:uг%2^31%2^23=(lK u)г:=by rw[aP];exact Nat.mod_mod_of_dvd _ (by decide) unfold kM kG Kf;rw[d,e];simp only[<-Β,nj] @[irreducible] def iU:Kf m<2^(m/2^23+23):=by unfold Kf;split_ifs with h .rw[h];simpa using ϊ m (show 0<2^23 by norm_num) .have:=ϐ ((by omega):2^23+m%2^23<2^24) (϶ (m/2^23-1));rwa[<-AF,((by omega):24+(m/2^23-1)=m/2^23+23)]at this @[irreducible] def dv(e d:Nat)(h:epush_cast<;>ring @[irreducible] def bf: (sk u)г=if uг<2^31 then uг+2^31 else if uг=2^31 then 2^31 else 2^32-1-uг:=by have:=u.toNat_lt;rw[sk];split_ifs<;>simp_all[Ι,<-Β,pU]<;>omega @[irreducible] def ga(a b:UInt32)(h:sk aKf m⟨dv m n,by constructor<;>intro e;subst e;decide;have:=dv 0 m;by_contra;have:Kf 0=0:=(by decide);omega⟩ have d:=a.toNat_lt;have g:=b.toNat_lt;have F1:=F (aг%2^31) (bг%2^31);have F2:=F (bг%2^31) (aг%2^31) generalize aг=A at*;generalize bг=B at*;clear F by_cases hA:A<2^31 ·by_cases hB:B<2^31 ·rw[AD hA,AD hB]at h;rw[AC (not_le.2 hA),AC (not_le.2 hB)];exact Int.ofNat_lt.2 (F1.1 (by clear*-h hA hB;omega)) ·rw[AD hA,AC hB]at h;exact absurd h (by clear*-hB;split<;>omega) ·rw[AC hA]at h;rw[AD (not_lt.1 hA)];by_cases hB:B<2^31 ·rw[AD hB]at h;rw[AC (not_le.2 hB)];split at h<;>omega ·rw[AC hB]at h;rw[AD (not_lt.1 hB)];exact neg_lt_neg (Int.ofNat_lt.2 (F2.1 (by clear*-h hA hB d g;split at h<;>split at h<;>omega))) @[irreducible] def g6:Model.cmpDyadic (nh y) (nh z)=compare (kv y) (kv z):=by have d:∀w,(nh w).toReal=(kv w:ℝ)*2^(-149:Int):=λw=>by rw[<-ϖ,lG,kv];push_cast;rw[Ac AL,AA];ring have e:(0:ℝ)<2^(-149:Int):=(by positivity);cases h:compare (kv y) (kv z);rw[Model.cmpDyadic_lt_iff,d,d];exact AI (mod_cast compare_lt_iff_lt.1 h) e;rw[Model.cmpDyadic_eq_iff,d,d,compare_eq_iff_eq.1 h];rw[Model.cmpDyadic_gt_iff,d,d];exact AI (mod_cast compare_gt_iff_gt.1 h) e @[irreducible] def co(e:kM u=0):u=0\/u=0x80000000:=by have j:=u.toNat_lt;rw[kM]at e;split_ifs at e with g .have d:=aZ u;have l:=aP u;rw[g]at d;rw[<-Β,<-Β];simp at d⊢;omega .omega @[irreducible] def be:lI (mx y z)=nt (lI y) (lI z):=by rw[Conv.mx];split .rename_i h;have e:=kV y h.1;have g:=kV z h.2.1;have j:Model.compare (lI y) (lI z)=pj _:=Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e g;rw[g6]at j;rw[nt,Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff _ _).2 ⟨Χ e,Χ g⟩:Model.chooseNaN2 (lI y) (lI z)=none),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ j];rcases h.2.2 with d|d|rfl;rw[AD d,compare_lt_iff_lt.2 (ga y z d)];rw[AC (nP d),compare_gt_iff_gt.2 (ga z y d)];rw[AC (UInt32.lt_irrefl _),compare_eq_iff_eq.2 rfl];by_cases l:kM y=0;rcases co y l with rfl|rfl<;>decide;simp[(by rw[lI,Model.isZero_eq_beq_zero_of_toDyadic?_some e,decodeD_sig_zero];simpa using l:Model.isZero (lI y)=false)] exact aR _ @[irreducible] def fn(w k U n:Nat)(e:0nt m (lI I[U+t/k*w+t%k]!)) (lI d):=by rw[gc _ _ _ _ _ _ _ e,List.foldl_hom lI];exact λ_ _=>(be _ _).symm @[irreducible] def iP: ps (kT u:Model lU)=u:=by show BG (kT u:Model lU).bits=u;rw[pu] @[irreducible] def aS(d:kB u≠0): nh u=⟨k9 u,2^23+(lK u)г,((kB u)г:Int)-150⟩:=by rw[nh];rw[AC d] @[irreducible] def cM(f:Nat)(e:f<2^23): lf (2^23+f) (2^23)=0:=by have d:(2^23+f)з=23:=by rw[mz (by omega)];constructor<;>omega rw[lf];rw[d,Nat.log2_two_pow];simp[mM,mZ,ο]<;>omega @[irreducible] def eO:la (m*2^23) (2^23)=m:=by rw[la];simp @[irreducible] def hO(q:UInt32)(p:lK d=0)(u:k9 d=false) (M:(kB d)г=qг+127)(v:kB d≠255) (x:qг<(kB r)г)(j:kB r≠255): kW (pf (lI r) (lI d))=r-(q<<<23):=by have N:=aZ r;have O:=aP r;have U:(kB r)г≠255:=λh=>j (Β.mp (by simpa using h));have L:=fracOf_toNat_lt r;rw[ny];unfold p0 lI;rw[kV r j,kV d v,aS r (λh=>by simp[h]at x),aS d (λh=>by simp[h]at M),p,u];have l:((2:Nat)^23==0)=false:=(by decide);have m:(2^23+(lK r)г==0)=false:=(by simp);simp only[nj,ϑ,Bool.xor_false,l,m,fT,ite_false];change kW (n6 FloatFormat.binary32 (k9 r) (2^23+(lK r)г) (2^23) _)=_;rw[<-nA,bD];unfold pC;rw[cM _ L];simp only[l,m,fT,ite_false,Ai,sub_zero];rw[AC (by omega),AC (by omega),AC (by omega)];have D:(2^23+(lK r)г).shiftLeft 23=(2^23+(lK r)г)*2^23:=ο _ _;rw[show(23:Int)=Int.ofNat 23 from rfl,mw,D,eO];simp only[(by simp[p7];omega:((2^23+(lK r)г:Nat)==p7 24)=false),fT,ite_false];rw[AC (by omega)];set e:=r-(q<<<23)with F;have o:(q<<<23)г=qг*2^23:=by rw[ϴ];simp[ο];omega have g:eг=rг-qг*2^23:=by rw[F,nG _ _ (by rw[UInt32.le_iff_toNat_le,o];clear*-N x;omega),o] rw[<-n7];conv_rhs=>rw[<-iP e,ofUInt32_eq_ofFields] rw[(by rw[ϓ,ap,ap,g];clear*-N x;omega:k9 e=k9 r),(by rw[aZ e,g];clear*-N x;omega:(kB e)г=(kB r)г-qг),(by rw[aP e,g];clear*-N O x;omega:(lK e)г=(lK r)г),((by omega):(((kB r)г:Int)-150-(((kB d)г:Int)-150)+127)л=(kB r)г-qг),((by decide):p7 23=2^23),ϱ];rfl @[irreducible] def i9(s:kF)(h:s&&&0x7FFFFFFF=0):s=0\/s=0x80000000:=by have e:=s.toNat_lt;have d:(s&&&0x7FFFFFFF)г=sг%2^31:=by rw[Ξ,show(0x7FFFFFFF:UInt32)г=2^31-1 from rfl,ζ] rw[h]at d;rw[<-Β,<-Β];simp at d⊢;omega @[irreducible] def cg(e:r=0\/r=0x80000000)(g:kB d≠0)(j:kB d≠255)(l:k9 d=false): kW (pf (lI r) (lI d))=r:=by rw[ny,p0,lI,lI,kV r (by rcases e with rfl|rfl<;>decide),kV d j,aS d g,l,(by rcases e with rfl|rfl<;>rfl:nh r=⟨k9 r,0,0⟩)];simp[(by simp:(2^23+(lK d)г==0)=false),fT,ite_false,Az,ite_true,Bool.xor_false];rcases e with rfl|rfl<;>rfl @[irreducible] def aX{a b:UInt32}(h:aby have:=Ι.mp h;rw[e]at this;omega noncomputable abbrev av:Word:=toWord (Ar (ofW (dotOf n fa λ_=>oneW)) (ofW d)) @[irreducible] def gl(v:DQ d):eX r d=kW (pf (lI r) (lI d)):=by obtain⟨e,l,m⟩:=v;have g:=aX m;dsimp only[eX];split;obtain⟨q,j,o,p⟩:=‹_/\_›;exact(hO r d _ q e (by rw[nG _ _ j];have:=UInt32.le_iff_toNat_le.1 j;simp at this⊢;omega) g (Ι.1 o) (aX p)).symm;split;exact(cg r d (i9 r ‹_›) l g e).symm;rfl @[irreducible] def gp(g:Nat->UInt64)(m:Nat):∀d:UInt64, Z ((lj m).foldl (λd t=>d+g t) d)=Z d+∑t∈kP m,Z (g t):=by induction m with |zero=>intro d;simp |succ m e=> intro d;rw[mD,l6,Ϸ,mT,fI,e,Ν];ring @[irreducible] def jB:ae 0=0:=by rw[eQ];rfl @[irreducible] def gK: (decide (kM u*kM ld=0)&&Bool.xor (k9 u) (k9 ld))=(u==0x80000000):=by by_cases d:kM u=0 .rcases co u d with rfl|rfl<;>decide have:(u==0x80000000)=false:=by simp;rintro rfl;exact d (by decide) rw[this,((by decide):kM ld=2^23),((by decide):k9 ld=false)];simp[d] @[irreducible] def dW(c:Nat):∀i,i+c<=n-> (nC (kK (n:=n) λj=>fa jи) (kK (n:=n) λ_=>ld) i c=true↔ ∀t,i<=t->t< i+c->fa t=0x80000000):=by induction c with |zero=>intro i _;simp[nC];intro t d e;omega |succ c l=> intro i m rw[nC,ab n fa i (by omega),ab n (λ_=>ld) i (by omega), gK,Η,l (i+1) (by omega),AQ] constructor .rintro⟨d,e⟩ t g o rcases BJ g with h|h .subst h;exact d .exact e t (by omega) (by omega) .intro h;exact⟨h i (le_refl _) (by omega),λt d e=>h t (by omega) (by omega)⟩ @[irreducible] def eW(O:0ld)=0)(g:Bool)(L:g=true↔∀tld)=if g then 0x80000000 else 0:=by have G:=cH n fa (λ_=>ld);have H:=dW n fa n 0 (by omega);have D:=ab n fa;have F:=ab n λ_=>ld;have d:=Ϝ (f:=λi:Fin n=>fa iи);have p:=Ϝ (f:=λ_:Fin n=>ld);rw[ms,dotSpec,Model.dot];generalize (kK (n:=n) λi=>fa iи)=A,(kK (n:=n) λ_:Fin n=>ld)=B at* have l:∀k,0<=k->k<0+(A.map (kT (fmt:=lU)))в->kB A[k]!≠255/\kB B[k]!≠255:=λk _ e=>by rw[m0,d]at e;rw[D k (by omega),F k (by omega)];exact⟨v k (by omega),(by decide)⟩ have q(X:Array UInt32):Xв=n->(∀k∀k (e:k<(X.map (kT (fmt:=lU)))в),mN (X.map (kT (fmt:=lU)))[k]=true:=by intro N K k e;rw[m0]at e;have j:=K k (by omega);rw[AB X k e]at j;simp[m6,j] have m:(A.map (kT (fmt:=lU)))в=(B.map (kT (fmt:=lU)))в:=by simp[d,p] have r:=q A d λk e=>(l k (by omega) (by simp[d];omega)).1;have u:=q B p λk e=>(l k (by omega) (by simp[d];omega)).2;have o:=ϯ (destination:=lU) _ _ m r u;rw[finiteDotSlice_eq A B 0 _ ((by simp)) (by rw[<-m];simp) l,m0,d,G,I,lH,nv]at o;rw[Ϭ lU _ _ .nearestEven m r u ((ϲ _).1 o)] obtain⟨j,x⟩:=dotStateLoop_flags A B ({}:me lU) 0 _ ((by simp)) (by rw[<-m];simp) l;rw[lT,j,x];have J:nC A B 0 n=g:=by rw[ϓ,H,L];exact⟨λh t M=>h t (by omega) (by omega),λh t _ M=>h t (by omega)⟩ simp only[m0,d,J];cases g<;>simp[show n≠0 by omega]<;>rfl @[irreducible] def dk(w k U m:Nat)(l:0(Nat.lt_succ_iff_lt_or_eq.1 d).elim (g t) λe=>e▸j,λh=>⟨λt d=>h t (by omega),h m (by omega)⟩ @[irreducible] def cu(d y x t:Nat): I[(d*h+y*k)*w+x*k+t/k*w+t%k]! =nI h w k I d y x t:=by congr 1;ring @[irreducible] def eg(B c A H:UInt64)(D:Bа<=255)(G:cа<=62)(J:0UInt64)(L M:Int) (T:∀tBool)(I:g ()=true↔∀tkF) (v:q ()=ms n fa λ_=>ld)(d:kF)(m:DQ d): wo B A H g q d=av n fa d:=by have p:=λt e=>dI c B _ D G (u t e);have K:=A3.1 (cJ n _ _ λt e=>(T t e).2.1);have N:=A3.1 (cJ n _ _ λt e=>(T t e).2.2);have o:af n fa (λ_=>ld)=(∑t∈kP n,bU Bа (fa t))*2^(Bа+149):=by rw[n8];refine ϔ rfl λt e=>?_;rw[fB _ ld _ 126 ((p t (mr e)).2.imp_right (·.1)) (BA (by decide)),((by decide):bU 126 ld=2^23)];ring rw[<-ϔ rfl λt e=>(T t (mr e)).1,nJ,<-n8,<-sZ A (∑t∈kP n,ae (l (fa t))) (by simp[x,gS]) (by linarith) (by linarith),<-sZ H (∑t∈kP n,ae (j (fa t))) (by simp[F,gS]) (by linarith) (by linarith)]at o;rw[wo,av];split;next r=>rw[r.1,r.2,jB]at o;rw[eW n fa J (λt e=>(p t e).1) (by rw[o];ring) _ I,cg _ d (by split<;>simp) m.2.1 (aX m.2.2) m.1] .rw[gl _ d m];refine congrArg (λs=>kW (pf (lI s) (lI d))) ?_;rw[Dense.dp,dY];split .refine(aY n fa _ _ _ _ (λt e=>⟨(p t e).1,(by decide)⟩) ?_ ‹_›).symm;rw[o,eU,(by simp[η];omega:(B+149)а=Bа+149)] .exact v @[irreducible] def ee(c:UInt64)(x:kF)(g:Bа<=255)(m:cа<=37)(h:ok c B x=true): ae 0*2^25+ae (t1 B x)=bU Bа x/\|ae (t1 B x)|<=2^(24+cа)-1/\ |ae 0|<=0:=by obtain⟨-,j⟩:=dI c B x g (by omega) h;obtain⟨l,d⟩:=fw B x cа (by omega) j;have:2^(24+cа)<=2^61:=Θ (by norm_num) (by omega);rw[jB,(by rw[t1,bU,sv,jj _ _ (by omega),l];cases k9 x<;>simp only[fT,ite_true,Am,neg_mul]<;>push_cast<;>ring:ae (t1 B x)=bU Bа x)];refine⟨(by ring),?_,(by simp)⟩;rw[bU,sv];cases k9 x<;>simp only[fT,ite_true,Am,neg_mul,BE]<;>rw[Ad (by positivity)]<;>exact Int.le_sub_one_of_lt (mod_cast d) @[irreducible] def em(f:kF->UInt64)(h w k:Nat)(I:Array kF)(d y x:Nat)(e:0by interval_cases t<;>assumption, λH=>⟨⟨⟨H 0 (by decide),H 1 (by decide)⟩,H 2 (by decide)⟩,H 3 (by decide)⟩⟩ @[irreducible] def ia:(eF u)а=(kB u)г:=by rw[eF,kB];simp @[irreducible] def ik(x:kF):aq x<=255:=by rw[aq];split .rw[θ,am];rw[kG];have:=mO x;split<;>simp<;>omega .exact UInt64.le_refl _ @[irreducible] def mn(a b:UInt64):(po a b)а=po aа bа:=by show(if a<=b then a else b)а=_;split<;>rename_i h .have:=θ.mp h;omega .have:=mt θ.mpr h;omega @[irreducible] def dH(a b:UInt64):po a b<=a:=θ.mpr (by rw[mn];omega) @[irreducible] def fX(a b:UInt64):po a b<=b:=θ.mpr (by rw[mn];omega) @[irreducible] def fZ(a b:UInt64):a<=max a b:=by show a<=if a<=b then b else a;split<;>simp_all @[irreducible] def f0(a b:UInt64):b<=max a b:=by show b<=if a<=b then b else a;split<;>rename_i h<;>simp_all[θ];(exact Nat.le_of_lt (by assumption)) @[irreducible] def cQ(x:kF)(B M:UInt64)(d:B<=aq x)(r:eF x<=M)(p:M<=po (B+37) 254) (o:B<=255):ok 37 B x=true:=by have j:=ia x;have g:=am x;have v:=mO x;rw[θ]at r p o;simp only[mn,η,kA]at p o;simp only[ok,Η,AM,Ak,nM,AQ];use λe=>by simp[e]at j;omega by_cases m:mW x=0;exact pZ m;right;rw[aq,AD (by simpa using m),θ,g]at d;apply A6;rw[θ,χ _ _ (θ.2 (by rw[g];omega)),g];rw[kG]at d⊢;split<;>simp<;>omega @[irreducible] def ki(d e g j:kF) (h:max (max (eF d) (eF e)) (max (eF g) (eF j))<=po (po (po (aq d) (aq e)) (po (aq g) (aq j))+37) 254): po (po (aq d) (aq e)) (po (aq g) (aq j))<=255/\ cV (ok 37 (po (po (aq d) (aq e)) (po (aq g) (aq j)))) d e g j=true:=by have l:po (po (aq d) (aq e)) (po (aq g) (aq j))<=255:= ϗ (ϗ (dH _ _) (dH _ _)) (ik d);simp only[cV,Η];use l,⟨⟨cQ _ _ _ (ϗ (dH _ _) (dH _ _)) (ϗ (fZ _ _) (fZ _ _)) h l,cQ _ _ _ (ϗ (dH _ _) (fX _ _)) (ϗ (f0 _ _) (fZ _ _)) h l⟩,cQ _ _ _ (ϗ (fX _ _) (dH _ _)) (ϗ (fZ _ _) (f0 _ _)) h l⟩,cQ _ _ _ (ϗ (fX _ _) (fX _ _)) (ϗ (f0 _ _) (f0 _ _)) h l @[irreducible] def gU(B:DQ d)(j y x:Nat)(e:USize) (D:eб=(j*h+y*2)*w+x*2)(G:(j*h+y*2)*w+x*2+w+1<2^31): gT h w I d j y x e=av (2*2) (nI h w 2 I j y x) d:=by have q:=cu h w 2 I j y x;have p:=q 0;have r:=q 1;have u:=q 2;have v:=q 3;simp only[Nat.reduceDiv,kH,nv,one_mul,Av]at p r u v;have m:kW (pf (lI (cU h w 2 I j y x)) (lI d))=av (2*2) (nI h w 2 I j y x) d:=rfl;have:=dj;have g:∀i o,I.uget i o=I[iб]!:=λi o=>(AB I _ o).symm;rw[gT];dsimp only;split;swap;exact m;simp(disch:=omega) only[g,lJ,mA,aa,γ,D,p,r,u,v];split;swap;exact m;rename_i l;have l:=ki _ _ _ _ l;have A:=(cW _ (nI h w 2 I j y x)).1 l.2;exact eg _ _ _ 37 _ _ (cB l.1) (by decide) (by decide) A _ (λ_=>0) _ 0 (λt F=>ee _ _ _ (cB l.1) (by decide) (A t F)) (by decide) (by decide) (by simp only[fI,show 2*2=4 from rfl,Ν,Finset.sum_range_zero,Ai]) (by simp[bF]) _ (by rw[cW];simp only[AQ]) _ rfl d B @[irreducible] def dO(f:Nat->Nat->Nat->kF) (e:∀d y x,f d y x=av (k*k) (nI h w k I d y x) (natW (k*k))): eT c (h/k) (w/k) f=n9 c h w k I:=by rw[iO];rw[n9];refine mi (by simp[pa]) λq _ _=>?_ simp only[ag,Λ,pa];exact e _ _ _ @[irreducible] def gI(B:UInt64)(d:USize)(r:dб<=Iв):∀m (e:USize) (l:UInt64), dб-eб=m->df I B d r e l=(lj m).foldl (λa j=>a+t1 B I[eб+j]!) l:=by have g:∀i o,I.uget i o=I[iб]!:=λi o=>(AB I _ o).symm;intro m;induction m<;>intro e l q;rw[df,dif_neg (mt ε.1 ((by omega):¬eбsimp<;>omega @[irreducible] def eV:dU=n9:=by funext c h w k I;unfold dU;dsimp only;split .rename_i d;obtain⟨e,o,u,B,m⟩:=d;split .rename_i D;obtain⟨rfl,G⟩:=D;rw[d8 _ _ _ _ _ _ _ o,Ϛ];unfold n9;refine mi (by simp[pa]) λq r _=>?_;simp only[ag,Λ,pa,Ϝ]at r⊢;have F:=(ϸ (Ϯ o u)).mpr r;have a:=ϊ (q/(w/2)) o;have:=ϊ q u;have v:q/(h/2*(w/2))*h+q/(w/2)%(h/2)*2+1<=c*h:=by have:=ι h (l7 F);rw[Ο]at this;clear*-this a;omega have A:=ι w v;rw[nO]at A;refine gU h w I _ m _ _ _ _ ?_ (by omega);rw[show(2:USize)=USize.ofNat 2 from rfl,<-BP,<-mC,Ϗ 2,<-lX,aa _ (by omega)] .have l:=jL _ B;split .rename_i d;refine dO _ _ _ _ _ _ λj y x=>?_;have g:∀tgi I _ d.2 (gC _ _) _;exact eg _ _ _ (cK (k*k)) _ _ (cB d.1) (by omega) (Ϯ e e) g _ (λ_=>0) _ 0 (λt p=>ee _ _ _ (cB d.1) l.1 (g t p)) l.2 (by simp) (by rw[gx];exact em _ h w k I j y x e) (by simp[bF]) _ (by simp only[dk _ _ _ _ _ _ e,cu,AQ]) _ rfl _ m .refine dO _ _ _ _ _ _ λj y x=>?_;split .rename_i d;have g:=(dk _ _ _ _ _ _ e).1 d.2;simp only[cu]at g;exact eg _ _ _ (cK (k*k)) _ _ (cB d.1) (by omega) (Ϯ e e) g _ (λ_=>0) _ 0 (λt p=>ee _ _ _ (cB d.1) l.1 (g t p)) l.2 (by simp) (em _ h w k I j y x e) (by simp[bF]) _ (by simp only[dk _ _ _ _ _ _ e,cu,AQ]) _ rfl _ m .rfl .rfl @[inline]def ky(u:Word):UInt32:=if u<0x80000000 then u+0x80000000 else 0xFFFFFFFF-u @[inline]def bu(a b:Word):Word:=if ky asimp_all[Ι,mh,pU]<;>omega @[irreducible] def il(a b:kF):(ky (bu a b))г=max (ky a)г (ky b)г:=by rw[bu];split<;>rename_i h<;>rw[Ι]at h<;>omega @[irreducible] def io(a b:kF)(h:(ky a)г=(ky b)г):a=b:=by rw[ci,ci]at h;have:=a.toNat_lt;have:=b.toNat_lt;rw[<-Β];split_ifs at h<;>omega @[irreducible] def fY(o:kB y≠255)(p:kB z≠255):mx y z=bu y z:=by have F:∀a b,sk aky aby rw[Ι,bf,bf]at h;rw[Ι,ci,ci];generalize aг=A at*;generalize bг=B at*;by_cases hA:A<2^31 ·rw[AD hA]at h⊢;by_cases hB:B<2^31 ·rw[AD hB]at h⊢;exact h ·rw[AC hB]at h;exact absurd h (by clear*-hB;split<;>omega) ·rw[AC hA]at h⊢;by_cases hB:B<2^31 ·rw[AD hB];clear*-hA;omega ·rw[AC hB]at h⊢;clear*-h hA hB;split at h<;>split at h<;>omega have:=y.toNat_lt;have:=z.toNat_lt;unfold Conv.mx bu;by_cases h:sk yh j.2.2];simp only[not_or]at h;obtain⟨d,g,l⟩:=h;rw[Ι,bf,bf]at d g;have m:yг≠zг:=λe=>l (Β.mp e);have:(y=0/\z=0x80000000)\/(y=0x80000000/\z=0):=by simp only[<-Β,kN];generalize yг=Y at*;generalize zг=Z at*;clear F o p l;rcases lt_trichotomy Y (2^31) with a|a|a ·rw[AD a]at d g;rcases lt_trichotomy Z (2^31) with b|b|b ·rw[AD b]at d g;exact absurd (Nat.le_antisymm (Nat.le_of_add_le_add_right (not_lt.1 g)) (Nat.le_of_add_le_add_right (not_lt.1 d))) m ·subst b;rw[AC (AX _),AD rfl]at g;exact Or.inl ⟨by clear*-g;omega,rfl⟩ ·rw[AC (not_lt_of_gt b),AC (ne_of_gt b)]at g;exact absurd (by clear*-b;omega) g ·subst a;rw[AC (AX _),AD rfl]at d g;rcases lt_trichotomy Z (2^31) with b|b|b ·rw[AD b]at d;exact Or.inr ⟨rfl,by clear*-d;omega⟩ ·exact absurd b.symm m ·rw[AC (not_lt_of_gt b),AC (ne_of_gt b)]at g;exact absurd (by clear*-b;omega) g ·rw[AC (not_lt_of_gt a),AC (ne_of_gt a)]at d g;rcases lt_trichotomy Z (2^31) with b|b|b ·rw[AD b]at d;exact absurd (by clear*-a;omega) d ·subst b;rw[AC (AX _),AD rfl]at d;exact absurd (by clear*-a;omega) d ·rw[AC (not_lt_of_gt b),AC (ne_of_gt b)]at d g;exact absurd (by omega) m rcases this with⟨rfl,rfl⟩|⟨rfl,rfl⟩<;>decide @[irreducible] def m4(g j l m:kF):(if nn g&&nn j&&nn l&&nn m then bu (bu g j) (bu l m) else mx (mx (mx (mx g g) j) l) m)=mx (mx (mx (mx g g) j) l) m:=by split .rename_i h;simp only[nn,Η,AM,Ak]at h;obtain⟨⟨⟨d,o⟩,p⟩,q⟩:=h;have e:∀a b,kB a≠255->kB b≠255->kB (bu a b)≠255:=λa b r u=>by rw[bu];split<;>assumption rw[fY _ _ d d,fY _ _ (e _ _ d d) o,fY _ _ (e _ _ (e _ _ d d) o) p,fY _ _ (e _ _ (e _ _ (e _ _ d d) o) p) q];apply io;simp only[il,max_self,max_assoc] .rfl @[inline]def iy(ch y x:Nat)(e:USize):Word:= let v:=wе if hb:ent j (lI (nI h w 2 I d y x t))) (lI (nI h w 2 I d y x 0))):=by have q:=cu h w 2 I d y x;have m:=q 0;have o:=q 1;have p:=q 2;have r:=q 3;simp only[Nat.reduceDiv,kH,nv,one_mul,Av]at m o p r;have:=dj;have g:∀i l,I.uget i l=I[iб]!:=λi l=>(AB I _ l).symm;rw[iy];dsimp only;split;rw[m4];simp(disch:=omega) only[g,lJ,mA,aa,γ,u];rw[<-cn (Conv.mx _ _),be,be,be,be,m,o,p,r];simp only[mD,List.range_zero,l6,Ϸ,mT];rw[<-cn (wl _ _ _ _ _ _ _ _),fn I w 2 _ (2*2) (by decide)];simp only[nI];congr 2;funext j t;congr 2;ring def d9:Array Word:= if k=2/\0dc (iy h w I o y) 2 0 (w/2) ((o*h+y*2)*w)е) (c*(h/2)) 0 0 (AS (c*(h/2*(w/2)))) else maxpoolSpec c h w k I @[irreducible] def fo:d9=maxpoolSpec:=by funext c h w k I;unfold d9;split;obtain⟨rfl,d,g,p⟩:=‹_›;rw[d8 _ _ _ _ _ _ _ d,Ϛ];unfold maxpoolSpec;refine mi (by simp) λq e _=>?_;simp only[ag,Λ,Ϝ]at e⊢;have o:=(ϸ (Ϯ d g)).mpr e;have:=ϊ (q/(w/2)) d;have:=ϊ q g;have j:q/(h/2*(w/2))*h+q/(w/2)%(h/2)*2+1<=c*h:=by have:=ι h (l7 o);rw[Ο]at this;omega have l:=ι w j;rw[nO]at l;refine iz h w I _ _ _ _ ?_ (by omega);rw[show(2:USize)=USize.ofNat 2 from rfl,<-BP,<-mC,Ϗ 2,<-lX,aa _ (by omega)];rfl end Conv section open Float.Model.UnpackedFloat namespace Elem @[irreducible] def VV(w:kF):(Core.mW w)а<2^24:=by rw[Core.an];exact mantOf_lt_24 w @[irreducible] def YB(a b:kF):(Core.mW a*Core.mW b)а=mantOf a*mantOf b:=by rw[ύ,Core.an,Core.an];exact γ (mul_mant_lt a b) end Elem open Elem namespace Norm noncomputable def Ya:Accuracy->Nat | .exact=>0 | .inexact _=>1 @[irreducible] def Yc{α:Type}(f:α->α)(n:Nat)(a:α): Nat.repeat f (n+1) a=Nat.repeat f n (f a):=by induction n generalizing a with |zero=>rfl |succ n d=>exact congrArg f (d a) @[irreducible] def QA(R k:Nat)(d:Accuracy): ExtendedMantissa.ofMantissaAndAccuracy (2*R+Ya d) .exact>>>(k+2)= ExtendedMantissa.ofMantissaAndAccuracy R d>>>(k+1):=by show Nat.repeat lm (k+2) _= Nat.repeat lm (k+1) _;rw[Yc,Yc,Yc];congr 1;rcases d with _|⟨_|_|_⟩<;> simp[ExtendedMantissa.ofMantissaAndAccuracy,lm,Ya]<;>omega open FloatLib.Numerics in @[irreducible] def VY(q r D t:Nat)(e:0rfl:(if r=0 then 0 else 1)=Ya (lP r D)),<-h,(by rw[Τ,Ρ _ _ e,ώ d,Ai]:(q*D+r)/D=q),(by rw[Τ,Μ,γ d]:(q*D+r)%D=r)] @[irreducible] def Y5(e:Int):Model.bpow e=(2:ℝ)^e:=(by rfl) @[irreducible] def Vi(q b:Nat)(d:q≠0)(h:b<=1):(2*q+b)з=qз+1:=by have e:=ϰ d;have g:=ϙ (n:=q);rw[mz (((by omega)))];omega open FloatLib.Numerics in @[irreducible] def V0(s:Bool)(P d:Nat)(o:P≠0)(l:d≠0)(q r D:Nat) (x:0omega have g:=Vi q _ j y;have G:(r:ℝ)/D<1:=(div_lt_one (Nat.cast_pos.2 x)).2 (Nat.cast_lt.2 t);have E:(0:ℝ)<=r/D:=div_nonneg (Nat.cast_nonneg _) (Nat.cast_nonneg _);have w:lf P d=(qз:Int)+e:=by apply Model.floorLog2_eq_of_bounds P d _ o l .rw[h,Y5,AK AL,AA];exact AE (u.trans (le_add_of_nonneg_right E)) (zpow_nonneg zero_le_two _) .rw[h,Y5,(by push_cast;ring:(qз:Int)+e+1=((qз+1:Nat):Int)+e),AK AL,AA];exact AI (((add_lt_add_iff_left _).2 G).trans_le v) (zpow_pos two_pos _) have p:la (l9 P d (23-((qз:Int)+e))).1 (l9 P d (23-((qз:Int)+e))).2=roundShiftRightEven (2*q+if r=0 then 0 else 1) ((2*q+if r=0 then 0 else 1)з-23):=by rw[roundShiftRightEven_eq_roundQuotientEven,g,(by clear*-m g;omega:qз+1-23=(qз-23)+1),<-VY q r D _ x t (((by omega)))] apply Model.roundQuotientEven_eq_of_rat_eq _ _ _ _ (RationalBinary.scaleByPowerOfTwo_snd_ne_zero _ _ _ l) (((by positivity)));rw[Model.scaleByPowerOfTwo_real];unfold Model.scaledRatToReal;rw[h,Y5,Ap,<-AK AL,(by clear*-m g;omega:e+(23-((qз:Int)+e))=-((qз-23:Nat):Int)),zpow_neg,AA];push_cast;rw[add_div' _ _ _ (Nat.cast_ne_zero.2 x.ne'),<-div_eq_mul_inv,div_div] generalize F:2*q+(if r=0 then 0 else 1)=J at g p⊢;rw[kE,AD (by decide),Model.ieeeRoundDyadic_eq_ieeeRoundDyadicImpl];simp only[Model.roundRat,n6,((by decide):Fmt.isIEEE=true),↓reduceDIte,Model.ieeeRoundRatScaled,Model.ieeeRoundDyadicImpl,AQ,o,l,ite_false,w,Int.add_zero,nY,g,((by decide):(FloatFormat.ieeeMaxNormalExponent lU:Int)=127),((by decide):FloatFormat.ieeeMinNormalExponent lU=-126),((by decide):(FloatFormat.normalMantissaExpOffset lU:Int)=150),((by decide):Fmt.fracWidth=23),show J≠0 by clear*-F j;omega,(by push_cast;ring:((qз+1:Nat):Int)+(e-1)=(qз:Int)+e),show¬((qз:Int)+e>127) by clear*-B;omega,show¬((qз:Int)+e< -150) by clear*-A;omega,show¬((qз:Int)+e< -126) by clear*-A;omega,(by clear*-m;omega:23<=qз+1),ite_true,nZ,p] @[irreducible] def Y8(v:ℚ)(w:v≠0)(s:Bool)(u:decide (v<0)=s) (q:Nat)(ρ:ℚ)(o:0<=ρ)(g:ρ<1)(e:Int) (j:|v|=((q:ℚ)+ρ)*(2:ℚ)^e) (p:2^25<=q)(l:-126<=(qз:Int)+e)(m:(qз:Int)+e<=126): roundRational v= kW (kE lU ⟨s,2*q+(if ρ=0 then 0 else 1),e-1⟩):=by have h:ρ=(ρ.numл:ℚ)/ρ.den:=by(conv_lhs=>rw[<-Rat.num_div_den ρ]);congr 1;exact_mod_cast(Int.toNat_of_nonneg (Rat.num_nonneg.2 o)).symm have d:=ρ.den_pos;generalize ρ.den=D,ρ.numл=r at h d;subst h;rw[roundRational,u,V0 s _ _ (((by positivity))) v.den_nz q r D d (by rwa[div_lt_one (mod_cast d),Nat.cast_lt]at g) e ?_ p l m];simp[d.ne'];have:=congrArg (λz:ℚ=>(z:ℝ)) j;rw[Rat.abs_def,Rat.divInt_eq_div]at this;push_cast at this;rwa[Nat.cast_natAbs,mI] @[irreducible] def Q7(R:Nat)(s:Int)(h:2^25<=R): -s+1<=((FloatFormat.toModel Fmt)).targetExponent (kY R (-s)):=by have:=(mu (((by omega)))).2 h;have:((FloatFormat.toModel Fmt)).mantissaBits<=25:=(by decide);rw[BV,kY];omega @[irreducible] def Vd(v:ℚ)(q:0simp @[irreducible] def YN(w:kF):(sv w:ℚ)=0↔mantOf w=0:=by rw[sv];split_ifs<;>simp @[irreducible] def Vr(w:kF):(sv w:ℚ)=(if signOf w then-1 else 1)*mantOf w:=by rw[sv];simp @[irreducible] def Y7(x:UInt64):(Core.ai x)а=xаз:=by rw[aA];rfl @[specialize]def Yh(x:(Array Word))(i stop u:Nat):Nat:= if ih (by rw[<-Core.an,d];rfl) lia @[irreducible] def Yi(x:(Array Word))(d:Nat): ∀k i u,d-i=k->Yh x i d u<=u/\ ∀j,i<=j->jmantOf x[j]! =0\/Yh x i d u<=idxOf x[j]!:=by intro k;induction k<;>intro i u h<;>rw[Yh] .grind .rename_i e;rw[AD (((by omega)))];dsimp only;rw[YK,Core.am];grind noncomputable def VJ(x:(Array Word))(u j:Nat):Nat:= (mantOf x[j]!*mantOf x[j]!)<<<(2*(idxOf x[j]!-u)) @[specialize]def Yl(x:(Array Word))(u i stop:Nat)(l h:UInt64)(c big:Nat):Nat:= if i>>1)>>>(63-k)else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l'>>1)>>>(63-kж) else d<<<(kж-64))а*2^64=dа*2^k/\ (if kж<64 then(d>>>1)>>>(63-kж) else d<<<(kж-64))а<2^62:=by have g:kжа=k:=by rw[Ϣ,UInt64.toNat_ofNat',γ (((by omega)))] by_cases h:k<64 simp only[(by rw[μ,g];simpa:kж<64),ite_true,ψ,ν,χ _ _ (show kж<=63 by rw[θ,g];simp;omega),g,kA,ο,β,γ h,γ ((by omega):63-k<64),kH,lY] rw[(by rw[<-AF];congr 1;clear*-h;omega:2^1*2^(63-k)=2^(64-k)),(by rw[<-AF];congr 1;clear*-h;omega:2^64=2^(64-k)*2^k),Nat.mul_mod_mul_right,<-Ϛ,<-Ϡ,Nat.mod_add_div'];exact⟨rfl,AO (Nat.div_le_self _ _) (((by omega)))⟩ have m:dа*2^(k-64)<2^62:=calc _<2^48*2^14:=ly o (Θ (((by positivity))) (((by omega)))) (((by positivity))) _=_:=rfl simp only[(by rw[μ,g];simp;omega:¬kж<64),ite_false,ϋ,Κ,ψ,χ _ _ (show(64:UInt64)<=kж by rw[θ,g];simp;omega),g,kA,γ ((by omega):k-64<64),ο,γ ((by omega):dа*2^(k-64)<2^64)] refine⟨?_,m⟩;rw[Ϛ,<-AF];congr 2;clear*-h;omega @[irreducible] def Vb(x:(Array Word))(u d:Nat): ∀k i (l h:UInt64) c big,d-i=k-> Yl x u i d l h c big=big+lа+hа*2^64+c*2^128+ ∑j∈Finset.range k,VJ x u (i+j):=by intro k;induction k<;>intro i l h c big q<;>rw[Yl] .rw[AC (((by omega)))];simp only[ο,Finset.range_zero,Finset.sum_empty];ring rename_i p;rw[AD (((by omega))),lV];have e:∀j,VJ x u (i+(j+1))=VJ x u (i+1+j):=λj=>by rw[lO];rfl simp only[e,ϑ];have o:VJ x u i=(Core.mW x[i]!*Core.mW x[i]!)а*2^(2*((Core.iW x[i]!)а-u)):=by rw[VJ,ο,YB,Core.am] have r:(Core.mW x[i]!*Core.mW x[i]!)а<2^48:=by rw[YB];have:=mantOf_lt_24 x[i]!;exact(ϕ this this).trans_eq rfl rw[o];generalize (Core.iW x[i]!)а-u=g at*;generalize Core.mW x[i]!*Core.mW x[i]! =m at*;by_cases t:g<=39 .have:=VL m (2*g) r (by clear*-t;omega);generalize (if(2*g)ж<64 then m<<<(2*g)жelse 0)=v at*;generalize (if(2*g)ж<64 then(m>>>1)>>>(63-(2*g)ж) else m<<<((2*g)ж-64))=w at*;rw[p (i+1) _ _ _ _ (((by omega)))];clear q o;have:=l.toNat_lt;have:=h.toNat_lt;have:=v.toNat_lt;simp only[η,μ,Ax lq,kA];lia rw[AC t,p (i+1) _ _ _ _ (by clear*-q;omega),ο];ring @[irreducible] def Yk(n:Nat)(f:Nat->ℚ)(a:ℚ): (lj n).foldl (λt j=>t+f j) a=a+∑j∈Finset.range n,f j:=by induction n generalizing a with |zero=>simp |succ n d=> rw[mD,l6,d,Ν];simp;ring @[irreducible] def VG(d u:Nat)(h:u<=d): ((2:ℚ)^((d:Int)-149))^2=(2:ℚ)^(2*(d-u))*(2:ℚ)^(2*(u:Int)-298):=by rw[<-AA ((2:ℚ)^((d:Int)-149)) 2,<-zpow_mul,<-AA (2:ℚ) (2*(d-u)),<-AK AL];grind @[irreducible] def Ye(w:kF)(u:Nat)(h:mantOf w=0\/u<=idxOf w): rationalWord w^2= (((mantOf w*mantOf w)<<<(2*(idxOf w-u)):Nat):ℚ)*2^(2*(u:Int)-298):=by rw[Y1,ο];rcases h with h|h;rw[(YN w).2 h,h];simp;rw[mul_pow,(by rw[<-sq_abs,VT];ring:(sv w:ℚ)^2=(mantOf w:ℚ)*mantOf w),VG _ _ h];grind def Yf(num den:Nat)(s:Int):Word:= toWord (Model.ofModel Fmt (roundWithAccuracy ((FloatFormat.toModel Fmt)) .positive (sqrtLower num den) (-s) (sqrtAccuracy num den))) open Float.Model in @[irreducible] def Q4(spec:Format)(g:pK)(R:Nat)(e:Int)(d:Accuracy)(l:R≠0) (p:e+1<=spec.targetExponent (kY R e)): nk spec g R e d=pp spec g (2*R+Ya d) (e-1):=by have h:kY (2*R+Ya d) (e-1)=kY R e:=by unfold kY;rw[Vi R _ l (by cases d<;>simp[Ya])];omega unfold pp decreaseExponent;simp only[h];rw[((by omega):(e-1-spec.targetExponent (kY R e))л=0)];simp;unfold nk shiftToTargetExponent shiftToExponent;rw[h];generalize spec.targetExponent (kY R e)=T at*;obtain⟨k,j⟩:∃k,(T-e)л=k+1:=⟨(T-e)л-1,(((by omega)))⟩;dsimp only;rw[j,(by clear*-j p;omega:(T-(e-1))л=k+2),QA,(by push_cast;ring:e-1+((k+2:Nat):Int)=e+((k+1:Nat):Int))] @[irreducible] def Vh(e d:Nat): Ya (sqrtAccuracy e d)=if e=sqrtLower e d^2*d then 0 else 1:=by unfold sqrtAccuracy;dsimp only;split_ifs<;>rfl @[irreducible] def V9(e d:Nat)(s:Int)(p:33554432<=sqrtLower e d) (l:sqrtLower e d>>>31=0)(m:-209<=s)(o:s<=297): Yf e d s=az false (UInt64.ofNat (2*sqrtLower e d+ (if e=sqrtLower e d*sqrtLower e d*d then 0 else 1))) (UInt64.ofNat (297-s)л):=by set R:=sqrtLower e d with g;have h:(UInt64.ofNat (297-s)л)а=(297-s)л:=by rw[UInt64.toNat_ofNat',γ (((by omega)))] have q:(if e=R*R*d then 0 else 1)<=1:=by split_ifs<;>simp have j:(UInt64.ofNat (2*R+(if e=R*R*d then 0 else 1)))а=2*R+(if e=R*R*d then 0 else 1):=by rw[UInt64.toNat_ofNat',γ (((by omega)))] rw[aJ _ _ _ (((by omega))),h,j,Yf,<-g,Q4 _ _ R (-s) _ (((by omega))) (Q7 R s (((by omega)))),Vh,<-g,sq,((by omega):(((297-s)л:Nat):Int)-298=-s-1)];rfl @[inline]def YG(num den R:Nat)(s:Int):Word:= if R>>>31==0&&-209<=s&&s<=297 then Core.az false (UInt64.ofNat (2*R+(if num==R*R*den then 0 else 1))) (UInt64.ofNat (297-s)л) else Yf num den s @[irreducible] def Vc(e d:Nat)(s:Int)(g:33554432<=sqrtLower e d): YG e d (sqrtLower e d) s=Yf e d s:=by rw[YG];split next h=> simp at h;rw[V9 e d s g h.1.1 h.1.2 h.2];simp simp def V8(B:Nat)(c:Int):Nat:=if 0<=c then B<<rw[ο];use e;push_cast;rw[<-AA (2:ℚ) cл,((by omega):((cл:Nat):Int)=c)];ring;use (((by positivity)));push_cast;rw[<-AA (2:ℚ) (-c)л,((by omega):(((-c)л:Nat):Int)=-c)];have:(2:ℚ)^(-c)≠0:=(((by positivity)));rw[zpow_neg];grind def V5(A Dn u:Nat)(eps:Word):Word:= let E:=mantOf eps let ie:=idxOf eps let w0:=min (2*u) (ie+149) let B:=(A<<<(2*u-w0))+((Dn*E)<<<(ie+149-w0)) let s:Int:=(350-(w0:Int)-((Bз:Int)-(Dnз:Int)))/2 let c:Int:=(w0:Int)-298+2*s let num:=V8 B c let den:=YF Dn c let R:=sqrtLower num den if 33554432<=R then YG num den R s else sqrtRational ((A:ℚ)*2^(2*(u:Int)-298)/Dn+rationalWord eps) @[irreducible] def YW(A e u:Nat)(d:kF)(t:0(2:ℚ)^j=2^k*2^((g:Int)-298):=λk j h=>by rw[h,<-AA,<-AK AL,add_sub_assoc] have:=congrArg (λz:ℚ=>(z:ℝ)) (w.trans (by rw[<-v,AK AL,m (2*u-g) (2*(u:Int)-298) (by clear*-y;omega),m (l+149-g) ((l:Int)-149) (by clear*-y;omega),ο,ο];push_cast;rw[mul_assoc (e:ℚ),add_div,mul_div_cancel_left₀ _ (Nat.cast_ne_zero.2 t.ne')];ring:_=((A:ℚ)*2^(2*(u:Int)-298)/e+E*2^((l:Int)-149))*2^(2*s)));rw[Rat.cast_div,Rat.cast_natCast,Rat.cast_natCast,Rat.cast_mul,Rat.cast_zpow,Rat.cast_ofNat]at this;exact this @[inline]def VO(x k:Nat):Nat:= if k<63&&x>>>(63-k)==0 then(xж<<>>63==0 then(Core.ai xж)аelse xз noncomputable def V2(r:Nat)(st:Bool):Nat:=if r !=0||st then 1 else 0 @[irreducible] def VI(N M:Nat)(e:0decide (v<0)=s) (p:0<=δ) (q:δ<1) (w:l=true↔δ≠0) (x:0 ((Ym x u i d P N).1:Int)-(Ym x u i d P N).2= (P:Int)-N+∑j∈Finset.range k,YS x u (i+j):=by intro k;induction k<;>intro i P N h<;>rw[Ym] .rw[AC (((by omega)))];simp rw[AD (((by omega)))];simp only[Yz,Core.an,Core.am,lV];have e:∀j,YS x u (i+(j+1))=YS x u (i+1+j):=λj=>by rw[lO];rfl simp only[e,ϑ];rw[YS];grind @[irreducible] def Yx(x:(Array Word))(u j:Nat) (h:mantOf x[j]! =0\/u<=idxOf x[j]!): rationalWord x[j]! =(YS x u j:ℚ)*2^((u:Int)-149):=by rw[Y1,YS];rcases h with h|h;simp[(YN _).2 h,h];rw[(by rw[<-AA,<-AK AL];congr 1;omega:(2:ℚ)^((idxOf x[j]!:Int)-149)=2^(idxOf x[j]!-u)*2^((u:Int)-149)),Vr,ο];split_ifs<;>push_cast<;>ring @[irreducible] def VW(n:Nat)(x:(Array Word))(r u:Nat) (d:∀j,r*n<=j->jmantOf x[j]! =0\/u<=idxOf x[j]!): (∑j∈Finset.range n,rationalWord x[r*n+j]! = ((((Ym x u (r*n) (r*n+n) 0 0).1:Int)-(Ym x u (r*n) (r*n+n) 0 0).2:Int):ℚ)* 2^((u:Int)-149))/\ (∑j∈Finset.range n,rationalWord x[r*n+j]!^2= ((Yl x u (r*n) (r*n+n) 0 0 0 0:Nat):ℚ)*2^(2*(u:Int)-298)):=by rw[VN x u _ n _ 0 0 (((by omega))),Vb x u _ n _ 0 0 0 0 (((by omega)))];push_cast[sub_zero,Ai,ϋ,ϳ,ϑ,Κ,n8];constructor<;>refine ϔ rfl λj e=>?_<;>rw[ϥ]at e;exacts[Yx x u _ (d _ (((by omega))) (((by omega)))),Ye _ u (d _ (((by omega))) (((by omega))))] @[irreducible] def YA(n:Nat)(x:(Array Word))(r u:Nat) (d:∀j,r*n<=j->jmantOf x[j]! =0\/u<=idxOf x[j]!): rowVariance n x r 0= ((Yl x u (r*n) (r*n+n) 0 0 0 0:Nat):ℚ)*2^(2*(u:Int)-298)/n:=by unfold rowVariance;rw[Yk,Ai];simp only[sub_zero];rw[(VW n x r u d).2] @[inline]def Y0(a b:Nat):Nat:=if b<=a then a-b else b-a @[irreducible] def YO(a b:Nat):((Y0 a b*Y0 a b:Nat):ℚ)=((a:ℚ)-b)^2:=by rw[Y0];split_ifs with h .push_cast[h];ring .push_cast[((by omega):a<=b)];ring @[irreducible] def VF(n:Nat)(x:(Array Word))(r u:Nat)(w:0jmantOf x[j]! =0\/u<=idxOf x[j]!): let pn:=Ym x u (r*n) (r*n+n) 0 0 let Q:=Yl x u (r*n) (r*n+n) 0 0 0 0 no n x r=((pn.1:ℚ)-pn.2)*2^((u:Int)-149)/n/\ rowVariance n x r (no n x r)= ((n*Q-Y0 pn.1 pn.2*Y0 pn.1 pn.2:Nat):ℚ)* 2^(2*(u:Int)-298)/((n*n:Nat):ℚ):=by intro pn Q;obtain⟨d,m⟩:=VW n x r u t;push_cast at d;have g:no n x r=(pn.1-pn.2)*2^((u:Int)-149)/n:=by rw[no,Yk,Ai,d] set c:ℚ:=2^((u:Int)-149)with q;have l:(2:ℚ)^(2*(u:Int)-298)=c^2:=by rw[q,<-AA,<-zpow_mul];exact congrArg _ (by omega) set S:ℚ:=pn.1-pn.2 with o;have h:rowVariance n x r (no n x r)=(n*Q-S^2)*c^2/(n*n):=by rw[rowVariance,Yk,Ai,g,ϔ rfl λj _=>(by ring:(rationalWord x[r*n+j]!-S*c/n)^2=rationalWord x[r*n+j]!^2-2*(S*c/n)*rationalWord x[r*n+j]!+(S*c/n)^2),nJ,nF,<-Finset.mul_sum,d,m,l,Finset.sum_const,Finset.card_range,nsmul_eq_mul];field_simp;ring have v:0<=n*Q-S^2:=by have e:0<=rowVariance n x r (no n x r):=(by rw[rowVariance,Yk,Ai];exact div_nonneg (Finset.sum_nonneg λ_ _=>sq_nonneg _) (Nat.cast_nonneg _));rw[h,le_div_iff₀ (((by positivity))),nv]at e;exact(mul_nonneg_iff_of_pos_right (((by positivity)))).1 e use g;rw[h,pO ((Nat.cast_le (α:=ℚ)).1 (by rw[YO,Nat.cast_mul];exact sub_nonneg.1 v)),YO,<-o,l,Nat.cast_mul,Nat.cast_mul] def sg(s:Bool)(M:ℚ):ℚ:=if s then-M else M @[irreducible] def Q6(w:kF):(Core.mW w !=0)=!decide (mantOf w=0):=by rw[show(Core.mW w !=0)=!(Core.mW w==0)from rfl,YK] @[irreducible] def Y2(w:kF):rationalWord w=sg (signOf w) (mantOf w)*2^((idxOf w:Int)-149):=by rw[Y1,Vr];rw[sg];simp @[irreducible] def Yn(a b:Nat):sg (decide (asimp only[ite_true,υ,Am]at j⊢<;>rw[(by rw[u];exact_mod_cast(Au M (2^27)).symm:(M:ℝ)=((M/2^27:ℕ):ℝ)*2^27+L)]at j<;>constructor<;>linarith only[j,r,t,AI l o,AI m o] end NF namespace NE open NF Dense.F open Dense (ay) @[inline]def mx(a b:UInt64):UInt64:=if arename_i h<;>rw[μ]at h<;>omega @[inline]def pk(s:Bool)(q σ:UInt64):Word:= ((if s then(0x80000000:UInt64)else 0)+((σ-146)<<<23+Core.ar (((2:UInt64)*q+1)<<<36)))й @[inline]def el(x g b:Word)(nd nS R pz:Float)(A1 A2 C1:UInt64)(slow:Unit->Word):Word:= let v:=(dw x*nd+nS)*dw g*R+dw b*pz let B:=v.toBits let E:=eF B let σ:=E-C1 let M:=mF B let L:=M&&&0x7FFFFFF let c:=mx (mx (E+10) (Core.iW b+A1)) (Core.iW g+A2)-E if 146<=σ&&σ<=398&&c<=25&&(1<<>>63!=0) (M>>>27) σ else slow () @[irreducible] def kj(s:Bool)(q σ:UInt64)(j:2^25<=qа)(l:qа<2^26)(m:146<=σа) (o:σа<=398):pk s q σ=az s ((2:UInt64)*q+1) σ:=by have d:((2:UInt64)*q+1)а=2*qа+1:=by rw[η,ύ];simp only[kA];omega have g:(((2:UInt64)*q+1)<<<36)а=(2*qа+1)*2^36:=by rw[ψ,d];simp only[kA,kH,ο];clear*-l;omega have h:(σ-36)а=σа-36:=by rw[χ σ 36 ((by omega):36<=σа)];rfl obtain⟨r,-,t⟩:=bM s (((2:UInt64)*q+1)<<<36) (σ-36) (by omega) (by omega) (by omega) (by omega);have p:(pk s q σ)г=(if s then 2^31 else 0)+((σа-146)*2^23+(ar (((2:UInt64)*q+1)<<<36))а):=by clear r h;unfold pk;rw[Ϫ,η,η,ψ,χ σ 146 ((by omega):146<=σа)];cases s<;>simp only[ite_true,ite_false,υ,kA,kH,ο]<;>omega rw[(by clear p r t;rw[cl s _ _ (by omega) (by omega),cl s _ _ (by omega) (by omega),d,g,h,(by rw[<-AF,BQ ((by omega):36<=σа)]:(2:Int)^σа=2^36*2^(σа-36))];cases s<;>simp only[ite_true,ite_false,υ]<;>push_cast<;>ring_nf:az s ((2:UInt64)*q+1) σ=az s (((2:UInt64)*q+1)<<<36) (σ-36))];apply Β.mp;clear*-p r h m;omega @[irreducible] def pB(a b:ℝ)(p q:ℕ)(d:|a|<=2^p)(e:|b|<=2^q):|a*b|<=2^(p+q):=by rw[Ae,AF];exact mul_le_mul d e (Aa _) (by positivity) @[irreducible] def sB(a b:ℝ)(p:ℕ)(d:|a|<=2^p)(e:|b|<=2^p):|a+b|<=2^(p+1):=by rw[A4];grind @[irreducible] def eB(x y:ℝ)(p:ℕ)(h:|x-y|<=|y|/2^53+1/2^1075)(g:|y|<=2^p):|x|<=2^(p+1):=by have e:(1:ℝ)<=2^p:=one_le_pow₀ (by norm_num);have d:(1:ℝ)/2^1075<=1/2^1:=AV (by norm_num) (by norm_num);rw[pow_one]at d;have:=AY x y;rw[A4];grind @[irreducible] def mo(a:ℝ)(p q:ℕ)(h:|a|<=2^p)(d:p<=q):|a|<=2^q:= h.trans (AU (by norm_num) d) @[irreducible] def z9(a:ℝ)(p:ℕ)(h:|a|<=2^p)(d:p<=971):|a|<=(2:ℝ)^(971:ℤ):=by rw[show(971:ℤ)=((971:ℕ):ℤ)from rfl,AA];exact mo a p 971 h d @[irreducible] def wB(w:kF):|(sv w:ℝ)*2^kG w|<=2^(24+kG w):=by rw[Ae,AW (by positivity:(0:ℝ)<2^idxOf w),AF];have:|(sv w:ℝ)|<=2^24:=by rw[<-mI,Ϲ];exact_mod_cast(bg w).le exact AE this (by positivity) @[irreducible] def jM(A H w p G R κ l a t j v q:ℝ)(o c E u y x:ℕ) (hA:A=H+w) (he:|w+p|<=q) (z:|a-A|<=|A|/2^53+1/2^1075) (B:|t-a*G|<=|a*G|/2^53+1/2^1075) (D:|j-t*R|<=|t*R|/2^53+1/2^1075) (V:|v-(j+l)|<=|j+l|/2^53+1/2^1075) (g:0<=R) (hR:|R-κ|<=R/2^50) (hκ:0<=κ) (Y:|v|<=2^53*(2:ℝ)^((o:ℤ)-1075)) (ah:|l|<=2^(24+E+x)) (hG:|G|<=2^(24+u)) (a0:u<=254) (a6:κ<=2^53) (al:R<=2^52) (as:10<=c) (aH:E+x+1056<=c+o) (N:q=0\/(q=2^y/\y+u+1154<=c+o)): |v-((H-p)*G*κ+l)|<=2^c*(2:ℝ)^((o:ℤ)-1075):=by refine(?_:_<=(|v|+|l|)/2^45+q*|G| *κ+(4*(1/2^1075)+4*(1/2^1075*R)+4*(1/2^1075*(|G| *R)))).trans ?_;set τ:ℝ:=1/2^1075;have m:0<=τ:=(by positivity);have r:=Aa G have key:∀P Q:ℝ,|Q-P|<=|P|/2^53+τ->|P|<=2*|Q|+2*τ:=λP Q h=>by linear_combination 2*AY P Q+2*Aw P Q+2*h+(1-2/2^53)*Aa P have X:=key _ _ V;have M:=key _ _ D;have K:=key _ _ B;have J:=key _ _ z;rw[Ae a G]at B K;rw[Ae t R,Ad g]at D M have L:|j|<=2*|v|+2*τ+|l|:=by have:=abs_sub (j+l) l;rw[add_sub_cancel_right]at this;exact this.trans (add_le_add X AP) rw[show v-((H-p)*G*κ+l)=(v-(j+l))+(j-t*R)+(t-a*G)*R+(a-A)*(G*R)+A*G*(R-κ)+(w+p)*G*κ by rw[hA];ring];have T:∀a b c d e f:ℝ,|a+b+c+d+e+f|<=|a|+|b|+|c|+|d|+|e|+|f|:=λa b c d e f=>(Ag _ _).trans (add_le_add ((Ag _ _).trans (add_le_add ((Ag _ _).trans (add_le_add ((Ag _ _).trans (add_le_add (Ag _ _) AP)) AP)) AP)) AP) refine(T _ _ _ _ _ _).trans ?_;simp only[Ae,Ad g,Ad hκ];clear_value τ;have hZ:|j+l|+|t| *R+|a| *|G| *R+9*(|A| *(|G| *R))<=256*|v|+256*|l|+2^54*τ+3*2^53*(τ*R)+3*2^53*(τ*(|G| *R)):=by linear_combination X+9*AE J (Af r g)+19*AE K g+39*M+78*L+98*Aa v+178*Aa l+18014398509481748*m+27021597764222938*Af m g+27021597764222958*Af m (Af r g) linear_combination V+D+AE B g+AE z (Af r g)+mul_le_mul_of_nonneg_left hR (Af (Aa A) r)+AE (AE he r) hκ+1/2^53*hZ set T:ℝ:=(2:ℝ)^((c:ℤ)-2+o-1075)with W;rw[(by rw[W,<-AA,<-AK AL,((by norm_num):(4:ℝ)=2^(2:ℤ)),<-AK AL];exact congrArg _ (by ring):(2:ℝ)^c*(2:ℝ)^((o:ℤ)-1075)=4*T)];have t1:|v|/2^45<=T:=calc _<=2^53*(2:ℝ)^((o:ℤ)-1075)/2^45:=div_le_div_of_nonneg_right Y (by positivity) _=(2:ℝ)^((8:ℕ)+((o:ℤ)-1075)):=by rw[AK AL,AA];ring _<=T:=AG one_le_two (by omega) have j:|l|/2^45<=T:=calc _<=(2:ℝ)^(24+E+x)/2^45:=div_le_div_of_nonneg_right ah (by positivity) _=(2:ℝ)^(((24+E+x:ℕ):ℤ)-45):=by rw[Ac AL,AA];norm_num _<=T:=AG one_le_two (((by omega))) have t3:q*|G| *κ<=T:=by rcases N with I|⟨I,aL⟩;rw[I,nv,nv];positivity;rw[I];calc _<=(2:ℝ)^y*2^(24+u)*2^53:=mul_le_mul (mul_le_mul_of_nonneg_left hG (by positivity)) a6 hκ (by positivity) _=(2:ℝ)^(((y+(24+u)+53:ℕ):ℤ)):=by rw[AA];ring _<=T:=AG one_le_two (by push_cast;omega) have g1:|G|<=2^278:=hG.trans (AU one_le_two (by omega));have a3:(1:ℝ)/2^1075*(|G| *R)<=1/2^25:=calc _<=(1:ℝ)/2^1075*(2^278*2^52):=mul_le_mul_of_nonneg_left (mul_le_mul g1 al g (by positivity)) (by positivity) _=1/2^745:=by field_simp _<=_:=AV one_le_two (by decide) have a4:(1:ℝ)/2^21<=T:=by rw[((by norm_num):(1:ℝ)/2^21=2^(-21:ℤ))];exact AG one_le_two (by omega) have a2:(1:ℝ)/2^1075*R<=1/2^25:=calc _<=(1:ℝ)/2^1075*2^52:=mul_le_mul_of_nonneg_left al (by positivity) _=1/2^1023:=by field_simp _<=_:=AV one_le_two (by decide) linear_combination t1+j+t3+4*a2+4*a3+a4+4*(AV one_le_two (by decide):(1:ℝ)/2^1075<=1/2^25) end NE namespace NR open NF Dense.F open Dense (ay) @[inline]def pt(j:Nat):Float:=P.get! (j+1) @[inline]def p2(e:Nat):Float:=pt (min e 254)*pt (e-min e 254) @[irreducible] def jw(j:Nat)(g:j<=254):fv (pt j)/\rv (pt j)=(2:ℝ)^j:=by have h:pt j=pw j:=by have d:P.get! (j+1)=P.data[j+1]!:=by rcases P with⟨e⟩;rfl rw[pt];rw[d,AB P.data (j+1) (by simp[P];omega)];simp only[P,Λ];rw[AD (by omega)];rfl rw[h];exact iJ j (by omega) @[irreducible] def jv(e:Nat)(l:e<=508):fv (p2 e)/\rv (p2 e)=(2:ℝ)^e:=by obtain⟨d,h⟩:=jw (po e 254) (by omega);obtain⟨g,j⟩:=jw (e-po e 254) (by omega);have:=aE _ _ d g 1 (e:ℤ) (by rw[h,j,<-AF,AA];push_cast;rw[one_mul];congr 1;omega) (by decide) (by omega) (bL 1 e 971 (by omega) (by rfl) 1 (by decide));rw[p2];refine⟨this.1,?_⟩;rw[this.2,AA];simp structure fH where td:Word ok:Bool nS:Float R:Float pz:Float A1:UInt64 A2:UInt64 C1:UInt64 @[inline]def eI(n:Nat)(t:Nat×Nat×Bool×Nat×Nat×Word):fH:= let k2:=t.2.1-21 let Sm:=VO t.2.2.2.1 (t.2.1-k2)+(t.2.2.2.2.1>>>k2) let es:=k2+t.1 let d:=t.2.2.2.2.2 let D:=nж*Core.mW d let lD:=Core.ai D let s:=lD-11 let R0:=((0x8000000000000000/D)<<>>53==0&& decide (es<=500), (if t.2.2.1 then z.toInt64 else(0-z).toInt64).toFloat*p2 es, R0.toInt64.toFloat,p2 Zrа,Zr+1056,if k2==0 then 0 else esж+1154,Zr+900⟩ @[irreducible] def kn(D s:UInt64)(d L:Nat)(m:Dа=d)(h:2^L<=d)(j:d<2^(L+1)) (y:sа=L-11)(t:11<=L)(u:L<=36): (((0x8000000000000000/D)<<>>(k-21))=((o<<>>(k-21):=by simp only[ο,β];rw[show o*2^k=o*2^(k-(k-21))*2^(k-21) by rw[Ap,<-AF];congr 2;omega,Τ _ v,Ρ _ _ (by positivity),Τ] rw[eI]at h⊢;dsimp only at h⊢;rw[Yz,ah]at h⊢;simp only[Η,AJ,BM,AM,Ak,θ,kA,AQ]at h obtain⟨⟨⟨⟨⟨⟨hn,a4⟩,aH⟩,t⟩,A⟩,a7⟩,Q⟩:=h;have q:((o<<>>(k-21)<2^53:=(((by omega)));generalize hS:(o<<>>j=e at q⊢;have ba:2^23<=kM d:=by rw[kM,AC aH];omega have p:(nж*mW d)а=n*kM d:=by rw[ύ,Α ((by omega):n<2^64),an,γ];have:=ϕ hn (lB d);omega generalize nж*mW d=D at t A p⊢;have hL:=Y7 D;generalize ai D=x at t A hL⊢;set L:=xа;have w:n*kM d≠0:=Nat.mul_ne_zero a0.ne' (by clear*-ba;omega);obtain⟨I,al⟩:2^L<=n*kM d/\n*kM d<2^(L+1):=by rw[hL,p];exact⟨ϰ w,ϙ⟩ have J:=kn _ (x-11) _ _ p I al (by rw[χ _ _ (t:11<=x)];rfl) t A;generalize((0x8000000000000000/D)<<<(x-11))+(((0x8000000000000000%D)<<<(x-11))/D)=g at J⊢;set y:=n*kM d with G;have l:0omega;show ae (0-eж)=_;rw[ay,Ζ,hz,ϋ,ϑ];clear*-q;omega have B:=dB _ (by rw[W];split<;>simp<;>omega);rw[W]at B;obtain⟨f2,v2⟩:=jv (j+u) (by omega);have:=aE _ _ B.1 f2 _ _ (by rw[B.2,v2,AA]) (by split<;>simp<;>omega) (by omega) (bL 53 (j+u) 971 (by omega) AP _ (by split<;>simp<;>omega));refine⟨this.1,?_⟩;rw[this.2,AA];simp rw[<-as];by_cases z:j=0;exact⟨0,by rw[<-m,z];simp,pZ rfl⟩;refine⟨2^(j+u),?_,BA ⟨rfl,by simp only[z,AQ,Am];rw[η,Α ((by omega):j+u<2^64)];simp only[kA];clear*-Q;omega⟩⟩;have a1:(e:ℝ)*2^j<=S:=(by rw[<-m,β];exact_mod_cast pr _ _);have a2:(S:ℝ)omega);refine⟨B.1,?_⟩;rw[B.2];show((ae g:ℤ):ℝ)=gа;rw[ay,AC (by omega)];simp have H:(0:ℝ)omega have:=dB _ (by rw[e];simp;omega);rw[e]at this;omega @[irreducible] def ic(a:(Array Word))(h:∀i (d:ikF)(n u k J K:ℕ)(sS:Bool)(ρ:NR.fH)(l:ℚ) (hρ:ρ=NR.eI n (u,k,sS,J,K,d))(hx:kB x≠255)(hg:kB g≠255)(hb:kB b≠255)(b6:0simp only[BE,nE]<;>exact_mod_cast b1.le have ha:=fA (dw x*p) ρ.nS hX.1 E.1 (z9 _ _ (sB _ _ _ bX bS) (by norm_num));have ba:|rv (dw x*p+ρ.nS)|<=2^555:=eB _ _ _ ha.2 (sB _ _ _ bX bS);have bG:|rv (dw g)|<=2^278:=by rw[vg];exact mo _ _ _ wg (by omega) have ht:=fM (dw x*p+ρ.nS) (dw g) ha.1 fg (z9 _ _ (pB _ _ _ _ ba bG) (by norm_num));have bt:|rv ((dw x*p+ρ.nS)*dw g)|<=2^834:=eB _ _ _ ht.2 (pB _ _ _ _ ba bG);have bR:|rv ρ.R|<=2^52:=by rw[hR.2,nE];exact_mod_cast b0 have G:=fM ((dw x*p+ρ.nS)*dw g) ρ.R ht.1 hR.1 (z9 _ _ (pB _ _ _ _ bt bR) (by norm_num));have bb:|rv ((dw x*p+ρ.nS)*dw g*ρ.R)|<=2^887:=eB _ _ _ G.2 (pB _ _ _ _ bt bR);have bB:|Bz|<=2^(24+kG b+j):=by rw[r.2,AF,<-Ap,Ae,AW ((by positivity):(0:ℝ)<2^j),AF (2:ℝ) (24+kG b)];exact AE wb (by positivity) have a7:|Bz|<=2^887:=mo _ _ _ bB (by omega);have hv:=fA ((dw x*p+ρ.nS)*dw g*ρ.R) (dw b*ρ.pz) G.1 r.1 (z9 _ _ (sB _ _ _ bb a7) (by norm_num));generalize hV:(dw x*p+ρ.nS)*dw g*ρ.R+dw b*ρ.pz=V at hc hv;simp only[Η,AJ,θ,μ,kA]at hc;obtain⟨⟨⟨⟨ch,c1⟩,X⟩,B⟩,as⟩:=hc;have eb:(eF V.toBits)а<2048:=by rw[eF,Ε];exact AO ϝ (by decide) have bq:ρ.C1<=eF V.toBits:=θ.2 (by have:=Ζ (eF V.toBits) ρ.C1;clear*-this c1 bp Jb;omega);have ds:(eF V.toBits-ρ.C1)а=(eF V.toBits)а-(900+j):=by rw[χ _ _ bq,bp] rw[ds]at ch c1;have M:1046+j<=(eF V.toBits)а:=(by clear*-ch;omega);have bs:¬eF V.toBits=0:=λh0=>by simp[h0]at M set H:=(eF V.toBits)аwith dy;have aL:=eK (eF V.toBits+10) (iW b+ρ.A1);have D:=eK (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2);obtain⟨b4,A,b5⟩:(eF V.toBits+10)а=H+10∧(iW b+ρ.A1)а=kG b+j+1056∧(iW g+ρ.A2)а=kG g+ρ.A2а:=by rw[η,η,η,am,am,bh];simp only[kA];clear*-eb ib ig Jb Ab;omega rw[b4,A]at aL;rw[aL,b5]at D;have ah:eF V.toBits<=mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2):=by rw[θ,D];clear*-;omega have z:=χ _ _ ah;rw[D]at z;generalize mx (mx (eF V.toBits+10) (iW b+ρ.A1)) (iW g+ρ.A2)-eF V.toBits=cc at z X B as;set c:=ccа;have L:((1:UInt64)<<>>63!=0 then-(I:ℝ)else I)*U:=(((by omega)));obtain⟨N,d1⟩:I<2^53∧2^52<=I:=by clear*-bw e1;omega have bv:|rv V|<=2^53*U:=by rw[a3,Ae,AW W,Ax _root_.abs,BE,nE,ite_self];exact AE (by exact_mod_cast N.le) W.le have dm:κ<=2^53:=by have h2:(g0:ℝ)<=2^52:=mod_cast b0;linarith only[(A3.1 hκ).1,h2] have al:eS=0\/(eS=2^es/\es+kG g+1154<=c+H):=b2.imp id λ⟨h0,hA⟩=>⟨h0,by clear*-hA z;omega⟩;have zz:10<=c∧kG b+j+1056<=c+H:=(by clear*-z;omega);have m:=jM _ Xn _ ((if sS then-(S:ℝ)else S)*2^u) _ _ κ Bz _ _ _ _ eS H c _ _ es j rfl (by rw[E.2];split<;>[skip;rw[<-BE]]<;>exact(congrArg _root_.abs ((by ring))).trans_le Q) ha.2 ht.2 G.2 hv.2 (by rw[hR.2];exact Nat.cast_nonneg _) (by rw[hR.2];exact hκ) dd bv bB (by rw[vg];exact wg) ig dm (by rw[hR.2];exact_mod_cast b0) zz.1 zz.2 al;have hY:((sv x:ℝ)*2^kG x*n-(if sS then-(S:ℝ)else S)*2^u)*((sv g:ℝ)*2^kG g)*κ+(sv b:ℝ)*2^(kG b+j)=(((rationalWord x-l)*rationalWord g/rationalWord d+rationalWord b:ℚ):ℝ)*(2^149*2^j):=by have e:∀w:kF,((rationalWord w:ℚ):ℝ)=(sv w:ℝ)*2^kG w/2^149:=λw=>by rw[Y1];push_cast;rw[Ac AL,AA];ring push_cast;rw[e x,e g,e b,o,AF,hZ];have e2:(n:ℝ)≠0:=Nat.cast_ne_zero.2 b6.ne';generalize(if sS then-(S:ℝ)else S)*2^u=T;linear_combination(exp:=1)(T*((sv g:ℝ)*2^kG g)*κ-(sv x:ℝ)*2^kG x*((sv g:ℝ)*2^kG g)*κ*n)*inv_mul_cancel₀ dz+T*((sv g:ℝ)*2^kG g)*κ*((rationalWord d:ℝ)⁻¹*(rationalWord d:ℝ))*inv_mul_cancel₀ e2 rw[show Xn=(sv x:ℝ)*2^kG x*n by rw[hX.2];push_cast;ring,r.2,vg,hY]at m;generalize(rationalWord x-l)*rationalWord g/rationalWord d+rationalWord b=Y at m a2⊢;have c2:=jh _ ((Y:ℝ)*(2^149*2^j)) _ _ _ _ c W a3 rfl B aH m;generalize hq:I/2^27=q at c2;obtain⟨b7,cb,q0⟩:2^25<=q∧q<2^26∧q≠0:=by clear*-hq N d1;omega obtain⟨e,he⟩:∃e:ℤ,e=(H:ℤ)-1075+27-149-j:=⟨_,rfl⟩;have e4:(2:ℝ)^27*U=(2:ℝ)^e*(2^149*2^j):=by rw[hU,he,<-AA (2:ℝ) 149,<-AA (2:ℝ) j,<-AA (2:ℝ) 27,<-AK AL,<-AK AL,<-AK AL];exact congrArg _ (by ring) have hP:(0:ℝ)<2^149*2^j:=(((by positivity)));obtain⟨lo,hi⟩:=c2;have k1:((q:ℕ):ℝ)*2^27*U=(q:ℝ)*2^e*(2^149*2^j):=by rw[Ap,e4,Ap] have k2:(((q:ℕ):ℝ)+1)*2^27*U=((q:ℝ)+1)*2^e*(2^149*2^j):=by rw[Ap,e4,Ap] rw[k1]at lo;rw[k2]at hi;generalize(V.toBits>>>63!=0)=s at lo hi⊢;have k3:(if s then-((Y:ℝ)*(2^149*2^j))else(Y:ℝ)*(2^149*2^j))=(((if s then-Y else Y:ℚ)):ℝ)*(2^149*2^j):=by by_cases hs:s=true;rw[AD hs,AD hs,Rat.cast_neg,neg_mul];rw[AC hs,AC hs] rw[k3]at lo hi;have a6:(q:ℚ)*2^e<(if s then-Y else Y):=(Rat.cast_lt (K:=ℝ)).1 (by rw[Rat.cast_mul,Rat.cast_natCast,Rat.cast_zpow,Rat.cast_ofNat];exact BF lo hP.le) have A:(if s then-Y else Y)<((q:ℚ)+1)*2^e:=(Rat.cast_lt (K:=ℝ)).1 (by rw[Rat.cast_mul,Rat.cast_add,Rat.cast_natCast,Rat.cast_one,Rat.cast_zpow,Rat.cast_ofNat];exact BF hi hP.le) have a0:(0:ℚ)<2^e:=(((by positivity)));have v:0<(if s then-Y else Y):=AO (Af (Nat.cast_nonneg _) a0.le) a6;obtain⟨t,t2⟩:|Y|=(if s then-Y else Y)∧decide (Y<0)=s:=by by_cases hs:s=true;rw[AD hs]at v⊢;exact⟨abs_of_neg (neg_pos.1 v),(decide_eq_true (neg_pos.1 v)).trans hs.symm⟩;rw[AC hs]at v⊢;exact⟨AW v,(decide_eq_false (not_lt.2 v.le)).trans (Bool.eq_false_of_ne_true hs).symm⟩ obtain⟨δ,hδ⟩:∃δ:ℚ,δ=(if s then-Y else Y)/2^e-q:=⟨_,rfl⟩;have c3:0<δ:=by rw[hδ];exact sub_pos.2 ((lt_div_iff₀ a0).2 a6) have c4:δ<1:=by rw[hδ,sub_lt_iff_lt_add,div_lt_iff₀ a0];linarith only[A] have d2:qз=25:=le_antisymm (Nat.lt_succ_iff.1 ((m9 q0).2 cb)) ((mu q0).2 b7);have e3:(mF V.toBits>>>27)а=q:=by rw[ν,<-O];simp only[kA,kH,β];clear*-hq;omega rw[<-ds]at ch c1;rw[kj _ _ _ (e3▸b7) (e3▸cb) ch c1,<-Qx s q true 1 e Y δ ((2:UInt64)*(mF V.toBits>>>27)+1) (eF V.toBits-ρ.C1) (λ_=>t2) c3.le c4 ⟨λ_=>c3.ne',λ_=>rfl⟩ one_pos (by rw[t,hδ,Nat.cast_one,div_one,add_sub_cancel,div_mul_cancel₀ _ a0.ne']) (by rwa[Nat.div_one]) (by rw[Nat.div_one,d2];clear*-ds he M ch c1;omega) (by rw[Nat.div_one,d2];clear*-ds he M ch c1;omega) (by rw[η,ύ,ν];simp[V2,<-O];clear*-hq N;omega) (by clear*-ds he M;omega)] end NE local instance:Inhabited NR.fH:=⟨⟨0,false,0,0,0,0,0,0⟩⟩ noncomputable def Yy(n:Nat)(eps:Word)(x:(Array Word))(r:Nat):Word:= let lo:=r*n let u:=Yh x lo (lo+n) 255 V5 (Yl x u lo (lo+n) 0 0 0 0) n u eps @[irreducible] def V7(n:Nat)(d:kF)(x:(Array Word))(r:Nat)(g:0USize->USize->Word)(s:σ)(lo i e:USize)(out:(Array Word)):(Array Word):= if h:iUSize->USize->kF)(s:σ)(g e:USize)(i:USize)(d:(Array Word)): (Yq f s g i e d).toList=d.toList++(pV iб (eб-iб)).map λq=>f s qе (qе-g):=by induction h:eб-iбgeneralizing i d<;>rw[Yq]<;>have:=e.toNat_lt_size;rw[dif_neg (by rw[ε];omega)];simp;rename_i j;rw[AT (ε.2 (((by omega)))),j _ _ (by rw[uS (((by omega)))];omega),uS (((by omega))),BS];simp @[specialize]def Yr{σ:Type}(g:Nat->σ)(f:σ->USize->USize->Word)(n rows r:Nat)(out:(Array Word)):(Array Word):= if rσ)(f:σ->USize->USize->kF)(n d r:Nat)(e:(Array Word))(m:d*n<2^32): (Yr g f n d r e).toList=e.toList++(pV (r*n) ((d-r)*n)).map λq=>f (g (q/n)) qе (qе-(q/n*n)е):=by induction h:d-r generalizing r e<;>rw[Yr] .grind .rename_i k l;have:=ι n ((by omega):r+1<=d);rw[Ο]at this;rw[AD (((by omega))),l (r+1) _ (((by omega))),j0,Conv.aa _ ((by omega):r*n<2^32),Conv.aa _ ((by exact Nat.lt_of_le_of_lt (by assumption) (by assumption)):r*n+n<2^32),List.append_assoc,ϱ,nO,nO,Τ (k*n),<-List.range'_append_1,List.map_append];congr 2;apply List.map_congr_left;intro i j;rw[List.mem_range'_1]at j;rw[mG j.1 (nO r n▸j.2)] @[irreducible] def Ys{σ:Type}(g:Nat->σ)(f:σ->USize->USize->kF)(n d:Nat)(j:d*n<2^32)(F:Fin (d*n)->kF) (h:∀q (h:qby rw[(by rw[Nat.mod_add_div']:qе=(q%n+q/n*n)е),lX,mC,USize.add_sub_cancel]:∀q,qе-(q/n*n)е=(q%n)е)];apply List.ext_getElem<;>simp;omega def cS(x:(Array Word))(i e:USize)(u:UInt64):UInt64:= if h:irw[cS,Yh]<;>have:=e.toNat_lt_size;rw[dif_neg (by rw[ε];omega),AC (((by omega)))];rename_i g;rw[AT (ε.2 (((by omega)))),AD (((by omega))),g _ _ (by rw[uS (((by omega)))];omega),uS (((by omega))),f6];congr 1;clear h this;split_ifs with h2 d<;>(try rw[μ]at d)<;>omega structure jY where l:UInt64 h:UInt64 c:Nat big:Nat P:Nat N:Nat @[inline]def cA(P:Nat)(q p:UInt64):Nat:=if q

>>1)>>>(63-k)else mm<<<(k-64) let l':=l+vl let h':=h+vh+(if l'dsimp only<;>unfold cF Yl Ym<;>have:=e.toNat_lt_size .rw[dif_neg (by rw[ε];omega)];simp only[show¬iбrename_i g<;>(try rw[χ _ _ g])<;>rw[θ]at g<;>simp<;>omega);rw[o];generalize q:(Core.iW w)а-uа=d;have t:dжа=d:=by simp<;>clear*-q this<;>omega have p:(2:UInt64)*dж=(2*d)ж:=ξ.mp (by simp<;>omega);simp only[t,p,show dж<=39↔d<=39 by rw[θ,t];rfl];clear q o t p;by_cases h1:d<=39<;>[simp only[AD h1];simp only[AC h1]]<;>refine⟨(j _ _ _ _ _ _ _ _ _ (((by omega)))).1,(j _ _ _ _ _ _ _ _ _ (((by omega)))).2.trans ?_⟩<;>(by_cases h2:signOf w=true<;>[simp(disch:=assumption) only[AD h2,j5,cy,jZ,lO _ (VO _ _)];simp(disch:=assumption) only[AC h2,j5,cy,jZ,lO _ (VO _ _)]]) @[inline]def ax(a b:UInt64):UInt64×UInt64:= let a0:=a%4294967296;let a1:=a/4294967296;let b0:=b%4294967296;let b1:=b/4294967296 let p00:=a0*b0;let p01:=a0*b1;let p10:=a1*b0 let m:=p00/4294967296+p01%4294967296+p10%4294967296 (a1*b1+p01/4294967296+p10/4294967296+m/4294967296,m%4294967296*4294967296+p00%4294967296) @[irreducible] def aU(a b:UInt64):(ax a b).1а*2^64+(ax a b).2а=aа*bа:=by unfold ax;simp only[η,ύ,ml,nB,kA];have:=a.toNat_lt;have:=b.toNat_lt;generalize aа=A,bа=B at* have e:A*B=A/4294967296*(B/4294967296)*2^64+(A%4294967296*(B/4294967296)+A/4294967296*(B%4294967296))*2^32+A%4294967296*(B%4294967296):=by(conv_lhs=>rw[<-ϛ A 4294967296,<-ϛ B 4294967296]);ring have⟨d,g,h,j⟩:A%4294967296<=4294967295/\B%4294967296<=4294967295/\A/4294967296<=4294967295/\B/4294967296<=4294967295:=(by omega);have k:∀p:ℕ,p<=4294967295*4294967295->p%2^64=p:=λp q=>γ (by omega);rw[k _ (ϧ d g),k _ (ϧ d j),k _ (ϧ h g),k _ (ϧ h j)];have h0:=ϧ d g;have h1:=ϧ d j;have h2:=ϧ h g;have h3:=ϧ h j;clear d g h j k;generalize A%4294967296*(B%4294967296)=x0,A%4294967296*(B/4294967296)=x1,A/4294967296*(B%4294967296)=x2,A/4294967296*(B/4294967296)=x3 at*;have d0:=Nat.div_add_mod x0 4294967296;have d1:=Nat.div_add_mod x1 4294967296;have d2:=Nat.div_add_mod x2 4294967296;have c0:=Nat.mod_lt x0 ((by decide):0<4294967296);have c1:=Nat.mod_lt x1 ((by decide):0<4294967296);have c2:=Nat.mod_lt x2 ((by decide):0<4294967296);generalize x0/4294967296=q0,x0%4294967296=r0,x1/4294967296=q1,x1%4294967296=r1,x2/4294967296=q2,x2%4294967296=r2 at*;omega @[inline]def cT(ah al mm:UInt64)(k:Nat):UInt64×UInt64:= let K:=kж let bl:=al+(if K<64 then mm<<>>1)>>>(63-K)else mm<<<(K-64))+(if bl>>1)>>>(63-kж)else d<<<(kж-64))=o at*;have:=g.toNat_lt;have:=l.toNat_lt;simp only[η,μ,Ax lq,kA];lia @[inline]def fV(bh bl:UInt64):UInt64:=if bh !=0 then 64+Core.ai bh else Core.ai bl @[irreducible] def iq(d g:UInt64):(fV d g)а=(dа*2^64+gа)з:=by have:=g.toNat_lt;rw[fV];split_ifs with h .have e:(dа*2^64+gа)>>>64=dа:=(by omega);have j:dа≠0:=by simpa[<-ξ]using h rw[bo (dа*2^64+gа) 64 (by rwa[e]),e,η,Y7];have:=(m9 j).2 d.toNat_lt;lia .simp only[AM,Ak,pM]at h;subst h;simp[Y7] def cR(H1 H0:UInt64)(t:Nat)(st:Bool)(Dn u:Nat)(eps:Word):UInt64:= let sE:=idxOf eps+149-2*u let e:=cT H1 H0 (Dnж*Core.mW eps) (sE-t) let S2:=(1374+(Core.ai Dnж)а-(2*u+t+(fV e.1 e.2)а))/2 let den:=Dnж<<<(1322-(2*u+2*S2+t))ж let R:=(Float.sqrt ((e.1.toFloat*0x10000000000000000+e.2.toFloat)/den.toFloat)).toUInt64 let p:=ax (R*R) den let q:=ax ((R+1)*(R+1)) den if 2*u<=idxOf eps+149/\t<=sE/\sE-t<=78/\H1<0x4000000000000000/\0(cR N M t (L !=0) d u j)й=V5 A d u j:=by unfold cR;dsimp only;generalize he:cT N M _ _=e;generalize as:(fV e.1 e.2)а=W;generalize v:(1374+(Core.ai dж)а-(2*u+t+W))/2=O;generalize x:1322-(2*u+2*O+t)=k;generalize w:dж<<(m*m)а=mа*mа:=λm h=>by rw[ύ];apply γ;exact AO (ϧ h h) (by decide) rw[hq _ g.le,y]at I;rw[hq _ (Q▸g),Q,y]at J;simp only[μ,θ,<-ξ]at a1 a0;generalize hX:Rа*Rа*(d*2^k)=X at I;generalize hY:(Rа+1)*(Rа+1)*(d*2^k)=Y at J;have hT:=϶ t;have xh:X<=H:=(by clear*-I a1 hH p2;omega);have h1:=ι (2^t) xh;have K:=ι (2^t) (by clear*-J a0 hH e2;omega:H+1<=Y);clear a1 a0;have G:∀a,a*(d*2^(k+t))=a*(d*2^k)*2^t:=λa=>by rw[m7];ring have w:0>>t=H:=by rw[β,<-U,Τ,Ρ _ _ hT,ώ hL,Κ] rw[bo B t (by omega),e,z] have aL:(p.1==e.1&&p.2==e.2&&!(L !=0))=(B==Rа*Rа*(d*2^(k+t))):=by rw[G,hX];clear v x h3;apply ϓ.2;simp only[Η,AQ,<-ξ,BM,bne_eq_false_iff_eq];constructor;rintro⟨⟨q1,q2⟩,q3⟩;rw[<-U,<-hH,<-I,q1,q2,q3,ϑ];intro h4;have:X=H:=by by_contra;have:=ι (2^t) ((by omega):X+1<=H);rw[Ϡ]at this;omega clear*-this I hH p2 e2 h4 U h1;omega unfold V5;dsimp only;rw[min_eq_left V,Nat.sub_self,BH,ο,ah,al,show(350-((2*u:Nat):Int)-(((t+W:Nat):Int)-(dз:Int)))/2=(O:Int)-512 by clear*-v E;omega,show((2*u:Nat):Int)-298+2*((O:Int)-512)=-((k+t:Nat):Int) by clear*-x D;omega,show V8 B (-((k+t:Nat):Int))=B by rw[V8];split_ifs;rw[show(-((k+t:Nat):Int))л=0 by clear*-x;omega,BH];rfl,show YF d (-((k+t:Nat):Int))=d*2^(k+t) by rw[YF];split_ifs;simp[((by omega):k+t=0)];rw[Int.neg_neg,Int.toNat_natCast,ο],<-aH,AD hR,YG,AD (show(Rа>>>31==0&&decide (-209<=(O:Int)-512)&&decide ((O:Int)-512<=297))=true by simp only[Η,AQ,AJ];clear*-g E F;omega),<-aL];congr 1;apply ξ.1;rw[UInt64.toNat_ofNat',η,ύ];split<;>simp<;>clear*-g<;>omega;congr 1;clear*-;omega @[irreducible] def jU(z m a d e:UInt64)(h:z≠0\/¬(m(x-y)а+yа=xа:=λx y q=>by rw[χ x y (θ.2 q)];exact Nat.sub_add_cancel q have t2:∀x y:UInt64,xа(x-y)а+yа=xа+2^64:=λx y q=>by rw[Ζ];have:=x.toNat_lt;have:=y.toNat_lt;omega by_cases c2:aа(ei l h c S n Dn u eps)й=V5 (n*Q-S*S) Dn u eps:=by unfold ei;dsimp only;have B:=aU nж l;have D:=aU nж h;have E:=aU Sж Sж;generalize ax nж l=a at B⊢;generalize ax nж h=b at D⊢;generalize ax Sж Sж=s at E⊢;by_cases G:n<1024/\S<2^64/\c<1024/\a.1<=a.1+b.2/\(b.1+nж*cж≠0\/¬(a.1+b.2absurd h (by decide) rw[AD G];obtain⟨H,T,C,M,Y⟩:=G;have N:nжа=n:=Α (H.trans (by decide));rw[N]at B D;rw[Α T]at E;have A:=jU _ _ _ _ _ Y rw[E,show(b.1+nж*cж)а*2^128+(a.1+b.2)а*2^64+a.2а=n*Q by have:=h.toNat_lt;have:=b.2.toNat_lt;have:=a.1.toNat_lt;have k:n*hа<1024*2^64:=ly H h.toNat_lt.le (by decide);have:n*c<1024*1024:=ϕ H C;rw[θ,η]at M;rw[η,η,ύ,N,Α (C.trans (by decide)),γ (a:=n*c) (by clear*-this;omega),γ (by clear*-D k this;omega),γ (by omega),hQ,Nat.mul_add,Nat.mul_add,<-Ϛ,<-Ϛ,<-B,<-D];ring]at A generalize b.1+nж*cж-_=X at A⊢;generalize a.1+b.2-s.1-_=V at A⊢;generalize a.2-s.2=W at A⊢;have:=V.toNat_lt;have:=W.toNat_lt;by_cases K:X=0;swap;rw[AC K];exact cd _ _ _ 64 _ _ _ eps (by rw[<-A];ring) W.toNat_lt rw[AD K];rw[K]at A;by_cases K2:V<17179869184/\idxOf eps+149-2*u<=78;swap;rw[AC K2];exact cd _ _ _ 32 _ _ _ eps (by rw[jD,<-A];simp) (by simp;omega) rw[AD K2];have J:=cd V W 0 0 Dn u (n*Q-S*S) eps (by rw[<-A];simp) (by simp);simp only[bne_self_eq_false]at J;by_cases K3:cR V W 0 false Dn u eps<4294967296;rw[AD K3];exact J rw[AC K3];by_cases G:V=0/\32<=u/\idxOf eps+149-2*u<=46;swap;rw[AC G];exact λq=>absurd q K3 rw[AD G];obtain⟨K,U,-⟩:=G;rw[<-jX _ _ _ _ hD he U];exact cd _ _ _ 32 _ _ _ eps (by rw[jD,<-A,K];simp) (by simp) def gQ(n:Nat)(eps:Word)(x:(Array Word))(r:Nat):Word:= let lo:=r*n let u:=cS x loе (lo+n)е 255 let st:=cF x u loе (lo+n)е 0 0 0 0 0 0 0 0 let F:=λ(_:Unit)=>V5 (st.big+st.lа+(st.hа+st.c<<<64)<<<64) n uа eps let v:=if st.big=0 then ei st.l st.h st.c 0 1 n uа eps else 4294967296 if v<4294967296 then vйelse F () @[irreducible] def gR(n:Nat)(eps:kF)(x:(Array Word))(r:Nat)(hn:0NR.eI 1 (0,0,false,0,0,gQ n eps x r)) (λe i j=>let xw:=ck x i;let gw:=ck g j if Core.mW xw==0 then roundRational 0 else if e.ok then NE.el xw gw 0 nd e.nS e.R e.pz e.A1 e.A2 e.C1 (λ_=>roundRational (rationalWord xw*rationalWord gw/rationalWord e.td)) else roundRational (rationalWord xw*rationalWord gw/rationalWord e.td)) n rows 0 (A0 (rows*n)) @[irreducible] def Qg{α:Type}[Inhabited α]{m k:Nat}(f:Fin m->α)(h:k< m): (kK f)[k]! =f ⟨k,h⟩:=by rw[AB _ k (by simpa using h),Λ] @[irreducible] def YP(e n:Nat)(h:kF)(x g:(Array Word))(l:0kB x[i]!≠255)(z:∀j,jkB g[j]!≠255): Yo e n h x g=rmsnormStable e n h x g:=by apply Ys _ _ _ _ w;intro i A;have r:=Ϟ (by rwa[Ϗ]);have B:=ϊ i l;have u:=ι n (l7 r);rw[Ο]at u;dsimp only;simp only[f6,Conv.aa _ ((by omega):i<2^32),Conv.aa _ ((by omega):i%n<2^32),Qg _ r,gR _ _ _ _ l q ((by exact Nat.lt_of_le_of_lt (by assumption) (by assumption)):i/n*n+n<2^32),V7 n h x _ l q];generalize mK _=d;have p:(rationalWord x[i]!-0)*rationalWord g[i%n]!/rationalWord d+rationalWord 0=rationalWord x[i]!*rationalWord g[i%n]!/rationalWord d:=by rw[(by rw[Y1,((by decide):sv 0=0)];simp:rationalWord 0=0)];ring split_ifs with t y;simp[(by rw[Y1,(by rw[sv];split<;>simp[(by simpa[YK]using t:mantOf x[i]! =0)]:sv x[i]! =0)];simp:rationalWord x[i]! =0)];exact(NE.jn _ _ 0 d _ 1 0 0 0 0 false _ 0 rfl (D i A) (z _ B) (by decide) one_pos y (by simp) (congrArg roundRational p).symm).trans (congrArg roundRational p);rfl @[inline]def SN(rows n:Nat)(eps:Word)(x g:(Array Word)):Bool:= rows>0&&n>0&&xв==rows*n&&gв==n&&x.all finiteWord&&g.all finiteWord&&finiteWord eps&&(!signOf eps&&Core.mW eps !=0) @[irreducible] def fG(e n:Nat)(d:kF)(x g:(Array Word)):SN e n d x g=mq e n d x g:=by rw[SN,mq];congr 1;rw[Q6,Y2];have:(0:ℚ)<2^((idxOf d:Int)-149):=(((by positivity)));rw[sg];cases signOf d<;>simp[this,BD] @[irreducible] def jm{d n:Nat}{e:kF}{x g:(Array Word)}(h:mq d n e x g=true): 0kB x[i]!≠255)/\∀j,jkB g[j]!≠255:=by simp only[mq,Η,AJ,BC]at h;have p:xв=d*n:=by simpa using h.1.1.1.1.1.2 have l:gв=n:=by simpa using h.1.1.1.1.2 use h.1.1.1.1.1.1.2,h.2,λi m=>NR.ic x (by simpa[np]using h.1.1.1.2) i (by omega),λj o=>NR.ic g (by simpa[np]using h.1.1.2) j (by omega) def ca(rows n:Nat)(eps:Word)(x g:(Array Word)):(Array Word):= if SN rows n eps x g then if rows*n<=4294967295 then Yo rows n eps x g else rmsnormSpec rows n eps x g else rmsnormSpec rows n eps x g @[irreducible] def du:ca=rmsnormSpec:=by funext j n l x g;rw[ca];split_ifs with h hR .rw[fG]at h;rw[rmsnormSpec,rmsnormWith];rw[AD h];have⟨a,e,c,d⟩:=jm h;exact YP j n l x g a (by omega) e c d .rfl .rfl def YU(n:Nat)(eps:Word)(x:(Array Word))(r:Nat):Nat×Nat×Bool×Nat×Nat×Word:= let lo:=r*n let u:=Yh x lo (lo+n) 255 let Q:=Yl x u lo (lo+n) 0 0 0 0 let pn:=Ym x u lo (lo+n) 0 0 let S:=Y0 pn.1 pn.2 let k:=Q2 (max pn.1 pn.2)-30 (u,k,decide (pn.1>>k,S&&&(VO 1 k-1),V5 (n*Q-S*S) (n*n) u eps) @[irreducible] def Vn(n:Nat)(d:kF)(x:(Array Word))(r:Nat)(e:0jmantOf x[j]! =0\/t.1<=idxOf x[j]!):=by have g:=(Yi x (r*n+n) n (r*n) 255 (((by omega)))).2;have⟨l,m⟩:=VF n x r _ e g;use(by rw[l,<-Yn];simp only[YU,Yz,ο,n4,ζ,β,Au]),(by simp only[YU];rw[YW _ _ _ _ (Ϯ e e) h,m]),g @[inline]def gM(n:Nat)(eps:Word)(x:(Array Word))(r:Nat):Nat×Nat×Bool×Nat×Nat×Word:= let lo:=r*n let u:=cS x loе (lo+n)е 255 let st:=cF x u loе (lo+n)е 0 0 0 0 0 0 0 0 let S:=Y0 st.P st.N let k:=Q2 (max st.P st.N)-30 (uа,k,decide (st.P>>k,S&&&(VO 1 k-1), let F:=λ(_:Unit)=>V5 (n*(st.big+st.lа+(st.hа+st.c<<<64)<<<64)-S*S) (n*n) uа eps let v:=if st.big=0 then ei st.l st.h st.c S n (n*n) uа eps else 4294967296 if v<4294967296 then vйelse F ()) @[irreducible] def gN(n:Nat)(eps:kF)(x:(Array Word))(r:Nat)(hn:0NR.eI n (gM n eps x r)) (λe i j=> if e.ok then NE.el (ck x i) (ck g j) (ck b j) nd e.nS e.R e.pz e.A1 e.A2 e.C1 λ_=>gP n eps x g b iб jб else gP n eps x g b iб jб) n rows 0 (A0 (rows*n)) @[irreducible] def V3(e n:Nat)(h:kF)(x g b:(Array Word))(m:0kB x[i]!≠255)(F:∀j,jkB g[j]!≠255) (D:∀j,jkB b[j]!≠255): Yw e n h x g b=layernormStable e n h x g b:=by apply Ys _ _ _ _ B;intro i G;have w:=Ϟ (by rwa[Ϗ]);have r:=ϊ i m;have z:=ι n (l7 w);rw[Ο]at z;dsimp only;simp only[f6,Conv.aa _ ((by omega):i<2^32),Conv.aa _ ((by omega):i%n<2^32),gP,Qg _ w,Fin.is_lt,Qg,gN _ _ _ _ m q ((by exact Nat.lt_of_le_of_lt (by assumption) (by assumption)):i/n*n+n<2^32)];obtain⟨v,A,-⟩:=Vn n h x (i/n) m q;rw[<-v,<-A];generalize YU n h x (i/n)=t at*;obtain⟨u,k,y,o,p,d⟩:=t;dsimp only at*;split_ifs with E;exact NE.jn _ _ _ d _ n u k o p y _ _ rfl (H i G) (F _ r) (D _ r) m E (by rw[v];unfold sg;split<;>push_cast<;>rw[Ac (by simp),AA]<;>ring) rfl;rfl def bn(rows n:Nat)(eps:Word)(x g b:(Array Word)):(Array Word):= if SN rows n eps x g&&bв==n&&b.all finiteWord then if rows*n<=4294967295 then Yw rows n eps x g b else layernormSpec rows n eps x g b else layernormSpec rows n eps x g b @[irreducible] def cN:bn=layernormSpec:=by funext l n m x g b;rw[bn];split_ifs with h;rw[fG]at h;rw[layernormSpec,layernormWith,AD h];simp only[Η]at h;obtain⟨a,e,c,d⟩:=jm h.1.1;have o:bв=n:=by simpa using h.1.2 exact V3 l n m x g b a (by omega) e c d (λj p=>NR.ic b (by simpa[np]using h.2) j (by omega));rfl;rfl end Norm end /- Paired driver for the generic cached NR1 Dense path: two outputs per pass through the proved `qP` worker, unchanged `pN` finishing; program equivalences only. -/ namespace Dense.F open ExactRuntime /-- The paired result two single-output results stand for. -/ noncomputable def A16.of (p q : A9) : A16 := ⟨p.a0,p.a1,p.a2,p.a3,p.a4,p.a5,p.a6,p.a7,q.a0,q.a1,q.a2,q.a3,q.a4,q.a5,q.a6,q.a7⟩ /-- Ordered eight-row MAC recurrence for two weight rows at once. The activation index is computed from the single counter `t`: with a second induction variable (as in `qP`) clang leaves the loop scalar on aarch64; in this form it is vectorized on both hosts. -/ @[specialize] def qQ (D X : FloatArray) (ou ov n : USize) (hd : D.size < 2^32) (hD : ou.toNat+n.toNat ≤ D.size) (hE : ov.toNat+n.toNat ≤ D.size) (hx : X.size < 2^32) (hX : 8*n.toNat ≤ X.size) (t : USize) (a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 : Float) : A16 := if h : t < n then have ht := USize.lt_iff_toNat_lt.mp h have hI : (t*8).toNat+8 ≤ X.size := by have := USize.le_size have hsz : USize.size=2^System.Platform.numBits := rfl rw [USize.toNat_mul,Nat.mod_eq_of_lt (by simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; omega let w := D.uget (ou+t) (by rw [Dense.aj (by have := USize.le_size; omega)]; omega) let v := D.uget (ov+t) (by rw [Dense.aj (by have := USize.le_size; omega)]; omega) let x0 := X.uget (t*8+0) (uk (by simp) hI hx) let x1 := X.uget (t*8+1) (uk (by simp) hI hx) let x2 := X.uget (t*8+2) (uk (by simp) hI hx) let x3 := X.uget (t*8+3) (uk (by simp) hI hx) let x4 := X.uget (t*8+4) (uk (by simp) hI hx) let x5 := X.uget (t*8+5) (uk (by simp) hI hx) let x6 := X.uget (t*8+6) (uk (by simp) hI hx) let x7 := X.uget (t*8+7) (uk (by simp) hI hx) qQ D X ou ov n hd hD hE hx hX (t+1) (a0+x0*w) (a1+x1*w) (a2+x2*w) (a3+x3*w) (a4+x4*w) (a5+x5*w) (a6+x6*w) (a7+x7*w) (b0+x0*v) (b1+x1*v) (b2+x2*v) (b3+x3*v) (b4+x4*v) (b5+x5*v) (b6+x6*v) (b7+x7*v) else ⟨a0,a1,a2,a3,a4,a5,a6,a7,b0,b1,b2,b3,b4,b5,b6,b7⟩ termination_by n.toNat-t.toNat decreasing_by have := USize.lt_iff_toNat_lt.mp h; rw [Dense.ac h]; omega /-- `qQ` is exactly two `qNR` runs: the same Float operations, lane by lane. -/ @[irreducible] def qQ_eq (D X : FloatArray) (ou ov n : USize) (hd : D.size < 2^32) (hD : ou.toNat+n.toNat ≤ D.size) (hE : ov.toNat+n.toNat ≤ D.size) (hx : X.size < 2^32) (hX : 8*n.toNat ≤ X.size) (e : Word) : ∀ m (t i : USize) (hi : i.toNat+8*(n.toNat-t.toNat) ≤ X.size) (a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 : Float), n.toNat-t.toNat=m → i=t*8 → qQ D X ou ov n hd hD hE hx hX t a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 = A16.of (qNR D X ou n hd hD hx t i hi a0 a1 a2 a3 a4 a5 a6 a7 e) (qNR D X ov n hd hE hx t i hi b0 b1 b2 b3 b4 b5 b6 b7 e) := by intro m induction m with | zero => intro t i hi a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 hm _ have h : ¬t < n := fun h => by have := USize.lt_iff_toNat_lt.mp h; omega rw [qQ,dif_neg h] conv_rhs => arg 1; rw [qNR,dif_neg h] conv_rhs => arg 2; rw [qNR,dif_neg h] rfl | succ m ih => intro t i hi a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 hm hbase subst hbase have ht : t.toNat < n.toNat := by omega have h : t < n := USize.lt_iff_toNat_lt.mpr ht have hmnext : n.toNat-(t+1).toNat=m := by rw [Dense.ac h]; omega rw [qQ,dif_pos h] conv_rhs => arg 1; rw [qNR,dif_pos h] conv_rhs => arg 2; rw [qNR,dif_pos h] exact ih (t+1) (t*8+8) _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ hmnext (by rw [USize.add_mul,USize.one_mul]) /-- `qNR` returns its metadata word unchanged. -/ @[irreducible] def qNR_o (D X : FloatArray) (ou n : USize) (hd : D.size < 2^32) (hD : ou.toNat+n.toNat ≤ D.size) (hx : X.size < 2^32) (hi : (0:USize).toNat+8*(n.toNat-(0:USize).toNat) ≤ X.size) (a0 a1 a2 a3 a4 a5 a6 a7 : Float) (e : Word) : (qNR D X ou n hd hD hx 0 0 hi a0 a1 a2 a3 a4 a5 a6 a7 e).o=e := (qNR_accum D X ou n hd hD hx 0 0 (by decide) _ 0 0 hi a0 a1 a2 a3 a4 a5 a6 a7 e rfl (by simp)).2 /-- The eight finishing writes of one output column, as in `b8`. -/ noncomputable def pN8 (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (s0 s1 s2 s3 s4 s5 s6 s7 : Float) : Array Word := pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L (pN t R C n relu X W b XT h L a i j s0) (i+1) j s1) (i+2) j s2) (i+3) j s3) (i+4) j s4) (i+5) j s5) (i+6) j s6) (i+7) j s7 @[irreducible] def b8_pN8 (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (rb o : Nat) (a : Array Word) (work : NRWork W) : b8 (work:=work) t R n ow relu X W b ix ib L hs hW XT rb o a = pN8 t R ow n relu X W b XT (hG (yR XT n ow W b hs hW rb o work).o ix ib L) L a (8*rb) o (yR XT n ow W b hs hW rb o work).s.a0 (yR XT n ow W b hs hW rb o work).s.a1 (yR XT n ow W b hs hW rb o work).s.a2 (yR XT n ow W b hs hW rb o work).s.a3 (yR XT n ow W b hs hW rb o work).s.a4 (yR XT n ow W b hs hW rb o work).s.a5 (yR XT n ow W b hs hW rb o work).s.a6 (yR XT n ow W b hs hW rb o work).s.a7 := rfl /-- Bounds the cached decoded payload satisfies for output row `o`. -/ @[irreducible] def nr_bounds (n ow : Nat) (W : Array Word) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (p : B8P W) (o : Nat) (ho : o < ow) : p.val.1.size < 2^32 ∧ (o*n).toUSize.toNat+n.toUSize.toNat ≤ p.val.1.size := by have hsz : p.val.1.size=W.size := by rw [B8P_data,(DRok W).1] have h1 : (o+1)*n ≤ ow*n := Nat.mul_le_mul_right n ho have := USize.le_size rw [Nat.succ_mul] at h1 rw [Dense.aa (by omega),Dense.aa (by omega),hsz] exact ⟨hs.1,by omega⟩ @[irreducible] def xt_bounds (n : Nat) (xt : FloatArray) (h : 8*n ≤ xt.size ∧ xt.size ≤ 4294967295) : xt.size < 2^32 ∧ (0:USize).toNat+8*(n.toUSize.toNat-(0:USize).toNat) ≤ xt.size ∧ 8*n.toUSize.toNat ≤ xt.size := by have := USize.le_size rw [USize.toNat_zero,Nat.sub_zero,Nat.zero_add,Dense.aa (by omega)] exact ⟨by omega,h.1,h.1⟩ /-- With the cached worker, `yR` is one `qNR` run. -/ @[irreducible] def yR_nr (XT : Array FloatArray) (n ow : Nat) (W b : Array Word) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (p : B8P W) (rb o : Nat) (h : 8*n ≤ (XT[rb]!).size ∧ (XT[rb]!).size ≤ 4294967295 ∧ o < ow) (hd : p.val.1.size < 2^32) (hD : (o*n).toUSize.toNat+n.toUSize.toNat ≤ p.val.1.size) (hx : (XT[rb]!).size < 2^32) (hi : (0:USize).toNat+8*(n.toUSize.toNat-(0:USize).toNat) ≤ (XT[rb]!).size) : yR XT n ow W b hs hW rb o (nrWork W p) = qNR p.val.1 (XT[rb]!) (o*n).toUSize n.toUSize hd hD hx 0 0 hi (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) (dw oneW*dw b[o]!) p.val.2 := by unfold yR dsimp only rw [dif_pos h] rfl /-- One output column through the cached worker, kept out of line: it only runs for an odd last output and for the defensive branch of `b8P`. -/ noncomputable def b8N (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (rb o : Nat) (a : Array Word) : Array Word := b8 (work:=nrWork W p) t R n ow relu X W b ix ib L hs hW XT rb o a /- Tiled B1: two adjacent eight-output panels per pass. -/ /-- Tiled B1 recurrence for two panels (`i`, `j` are their offsets) sharing each activation. -/ @[specialize] def qT2 (D X : FloatArray) (n : USize) (hd : D.size < 2^32) (hx : n.toNat ≤ X.size) (z : Float) (t i j : USize) (hi : i.toNat+8*(n.toNat-t.toNat) ≤ D.size) (hj : j.toNat+8*(n.toNat-t.toNat) ≤ D.size) (a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 : Float) : A16 := if h : t < n then have ht := USize.lt_iff_toNat_lt.mp h have hI : i.toNat+8 ≤ D.size := by omega have hJ : j.toNat+8 ≤ D.size := by omega have hn : (i+8).toNat+8*(n.toNat-(t+1).toNat) ≤ D.size := by rw [Dense.ac h,Dense.aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; omega have hm : (j+8).toNat+8*(n.toNat-(t+1).toNat) ≤ D.size := by rw [Dense.ac h,Dense.aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat]; omega let x := X.uget t (by omega) if x == z then qT2 D X n hd hx z (t+1) (i+8) (j+8) hn hm a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 else qT2 D X n hd hx z (t+1) (i+8) (j+8) hn hm (a0+x*D.uget (i+0) (uk (by simp) hI hd)) (a1+x*D.uget (i+1) (uk (by simp) hI hd)) (a2+x*D.uget (i+2) (uk (by simp) hI hd)) (a3+x*D.uget (i+3) (uk (by simp) hI hd)) (a4+x*D.uget (i+4) (uk (by simp) hI hd)) (a5+x*D.uget (i+5) (uk (by simp) hI hd)) (a6+x*D.uget (i+6) (uk (by simp) hI hd)) (a7+x*D.uget (i+7) (uk (by simp) hI hd)) (b0+x*D.uget (j+0) (uk (by simp) hJ hd)) (b1+x*D.uget (j+1) (uk (by simp) hJ hd)) (b2+x*D.uget (j+2) (uk (by simp) hJ hd)) (b3+x*D.uget (j+3) (uk (by simp) hJ hd)) (b4+x*D.uget (j+4) (uk (by simp) hJ hd)) (b5+x*D.uget (j+5) (uk (by simp) hJ hd)) (b6+x*D.uget (j+6) (uk (by simp) hJ hd)) (b7+x*D.uget (j+7) (uk (by simp) hJ hd)) else ⟨a0,a1,a2,a3,a4,a5,a6,a7,b0,b1,b2,b3,b4,b5,b6,b7⟩ termination_by n.toNat-t.toNat decreasing_by all_goals have := USize.lt_iff_toNat_lt.mp h; rw [Dense.ac h]; omega /-- `qT2` is exactly two `qT` runs. -/ @[irreducible] def qT2_eq (D X : FloatArray) (n : USize) (hd : D.size < 2^32) (hx : n.toNat ≤ X.size) (z : Float) (e : Word) : ∀ m (t i j : USize) (hi : i.toNat+8*(n.toNat-t.toNat) ≤ D.size) (hj : j.toNat+8*(n.toNat-t.toNat) ≤ D.size) (a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 : Float), n.toNat-t.toNat=m → qT2 D X n hd hx z t i j hi hj a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 = A16.of (qT D X n hd hx z t i hi a0 a1 a2 a3 a4 a5 a6 a7 e) (qT D X n hd hx z t j hj b0 b1 b2 b3 b4 b5 b6 b7 e) := by intro m induction m with | zero => intro t i j hi hj a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 hm have h : ¬t < n := fun h => by have := USize.lt_iff_toNat_lt.mp h; omega rw [qT2,dif_neg h] conv_rhs => arg 1; rw [qT,dif_neg h] conv_rhs => arg 2; rw [qT,dif_neg h] rfl | succ m ih => intro t i j hi hj a0 a1 a2 a3 a4 a5 a6 a7 b0 b1 b2 b3 b4 b5 b6 b7 hm have ht : t.toNat < n.toNat := by omega have h : t < n := USize.lt_iff_toNat_lt.mpr ht have hmnext : n.toNat-(t+1).toNat=m := by rw [Dense.ac h]; omega rw [qT2,dif_pos h] conv_rhs => arg 1; rw [qT,dif_pos h] conv_rhs => arg 2; rw [qT,dif_pos h] dsimp only split · exact ih _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ hmnext · exact ih _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ hmnext @[irreducible] def qT_o (D X : FloatArray) (n : USize) (hd : D.size < 2^32) (hx : n.toNat ≤ X.size) (z : Float) (i : USize) (hi : i.toNat+8*(n.toNat-(0:USize).toNat) ≤ D.size) (a0 a1 a2 a3 a4 a5 a6 a7 : Float) (e : Word) : (qT D X n hd hx z 0 i hi a0 a1 a2 a3 a4 a5 a6 a7 e).o=e := (qT_accum D X n hd hx z i.toNat 0 (by decide) _ 0 i hi a0 a1 a2 a3 a4 a5 a6 a7 e rfl (by simp)).2 @[irreducible] def A9.eta (q : A9) (e : Word) (h : q.o=e) : (⟨q.a0,q.a1,q.a2,q.a3,q.a4,q.a5,q.a6,q.a7,e⟩ : A9)=q := by cases q simp only at h subst h rfl @[irreducible] def tp_bounds (n : Nat) (D : FloatArray) (lo : Nat) (hn : 8*n < 2^32) (hd : D.size < 2^32) (h : lo+8*n ≤ D.size) : lo.toUSize.toNat+8*(n.toUSize.toNat-(0:USize).toNat) ≤ D.size := by have := USize.le_size rw [Dense.aa (by omega),Dense.aa (by omega),USize.toNat_zero,Nat.sub_zero] exact h @[irreducible] def tx_bounds (n : Nat) (xr : FloatArray) (hn : 8*n < 2^32) (h : xr.size=n) : n.toUSize.toNat ≤ xr.size := by have := USize.le_size rw [Dense.aa (by omega)] omega /-- Panels `g` and `g+1` of the tiled B1 worker in one pass. -/ @[inline] def yWT2 (xr : FloatArray) (n ow : Nat) (W b : Array Word) (hs : W.size < 2^32 ∧ 8*n < 2^32) (p : TP W n ow) (g : Nat) : A9 × A9 := let D := p.val.1 let bq := fun r => dw oneW*dw b[min (8*g) (ow-8)+r]! let bs := fun r => dw oneW*dw b[min (8*(g+1)) (ow-8)+r]! if h : xr.size=n ∧ g+1 < (ow+7)/8 ∧ D.size < 2^32 ∧ (g+1)*n*8+8*n ≤ D.size then let s := qT2 D xr n.toUSize h.2.2.1 (tx_bounds n xr hs.2 h.1) 0 0 (g*n*8).toUSize ((g+1)*n*8).toUSize (tp_bounds n D (g*n*8) hs.2 h.2.2.1 (by have := h.2.2.2; rw [Nat.succ_mul] at this; omega)) (tp_bounds n D ((g+1)*n*8) hs.2 h.2.2.1 h.2.2.2) (bq 0) (bq 1) (bq 2) (bq 3) (bq 4) (bq 5) (bq 6) (bq 7) (bs 0) (bs 1) (bs 2) (bs 3) (bs 4) (bs 5) (bs 6) (bs 7) (⟨s.a0,s.a1,s.a2,s.a3,s.a4,s.a5,s.a6,s.a7,p.val.2⟩, ⟨s.b0,s.b1,s.b2,s.b3,s.b4,s.b5,s.b6,s.b7,p.val.2⟩) else (yWT xr n ow W b hs p g,yWT xr n ow W b hs p (g+1)) @[irreducible] def yWT2_eq (xr : FloatArray) (n ow : Nat) (W b : Array Word) (hs : W.size < 2^32 ∧ 8*n < 2^32) (p : TP W n ow) (g : Nat) : yWT2 xr n ow W b hs p g=(yWT xr n ow W b hs p g,yWT xr n ow W b hs p (g+1)) := by unfold yWT2 dsimp only split · rename_i h have hlo : g*n*8+8*n ≤ p.val.1.size := by have := h.2.2.2; rw [Nat.succ_mul] at this; omega have hg : xr.size=n ∧ g < (ow+7)/8 ∧ p.val.1.size < 2^32 ∧ g*n*8+8*n ≤ p.val.1.size := ⟨h.1,by omega,h.2.2.1,hlo⟩ have BX := tx_bounds n xr hs.2 h.1 have B0 := tp_bounds n p.val.1 (g*n*8) hs.2 h.2.2.1 hlo have B1 := tp_bounds n p.val.1 ((g+1)*n*8) hs.2 h.2.2.1 h.2.2.2 have e0 : yWT xr n ow W b hs p g= qT p.val.1 xr n.toUSize h.2.2.1 BX 0 0 (g*n*8).toUSize B0 (dw oneW*dw b[min (8*g) (ow-8)+0]!) (dw oneW*dw b[min (8*g) (ow-8)+1]!) (dw oneW*dw b[min (8*g) (ow-8)+2]!) (dw oneW*dw b[min (8*g) (ow-8)+3]!) (dw oneW*dw b[min (8*g) (ow-8)+4]!) (dw oneW*dw b[min (8*g) (ow-8)+5]!) (dw oneW*dw b[min (8*g) (ow-8)+6]!) (dw oneW*dw b[min (8*g) (ow-8)+7]!) p.val.2 := by unfold yWT dsimp only rw [dif_pos hg] have e1 : yWT xr n ow W b hs p (g+1)= qT p.val.1 xr n.toUSize h.2.2.1 BX 0 0 ((g+1)*n*8).toUSize B1 (dw oneW*dw b[min (8*(g+1)) (ow-8)+0]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+1]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+2]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+3]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+4]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+5]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+6]!) (dw oneW*dw b[min (8*(g+1)) (ow-8)+7]!) p.val.2 := by unfold yWT dsimp only rw [dif_pos h] rw [e0,e1,qT2_eq p.val.1 xr n.toUSize h.2.2.1 BX 0 p.val.2 _ 0 _ _ B0 B1 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl] exact Prod.ext (A9.eta _ _ (qT_o _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _)) (A9.eta _ _ (qT_o _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _)) · rfl /-- `da` taking two elements per step from one paired evaluation while two remain. -/ @[specialize] def daP {α : Type} (f : Nat → α) (f2 : Nat → α × α) (N : Nat) (a : Array α) : Array α := if a.size+1 < N then let y := f2 a.size daP f f2 N ((a.push y.1).push y.2) else da f N a termination_by N-a.size decreasing_by simp only [Array.size_push]; omega @[irreducible] def daP_eq {α : Type} (f : Nat → α) (f2 : Nat → α × α) (N : Nat) (h2 : ∀ k, f2 k=(f k,f (k+1))) : ∀ a, daP f f2 N a=da f N a := by intro a induction a using daP.induct f2 N with | case1 a h y ih => rw [daP,if_pos h] dsimp only rw [ih] conv_rhs => rw [da,if_pos (by (exact Nat.le_of_lt (by assumption)) : a.size < N),da, if_pos (by rw [Array.size_push]; exact h)] have hy : y=(f a.size,f (a.size+1)) := h2 _ rw [hy,Array.size_push] | case2 a h => rw [daP,if_neg h] local instance : Inhabited A9 := ⟨⟨0,0,0,0,0,0,0,0,0⟩⟩ /-- `d6T` with the paired panel worker. -/ def d6T2 (n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hw : ow*n ≤ W.size) : Array Word := if _h : 8 ≤ ow ∧ 0 < n ∧ W.size ≤ 1048576 ∧ ((ow+7)/8)*n*8 < 2^32 then let p := TPGet W n ow if p.val.2 < 255 then let xr := bQ (fun k => dw X[k]!) n (FloatArray.emptyWithCapacity n) let Y := daP (fun g => yWT xr n ow W b hs p g) (fun g => yWT2 xr n ow W b hs p g) ((ow+7)/8) (Array.emptyWithCapacity ((ow+7)/8)) da (fun j => let y := Y[j/8]! let o := j*n tG relu (y.s.f (j-min (8*(j/8)) (ow-8))) y.o ix ib L (fun _ => tS relu L n (fun s => xr.get! s*dw W[o+s]!) (fun _ => dw oneW*dw b[j]!) (fun _ => aD n relu X W b (j/ow*n) 1 j)) (fun _ => aD n relu X W b (j/ow*n) 1 j)) (1*ow) (Array.emptyWithCapacity (1*ow)) else d6 n ow relu X W b ix ib L hs hw else d6 n ow relu X W b ix ib L hs hw @[irreducible] def d6T2_eq : @d6T2 = @d6T := by funext n ow relu X W b ix ib L hs hw unfold d6T2 d6T simp only [daP_eq _ _ _ (fun g => yWT2_eq _ n ow W b hs _ g)] end Dense.F namespace Dense open ExactRuntime end Dense /- Machine-word finishing for the paired cached Dense driver and gemm through the same driver; program equivalences against the definitions above only. -/ namespace Dense.F open ExactRuntime /-- One output write at a machine-word position: lane `k` of a group with `cnt` live rows. -/ @[inline] def wU (a : Array Word) (cnt k p : USize) (w : Word) (hp : k < cnt → p.toNat < a.size) : Array Word := if h : k < cnt then a.uset p w (hp h) else a @[irreducible] def wU_size (a : Array Word) (cnt k p : USize) (w : Word) (hp : k < cnt → p.toNat < a.size) : (wU a cnt k p w hp).size = a.size := by unfold wU split · exact Array.size_set _ · rfl @[irreducible] def wU_eq (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (hh : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (cnt k p : USize) (S : Float) (hp : k < cnt → p.toNat < a.size) (h1 : hh.1 = true) (hk : k < cnt ↔ i < R) (hpos : i < R → p.toNat = if t then j*R+i else i*C+j) (hc : k < cnt → ak S hh.2 < 4294967296) : wU a cnt k p (act relu (ak S hh.2).toUInt32) hp = pN t R C n relu X W b XT hh L a i j S := by unfold wU pN us by_cases hi : i < R · have e := hpos hi have hlt := hc (hk.2 hi) rw [dite_eq_left (hk.2 hi), dite_eq_left ⟨by simpa using hi,by rw [← e]; exact hp (hk.2 hi)⟩] simp only [Array.uset,h1,ite_true,e,tf,hlt] · rw [dite_eq_right (fun h => absurd (hk.1 h) hi), dite_eq_right (fun h => absurd (by simpa using h.1) hi)] /-- Lane `k` of an eight-row group: activity and position of the machine-word version agree with the natural-number ones. -/ @[irreducible] def lane (t : Bool) (R C i j k : Nat) (cnt p st kk : USize) (hk : k < 8) (hkk : kk.toNat = k) (hc : cnt.toNat = min 8 (R-i)) (hp : i < R → p.toNat = if t then j*R+i else i*C+j) (hst : i < R → st.toNat = if t then 1 else C) (hj : j < C) (hRC : R*C ≤ 4294967295) : (kk < cnt ↔ i+k < R) ∧ (i+k < R → (p+kk*st).toNat = if t then j*R+(i+k) else (i+k)*C+j) := by have hsz : USize.size = 2^System.Platform.numBits := rfl have hle := USize.le_size refine ⟨by rw [USize.lt_iff_toNat_lt,hkk,hc]; omega,fun h => ?_⟩ rw [USize.toNat_add,USize.toNat_mul,hkk,hp (by omega),hst (by omega),← hsz] clear hp hst hc hkk hsz cases t · have h2 : (i+k+1)*C ≤ R*C := Nat.mul_le_mul_right C h rw [Nat.add_mul,Nat.add_mul,Nat.one_mul] at h2 simp only [Bool.false_eq_true,ite_false] rw [Nat.add_mul,Nat.mod_eq_of_lt (a:=k*C) (by omega),Nat.mod_eq_of_lt (by omega)] omega · have h1 : (j+1)*R ≤ C*R := Nat.mul_le_mul_right R hj rw [Nat.mul_comm C R,Nat.add_mul,Nat.one_mul] at h1 simp only [ite_true] rw [Nat.mul_one,Nat.mod_eq_of_lt (a:=k) (by omega),Nat.mod_eq_of_lt (by omega)] omega /-- Every live lane position lies inside an output array of `R*C` words. -/ @[irreducible] def laneH (t : Bool) (R C i j : Nat) (cnt p st : USize) (hc : cnt.toNat = min 8 (R-i)) (hp : i < R → p.toNat = if t then j*R+i else i*C+j) (hst : i < R → st.toNat = if t then 1 else C) (hj : j < C) (hRC : R*C ≤ 4294967295) (a : Array Word) (ha : a.size = R*C) : ∀ kk : USize, kk < cnt → (p+kk*st).toNat < a.size := by intro kk hk have hk8 : kk.toNat < 8 := by rw [USize.lt_iff_toNat_lt,hc] at hk; omega have l := lane t R C i j kk.toNat cnt p st kk hk8 rfl hc hp hst hj hRC have hi := l.1.1 hk have h1 : (j+1)*R ≤ C*R := Nat.mul_le_mul_right R hj have h2 : (i+kk.toNat+1)*C ≤ R*C := Nat.mul_le_mul_right C hi rw [Nat.mul_comm C R,Nat.add_mul,Nat.one_mul] at h1 rw [Nat.add_mul,Nat.one_mul] at h2 rw [l.2 hi,ha] cases t · simp only [Bool.false_eq_true,ite_false]; omega · simp only [ite_true]; omega @[irreducible] def pN_size (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (S : Float) : (pN t R C n relu X W b XT h L a i j S).size = a.size := by unfold pN exact kt _ _ _ _ @[irreducible] def pN8_size (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (s0 s1 s2 s3 s4 s5 s6 s7 : Float) : (pN8 t R C n relu X W b XT h L a i j s0 s1 s2 s3 s4 s5 s6 s7).size = a.size := by unfold pN8 rw [pN_size,pN_size,pN_size,pN_size,pN_size,pN_size,pN_size,pN_size] /-- Eight writes of one row group and one output column. -/ @[inline] def w8 (a : Array Word) (cnt p st : USize) (w0 w1 w2 w3 w4 w5 w6 w7 : Word) (H : ∀ kk : USize, kk < cnt → (p+kk*st).toNat < a.size) : Array Word := wU (wU (wU (wU (wU (wU (wU (wU a cnt 0 (p+0*st) w0 (H 0)) cnt 1 (p+1*st) w1 (fun h => by rw [wU_size]; exact H 1 h)) cnt 2 (p+2*st) w2 (fun h => by rw [wU_size,wU_size]; exact H 2 h)) cnt 3 (p+3*st) w3 (fun h => by rw [wU_size,wU_size,wU_size]; exact H 3 h)) cnt 4 (p+4*st) w4 (fun h => by rw [wU_size,wU_size,wU_size,wU_size]; exact H 4 h)) cnt 5 (p+5*st) w5 (fun h => by rw [wU_size,wU_size,wU_size,wU_size,wU_size]; exact H 5 h)) cnt 6 (p+6*st) w6 (fun h => by rw [wU_size,wU_size,wU_size,wU_size,wU_size,wU_size]; exact H 6 h)) cnt 7 (p+7*st) w7 (fun h => by rw [wU_size,wU_size,wU_size,wU_size,wU_size,wU_size,wU_size]; exact H 7 h) @[irreducible] def w8_size (a : Array Word) (cnt p st : USize) (w0 w1 w2 w3 w4 w5 w6 w7 : Word) (H : ∀ kk : USize, kk < cnt → (p+kk*st).toNat < a.size) : (w8 a cnt p st w0 w1 w2 w3 w4 w5 w6 w7 H).size = a.size := by unfold w8 rw [wU_size,wU_size,wU_size,wU_size,wU_size,wU_size,wU_size,wU_size] /-- Every live lane of a group carries a certified rounding. -/ @[inline] def ok8 (cnt : USize) (c0 c1 c2 c3 c4 c5 c6 c7 : UInt64) : Bool := decide ((0:USize) < cnt → c0 < 4294967296) && (decide ((1:USize) < cnt → c1 < 4294967296) && (decide ((2:USize) < cnt → c2 < 4294967296) && (decide ((3:USize) < cnt → c3 < 4294967296) && (decide ((4:USize) < cnt → c4 < 4294967296) && (decide ((5:USize) < cnt → c5 < 4294967296) && (decide ((6:USize) < cnt → c6 < 4294967296) && decide ((7:USize) < cnt → c7 < 4294967296))))))) @[irreducible] def ok8_spec (cnt : USize) (c0 c1 c2 c3 c4 c5 c6 c7 : UInt64) (h : ok8 cnt c0 c1 c2 c3 c4 c5 c6 c7 = true) : ((0:USize) < cnt → c0 < 4294967296) ∧ ((1:USize) < cnt → c1 < 4294967296) ∧ ((2:USize) < cnt → c2 < 4294967296) ∧ ((3:USize) < cnt → c3 < 4294967296) ∧ ((4:USize) < cnt → c4 < 4294967296) ∧ ((5:USize) < cnt → c5 < 4294967296) ∧ ((6:USize) < cnt → c6 < 4294967296) ∧ ((7:USize) < cnt → c7 < 4294967296) := by simpa only [ok8,Bool.and_eq_true,decide_eq_true_eq] using h @[irreducible] def w8_eq (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (hh : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (cnt p st : USize) (s0 s1 s2 s3 s4 s5 s6 s7 : Float) (H : ∀ kk : USize, kk < cnt → (p+kk*st).toNat < a.size) (h1 : hh.1 = true) (hc : cnt.toNat = min 8 (R-i)) (hp : i < R → p.toNat = if t then j*R+i else i*C+j) (hst : i < R → st.toNat = if t then 1 else C) (hj : j < C) (hRC : R*C ≤ 4294967295) (hok : ok8 cnt (ak s0 hh.2) (ak s1 hh.2) (ak s2 hh.2) (ak s3 hh.2) (ak s4 hh.2) (ak s5 hh.2) (ak s6 hh.2) (ak s7 hh.2) = true) : w8 a cnt p st (act relu (ak s0 hh.2).toUInt32) (act relu (ak s1 hh.2).toUInt32) (act relu (ak s2 hh.2).toUInt32) (act relu (ak s3 hh.2).toUInt32) (act relu (ak s4 hh.2).toUInt32) (act relu (ak s5 hh.2).toUInt32) (act relu (ak s6 hh.2).toUInt32) (act relu (ak s7 hh.2).toUInt32) H = pN8 t R C n relu X W b XT hh L a i j s0 s1 s2 s3 s4 s5 s6 s7 := by have hk := ok8_spec _ _ _ _ _ _ _ _ _ hok have e := fun (k : Nat) (kk : USize) (hk : k < 8) (hkk : kk.toNat = k) (a' : Array Word) (S : Float) (hp' : kk < cnt → (p+kk*st).toNat < a'.size) (hok' : kk < cnt → ak S hh.2 < 4294967296) => wU_eq t R C n relu X W b XT hh L a' (i+k) j cnt kk (p+kk*st) S hp' h1 (lane t R C i j k cnt p st kk hk hkk hc hp hst hj hRC).1 (lane t R C i j k cnt p st kk hk hkk hc hp hst hj hRC).2 hok' have e0 : ∀ (a' : Array Word) (S : Float) (hp' : (0:USize) < cnt → (p+0*st).toNat < a'.size) (_ : (0:USize) < cnt → ak S hh.2 < 4294967296), wU a' cnt 0 (p+0*st) (act relu (ak S hh.2).toUInt32) hp' = pN t R C n relu X W b XT hh L a' i j S := fun a' S hp' hok' => e 0 0 (by omega) (by simp) a' S hp' hok' unfold w8 pN8 rw [e 7 7 (by omega) (by simp) _ _ _ hk.2.2.2.2.2.2.2, e 6 6 (by omega) (by simp) _ _ _ hk.2.2.2.2.2.2.1, e 5 5 (by omega) (by simp) _ _ _ hk.2.2.2.2.2.1, e 4 4 (by omega) (by simp) _ _ _ hk.2.2.2.2.1, e 3 3 (by omega) (by simp) _ _ _ hk.2.2.2.1, e 2 2 (by omega) (by simp) _ _ _ hk.2.2.1, e 1 1 (by omega) (by simp) _ _ _ hk.2.1, e0 _ _ _ hk.1] /-- One output of the natural-number finishing, out of line: it only runs for a group with a lane that is not certified. -/ @[noinline] def pNs (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (S : Float) : Array Word := pN t R C n relu X W b XT h L a i j S /-- The natural-number finishing chain of one output column, through `pNs`. -/ @[noinline] def pN8n (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (s0 s1 s2 s3 s4 s5 s6 s7 : Float) : Array Word := pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L (pNs t R C n relu X W b XT h L a i j s0) (i+1) j s1) (i+2) j s2) (i+3) j s3) (i+4) j s4) (i+5) j s5) (i+6) j s6) (i+7) j s7 @[irreducible] def pN8n_eq (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (s0 s1 s2 s3 s4 s5 s6 s7 : Float) : pN8n t R C n relu X W b XT h L a i j s0 s1 s2 s3 s4 s5 s6 s7 = pN8 t R C n relu X W b XT h L a i j s0 s1 s2 s3 s4 s5 s6 s7 := rfl /-- Both columns of a paired step through the natural-number chain; takes the worker result itself so that its sixteen fields are not kept alive across the certified path. -/ @[noinline] def pN16n (t : Bool) (R C n : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (h : Bool × UInt64) (L : Nat) (a : Array Word) (i j : Nat) (s : A16) : Array Word := pN8n t R C n relu X W b XT h L (pN8n t R C n relu X W b XT h L a i j s.a0 s.a1 s.a2 s.a3 s.a4 s.a5 s.a6 s.a7) i (j+1) s.b0 s.b1 s.b2 s.b3 s.b4 s.b5 s.b6 s.b7 /-- Position of row `i`, output `j` as a machine word. -/ @[irreducible] def pos_ok (t : Bool) (R C i j : Nat) (hj : j < C) (hRC : R*C ≤ 4294967295) (hi : i < R) : ((if t then j*R+i else i*C+j).toUSize).toNat = if t then j*R+i else i*C+j := by have hle := USize.le_size have h1 : (j+1)*R ≤ C*R := Nat.mul_le_mul_right R hj have h2 : (i+1)*C ≤ R*C := Nat.mul_le_mul_right C hi rw [Nat.mul_comm C R,Nat.add_mul,Nat.one_mul] at h1 rw [Nat.add_mul,Nat.one_mul] at h2 cases t · simp only [Bool.false_eq_true,ite_false] exact Dense.aa (by omega) · simp only [ite_true] exact Dense.aa (by omega) @[irreducible] def st_ok (t : Bool) (R C i : Nat) (hRC : R*C ≤ 4294967295) (hi : i < R) : (if t then (1:USize) else C.toUSize).toNat = if t then 1 else C := by have hle := USize.le_size have h2 : 1*C ≤ R*C := Nat.mul_le_mul_right C (by omega) rw [Nat.one_mul] at h2 cases t · simp only [Bool.false_eq_true,ite_false] exact Dense.aa (by omega) · simp @[irreducible] def cnt_ok (R i : Nat) : ((min 8 (R-i)).toUSize).toNat = min 8 (R-i) := Dense.aa (by have := USize.le_size; omega) /-- Outputs `v`, `v+1` of one row group on machine words: one pass of the paired worker, all sixteen roundings, then sixteen writes when every live lane is certified; otherwise the natural-number chain. Out of line on purpose: its code exists once. -/ @[noinline] def b8C (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (p : B8P W) (hh : Bool × UInt64) (L rb : Nat) (xt : FloatArray) (v ou ov nU : USize) (hd : p.val.1.size < 2^32) (hD : ou.toNat+nU.toNat ≤ p.val.1.size) (hE : ov.toNat+nU.toNat ≤ p.val.1.size) (hx : xt.size < 2^32) (hX : 8*nU.toNat ≤ xt.size) (a : Array Word) (cnt pa pb st : USize) (H0 : ∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) (H1 : ∀ kk : USize, kk < cnt → (pb+kk*st).toNat < a.size) : Array Word := let bp0 := dw oneW*dw b[v.toNat]! let bp1 := dw oneW*dw b[v.toNat+1]! let s := qQ p.val.1 xt ou ov nU hd hD hE hx hX 0 bp0 bp0 bp0 bp0 bp0 bp0 bp0 bp0 bp1 bp1 bp1 bp1 bp1 bp1 bp1 bp1 let c0 := ak s.a0 hh.2 let c1 := ak s.a1 hh.2 let c2 := ak s.a2 hh.2 let c3 := ak s.a3 hh.2 let c4 := ak s.a4 hh.2 let c5 := ak s.a5 hh.2 let c6 := ak s.a6 hh.2 let c7 := ak s.a7 hh.2 let d0 := ak s.b0 hh.2 let d1 := ak s.b1 hh.2 let d2 := ak s.b2 hh.2 let d3 := ak s.b3 hh.2 let d4 := ak s.b4 hh.2 let d5 := ak s.b5 hh.2 let d6 := ak s.b6 hh.2 let d7 := ak s.b7 hh.2 if _hok : (ok8 cnt c0 c1 c2 c3 c4 c5 c6 c7 && ok8 cnt d0 d1 d2 d3 d4 d5 d6 d7) = true then w8 (w8 a cnt pa st (act relu c0.toUInt32) (act relu c1.toUInt32) (act relu c2.toUInt32) (act relu c3.toUInt32) (act relu c4.toUInt32) (act relu c5.toUInt32) (act relu c6.toUInt32) (act relu c7.toUInt32) H0) cnt pb st (act relu d0.toUInt32) (act relu d1.toUInt32) (act relu d2.toUInt32) (act relu d3.toUInt32) (act relu d4.toUInt32) (act relu d5.toUInt32) (act relu d6.toUInt32) (act relu d7.toUInt32) (fun kk h => by rw [w8_size]; exact H1 kk h) else pN16n t R ow n relu X W b XT hh L a (8*rb) v.toNat s @[irreducible] def b8C_size (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (p : B8P W) (hh : Bool × UInt64) (L rb : Nat) (xt : FloatArray) (v ou ov nU : USize) (hd : p.val.1.size < 2^32) (hD : ou.toNat+nU.toNat ≤ p.val.1.size) (hE : ov.toNat+nU.toNat ≤ p.val.1.size) (hx : xt.size < 2^32) (hX : 8*nU.toNat ≤ xt.size) (a : Array Word) (cnt pa pb st : USize) (H0 : ∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) (H1 : ∀ kk : USize, kk < cnt → (pb+kk*st).toNat < a.size) : (b8C t R n ow relu X W b XT p hh L rb xt v ou ov nU hd hD hE hx hX a cnt pa pb st H0 H1).size = a.size := by unfold b8C dsimp only split · rw [w8_size,w8_size] · unfold pN16n rw [pN8n_eq,pN8n_eq,pN8_size,pN8_size] /-- On the positions of row group `rb` and outputs `v`, `v+1` the paired step is two `b8N`. -/ @[irreducible] def b8C_b8N2 (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (rb : Nat) (v : USize) (a : Array Word) (h : 8*n ≤ (XT[rb]!).size ∧ (XT[rb]!).size ≤ 4294967295 ∧ v.toNat+1 < ow) {ou ov nU cnt pa pb st : USize} (hd : p.val.1.size < 2^32) (hD : ou.toNat+nU.toNat ≤ p.val.1.size) (hE : ov.toNat+nU.toNat ≤ p.val.1.size) (hx : (XT[rb]!).size < 2^32) (hX : 8*nU.toNat ≤ (XT[rb]!).size) (H0 : ∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) (H1 : ∀ kk : USize, kk < cnt → (pb+kk*st).toNat < a.size) (e1 : ou = (v.toNat*n).toUSize) (e2 : ov = ((v.toNat+1)*n).toUSize) (e3 : nU = n.toUSize) (e4 : cnt = (min 8 (R-8*rb)).toUSize) (e5 : pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) (e6 : pb = (if t then (v.toNat+1)*R+8*rb else 8*rb*ow+(v.toNat+1)).toUSize) (e7 : st = if t then 1 else ow.toUSize) : b8C t R n ow relu X W b XT p (hG p.val.2 ix ib L) L rb (XT[rb]!) v ou ov nU hd hD hE hx hX a cnt pa pb st H0 H1 = b8N t R n ow relu X W b ix ib L hs hW XT p rb (v.toNat+1) (b8N t R n ow relu X W b ix ib L hs hW XT p rb v.toNat a) := by subst e1 e2 e3 e4 e5 e6 e7 have h0 : 8*n ≤ (XT[rb]!).size ∧ (XT[rb]!).size ≤ 4294967295 ∧ v.toNat < ow := ⟨h.1,h.2.1,by omega⟩ have BX := xt_bounds n (XT[rb]!) ⟨h.1,h.2.1⟩ have fin : ∀ s : A16, s = qQ p.val.1 (XT[rb]!) (v.toNat*n).toUSize ((v.toNat+1)*n).toUSize n.toUSize hd hD hE hx hX 0 (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) (dw oneW*dw b[v.toNat+1]!) → pN8 t R ow n relu X W b XT (hG p.val.2 ix ib L) L (pN8 t R ow n relu X W b XT (hG p.val.2 ix ib L) L a (8*rb) v.toNat s.a0 s.a1 s.a2 s.a3 s.a4 s.a5 s.a6 s.a7) (8*rb) (v.toNat+1) s.b0 s.b1 s.b2 s.b3 s.b4 s.b5 s.b6 s.b7 = b8N t R n ow relu X W b ix ib L hs hW XT p rb (v.toNat+1) (b8N t R n ow relu X W b ix ib L hs hW XT p rb v.toNat a) := by intro s es subst es unfold b8N rw [b8_pN8,b8_pN8,yR_nr XT n ow W b hs hW p rb v.toNat h0 hd hD hx BX.2.1, yR_nr XT n ow W b hs hW p rb (v.toNat+1) h hd hE hx BX.2.1,qNR_o,qNR_o, qQ_eq p.val.1 (XT[rb]!) (v.toNat*n).toUSize ((v.toNat+1)*n).toUSize n.toUSize hd hD hE hx hX p.val.2 _ 0 0 BX.2.1 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl (by simp)] rfl unfold b8C dsimp only split · rename_i hok rw [Bool.and_eq_true] at hok rw [w8_eq t R ow n relu X W b XT (hG p.val.2 ix ib L) L _ (8*rb) (v.toNat+1) _ _ _ _ _ _ _ _ _ _ _ _ g.1 (cnt_ok R (8*rb)) (pos_ok t R ow (8*rb) (v.toNat+1) h.2.2 g.2) (st_ok t R ow (8*rb) g.2) h.2.2 g.2 hok.2, w8_eq t R ow n relu X W b XT (hG p.val.2 ix ib L) L _ (8*rb) v.toNat _ _ _ _ _ _ _ _ _ _ _ _ g.1 (cnt_ok R (8*rb)) (pos_ok t R ow (8*rb) v.toNat (by omega) g.2) (st_ok t R ow (8*rb) g.2) (by omega) g.2 hok.1] exact fin _ rfl · unfold pN16n rw [pN8n_eq,pN8n_eq] exact fin _ rfl /-- The odd last output `v` of one row group on machine words. -/ @[noinline] def b8C1 (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (p : B8P W) (hh : Bool × UInt64) (L rb : Nat) (xt : FloatArray) (v ou nU : USize) (hd : p.val.1.size < 2^32) (hD : ou.toNat+nU.toNat ≤ p.val.1.size) (hx : xt.size < 2^32) (hi : (0:USize).toNat+8*(nU.toNat-(0:USize).toNat) ≤ xt.size) (a : Array Word) (cnt pa st : USize) (H0 : ∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) : Array Word := let bp := dw oneW*dw b[v.toNat]! let s := qNR p.val.1 xt ou nU hd hD hx 0 0 hi bp bp bp bp bp bp bp bp p.val.2 let c0 := ak s.s.a0 hh.2 let c1 := ak s.s.a1 hh.2 let c2 := ak s.s.a2 hh.2 let c3 := ak s.s.a3 hh.2 let c4 := ak s.s.a4 hh.2 let c5 := ak s.s.a5 hh.2 let c6 := ak s.s.a6 hh.2 let c7 := ak s.s.a7 hh.2 if _hok : ok8 cnt c0 c1 c2 c3 c4 c5 c6 c7 = true then w8 a cnt pa st (act relu c0.toUInt32) (act relu c1.toUInt32) (act relu c2.toUInt32) (act relu c3.toUInt32) (act relu c4.toUInt32) (act relu c5.toUInt32) (act relu c6.toUInt32) (act relu c7.toUInt32) H0 else pN8n t R ow n relu X W b XT hh L a (8*rb) v.toNat s.s.a0 s.s.a1 s.s.a2 s.s.a3 s.s.a4 s.s.a5 s.s.a6 s.s.a7 @[irreducible] def b8C1_size (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (XT : Array FloatArray) (p : B8P W) (hh : Bool × UInt64) (L rb : Nat) (xt : FloatArray) (v ou nU : USize) (hd : p.val.1.size < 2^32) (hD : ou.toNat+nU.toNat ≤ p.val.1.size) (hx : xt.size < 2^32) (hi : (0:USize).toNat+8*(nU.toNat-(0:USize).toNat) ≤ xt.size) (a : Array Word) (cnt pa st : USize) (H0 : ∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) : (b8C1 t R n ow relu X W b XT p hh L rb xt v ou nU hd hD hx hi a cnt pa st H0).size = a.size := by unfold b8C1 dsimp only split · rw [w8_size] · rw [pN8n_eq,pN8_size] /-- On the positions of row group `rb` and output `v` the single step is `b8N`. -/ @[irreducible] def b8C1_b8N (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (rb : Nat) (v : USize) (a : Array Word) (h : 8*n ≤ (XT[rb]!).size ∧ (XT[rb]!).size ≤ 4294967295 ∧ v.toNat < ow) {ou nU cnt pa st : USize} (hd : p.val.1.size < 2^32) (hD : ou.toNat+nU.toNat ≤ p.val.1.size) (hx : (XT[rb]!).size < 2^32) (hi : (0:USize).toNat+8*(nU.toNat-(0:USize).toNat) ≤ (XT[rb]!).size) (H0 : ∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) (e1 : ou = (v.toNat*n).toUSize) (e3 : nU = n.toUSize) (e4 : cnt = (min 8 (R-8*rb)).toUSize) (e5 : pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) (e7 : st = if t then 1 else ow.toUSize) : b8C1 t R n ow relu X W b XT p (hG p.val.2 ix ib L) L rb (XT[rb]!) v ou nU hd hD hx hi a cnt pa st H0 = b8N t R n ow relu X W b ix ib L hs hW XT p rb v.toNat a := by subst e1 e3 e4 e5 e7 unfold b8C1 b8N dsimp only rw [b8_pN8,yR_nr XT n ow W b hs hW p rb v.toNat h hd hD hx hi,qNR_o] split · rename_i hok exact w8_eq t R ow n relu X W b XT (hG p.val.2 ix ib L) L a (8*rb) v.toNat _ _ _ _ _ _ _ _ _ _ _ _ g.1 (cnt_ok R (8*rb)) (pos_ok t R ow (8*rb) v.toNat h.2.2 g.2) (st_ok t R ow (8*rb) g.2) h.2.2 g.2 hok · rfl /-- A group that has run out of outputs ends `l2` when it is the last group. -/ @[irreducible] def l2_done (V : Nat) (f : Nat → Nat → Array Word → Array Word) (u v : Nat) (a : Array Word) (hv : ¬ v < V) : l2 (u+1) V f u v a = a := by rw [l2,if_pos (Nat.lt_succ_self u),if_neg hv,l2,if_neg (Nat.lt_irrefl _)] /-- `l2` splits at a group boundary. -/ @[irreducible] def l2_split (U V : Nat) (f : Nat → Nat → Array Word → Array Word) (u : Nat) (hu : u < U) : ∀ v a, l2 U V f u v a = l2 U V f (u+1) 0 (l2 (u+1) V f u v a) := by intro v induction hm : V-v using Nat.strong_induction_on generalizing v with | _ m ih => intro a by_cases hv : v < V · rw [l2,if_pos hu,if_pos hv,ih _ (by omega) (v+1) rfl] refine congrArg _ ?_ conv_rhs => rw [l2,if_pos (Nat.lt_succ_self u),if_pos hv] · rw [l2,if_pos hu,if_neg hv,l2_done V f u v a hv] @[irreducible] def ou_succ (o n : Nat) : (o*n).toUSize+n.toUSize = ((o+1)*n).toUSize := by simp only [Nat.toUSize_eq,Nat.add_mul,Nat.one_mul,USize.ofNat_add] @[irreducible] def pos_succ (t : Bool) (R C i j : Nat) : (if t then j*R+i else i*C+j).toUSize+(if t then R.toUSize else 1) = (if t then (j+1)*R+i else i*C+(j+1)).toUSize := by cases t · simp only [Bool.false_eq_true,ite_false,Nat.toUSize_eq,USize.ofNat_add,USize.add_assoc] rfl · simp only [ite_true,Nat.toUSize_eq,← USize.ofNat_add] congr 1 ring /-- Machine-word counter facts of one step of the group loop. -/ @[irreducible] def v_two (v owU : USize) (h : v < owU ∧ v+1 < owU) : (v+2).toNat = v.toNat+2 ∧ v.toNat+1 < owU.toNat := by have h1 := USize.lt_iff_toNat_lt.mp h.1 have h2 := USize.lt_iff_toNat_lt.mp h.2 rw [Dense.ac h.1] at h2 have := owU.toNat_lt_size rw [Dense.aj (by simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat] exact ⟨trivial,h2⟩ /-- Everything a paired step of the group loop needs, from the loop invariants. -/ @[irreducible] def iG_step (t : Bool) (R n ow : Nat) (W : Array Word) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g2 : R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (rb : Nat) (xt : FloatArray) (owU nU cnt st pst : USize) (q : xt = XT[rb]! ∧ owU = ow.toUSize ∧ nU = n.toUSize ∧ cnt = (min 8 (R-8*rb)).toUSize ∧ st = (if t then 1 else ow.toUSize) ∧ pst = (if t then R.toUSize else 1)) (hx : 8*n ≤ xt.size ∧ xt.size ≤ 4294967295) (v ou pa : USize) (hv : ou = (v.toNat*n).toUSize ∧ pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) (a : Array Word) (ha : a.size = R*ow) (h : v < owU ∧ v+1 < owU) : (p.val.1.size < 2^32 ∧ ou.toNat+nU.toNat ≤ p.val.1.size ∧ (ou+nU).toNat+nU.toNat ≤ p.val.1.size ∧ xt.size < 2^32 ∧ 8*nU.toNat ≤ xt.size) ∧ ((∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) ∧ (∀ kk : USize, kk < cnt → (pa+pst+kk*st).toNat < a.size)) ∧ (ou+nU+nU = ((v+2).toNat*n).toUSize ∧ pa+pst+pst = (if t then (v+2).toNat*R+8*rb else 8*rb*ow+(v+2).toNat).toUSize) ∧ v.toNat+1 < ow := by obtain ⟨rfl,rfl,rfl,rfl,rfl,rfl⟩ := q obtain ⟨rfl,rfl⟩ := hv have hoU : (ow.toUSize).toNat = ow := Dense.aa (by have := USize.le_size; omega) have V := v_two v _ h rw [hoU] at V have B0 := nr_bounds n ow W hs hW p v.toNat (by omega) have B1 := nr_bounds n ow W hs hW p (v.toNat+1) V.2 have BX := xt_bounds n (XT[rb]!) hx rw [ou_succ,pos_succ,ou_succ,pos_succ,V.1] exact ⟨⟨B0.1,B0.2,B1.2,BX.1,BX.2.2⟩, ⟨laneH t R ow (8*rb) v.toNat _ _ _ (cnt_ok R (8*rb)) (pos_ok t R ow (8*rb) v.toNat (by omega) g2) (st_ok t R ow (8*rb) g2) (by omega) g2 a ha, laneH t R ow (8*rb) (v.toNat+1) _ _ _ (cnt_ok R (8*rb)) (pos_ok t R ow (8*rb) (v.toNat+1) V.2 g2) (st_ok t R ow (8*rb) g2) V.2 g2 a ha⟩, ⟨rfl,rfl⟩,V.2⟩ /-- The same for the single last output. -/ @[irreducible] def iG_step1 (t : Bool) (R n ow : Nat) (W : Array Word) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g2 : R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (rb : Nat) (xt : FloatArray) (owU nU cnt st pst : USize) (q : xt = XT[rb]! ∧ owU = ow.toUSize ∧ nU = n.toUSize ∧ cnt = (min 8 (R-8*rb)).toUSize ∧ st = (if t then 1 else ow.toUSize) ∧ pst = (if t then R.toUSize else 1)) (hx : 8*n ≤ xt.size ∧ xt.size ≤ 4294967295) (v ou pa : USize) (hv : ou = (v.toNat*n).toUSize ∧ pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) (a : Array Word) (ha : a.size = R*ow) (h : v < owU) : (p.val.1.size < 2^32 ∧ ou.toNat+nU.toNat ≤ p.val.1.size ∧ xt.size < 2^32 ∧ (0:USize).toNat+8*(nU.toNat-(0:USize).toNat) ≤ xt.size) ∧ (∀ kk : USize, kk < cnt → (pa+kk*st).toNat < a.size) ∧ v.toNat < ow := by obtain ⟨rfl,rfl,rfl,rfl,rfl,rfl⟩ := q obtain ⟨rfl,rfl⟩ := hv have hoU : (ow.toUSize).toNat = ow := Dense.aa (by have := USize.le_size; omega) have hvo : v.toNat < ow := by have := USize.lt_iff_toNat_lt.mp h; omega have B0 := nr_bounds n ow W hs hW p v.toNat hvo have BX := xt_bounds n (XT[rb]!) hx exact ⟨⟨B0.1,B0.2,BX.1,BX.2.1⟩, laneH t R ow (8*rb) v.toNat _ _ _ (cnt_ok R (8*rb)) (pos_ok t R ow (8*rb) v.toNat hvo g2) (st_ok t R ow (8*rb) g2) hvo g2 a ha,hvo⟩ /-- One step of the group loop from state `(v, ou, pa, a)`; `rec` continues after a pair. -/ @[inline] def iGs (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (hh : Bool × UInt64) (g : hh.1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (rb : Nat) (xt : FloatArray) (owU nU cnt st pst : USize) (q : xt = XT[rb]! ∧ owU = ow.toUSize ∧ nU = n.toUSize ∧ cnt = (min 8 (R-8*rb)).toUSize ∧ st = (if t then 1 else ow.toUSize) ∧ pst = (if t then R.toUSize else 1)) (hx : 8*n ≤ xt.size ∧ xt.size ≤ 4294967295) (rec : (v ou pa : USize) → (ou = (v.toNat*n).toUSize ∧ pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) → (a : Array Word) → a.size = R*ow → {a' : Array Word // a'.size = R*ow}) (v ou pa : USize) (hv : ou = (v.toNat*n).toUSize ∧ pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) (a : Array Word) (ha : a.size = R*ow) : {a' : Array Word // a'.size = R*ow} := if h : v < owU ∧ v+1 < owU then have F := iG_step t R n ow W hs hW XT p g.2 go rb xt owU nU cnt st pst q hx v ou pa hv a ha h rec (v+2) (ou+nU+nU) (pa+pst+pst) F.2.2.1 (b8C t R n ow relu X W b XT p hh L rb xt v ou (ou+nU) nU F.1.1 F.1.2.1 F.1.2.2.1 F.1.2.2.2.1 F.1.2.2.2.2 a cnt pa (pa+pst) st F.2.1.1 F.2.1.2) (by rw [b8C_size]; exact ha) else if h' : v < owU then have F := iG_step1 t R n ow W hs hW XT p g.2 go rb xt owU nU cnt st pst q hx v ou pa hv a ha h' ⟨b8C1 t R n ow relu X W b XT p hh L rb xt v ou nU F.1.1 F.1.2.1 F.1.2.2.1 F.1.2.2.2 a cnt pa st F.2.1,by rw [b8C1_size]; exact ha⟩ else ⟨a,ha⟩ /-- All outputs of one row group, with every loop-invariant value passed in as a machine word: `xt` the activation tile, `cnt` the live rows, `st` the row stride of output positions, `pst` their output stride. State: output `v`, weight offset `ou`, position `pa`; `m` bounds the number of steps (`ow/2+1` always suffices). -/ def iG (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (hh : Bool × UInt64) (g : hh.1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (rb : Nat) (xt : FloatArray) (owU nU cnt st pst : USize) (q : xt = XT[rb]! ∧ owU = ow.toUSize ∧ nU = n.toUSize ∧ cnt = (min 8 (R-8*rb)).toUSize ∧ st = (if t then 1 else ow.toUSize) ∧ pst = (if t then R.toUSize else 1)) (hx : 8*n ≤ xt.size ∧ xt.size ≤ 4294967295) : (m : Nat) → (v ou pa : USize) → (ou = (v.toNat*n).toUSize ∧ pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) → (a : Array Word) → a.size = R*ow → {a' : Array Word // a'.size = R*ow} | 0 => fun _ _ _ _ a ha => ⟨a,ha⟩ | m+1 => iGs t R n ow relu X W b ix ib L hs hW XT p hh g go rb xt owU nU cnt st pst q hx (iG t R n ow relu X W b ix ib L hs hW XT p hh g go rb xt owU nU cnt st pst q hx m) @[irreducible] def iG_eq (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (rb : Nat) (xt : FloatArray) (owU nU cnt st pst : USize) (q : xt = XT[rb]! ∧ owU = ow.toUSize ∧ nU = n.toUSize ∧ cnt = (min 8 (R-8*rb)).toUSize ∧ st = (if t then 1 else ow.toUSize) ∧ pst = (if t then R.toUSize else 1)) (hx : 8*n ≤ xt.size ∧ xt.size ≤ 4294967295) : ∀ (m : Nat) (v ou pa : USize) (hv : ou = (v.toNat*n).toUSize ∧ pa = (if t then v.toNat*R+8*rb else 8*rb*ow+v.toNat).toUSize) (a : Array Word) (ha : a.size = R*ow), ow-v.toNat < 2*m → (iG t R n ow relu X W b ix ib L hs hW XT p (hG p.val.2 ix ib L) g go rb xt owU nU cnt st pst q hx m v ou pa hv a ha).1 = l2 (rb+1) ow (b8N t R n ow relu X W b ix ib L hs hW XT p) rb v.toNat a := by intro m induction m with | zero => intro v ou pa hv a ha hm; omega | succ m ih => intro v ou pa hv a ha hm have hoU : owU.toNat = ow := by rw [q.2.1]; exact Dense.aa (by have := USize.le_size; omega) show (iGs t R n ow relu X W b ix ib L hs hW XT p (hG p.val.2 ix ib L) g go rb xt owU nU cnt st pst q hx (iG t R n ow relu X W b ix ib L hs hW XT p (hG p.val.2 ix ib L) g go rb xt owU nU cnt st pst q hx m) v ou pa hv a ha).1 = _ unfold iGs split · rename_i h have V := v_two v owU h have F := iG_step t R n ow W hs hW XT p g.2 go rb xt owU nU cnt st pst q hx v ou pa hv a ha h rw [ih _ _ _ _ _ _ (by omega),V.1] conv_rhs => rw [l2,if_pos (Nat.lt_succ_self rb),if_pos (by omega : v.toNat < ow), l2,if_pos (Nat.lt_succ_self rb),if_pos F.2.2.2] refine congrArg (l2 (rb+1) ow (b8N t R n ow relu X W b ix ib L hs hW XT p) rb (v.toNat+2)) ?_ obtain ⟨rfl,rfl,rfl,rfl,rfl,rfl⟩ := q obtain ⟨rfl,rfl⟩ := hv exact b8C_b8N2 t R n ow relu X W b ix ib L hs hW XT p g rb v a ⟨hx.1,hx.2,F.2.2.2⟩ _ _ _ _ _ _ _ rfl (ou_succ v.toNat n) rfl rfl rfl (pos_succ t R ow (8*rb) v.toNat) rfl · split · rename_i h h' have F := iG_step1 t R n ow W hs hW XT p g.2 go rb xt owU nU cnt st pst q hx v ou pa hv a ha h' have hn : ¬ v.toNat+1 < ow := by intro hc have hlt := USize.lt_iff_toNat_lt.mp h' have := owU.toNat_lt_size exact h ⟨h',by rw [USize.lt_iff_toNat_lt,Dense.ac h']; omega⟩ conv_rhs => rw [l2,if_pos (Nat.lt_succ_self rb),if_pos F.2.2,l2_done _ _ _ _ _ hn] obtain ⟨rfl,rfl,rfl,rfl,rfl,rfl⟩ := q obtain ⟨rfl,rfl⟩ := hv exact b8C1_b8N t R n ow relu X W b ix ib L hs hW XT p g rb v a ⟨hx.1,hx.2,F.2.2⟩ F.1.1 F.1.2.1 F.1.2.2.1 F.1.2.2.2 F.2.1 rfl rfl rfl rfl rfl · rename_i h h' have hlt : ¬ v.toNat < ow := by intro hc; exact h' (by rw [USize.lt_iff_toNat_lt]; omega) rw [l2_done _ _ _ _ _ hlt] /-- The loop invariants at the first output of a group. -/ @[irreducible] def inv0 (t : Bool) (R n ow u : Nat) : (0:USize) = ((0:USize).toNat*n).toUSize ∧ (if t then 8*u else 8*u*ow).toUSize = (if t then (0:USize).toNat*R+8*u else 8*u*ow+(0:USize).toNat).toUSize := by simp only [USize.toNat_zero,Nat.zero_mul,Nat.zero_add,Nat.add_zero] exact ⟨rfl,trivial⟩ /-- The group loop: one hoisted `iG` per row group, `m` groups from group `u`. -/ def oG (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (hXT : ∀ u, u < (R+7)/8 → 8*n ≤ (XT[u]!).size ∧ (XT[u]!).size ≤ 4294967295) : (m u : Nat) → u+m ≤ (R+7)/8 → (a : Array Word) → a.size = R*ow → Array Word | 0,_,_,a,_ => a | m+1,u,hm,a,ha => let r := iG t R n ow relu X W b ix ib L hs hW XT p (hG p.val.2 ix ib L) g go u (XT[u]!) ow.toUSize n.toUSize (min 8 (R-8*u)).toUSize (if t then 1 else ow.toUSize) (if t then R.toUSize else 1) ⟨rfl,rfl,rfl,rfl,rfl,rfl⟩ (hXT u (by omega)) (ow/2+1) 0 0 (if t then 8*u else 8*u*ow).toUSize (inv0 t R n ow u) a ha oG t R n ow relu X W b ix ib L hs hW XT p g go hXT m (u+1) (by omega) r.1 r.2 @[irreducible] def oG_eq (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (hXT : ∀ u, u < (R+7)/8 → 8*n ≤ (XT[u]!).size ∧ (XT[u]!).size ≤ 4294967295) : ∀ (m u : Nat) (hm : u+m ≤ (R+7)/8) (a : Array Word) (ha : a.size = R*ow), oG t R n ow relu X W b ix ib L hs hW XT p g go hXT m u hm a ha = l2 (u+m) ow (b8N t R n ow relu X W b ix ib L hs hW XT p) u 0 a := by intro m induction m with | zero => intro u hm a ha rw [oG,l2,if_neg (by omega)] | succ m ih => intro u hm a ha have e : u+(m+1) = u+1+m := by omega have e0 := iG_eq t R n ow relu X W b ix ib L hs hW XT p g go u _ _ _ _ _ _ ⟨rfl,rfl,rfl,rfl,rfl,rfl⟩ (hXT u (by omega)) (ow/2+1) 0 0 _ (inv0 t R n ow u) a ha (by rw [USize.toNat_zero]; omega) rw [USize.toNat_zero] at e0 rw [oG,l2_split (u+(m+1)) ow _ u (by omega) 0 a,e] rw [ih,e0] /-- The loop of `L8` for the cached worker on machine words. -/ @[noinline] def L8F (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (hXT : ∀ u, u < (R+7)/8 → 8*n ≤ (XT[u]!).size ∧ (XT[u]!).size ≤ 4294967295) : Array Word := oG t R n ow relu X W b ix ib L hs hW XT p g go hXT ((R+7)/8) 0 (Nat.le_of_eq (Nat.zero_add _)) (Array.replicate (R*ow) 0) Array.size_replicate @[irreducible] def L8F_eq (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (XT : Array FloatArray) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (hXT : ∀ u, u < (R+7)/8 → 8*n ≤ (XT[u]!).size ∧ (XT[u]!).size ≤ 4294967295) : L8F t R n ow relu X W b ix ib L hs hW XT p g go hXT = l2 ((R+7)/8) ow (b8N t R n ow relu X W b ix ib L hs hW XT p) 0 0 (Array.replicate (R*ow) 0) := by unfold L8F rw [oG_eq,Nat.zero_add] /-- One decoded activation with a machine-word bounds test; a padded lane of a short last group reads past the array and decodes zero, as `xr` does. -/ @[inline] def xrF (X : Array Word) (hX : X.size ≤ 4294967295) (q st : USize) (r : Nat) : Float := if h : q+r.toUSize*st < X.usize then dw (X.uget (q+r.toUSize*st) (Conv.uL h)) else dw 0 @[irreducible] def xrF_eq (X : Array Word) (hX : X.size ≤ 4294967295) (q st : USize) (r : Nat) : xrF X hX q st r = xr X q st r := by unfold xrF xr split · rename_i h rw [gD,getElem!_pos X _ (Conv.uL h)] rfl · rename_i h have hu : X.usize.toNat = X.size := Dense.aa (by have := USize.le_size; omega) rw [USize.lt_iff_toNat_lt,hu] at h rw [gD,getElem!_neg X _ h] rfl @[irreducible] def fa_set (Y : FloatArray) (i : USize) (v : Float) (h : i.toNat < Y.size) : Y.set! i.toNat v = Y.uset i v h := by cases Y with | mk ds => have h' : i.toNat < ds.size := h simp only [FloatArray.set!,FloatArray.uset,Array.uset,Array.set!,Array.setIfInBounds, dif_pos h'] @[irreducible] def fa_size (Y : FloatArray) (i : USize) (v : Float) (h : i.toNat < Y.size) : (Y.uset i v h).size = Y.size := by cases Y with | mk ds => simp only [FloatArray.uset,FloatArray.size,Array.uset] exact Array.size_set _ /-- One store into an array known to hold at least `m` values; the bound travels with the array so that a chain of stores needs no fresh size argument. -/ @[inline] def fuS (m : Nat) (Y : {Y : FloatArray // m ≤ Y.size}) (i : USize) (v : Float) (h : i.toNat < m) : {Y : FloatArray // m ≤ Y.size} := ⟨Y.1.uset i v (Nat.lt_of_lt_of_le h Y.2),by rw [fa_size]; exact Y.2⟩ @[irreducible] def fuS_eq (m : Nat) (Y : {Y : FloatArray // m ≤ Y.size}) (i : USize) (v : Float) (h : i.toNat < m) : (fuS m Y i v h).1 = Y.1.set! i.toNat v := (fa_set Y.1 i v (Nat.lt_of_lt_of_le h Y.2)).symm @[irreducible] def s8b (m : Nat) (o k : USize) (hk : k.toNat < 8) (h : o.toNat+8 ≤ m ∧ m ≤ 4294967295) : (o+k).toNat < m := by rw [Dense.aj (by have := USize.le_size; omega)] omega /-- `s8` with one bounds proof for the eight stores. -/ @[inline] def s8F (Y : FloatArray) (o : USize) (e0 e1 e2 e3 e4 e5 e6 e7 : Float) (h : o.toNat+8 ≤ Y.size ∧ Y.size ≤ 4294967295) : FloatArray := (fuS Y.size (fuS Y.size (fuS Y.size (fuS Y.size (fuS Y.size (fuS Y.size (fuS Y.size (fuS Y.size ⟨Y,Nat.le_refl _⟩ o e0 (by omega)) (o+1) e1 (s8b Y.size o 1 (by simp) h)) (o+2) e2 (s8b Y.size o 2 (by simp) h)) (o+3) e3 (s8b Y.size o 3 (by simp) h)) (o+4) e4 (s8b Y.size o 4 (by simp) h)) (o+5) e5 (s8b Y.size o 5 (by simp) h)) (o+6) e6 (s8b Y.size o 6 (by simp) h)) (o+7) e7 (s8b Y.size o 7 (by simp) h)).1 @[irreducible] def s8F_eq (Y : FloatArray) (o : USize) (e0 e1 e2 e3 e4 e5 e6 e7 : Float) (h : o.toNat+8 ≤ Y.size ∧ Y.size ≤ 4294967295) : s8F Y o e0 e1 e2 e3 e4 e5 e6 e7 h = s8 Y o e0 e1 e2 e3 e4 e5 e6 e7 := by unfold s8 s8F rw [fuS_eq,fuS_eq,fuS_eq,fuS_eq,fuS_eq,fuS_eq,fuS_eq,fuS_eq] @[irreducible] def s8_size (Y : FloatArray) (o : USize) (e0 e1 e2 e3 e4 e5 e6 e7 : Float) : (s8 Y o e0 e1 e2 e3 e4 e5 e6 e7).size = Y.size := by cases Y with | mk ds => simp [s8,FloatArray.set!,FloatArray.size] /-- The activation pack `bx` with machine-word reads and stores. -/ def bxF (X : Array Word) (hX : X.size ≤ 4294967295) (st s : USize) : (k : Nat) → (q o : USize) → (Y : FloatArray) → (o.toNat+8*k ≤ Y.size ∧ Y.size ≤ 4294967295) → FloatArray | 0,_,_,Y,_ => Y | k+1,q,o,Y,h => bxF X hX st s k (q+s) (o+8) (s8F Y o (xrF X hX q st 0) (xrF X hX q st 1) (xrF X hX q st 2) (xrF X hX q st 3) (xrF X hX q st 4) (xrF X hX q st 5) (xrF X hX q st 6) (xrF X hX q st 7) ⟨by omega,h.2⟩) (by rw [s8F_eq,s8_size,Dense.aj (by have := USize.le_size; simp only [USize.reduceToNat]; omega)] simp only [USize.reduceToNat] exact ⟨by omega,h.2⟩) @[irreducible] def bxF_eq (X : Array Word) (hX : X.size ≤ 4294967295) (st s : USize) : ∀ (k : Nat) (q o : USize) (Y : FloatArray) (h : o.toNat+8*k ≤ Y.size ∧ Y.size ≤ 4294967295), bxF X hX st s k q o Y h = bx X st s k q o Y := by intro k induction k with | zero => intro q o Y h; rw [bxF,bx] | succ k ih => intro q o Y h rw [bxF,bx,ih,s8F_eq,xrF_eq,xrF_eq,xrF_eq,xrF_eq,xrF_eq,xrF_eq,xrF_eq,xrF_eq] /-- The activation tile of row group `rb` (`bZ`) through the machine-word pack. -/ def bZF (t : Bool) (X : Array Word) (hX : X.size ≤ 4294967295) (R n rb : Nat) (Z : FloatArray) (h : ((if t then 8*rb else 8*rb*n)+n*(if t then R else 1)+(if t then R else 1)+8*(if t then 1 else n)+8*n ≤ 4294967295) ∧ 8*n ≤ Z.size ∧ Z.size ≤ 4294967295) : FloatArray := bxF X hX (if t then 1 else n).toUSize (if t then R else 1).toUSize n (if t then 8*rb else 8*rb*n).toUSize 0 Z ⟨by rw [USize.toNat_zero,Nat.zero_add]; exact h.2.1,h.2.2⟩ @[irreducible] def bZF_eq (t : Bool) (X : Array Word) (hX : X.size ≤ 4294967295) (R n rb : Nat) (Z : FloatArray) (h : ((if t then 8*rb else 8*rb*n)+n*(if t then R else 1)+(if t then R else 1)+8*(if t then 1 else n)+8*n ≤ 4294967295) ∧ 8*n ≤ Z.size ∧ Z.size ≤ 4294967295) : bZF t X hX R n rb Z h = bZ t X R n rb Z := by unfold bZF bZ dQ rw [if_pos h.1,bxF_eq] @[irreducible] def zt_ok (n : Nat) (hn : 8*n < 2^32) : 8*n ≤ (zT n).size ∧ (zT n).size ≤ 4294967295 := by have := jH n omega /-- Every tile built by `c6F` has room for `8*n` values. -/ @[irreducible] def xt_ok (t : Bool) (X : Array Word) (hX : X.size ≤ 4294967295) (R n : Nat) (hn : 8*n < 2^32) (hq : ∀ rb, rb < (R+7)/8 → (if t then 8*rb else 8*rb*n)+n*(if t then R else 1)+(if t then R else 1)+8*(if t then 1 else n)+8*n ≤ 4294967295) (u : Nat) (hu : u < (R+7)/8) : 8*n ≤ ((Array.ofFn (n:=(R+7)/8) fun rb => bZF t X hX R n rb.val (zT n) ⟨hq rb.val rb.isLt,zt_ok n hn⟩)[u]!).size ∧ ((Array.ofFn (n:=(R+7)/8) fun rb => bZF t X hX R n rb.val (zT n) ⟨hq rb.val rb.isLt,zt_ok n hn⟩)[u]!).size ≤ 4294967295 := by rw [getElem!_pos _ u (by rw [Array.size_ofFn]; exact hu),Array.getElem_ofFn,bZF_eq] dsimp only unfold bZ have z := jH n have f := fF X (if t then 1 else n) (if t then R else 1) n (if t then 8*u else 8*u*n) (zT n) z.1 have f1 := f.1 have f2 := f.2.1 clear f omega /-- The `c6` driver for the cached worker: machine-word pack, two outputs per pass, machine-word finishing. All size conditions are proofs; there is no run-time fallback below this point except the per-group natural-number finishing. -/ @[inline] def c6F (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (hX : X.size ≤ 4294967295) (hq : ∀ rb, rb < (R+7)/8 → (if t then 8*rb else 8*rb*n)+n*(if t then R else 1)+(if t then R else 1)+8*(if t then 1 else n)+8*n ≤ 4294967295) : Array Word := L8F t R n ow relu X W b ix ib L hs hW (Array.ofFn (n:=(R+7)/8) fun rb => bZF t X hX R n rb.val (zT n) ⟨hq rb.val rb.isLt,zt_ok n hs.2⟩) p g go (xt_ok t X hX R n hs.2 hq) @[irreducible] def c6F_eq (t : Bool) (R n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hW : ow*n ≤ W.size) (p : B8P W) (g : (hG p.val.2 ix ib L).1 = true ∧ R*ow ≤ 4294967295) (go : ow ≤ 4294967295) (hX : X.size ≤ 4294967295) (hq : ∀ rb, rb < (R+7)/8 → (if t then 8*rb else 8*rb*n)+n*(if t then R else 1)+(if t then R else 1)+8*(if t then 1 else n)+8*n ≤ 4294967295) : c6F t R n ow relu X W b ix ib L hs hW p g go hX hq = c6 (work:=nrWork W p) t R n ow relu X W b ix ib L hs hW := by unfold c6F c6 L8 dsimp only rw [L8F_eq] simp only [bZF_eq] rfl @[irreducible] def lin_pg (rows n : Nat) (h1 : rows*n ≤ 1048576) (h2 : n ≤ 131072) : ∀ rb, rb < (rows+7)/8 → (if false then 8*rb else 8*rb*n)+n*(if false then rows else 1)+(if false then rows else 1)+8*(if false then 1 else n)+8*n ≤ 4294967295 := by intro rb hrb simp only [Bool.false_eq_true,ite_false] have h : 8*rb ≤ rows+6 := by omega have := Nat.mul_le_mul_right n h rw [Nat.add_mul] at this omega @[irreducible] def gem_pg (k n : Nat) (h : k*n+2*n+8*k+14 ≤ 4294967295) : ∀ rb, rb < (n+7)/8 → (if true then 8*rb else 8*rb*k)+k*(if true then n else 1)+(if true then n else 1)+8*(if true then 1 else k)+8*k ≤ 4294967295 := by intro rb hrb simp only [ite_true] omega @[irreducible] def lin_go (rows ow : Nat) (h0 : 2 ≤ rows) (h1 : rows*ow ≤ 1048576) : ow ≤ 4294967295 := by have := Nat.mul_le_mul_right ow h0 omega @[irreducible] def hG_lt (e : Word) (ix ib L : Nat) (h : (hG e ix ib L).1 = true) : e < 255 := by unfold hG at h simp only [decide_eq_true_eq] at h exact h.1 /-- Rows 2..256 with a certified layer: the machine-word driver. Anything else is the specification itself (no benchmark shape gets there). -/ def irNR3 (rows n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hw : ow*n ≤ W.size) : Array Word := if h : 2 ≤ rows ∧ rows ≤ 256 ∧ 0 < n ∧ 0 < ow ∧ n ≤ 131072 ∧ rows*n ≤ X.size ∧ W.size=ow*n ∧ b.size=ow ∧ rows*n ≤ 1048576 ∧ rows*ow ≤ 1048576 ∧ W.size ≤ 1048576 ∧ X.size ≤ 4294967295 then let p := B8Get W if g : (hG p.val.2 ix ib L).1 = true then c6F false rows n ow relu X W b ix ib L hs hw p ⟨g,by omega⟩ (lin_go rows ow h.1 h.2.2.2.2.2.2.2.2.2.1) h.2.2.2.2.2.2.2.2.2.2.2 (lin_pg rows n h.2.2.2.2.2.2.2.2.1 h.2.2.2.2.1) else linearSpec rows n ow relu X W b else linearSpec rows n ow relu X W b @[irreducible] def irNR3_correct (rows n ow : Nat) (relu : Bool) (X W b : Array Word) (ix ib L : Nat) (hs : W.size < 2^32 ∧ 8*n < 2^32) (hw : ow*n ≤ W.size) (H : Nat) (FX : ∀ q : Nat, expOf X[q]! ≠ 255 ∧ idxOf X[q]! ≤ ix) (FB : ∀ q : Nat, expOf b[q]! ≠ 255 ∧ idxOf b[q]! ≤ H) (hb : 174+H ≤ ib) (hn : n+2 ≤ 2^L) (hL : L ≤ 27) (hR : ib+L ≤ 425) : irNR3 rows n ow relu X W b ix ib L hs hw = linearSpec rows n ow relu X W b := by unfold irNR3 split · dsimp only split · rw [c6F_eq] simpa only [linearSpec,linearWith,Bool.false_eq_true,ite_false] using csNR (t:=false) rows n ow relu X W b ix ib L hs hw (B8Get W) H FX FB hb hn hL hR · rfl · rfl end Dense.F namespace Dense open ExactRuntime /-- `linear`: one row through the tiled worker, 2..256 rows through the machine-word driver, anything else through the specification (inside `irNR3`). -/ def c7N3 (rows inW outW : Nat) (relu : Bool) (X W b : Array Word) : Array Word := c7 rows inW outW relu X W b F.d6T2 F.irNR3 @[irreducible] def eDN3 : c7N3 = linearSpec := by funext e d g j X W b;unfold c7N3;rw [F.d6T2_eq];unfold c7;dsimp only;split;rename_i h;have := USize.le_size;have ⟨l,m,o,p,y,z,A,B,u⟩ := h;have q : d+2 ≤ 2^(Nat.log2 (d+1)+1) := by have := @Nat.lt_log2_self (d+1);omega split;rename_i v;subst v;exact F.dCT _ _ _ _ _ _ _ _ _ _ _ _ (F.bd X (by omega) l) (F.bd b (by omega) m) le_rfl q p o split;rename_i _ t;obtain ⟨x,-⟩ := t;obtain ⟨r,rfl⟩ : ∃ r, e = r+1 := ⟨e-1,by omega⟩;rw [Nat.add_sub_cancel,← iv r d g j X W b];refine congr (congrArg HAppend.hAppend ?_) ?_;swap exact F.dCT _ _ _ _ _ _ _ _ _ _ _ _ (j7 X _ _ (fun w => expOf w ≠ 255 ∧ idxOf w ≤ (F.aO X 0 0).toNat-1) (F.bd X (by omega) l)) (F.bd b (by omega) m) le_rfl q p o iterate 2 exact F.irNR3_correct _ _ _ _ _ _ _ _ _ _ _ _ _ (F.bd X (by omega) l) (F.bd b (by omega) m) le_rfl q p o rfl /-- `gemm` through the cached machine-word driver: the columns of `B` are the row groups. Anything outside its size and certificate conditions is the specification itself. -/ def ffP (batch m k n : Nat) (A B : Array Word) : Array Word := let L := Nat.log2 (k+1)+1 if h : batch=1 ∧ 0 < k ∧ 174+L ≤ 425 ∧ L ≤ 27 ∧ m*k ≤ A.size ∧ A.size ≤ 4294967295 ∧ 8*k ≤ 4294967295 ∧ B.size ≤ 4294967295 ∧ n*m ≤ 4294967295 ∧ m ≤ 4294967295 ∧ k*n+2*n+8*k+14 ≤ 4294967295 then let p := F.B8Get A let eb := F.aO B 0 0 if h2 : eb < 255 ∧ (F.hG p.val.2 (eb.toNat-1) 174 L).1 = true then F.c6F true n k m false B A (Array.replicate m 0x80000000) (eb.toNat-1) 174 L ⟨bc h.2.2.2.2.2.1,bc h.2.2.2.2.2.2.1⟩ h.2.2.2.2.1 p ⟨h2.2,h.2.2.2.2.2.2.2.2.1⟩ h.2.2.2.2.2.2.2.2.2.1 h.2.2.2.2.2.2.2.1 (F.gem_pg k n h.2.2.2.2.2.2.2.2.2.2) else gemmSpec batch m k n A B else gemmSpec batch m k n A B @[irreducible] def gvP : ffP = gemmSpec := by funext batch m k n A B unfold ffP dsimp only split · rename_i h split · rename_i h2 have hsz := USize.le_size obtain ⟨rfl,u,p1,r1,x,y,z,D,E1,E2,E3⟩ := h have ea : F.aO A 0 0 < 255 := by rw [← F.B8P_exp A (F.B8Get A)]; exact F.hG_lt _ _ _ _ h2.2 have j := F.bd B (by omega) h2.1 have v := F.bd A (by omega) ea have hb : ∀ q : Nat, expOf (Array.replicate m (0x80000000:Word))[q]! ≠ 255 ∧ idxOf (Array.replicate m (0x80000000:Word))[q]! ≤ 0 := fun q => by by_cases hq : q < m <;> simp [hq] <;> decide have hn : k+2 ≤ 2^(Nat.log2 (k+1)+1) := by have := @Nat.lt_log2_self (k+1); omega rw [F.c6F_eq, F.csNR (t:=true) n k m false B A _ _ 174 _ _ _ (F.B8Get A) 0 j hb (Nat.le_refl _) hn r1 p1,gemmSpec,gemmWith] refine Array.ext (by simp [Nat.mul_comm]) fun q e _ => ?_ rw [Array.size_ofFn] at e have g : q/n < m := Nat.div_lt_of_lt_mul e have w : (Array.replicate m (0x80000000:Word))[q/n]! = 0x80000000 := by simp [g] simp only [Array.getElem_ofFn,↓reduceIte,w, Nat.div_eq_of_lt (by rwa [Nat.mul_comm] : q < m*n),Nat.mod_eq_of_lt g,Nat.zero_mul, Nat.zero_add] exact (F.dz k (fun t => A[q/n*k+t]!) (fun t => B[q%n+t*n]!) u fun t _ => ⟨(v _).1,(j _).1⟩).trans (by simp only [Nat.add_comm (q%n)]) · rfl · rfl end Dense def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.c7N3,Dense.ffP⟩ conv:=⟨Conv.er,Conv.cG⟩ elem:=⟨Conv.dU,Conv.d9,Bn.cq,Bn.br⟩ norm:=⟨Norm.ca,Norm.bn⟩ @[irreducible] def correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm,Dense.eDN3,Dense.gvP,Conv.eu,Conv.cY,Conv.fo,Conv.eV,Bn.dT,Bn.cO,Norm.du,Norm.cN] end Submission