Full-response assembly and the complete affine sampler program
DefinitionInfoLossLAR_RuntimeBundle_06affine-transportinfo-loss-lar-runtimestoc-2027
The full-response and finite-rectangle programs assemble the sampler numerical data. The tape codec divides a padded public random bit string into the independent components used by proposal generation, bounded rejection, chart completion, and affine emission. The complete program reads the platform sampler request and returns the encoded integer matrix and offset. Later theorems prove its polynomial running time, invertibility, and Gaussian transport accuracy.
Definition code
import Definitions.Def_InfoLossLAR_RuntimeBundle_05
open _root_.InfoLossLARNativeSupplements.h7fd26e43562bbe30.AFT.BinaryArithmetic.RationalBits renaming exists_code → AFT.BinaryArithmetic.RationalBits.exists_code
open _root_.InfoLossLARNativeSupplements.h7fd26e43562bbe30.AFT.BinaryArithmetic.RationalBits renaming exists_code → _p2mNativeSupplement0
open _root_.InfoLossLARNativeSupplements.hbc5d2d237f3bc4c8.AFT.BinaryArithmetic renaming bits_value → AFT.BinaryArithmetic.bits_value
open _root_.InfoLossLARNativeSupplements.hbc5d2d237f3bc4c8.AFT.BinaryArithmetic renaming bits_value → _p2mNativeSupplement1
open _root_.InfoLossLARNativeSupplements.h5a8ca90c605f85fc.AFT.CanonicalMoments renaming independent_embedding_expectation_general → AFT.CanonicalMoments.independent_embedding_expectation_general
open _root_.InfoLossLARNativeSupplements.h5a8ca90c605f85fc.AFT.CanonicalMoments renaming independent_embedding_expectation_general → _p2mNativeSupplement2
open _root_.InfoLossLARNativeSupplements.hf808c8dbbd952db7.AFT.CanonicalMoments renaming independent_equiv_expectation_general → AFT.CanonicalMoments.independent_equiv_expectation_general
open _root_.InfoLossLARNativeSupplements.hf808c8dbbd952db7.AFT.CanonicalMoments renaming independent_equiv_expectation_general → _p2mNativeSupplement3
open _root_.InfoLossLARNativeSupplements.h854528c9e123c6f3.AFT.RationalNumerics.HeightBound renaming div → AFT.RationalNumerics.HeightBound.div
open _root_.InfoLossLARNativeSupplements.h854528c9e123c6f3.AFT.RationalNumerics.HeightBound renaming div → _p2mNativeSupplement4
open _root_.InfoLossLARNativeSupplements.ha562531658b7642e.AFT.RationalNumerics.HeightBound renaming inv → AFT.RationalNumerics.HeightBound.inv
open _root_.InfoLossLARNativeSupplements.ha562531658b7642e.AFT.RationalNumerics.HeightBound renaming inv → _p2mNativeSupplement5
open _root_.InfoLossLARNativeSupplements.h4f5add37bf40c2da.AFT.RationalNumerics.HeightBound renaming mono → AFT.RationalNumerics.HeightBound.mono
open _root_.InfoLossLARNativeSupplements.h4f5add37bf40c2da.AFT.RationalNumerics.HeightBound renaming mono → _p2mNativeSupplement6
open _root_.InfoLossLARNativeSupplements.hec331a1b1191da2d.AFT.RationalNumerics.HeightBound renaming mul → AFT.RationalNumerics.HeightBound.mul
open _root_.InfoLossLARNativeSupplements.hec331a1b1191da2d.AFT.RationalNumerics.HeightBound renaming mul → _p2mNativeSupplement7
open _root_.InfoLossLARNativeSupplements.hca9f3ecea512145f.AFT.RationalNumerics.HeightBound renaming of_int → AFT.RationalNumerics.HeightBound.of_int
open _root_.InfoLossLARNativeSupplements.hca9f3ecea512145f.AFT.RationalNumerics.HeightBound renaming of_int → _p2mNativeSupplement8
open _root_.InfoLossLARNativeSupplements.h5b3dd70c728d6348.AFT.RationalNumerics.HeightBound renaming of_nat → AFT.RationalNumerics.HeightBound.of_nat
open _root_.InfoLossLARNativeSupplements.h5b3dd70c728d6348.AFT.RationalNumerics.HeightBound renaming of_nat → _p2mNativeSupplement9
open _root_.InfoLossLARNativeSupplements.h8fac5110874b5cd9.AFT.RationalNumerics.HeightBound renaming one → AFT.RationalNumerics.HeightBound.one
open _root_.InfoLossLARNativeSupplements.h8fac5110874b5cd9.AFT.RationalNumerics.HeightBound renaming one → _p2mNativeSupplement10
open _root_.InfoLossLARNativeSupplements.h90032182500c2e77.AFT.RationalNumerics.HeightBound renaming pow → AFT.RationalNumerics.HeightBound.pow
open _root_.InfoLossLARNativeSupplements.h90032182500c2e77.AFT.RationalNumerics.HeightBound renaming pow → _p2mNativeSupplement11
open _root_.InfoLossLARNativeSupplements.h6381918e2bfc67e4.AFT.RationalNumerics renaming arctanSum_error → AFT.RationalNumerics.arctanSum_error
open _root_.InfoLossLARNativeSupplements.h6381918e2bfc67e4.AFT.RationalNumerics renaming arctanSum_error → _p2mNativeSupplement12
open _root_.InfoLossLARNativeSupplements.h3497cf28d345cc71.AFT.RationalNumerics renaming arctan_term_bound → AFT.RationalNumerics.arctan_term_bound
open _root_.InfoLossLARNativeSupplements.h3497cf28d345cc71.AFT.RationalNumerics renaming arctan_term_bound → _p2mNativeSupplement13
open _root_.InfoLossLARNativeSupplements.had468f01f375d910.AFT.RationalNumerics renaming boundedRootList_nodup → AFT.RationalNumerics.boundedRootList_nodup
open _root_.InfoLossLARNativeSupplements.had468f01f375d910.AFT.RationalNumerics renaming boundedRootList_nodup → _p2mNativeSupplement14
open _root_.InfoLossLARNativeSupplements.h41ae6c8d47a51d34.AFT.RationalNumerics renaming commonDenominator_le → AFT.RationalNumerics.commonDenominator_le
open _root_.InfoLossLARNativeSupplements.h41ae6c8d47a51d34.AFT.RationalNumerics renaming commonDenominator_le → _p2mNativeSupplement15
open _root_.InfoLossLARNativeSupplements.h5f0d1be1226eed7f.AFT.RationalNumerics renaming commonDenominator_pos → AFT.RationalNumerics.commonDenominator_pos
open _root_.InfoLossLARNativeSupplements.h5f0d1be1226eed7f.AFT.RationalNumerics renaming commonDenominator_pos → _p2mNativeSupplement16
open _root_.InfoLossLARNativeSupplements.h1076ff82614707e5.AFT.RationalNumerics renaming commonNumerator_abs_le → AFT.RationalNumerics.commonNumerator_abs_le
open _root_.InfoLossLARNativeSupplements.h1076ff82614707e5.AFT.RationalNumerics renaming commonNumerator_abs_le → _p2mNativeSupplement17
open _root_.InfoLossLARNativeSupplements.h3827d5d7d51242c6.AFT.RationalNumerics renaming commonNumerator_cast → AFT.RationalNumerics.commonNumerator_cast
open _root_.InfoLossLARNativeSupplements.h3827d5d7d51242c6.AFT.RationalNumerics renaming commonNumerator_cast → _p2mNativeSupplement18
open _root_.InfoLossLARNativeSupplements.h4b0b2c49d14fd209.AFT.RationalNumerics renaming commonNumerator_div → AFT.RationalNumerics.commonNumerator_div
open _root_.InfoLossLARNativeSupplements.h4b0b2c49d14fd209.AFT.RationalNumerics renaming commonNumerator_div → _p2mNativeSupplement19
open _root_.InfoLossLARNativeSupplements.h2882c93186ab7cf8.AFT.RationalNumerics renaming denominator_dvd_common → AFT.RationalNumerics.denominator_dvd_common
open _root_.InfoLossLARNativeSupplements.h2882c93186ab7cf8.AFT.RationalNumerics renaming denominator_dvd_common → _p2mNativeSupplement20
open _root_.InfoLossLARNativeSupplements.h05d99dd2bef78a64.AFT.RationalNumerics renaming integerLinearIteration_abs_le → AFT.RationalNumerics.integerLinearIteration_abs_le
open _root_.InfoLossLARNativeSupplements.h05d99dd2bef78a64.AFT.RationalNumerics renaming integerLinearIteration_abs_le → _p2mNativeSupplement21
open _root_.InfoLossLARNativeSupplements.hc6ad092b2f522781.AFT.RationalNumerics renaming integerLinearIteration_exact → AFT.RationalNumerics.integerLinearIteration_exact
open _root_.InfoLossLARNativeSupplements.hc6ad092b2f522781.AFT.RationalNumerics renaming integerLinearIteration_exact → _p2mNativeSupplement22
open _root_.InfoLossLARNativeSupplements.hdcd54a4fdf95f258.AFT.RationalNumerics renaming integerLinearIteration_height → AFT.RationalNumerics.integerLinearIteration_height
open _root_.InfoLossLARNativeSupplements.hdcd54a4fdf95f258.AFT.RationalNumerics renaming integerLinearIteration_height → _p2mNativeSupplement23
open _root_.InfoLossLARNativeSupplements.he7db6c4ee6224eee.AFT.RationalNumerics renaming linearIteration_height → AFT.RationalNumerics.linearIteration_height
open _root_.InfoLossLARNativeSupplements.he7db6c4ee6224eee.AFT.RationalNumerics renaming linearIteration_height → _p2mNativeSupplement24
open _root_.InfoLossLARNativeSupplements.h18af7218e3ae5082.AFT.RationalNumerics renaming mem_boundedRootList → AFT.RationalNumerics.mem_boundedRootList
open _root_.InfoLossLARNativeSupplements.h18af7218e3ae5082.AFT.RationalNumerics renaming mem_boundedRootList → _p2mNativeSupplement25
open _root_.InfoLossLARNativeSupplements.h878260dd8e6c9a6e.AFT.RationalNumerics renaming piApprox_error → AFT.RationalNumerics.piApprox_error
open _root_.InfoLossLARNativeSupplements.h878260dd8e6c9a6e.AFT.RationalNumerics renaming piApprox_error → _p2mNativeSupplement26
open _root_.InfoLossLARNativeSupplements.h91d71a61f0497f7b.AFT.RationalNumerics renaming piApprox_le_five → AFT.RationalNumerics.piApprox_le_five
open _root_.InfoLossLARNativeSupplements.h91d71a61f0497f7b.AFT.RationalNumerics renaming piApprox_le_five → _p2mNativeSupplement27
open _root_.InfoLossLARNativeSupplements.hb0db73987b7b1eff.AFT.V7Calibration renaming actualPublicBodyChoice_nonempty → AFT.V7Calibration.actualPublicBodyChoice_nonempty
open _root_.InfoLossLARNativeSupplements.hb0db73987b7b1eff.AFT.V7Calibration renaming actualPublicBodyChoice_nonempty → _p2mNativeSupplement28
open _root_.InfoLossLARNativeSupplements.hb6587a05bd2df660.AFT.V7Calibration renaming actualPublicPrimaryChoice_nonempty → AFT.V7Calibration.actualPublicPrimaryChoice_nonempty
open _root_.InfoLossLARNativeSupplements.hb6587a05bd2df660.AFT.V7Calibration renaming actualPublicPrimaryChoice_nonempty → _p2mNativeSupplement29
open _root_.InfoLossLARNativeSupplements.he83cfe7a7db39d44.CurrentAFT.BinaryFiniteProduct renaming current_value → CurrentAFT.BinaryFiniteProduct.current_value
open _root_.InfoLossLARNativeSupplements.he83cfe7a7db39d44.CurrentAFT.BinaryFiniteProduct renaming current_value → _p2mNativeSupplement30
open _root_.InfoLossLARNativeSupplements.hf109288ce2bff41a.CurrentAFT.BinaryFullResponseCounts renaming current_sizes → CurrentAFT.BinaryFullResponseCounts.current_sizes
open _root_.InfoLossLARNativeSupplements.hf109288ce2bff41a.CurrentAFT.BinaryFullResponseCounts renaming current_sizes → _p2mNativeSupplement31
open _root_.InfoLossLARNativeSupplements.hab90893a8a9293a2.CurrentAFT.BinaryListSum renaming current_value → CurrentAFT.BinaryListSum.current_value
open _root_.InfoLossLARNativeSupplements.hab90893a8a9293a2.CurrentAFT.BinaryListSum renaming current_value → _p2mNativeSupplement32
open _root_.InfoLossLARNativeSupplements.hb7b15c9a79e648be.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_ordinary → CurrentAFT.BinaryRootMetadataSerializer.actualChoice_ordinary
open _root_.InfoLossLARNativeSupplements.hb7b15c9a79e648be.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_ordinary → _p2mNativeSupplement33
open _root_.InfoLossLARNativeSupplements.h9bd8eaff2c880c78.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_primary → CurrentAFT.BinaryRootMetadataSerializer.actualChoice_primary
open _root_.InfoLossLARNativeSupplements.h9bd8eaff2c880c78.CurrentAFT.BinaryRootMetadataSerializer renaming actualChoice_primary → _p2mNativeSupplement34
open _root_.InfoLossLARNativeSupplements.ha802267fba3ae37a.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_input → CurrentAFT.BinaryRootMetadataSerializer.candidate_input
open _root_.InfoLossLARNativeSupplements.ha802267fba3ae37a.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_input → _p2mNativeSupplement35
open _root_.InfoLossLARNativeSupplements.h1ccc0b12a2e9b2e7.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_kept → CurrentAFT.BinaryRootMetadataSerializer.candidate_kept
open _root_.InfoLossLARNativeSupplements.h1ccc0b12a2e9b2e7.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_kept → _p2mNativeSupplement36
open _root_.InfoLossLARNativeSupplements.hf63ab620f3c57a9b.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_ordinary → CurrentAFT.BinaryRootMetadataSerializer.candidate_ordinary
open _root_.InfoLossLARNativeSupplements.hf63ab620f3c57a9b.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_ordinary → _p2mNativeSupplement37
open _root_.InfoLossLARNativeSupplements.h8b1af35cb5128d1e.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_primary → CurrentAFT.BinaryRootMetadataSerializer.candidate_primary
open _root_.InfoLossLARNativeSupplements.h8b1af35cb5128d1e.CurrentAFT.BinaryRootMetadataSerializer renaming candidate_primary → _p2mNativeSupplement38
open _root_.InfoLossLARNativeSupplements.hc002c1f58373bc9e.CurrentAFT.BinaryRootMetadataSerializer renaming classify_numbering → CurrentAFT.BinaryRootMetadataSerializer.classify_numbering
open _root_.InfoLossLARNativeSupplements.hc002c1f58373bc9e.CurrentAFT.BinaryRootMetadataSerializer renaming classify_numbering → _p2mNativeSupplement39
open _root_.InfoLossLARNativeSupplements.h0654708b8f7abd41.CurrentAFT.BinaryRootMetadataSerializer renaming current_castMetadata → CurrentAFT.BinaryRootMetadataSerializer.current_castMetadata
open _root_.InfoLossLARNativeSupplements.h0654708b8f7abd41.CurrentAFT.BinaryRootMetadataSerializer renaming current_castMetadata → _p2mNativeSupplement40
open _root_.InfoLossLARNativeSupplements.h62365cd168bf9746.CurrentAFT.BinaryRootMetadataSerializer renaming current_cast_tags → CurrentAFT.BinaryRootMetadataSerializer.current_cast_tags
open _root_.InfoLossLARNativeSupplements.h62365cd168bf9746.CurrentAFT.BinaryRootMetadataSerializer renaming current_cast_tags → _p2mNativeSupplement41
open _root_.InfoLossLARNativeSupplements.hd04a074a03468451.CurrentAFT.BinaryRootMetadataSerializer renaming current_congr_counts → CurrentAFT.BinaryRootMetadataSerializer.current_congr_counts
open _root_.InfoLossLARNativeSupplements.hd04a074a03468451.CurrentAFT.BinaryRootMetadataSerializer renaming current_congr_counts → _p2mNativeSupplement42
open _root_.InfoLossLARNativeSupplements.h92779a9b15e1ad74.CurrentAFT.BinaryRootMetadataSerializer renaming current_kept_le → CurrentAFT.BinaryRootMetadataSerializer.current_kept_le
open _root_.InfoLossLARNativeSupplements.h92779a9b15e1ad74.CurrentAFT.BinaryRootMetadataSerializer renaming current_kept_le → _p2mNativeSupplement43
open _root_.InfoLossLARNativeSupplements.h5d3e6518d488d268.CurrentAFT.BinaryRootMetadataSerializer renaming current_metadata_actual → CurrentAFT.BinaryRootMetadataSerializer.current_metadata_actual
open _root_.InfoLossLARNativeSupplements.h5d3e6518d488d268.CurrentAFT.BinaryRootMetadataSerializer renaming current_metadata_actual → _p2mNativeSupplement44
open _root_.InfoLossLARNativeSupplements.h6da04ab1cb4f0ae9.CurrentAFT.BinaryRootMetadataSerializer renaming current_native_counts → CurrentAFT.BinaryRootMetadataSerializer.current_native_counts
open _root_.InfoLossLARNativeSupplements.h6da04ab1cb4f0ae9.CurrentAFT.BinaryRootMetadataSerializer renaming current_native_counts → _p2mNativeSupplement45
open _root_.InfoLossLARNativeSupplements.h0034013fd46e34b6.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_actual → CurrentAFT.BinaryRootMetadataSerializer.current_rational_actual
open _root_.InfoLossLARNativeSupplements.h0034013fd46e34b6.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_actual → _p2mNativeSupplement46
open _root_.InfoLossLARNativeSupplements.he41810aeef644de7.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_native → CurrentAFT.BinaryRootMetadataSerializer.current_rational_native
open _root_.InfoLossLARNativeSupplements.he41810aeef644de7.CurrentAFT.BinaryRootMetadataSerializer renaming current_rational_native → _p2mNativeSupplement47
open _root_.InfoLossLARNativeSupplements.hdf21f91932116c35.CurrentAFT.BinaryRootMetadataSerializer renaming current_role → CurrentAFT.BinaryRootMetadataSerializer.current_role
open _root_.InfoLossLARNativeSupplements.hdf21f91932116c35.CurrentAFT.BinaryRootMetadataSerializer renaming current_role → _p2mNativeSupplement48
open _root_.InfoLossLARNativeSupplements.h2f02b0da80d0da15.CurrentAFT.BinaryRootMetadataSerializer renaming current_role_actual → CurrentAFT.BinaryRootMetadataSerializer.current_role_actual
open _root_.InfoLossLARNativeSupplements.h2f02b0da80d0da15.CurrentAFT.BinaryRootMetadataSerializer renaming current_role_actual → _p2mNativeSupplement49
open _root_.InfoLossLARNativeSupplements.hf05bd272bb1b56e1.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot → CurrentAFT.BinaryRootMetadataSerializer.current_tagSlot
open _root_.InfoLossLARNativeSupplements.hf05bd272bb1b56e1.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot → _p2mNativeSupplement50
open _root_.InfoLossLARNativeSupplements.h99dea6e0b2cb92cd.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot_actual → CurrentAFT.BinaryRootMetadataSerializer.current_tagSlot_actual
open _root_.InfoLossLARNativeSupplements.h99dea6e0b2cb92cd.CurrentAFT.BinaryRootMetadataSerializer renaming current_tagSlot_actual → _p2mNativeSupplement51
open _root_.InfoLossLARNativeSupplements.h5aa51497de94248a.CurrentAFT.BinaryRootMetadataSerializer renaming find_value → CurrentAFT.BinaryRootMetadataSerializer.find_value
open _root_.InfoLossLARNativeSupplements.h5aa51497de94248a.CurrentAFT.BinaryRootMetadataSerializer renaming find_value → _p2mNativeSupplement52
open _root_.InfoLossLARNativeSupplements.he1ba053a04ebe416.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_kept → CurrentAFT.BinaryRootMetadataSerializer.inputOrdering_symm_kept
open _root_.InfoLossLARNativeSupplements.he1ba053a04ebe416.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_kept → _p2mNativeSupplement53
open _root_.InfoLossLARNativeSupplements.hb19b481a4ab916e9.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_ordinary → CurrentAFT.BinaryRootMetadataSerializer.inputOrdering_symm_ordinary
open _root_.InfoLossLARNativeSupplements.hb19b481a4ab916e9.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_ordinary → _p2mNativeSupplement54
open _root_.InfoLossLARNativeSupplements.h925bf1f311c5581d.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_primary → CurrentAFT.BinaryRootMetadataSerializer.inputOrdering_symm_primary
open _root_.InfoLossLARNativeSupplements.h925bf1f311c5581d.CurrentAFT.BinaryRootMetadataSerializer renaming inputOrdering_symm_primary → _p2mNativeSupplement55
open _root_.InfoLossLARNativeSupplements.h28bdeb915df6f31b.CurrentAFT.BinaryRootMetadataSerializer renaming keptOrdering_number → CurrentAFT.BinaryRootMetadataSerializer.keptOrdering_number
open _root_.InfoLossLARNativeSupplements.h28bdeb915df6f31b.CurrentAFT.BinaryRootMetadataSerializer renaming keptOrdering_number → _p2mNativeSupplement56
open _root_.InfoLossLARNativeSupplements.hd98ece77ce245c62.CurrentAFT.BinaryRootMetadataSerializer renaming kept_length_le → CurrentAFT.BinaryRootMetadataSerializer.kept_length_le
open _root_.InfoLossLARNativeSupplements.hd98ece77ce245c62.CurrentAFT.BinaryRootMetadataSerializer renaming kept_length_le → _p2mNativeSupplement57
open _root_.InfoLossLARNativeSupplements.h0c3b1f75a36dc0a1.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_input → CurrentAFT.BinaryRootMetadataSerializer.matchesBlock_input
open _root_.InfoLossLARNativeSupplements.h0c3b1f75a36dc0a1.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_input → _p2mNativeSupplement58
open _root_.InfoLossLARNativeSupplements.h3614eab28d16c434.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_value → CurrentAFT.BinaryRootMetadataSerializer.matchesBlock_value
open _root_.InfoLossLARNativeSupplements.h3614eab28d16c434.CurrentAFT.BinaryRootMetadataSerializer renaming matchesBlock_value → _p2mNativeSupplement59
open _root_.InfoLossLARNativeSupplements.h7211ad64e277ecd6.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_get → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_get
open _root_.InfoLossLARNativeSupplements.h7211ad64e277ecd6.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_get → _p2mNativeSupplement60
open _root_.InfoLossLARNativeSupplements.h5bfd14958fa45ca1.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_increasing → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_increasing
open _root_.InfoLossLARNativeSupplements.h5bfd14958fa45ca1.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_increasing → _p2mNativeSupplement61
open _root_.InfoLossLARNativeSupplements.h830e34787bfcc36e.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_membership → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_membership
open _root_.InfoLossLARNativeSupplements.h830e34787bfcc36e.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_membership → _p2mNativeSupplement62
open _root_.InfoLossLARNativeSupplements.hdf4e90e4faeda9bb.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_tagsInput
open _root_.InfoLossLARNativeSupplements.hdf4e90e4faeda9bb.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput → _p2mNativeSupplement63
open _root_.InfoLossLARNativeSupplements.h0eb6479555712d22.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput_vector → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_tagsInput_vector
open _root_.InfoLossLARNativeSupplements.h0eb6479555712d22.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_tagsInput_vector → _p2mNativeSupplement64
open _root_.InfoLossLARNativeSupplements.he3484ce79e618bef.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_value → CurrentAFT.BinaryRootMetadataSerializer.nativeTag_value
open _root_.InfoLossLARNativeSupplements.he3484ce79e618bef.CurrentAFT.BinaryRootMetadataSerializer renaming nativeTag_value → _p2mNativeSupplement65
open _root_.InfoLossLARNativeSupplements.hb10c61056b84e123.CurrentAFT.BinaryRootMetadataSerializer renaming position_input → CurrentAFT.BinaryRootMetadataSerializer.position_input
open _root_.InfoLossLARNativeSupplements.hb10c61056b84e123.CurrentAFT.BinaryRootMetadataSerializer renaming position_input → _p2mNativeSupplement66
open _root_.InfoLossLARNativeSupplements.h717398dca61c08fb.CurrentAFT.BinaryRootMetadataSerializer renaming rational_current_cast_tags → CurrentAFT.BinaryRootMetadataSerializer.rational_current_cast_tags
open _root_.InfoLossLARNativeSupplements.h717398dca61c08fb.CurrentAFT.BinaryRootMetadataSerializer renaming rational_current_cast_tags → _p2mNativeSupplement67
open _root_.InfoLossLARNativeSupplements.h5c1679d60747a3c8.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_at_group → CurrentAFT.BinaryRootMetadataSerializer.retainedInput_at_group
open _root_.InfoLossLARNativeSupplements.h5c1679d60747a3c8.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_at_group → _p2mNativeSupplement68
open _root_.InfoLossLARNativeSupplements.hd10b40ce4e5fb3ce.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_get → CurrentAFT.BinaryRootMetadataSerializer.retainedInput_get
open _root_.InfoLossLARNativeSupplements.hd10b40ce4e5fb3ce.CurrentAFT.BinaryRootMetadataSerializer renaming retainedInput_get → _p2mNativeSupplement69
open _root_.InfoLossLARNativeSupplements.h790debae9bc7d744.CurrentAFT.BinaryRootMetadataSerializer renaming role_input → CurrentAFT.BinaryRootMetadataSerializer.role_input
open _root_.InfoLossLARNativeSupplements.h790debae9bc7d744.CurrentAFT.BinaryRootMetadataSerializer renaming role_input → _p2mNativeSupplement70
open _root_.InfoLossLARNativeSupplements.h36433fb6e771176d.CurrentAFT.BinaryRootMetadataSerializer renaming role_kept → CurrentAFT.BinaryRootMetadataSerializer.role_kept
open _root_.InfoLossLARNativeSupplements.h36433fb6e771176d.CurrentAFT.BinaryRootMetadataSerializer renaming role_kept → _p2mNativeSupplement71
open _root_.InfoLossLARNativeSupplements.h1c0aacbfbcab259c.CurrentAFT.BinaryRootMetadataSerializer renaming role_ordinary → CurrentAFT.BinaryRootMetadataSerializer.role_ordinary
open _root_.InfoLossLARNativeSupplements.h1c0aacbfbcab259c.CurrentAFT.BinaryRootMetadataSerializer renaming role_ordinary → _p2mNativeSupplement72
open _root_.InfoLossLARNativeSupplements.had28d56c66c172c2.CurrentAFT.BinaryRootMetadataSerializer renaming role_primary → CurrentAFT.BinaryRootMetadataSerializer.role_primary
open _root_.InfoLossLARNativeSupplements.had28d56c66c172c2.CurrentAFT.BinaryRootMetadataSerializer renaming role_primary → _p2mNativeSupplement73
open _root_.InfoLossLARNativeSupplements.hf7b606d7b6c71037.CurrentAFT.BinaryRootMetadataSerializer renaming splitIndex_value → CurrentAFT.BinaryRootMetadataSerializer.splitIndex_value
open _root_.InfoLossLARNativeSupplements.hf7b606d7b6c71037.CurrentAFT.BinaryRootMetadataSerializer renaming splitIndex_value → _p2mNativeSupplement74
open _root_.InfoLossLARNativeSupplements.hc171b658125977dd.CurrentAFT.BinaryRootMetadataSerializer renaming tagBlocks_card → CurrentAFT.BinaryRootMetadataSerializer.tagBlocks_card
open _root_.InfoLossLARNativeSupplements.hc171b658125977dd.CurrentAFT.BinaryRootMetadataSerializer renaming tagBlocks_card → _p2mNativeSupplement75
open _root_.InfoLossLARNativeSupplements.h864990220cd05a68.CurrentAFT.BinaryRootMetadataSerializer renaming tagSlot_input → CurrentAFT.BinaryRootMetadataSerializer.tagSlot_input
open _root_.InfoLossLARNativeSupplements.h864990220cd05a68.CurrentAFT.BinaryRootMetadataSerializer renaming tagSlot_input → _p2mNativeSupplement76
open _root_.InfoLossLARNativeSupplements.he99bee3d04267632.CurrentAFT.BinaryRootMetadataSerializer renaming tagsInput_get → CurrentAFT.BinaryRootMetadataSerializer.tagsInput_get
open _root_.InfoLossLARNativeSupplements.he99bee3d04267632.CurrentAFT.BinaryRootMetadataSerializer renaming tagsInput_get → _p2mNativeSupplement77
open _root_.InfoLossLARNativeSupplements.h15d8c2848429780a.CurrentAFT.BinaryRootMetadataSerializer renaming vector_count_cast_get → CurrentAFT.BinaryRootMetadataSerializer.vector_count_cast_get
open _root_.InfoLossLARNativeSupplements.h15d8c2848429780a.CurrentAFT.BinaryRootMetadataSerializer renaming vector_count_cast_get → _p2mNativeSupplement78
open _root_.InfoLossLARNativeSupplements.h6033ffbe1c08cc96.CurrentAFT.BinaryRootMetadataSerializer renaming vector_length_cast_get → CurrentAFT.BinaryRootMetadataSerializer.vector_length_cast_get
open _root_.InfoLossLARNativeSupplements.h6033ffbe1c08cc96.CurrentAFT.BinaryRootMetadataSerializer renaming vector_length_cast_get → _p2mNativeSupplement79
open _root_.InfoLossLARNativeSupplements.he438d921f6936ff8.CurrentAFT.BinaryRootMetadataSerializer renaming vector_mem_toList → CurrentAFT.BinaryRootMetadataSerializer.vector_mem_toList
open _root_.InfoLossLARNativeSupplements.he438d921f6936ff8.CurrentAFT.BinaryRootMetadataSerializer renaming vector_mem_toList → _p2mNativeSupplement80
open _root_.InfoLossLARNativeSupplements.he37fcb2fedaaad11.CurrentAFT.BinarySparseCycleEvaluation renaming current_tuple_value → CurrentAFT.BinarySparseCycleEvaluation.current_tuple_value
open _root_.InfoLossLARNativeSupplements.he37fcb2fedaaad11.CurrentAFT.BinarySparseCycleEvaluation renaming current_tuple_value → _p2mNativeSupplement81
open _root_.InfoLossLARNativeSupplements.h42f327202f6ffc34.CurrentAFT.BinarySparseCycleEvaluation renaming rootEntry_value → CurrentAFT.BinarySparseCycleEvaluation.rootEntry_value
open _root_.InfoLossLARNativeSupplements.h42f327202f6ffc34.CurrentAFT.BinarySparseCycleEvaluation renaming rootEntry_value → _p2mNativeSupplement82
open _root_.InfoLossLARNativeSupplements.h046841627a1cee9b.CurrentAFT.BinarySparseCycleEvaluation renaming roots_value → CurrentAFT.BinarySparseCycleEvaluation.roots_value
open _root_.InfoLossLARNativeSupplements.h046841627a1cee9b.CurrentAFT.BinarySparseCycleEvaluation renaming roots_value → _p2mNativeSupplement83
open _root_.InfoLossLARNativeSupplements.hd0df78f75d4d893f.CurrentAFT.BinarySparseCycleEvaluation renaming term_value → CurrentAFT.BinarySparseCycleEvaluation.term_value
open _root_.InfoLossLARNativeSupplements.hd0df78f75d4d893f.CurrentAFT.BinarySparseCycleEvaluation renaming term_value → _p2mNativeSupplement84
open _root_.InfoLossLARNativeSupplements.hf4f5fd4dcb0d678c.CurrentAFT.BinarySparseCycleEvaluation renaming weightEntry_value → CurrentAFT.BinarySparseCycleEvaluation.weightEntry_value
open _root_.InfoLossLARNativeSupplements.hf4f5fd4dcb0d678c.CurrentAFT.BinarySparseCycleEvaluation renaming weightEntry_value → _p2mNativeSupplement85
open _root_.InfoLossLARNativeSupplements.haf9b5363dbfc3f4c.CurrentAFT.BinarySparseCycleSemantic renaming coordinates_apply → CurrentAFT.BinarySparseCycleSemantic.coordinates_apply
open _root_.InfoLossLARNativeSupplements.haf9b5363dbfc3f4c.CurrentAFT.BinarySparseCycleSemantic renaming coordinates_apply → _p2mNativeSupplement86
open _root_.InfoLossLARNativeSupplements.hb39aff037bdc4326.CurrentAFT.BinarySparseCycleSemantic renaming current_value → CurrentAFT.BinarySparseCycleSemantic.current_value
open _root_.InfoLossLARNativeSupplements.hb39aff037bdc4326.CurrentAFT.BinarySparseCycleSemantic renaming current_value → _p2mNativeSupplement87
open _root_.InfoLossLARNativeSupplements.h0cda298b0874d5b6.CurrentAFT.BinarySparseCycleSemantic renaming product_coordinates → CurrentAFT.BinarySparseCycleSemantic.product_coordinates
open _root_.InfoLossLARNativeSupplements.h0cda298b0874d5b6.CurrentAFT.BinarySparseCycleSemantic renaming product_coordinates → _p2mNativeSupplement88
open _root_.InfoLossLARNativeSupplements.h10d530ee15bdc77f.CurrentAFT.BinarySparseCycleSemantic renaming roots_coordinates → CurrentAFT.BinarySparseCycleSemantic.roots_coordinates
open _root_.InfoLossLARNativeSupplements.h10d530ee15bdc77f.CurrentAFT.BinarySparseCycleSemantic renaming roots_coordinates → _p2mNativeSupplement89
open _root_.InfoLossLARNativeSupplements.h5cfbe96a887c7fbe.CurrentAFT.BinaryTouchedCycle renaming candidates_length → CurrentAFT.BinaryTouchedCycle.candidates_length
open _root_.InfoLossLARNativeSupplements.h5cfbe96a887c7fbe.CurrentAFT.BinaryTouchedCycle renaming candidates_length → _p2mNativeSupplement90
open _root_.InfoLossLARNativeSupplements.hbcb1352f59b47e7a.CurrentAFT.BinaryTouchedCycle renaming prepare_length → CurrentAFT.BinaryTouchedCycle.prepare_length
open _root_.InfoLossLARNativeSupplements.hbcb1352f59b47e7a.CurrentAFT.BinaryTouchedCycle renaming prepare_length → _p2mNativeSupplement91
open _root_.InfoLossLARNativeSupplements.h7b66ba8c3614b749.CurrentAFT.BinaryTouchedCycle renaming unique_length → CurrentAFT.BinaryTouchedCycle.unique_length
open _root_.InfoLossLARNativeSupplements.h7b66ba8c3614b749.CurrentAFT.BinaryTouchedCycle renaming unique_length → _p2mNativeSupplement92
open _root_.InfoLossLARNativeSupplements.h8bc15ae79e4624be.CurrentAFT.BinaryTouchedCycleBuffer renaming lookup_value → CurrentAFT.BinaryTouchedCycleBuffer.lookup_value
open _root_.InfoLossLARNativeSupplements.h8bc15ae79e4624be.CurrentAFT.BinaryTouchedCycleBuffer renaming lookup_value → _p2mNativeSupplement93
open _root_.InfoLossLARNativeSupplements.hf362d6b0d865f5c6.CurrentAFT.BinaryTouchedCycleRanks renaming positions_value → CurrentAFT.BinaryTouchedCycleRanks.positions_value
open _root_.InfoLossLARNativeSupplements.hf362d6b0d865f5c6.CurrentAFT.BinaryTouchedCycleRanks renaming positions_value → _p2mNativeSupplement94
open _root_.InfoLossLARNativeSupplements.h4cdf4f6ad2d19d90.CurrentAFT.BinaryTupleSum renaming current_value → CurrentAFT.BinaryTupleSum.current_value
open _root_.InfoLossLARNativeSupplements.h4cdf4f6ad2d19d90.CurrentAFT.BinaryTupleSum renaming current_value → _p2mNativeSupplement95
open _root_.InfoLossLARNativeSupplements.ha8fcea89e723dc23.CurrentAFT.BinaryTupleSum renaming get_ofFn_fun → CurrentAFT.BinaryTupleSum.get_ofFn_fun
open _root_.InfoLossLARNativeSupplements.ha8fcea89e723dc23.CurrentAFT.BinaryTupleSum renaming get_ofFn_fun → _p2mNativeSupplement96
open _root_.InfoLossLARNativeSupplements.ha84cbfc4268e8d40.CurrentAFT.BinaryTupleSum renaming prepend_get → CurrentAFT.BinaryTupleSum.prepend_get
open _root_.InfoLossLARNativeSupplements.ha84cbfc4268e8d40.CurrentAFT.BinaryTupleSum renaming prepend_get → _p2mNativeSupplement97
open _root_.InfoLossLARNativeSupplements.hcca3d782e3229b7c.CurrentAFT.BinaryTupleSum renaming prepend_value → CurrentAFT.BinaryTupleSum.prepend_value
open _root_.InfoLossLARNativeSupplements.hcca3d782e3229b7c.CurrentAFT.BinaryTupleSum renaming prepend_value → _p2mNativeSupplement98
open _root_.InfoLossLARNativeSupplements.h78d75bb492074482.CurrentAFT.CountedBoundedRootTags.Tag renaming card → CurrentAFT.CountedBoundedRootTags.Tag.card
open _root_.InfoLossLARNativeSupplements.h78d75bb492074482.CurrentAFT.CountedBoundedRootTags.Tag renaming card → _p2mNativeSupplement99
open _root_.InfoLossLARNativeSupplements.h9568a61082f27bb9.CurrentAFT.CountedBoundedRootTags.Tag renaming nodup → CurrentAFT.CountedBoundedRootTags.Tag.nodup
open _root_.InfoLossLARNativeSupplements.h9568a61082f27bb9.CurrentAFT.CountedBoundedRootTags.Tag renaming nodup → _p2mNativeSupplement100
open _root_.InfoLossLARNativeSupplements.hf6e7f4bd634f80a9.CurrentAFT.CountedBoundedRootTags.Tag renaming read_value → CurrentAFT.CountedBoundedRootTags.Tag.read_value
open _root_.InfoLossLARNativeSupplements.hf6e7f4bd634f80a9.CurrentAFT.CountedBoundedRootTags.Tag renaming read_value → _p2mNativeSupplement101
open _root_.InfoLossLARNativeSupplements.hd05ef333dfb7baf7.CurrentAFT.CountedBoundedRootTags.Tag renaming store_value → CurrentAFT.CountedBoundedRootTags.Tag.store_value
open _root_.InfoLossLARNativeSupplements.hd05ef333dfb7baf7.CurrentAFT.CountedBoundedRootTags.Tag renaming store_value → _p2mNativeSupplement102
open _root_.InfoLossLARNativeSupplements.h8bf8720ebb55498f.CurrentAFT.CountedBoundedRootTags.Tag renaming vector_increasing → CurrentAFT.CountedBoundedRootTags.Tag.vector_increasing
open _root_.InfoLossLARNativeSupplements.h8bf8720ebb55498f.CurrentAFT.CountedBoundedRootTags.Tag renaming vector_increasing → _p2mNativeSupplement103
open _root_.InfoLossLARNativeSupplements.h5fde173c8469afa6.CurrentAFT.CountedBoundedRootTags renaming current_sets → CurrentAFT.CountedBoundedRootTags.current_sets
open _root_.InfoLossLARNativeSupplements.h5fde173c8469afa6.CurrentAFT.CountedBoundedRootTags renaming current_sets → _p2mNativeSupplement104
open _root_.InfoLossLARNativeSupplements.he8f344a3055fc54a.CurrentAFT.CountedBoundedRootTags renaming entry_sets → CurrentAFT.CountedBoundedRootTags.entry_sets
open _root_.InfoLossLARNativeSupplements.he8f344a3055fc54a.CurrentAFT.CountedBoundedRootTags renaming entry_sets → _p2mNativeSupplement105
open _root_.InfoLossLARNativeSupplements.h2c50018e32584610.CurrentAFT.CountedBoundedRootTags renaming guarded_value → CurrentAFT.CountedBoundedRootTags.guarded_value
open _root_.InfoLossLARNativeSupplements.h2c50018e32584610.CurrentAFT.CountedBoundedRootTags renaming guarded_value → _p2mNativeSupplement106
open _root_.InfoLossLARNativeSupplements.h4aa23a1b871c5bc6.CurrentAFT.CountedBoundedRootTags renaming sum_value → CurrentAFT.CountedBoundedRootTags.sum_value
open _root_.InfoLossLARNativeSupplements.h4aa23a1b871c5bc6.CurrentAFT.CountedBoundedRootTags renaming sum_value → _p2mNativeSupplement107
open _root_.InfoLossLARNativeSupplements.h5a83c4211de0d052.CurrentAFT.CountedBoundedRootTags renaming sum_value_equiv → CurrentAFT.CountedBoundedRootTags.sum_value_equiv
open _root_.InfoLossLARNativeSupplements.h5a83c4211de0d052.CurrentAFT.CountedBoundedRootTags renaming sum_value_equiv → _p2mNativeSupplement108
open _root_.InfoLossLARNativeSupplements.h857ff8dbe55756b8.CurrentAFT.CurrentCycleEntryProgram renaming bodyCount_eq → CurrentAFT.CurrentCycleEntryProgram.bodyCount_eq
open _root_.InfoLossLARNativeSupplements.h857ff8dbe55756b8.CurrentAFT.CurrentCycleEntryProgram renaming bodyCount_eq → _p2mNativeSupplement109
open _root_.InfoLossLARNativeSupplements.h4b24203afd73c049.CurrentAFT.CurrentCycleEntryProgram renaming roots_mod_iff → CurrentAFT.CurrentCycleEntryProgram.roots_mod_iff
open _root_.InfoLossLARNativeSupplements.h4b24203afd73c049.CurrentAFT.CurrentCycleEntryProgram renaming roots_mod_iff → _p2mNativeSupplement110
open _root_.InfoLossLARNativeSupplements.h187f69822989eb63.CurrentAFT.CurrentCycleEntryProgram renaming selectedEntry_cast → CurrentAFT.CurrentCycleEntryProgram.selectedEntry_cast
open _root_.InfoLossLARNativeSupplements.h187f69822989eb63.CurrentAFT.CurrentCycleEntryProgram renaming selectedEntry_cast → _p2mNativeSupplement111
open _root_.InfoLossLARNativeSupplements.h9180bab9fc132623.CurrentAFT.CurrentCycleEntryProgram renaming selected_probability_source → CurrentAFT.CurrentCycleEntryProgram.selected_probability_source
open _root_.InfoLossLARNativeSupplements.h9180bab9fc132623.CurrentAFT.CurrentCycleEntryProgram renaming selected_probability_source → _p2mNativeSupplement112
open _root_.InfoLossLARNativeSupplements.hf7c0550335227b9c.CurrentAFT.CurrentGaussianBits renaming ratio_bounds → CurrentAFT.CurrentGaussianBits.ratio_bounds
open _root_.InfoLossLARNativeSupplements.hf7c0550335227b9c.CurrentAFT.CurrentGaussianBits renaming ratio_bounds → _p2mNativeSupplement113
open _root_.InfoLossLARNativeSupplements.ha029c925a85a9044.CurrentAFT.CurrentPublicShiftProgram renaming encode_value → CurrentAFT.CurrentPublicShiftProgram.encode_value
open _root_.InfoLossLARNativeSupplements.ha029c925a85a9044.CurrentAFT.CurrentPublicShiftProgram renaming encode_value → _p2mNativeSupplement114
open _root_.InfoLossLARNativeSupplements.h4ae04e3f1cb5b359.CurrentAFT.CurrentRootSlotIndex renaming tagPosition_eq → CurrentAFT.CurrentRootSlotIndex.tagPosition_eq
open _root_.InfoLossLARNativeSupplements.h4ae04e3f1cb5b359.CurrentAFT.CurrentRootSlotIndex renaming tagPosition_eq → _p2mNativeSupplement115
open _root_.InfoLossLARNativeSupplements.h20ee486b3d1dffd8.CurrentAFT.CyclePatternProgram renaming averagedEvaluate_cast → CurrentAFT.CyclePatternProgram.averagedEvaluate_cast
open _root_.InfoLossLARNativeSupplements.h20ee486b3d1dffd8.CurrentAFT.CyclePatternProgram renaming averagedEvaluate_cast → _p2mNativeSupplement116
open _root_.InfoLossLARNativeSupplements.hb37dd6f3dcea3b7d.CurrentAFT.CyclePatternProgram renaming evaluate_local → CurrentAFT.CyclePatternProgram.evaluate_local
open _root_.InfoLossLARNativeSupplements.hb37dd6f3dcea3b7d.CurrentAFT.CyclePatternProgram renaming evaluate_local → _p2mNativeSupplement117
open _root_.InfoLossLARNativeSupplements.h689ba464633d8cff.CurrentAFT.CyclePatternProgram renaming evaluate_semantics → CurrentAFT.CyclePatternProgram.evaluate_semantics
open _root_.InfoLossLARNativeSupplements.h689ba464633d8cff.CurrentAFT.CyclePatternProgram renaming evaluate_semantics → _p2mNativeSupplement118
open _root_.InfoLossLARNativeSupplements.hd02155c30f7ca58d.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_eq_windowEvaluate → CurrentAFT.CyclePatternProgram.gaussianEvaluate_eq_windowEvaluate
open _root_.InfoLossLARNativeSupplements.hd02155c30f7ca58d.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_eq_windowEvaluate → _p2mNativeSupplement119
open _root_.InfoLossLARNativeSupplements.hc532f8ed89f571a1.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_semantics → CurrentAFT.CyclePatternProgram.gaussianEvaluate_semantics
open _root_.InfoLossLARNativeSupplements.hc532f8ed89f571a1.CurrentAFT.CyclePatternProgram renaming gaussianEvaluate_semantics → _p2mNativeSupplement120
open _root_.InfoLossLARNativeSupplements.h3e1ece29cbe1b4d4.CurrentAFT.CyclePatternProgram renaming restricted_expectation → CurrentAFT.CyclePatternProgram.restricted_expectation
open _root_.InfoLossLARNativeSupplements.h3e1ece29cbe1b4d4.CurrentAFT.CyclePatternProgram renaming restricted_expectation → _p2mNativeSupplement121
open _root_.InfoLossLARNativeSupplements.h33993643e1712ab8.CurrentAFT.CycleRootExpansion renaming current_body_two_le → CurrentAFT.CycleRootExpansion.current_body_two_le
open _root_.InfoLossLARNativeSupplements.h33993643e1712ab8.CurrentAFT.CycleRootExpansion renaming current_body_two_le → _p2mNativeSupplement122
open _root_.InfoLossLARNativeSupplements.hd99e5f9e75bbb7e1.CurrentAFT.CycleSelections renaming averagedSelectedLaw_coordinate → CurrentAFT.CycleSelections.averagedSelectedLaw_coordinate
open _root_.InfoLossLARNativeSupplements.hd99e5f9e75bbb7e1.CurrentAFT.CycleSelections renaming averagedSelectedLaw_coordinate → _p2mNativeSupplement123
open _root_.InfoLossLARNativeSupplements.h788b7dba49e3cc6b.CurrentAFT.CycleSelections renaming selectedLaw_coordinate → CurrentAFT.CycleSelections.selectedLaw_coordinate
open _root_.InfoLossLARNativeSupplements.h788b7dba49e3cc6b.CurrentAFT.CycleSelections renaming selectedLaw_coordinate → _p2mNativeSupplement124
open _root_.InfoLossLARNativeSupplements.h8eafa7c1234de921.CurrentAFT.FullResponseEnumeration renaming mem_boundedSubsets → CurrentAFT.FullResponseEnumeration.mem_boundedSubsets
open _root_.InfoLossLARNativeSupplements.h8eafa7c1234de921.CurrentAFT.FullResponseEnumeration renaming mem_boundedSubsets → _p2mNativeSupplement125
open _root_.InfoLossLARNativeSupplements.h4d94229af05aca84.CurrentAFT.Parameters renaming modulus_eq_find → CurrentAFT.Parameters.modulus_eq_find
open _root_.InfoLossLARNativeSupplements.h4d94229af05aca84.CurrentAFT.Parameters renaming modulus_eq_find → _p2mNativeSupplement126
open _root_.InfoLossLARNativeSupplements.h7c8d9f04458b8eff.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal → CurrentAFT.ProtectedCycle.cycleLaw_marginal
open _root_.InfoLossLARNativeSupplements.h7c8d9f04458b8eff.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal → _p2mNativeSupplement127
open _root_.InfoLossLARNativeSupplements.ha0baf4dfdfb7707f.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal_of_two_le → CurrentAFT.ProtectedCycle.cycleLaw_marginal_of_two_le
open _root_.InfoLossLARNativeSupplements.ha0baf4dfdfb7707f.CurrentAFT.ProtectedCycle renaming cycleLaw_marginal_of_two_le → _p2mNativeSupplement128
open _root_.InfoLossLARNativeSupplements.h94f62847a0770621.CurrentAFT.ProtectedCycle renaming independent_pair_law → CurrentAFT.ProtectedCycle.independent_pair_law
open _root_.InfoLossLARNativeSupplements.h94f62847a0770621.CurrentAFT.ProtectedCycle renaming independent_pair_law → _p2mNativeSupplement129
open _root_.InfoLossLARNativeSupplements.h2021c53cebcb97f7.CurrentAFT.RationalScalarFamilyAverage renaming current_eq_window_sum → CurrentAFT.RationalScalarFamilyAverage.current_eq_window_sum
open _root_.InfoLossLARNativeSupplements.h2021c53cebcb97f7.CurrentAFT.RationalScalarFamilyAverage renaming current_eq_window_sum → _p2mNativeSupplement130
open _root_.InfoLossLARNativeSupplements.h6473fbae786c301e.CurrentAFT.RootSignedMassProgram renaming referenceEntry_cast → CurrentAFT.RootSignedMassProgram.referenceEntry_cast
open _root_.InfoLossLARNativeSupplements.h6473fbae786c301e.CurrentAFT.RootSignedMassProgram renaming referenceEntry_cast → _p2mNativeSupplement131
open _root_.InfoLossLARNativeSupplements.h4c23fa31c2a53a0c.CurrentAFT.RootSignedMassProgram renaming singleton_probability → CurrentAFT.RootSignedMassProgram.singleton_probability
open _root_.InfoLossLARNativeSupplements.h4c23fa31c2a53a0c.CurrentAFT.RootSignedMassProgram renaming singleton_probability → _p2mNativeSupplement132
open _root_.InfoLossLARNativeSupplements.hb738544899c1bf50.CurrentAFT.TensorPublicProjection renaming independent_decision_expectation → CurrentAFT.TensorPublicProjection.independent_decision_expectation
open _root_.InfoLossLARNativeSupplements.hb738544899c1bf50.CurrentAFT.TensorPublicProjection renaming independent_decision_expectation → _p2mNativeSupplement133
open _root_.InfoLossLARNativeSupplements.hf2382f7ddc8e222e.AFT.RationalNumerics renaming natAbs_finset_sum_le → AFT.RationalNumerics.natAbs_finset_sum_le
open _root_.InfoLossLARNativeSupplements.hf2382f7ddc8e222e.AFT.RationalNumerics renaming natAbs_finset_sum_le → _p2mNativeSupplement134
open _root_.InfoLossLARNativeSupplements.h707562ec4bd11ae8.AFT.RationalNumerics.HeightBound renaming reduced_le → AFT.RationalNumerics.HeightBound.reduced_le
open _root_.InfoLossLARNativeSupplements.h707562ec4bd11ae8.AFT.RationalNumerics.HeightBound renaming reduced_le → _p2mNativeSupplement135
open _root_.InfoLossLARNativeSupplements.hd70d55bab6f2346d.CurrentAFT.CountedBoundedRootTags renaming bounded_sum → CurrentAFT.CountedBoundedRootTags.bounded_sum
open _root_.InfoLossLARNativeSupplements.hd70d55bab6f2346d.CurrentAFT.CountedBoundedRootTags renaming bounded_sum → _p2mNativeSupplement136
open _root_.InfoLossLARNativeSupplements.hb84db39a2a2ae627.CurrentAFT.CountedBoundedRootTags renaming flatMap_attach → CurrentAFT.CountedBoundedRootTags.flatMap_attach
open _root_.InfoLossLARNativeSupplements.hb84db39a2a2ae627.CurrentAFT.CountedBoundedRootTags renaming flatMap_attach → _p2mNativeSupplement137
open _root_.InfoLossLARNativeSupplements.he91e90e23380c2d0.CurrentAFT.JointTaggedPhysicalFock renaming law_nonempty → CurrentAFT.JointTaggedPhysicalFock.law_nonempty
open _root_.InfoLossLARNativeSupplements.he91e90e23380c2d0.CurrentAFT.JointTaggedPhysicalFock renaming law_nonempty → _p2mNativeSupplement138
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryControlChoiceAverage
end CurrentAFT.BinaryControlChoiceAverage
namespace CurrentAFT.BinaryControlChoiceAverage.heightPolynomial
end CurrentAFT.BinaryControlChoiceAverage.heightPolynomial
namespace CurrentAFT.BinaryControlChoiceAverage.workPolynomial
end CurrentAFT.BinaryControlChoiceAverage.workPolynomial
namespace CurrentAFT.BinaryTwoPoolAverage
end CurrentAFT.BinaryTwoPoolAverage
namespace CurrentAFT.BinaryTwoPoolAverage.current
end CurrentAFT.BinaryTwoPoolAverage.current
set_option autoImplicit false
set_option maxHeartbeats 1200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! Full actual independent control-selection average. The generated primary
and ordinary populations are enumerated without replacement, all bounded
root tags are summed, and the exact native masses normalize the result. -/
namespace Integration9_9.TM2NativeChoiceAverage
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeFiniteSeries
open scoped BigOperators
attribute [local irreducible] BinaryFullResponseCounts.current TM2NativeFullResponseCounts.slots
Parameters.legCount BackgroundRates.ordinaryPool RationalFullResponseProgram.selected
abbrev Data := _root_.Integration9_9.TM2NativePackedRoot.Data
abbrev Request := _root_.Integration9_9.TM2NativePackedRoot.Request
def current (order r s : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeChoiceAverage.Request) : ℚ :=
_root_.Integration9_9.TM2NativeTwoPoolAverage.current r s (_root_.Integration9_9.TM2NativeSelectedResponse.current order r s arity)
(x,(_root_.Integration9_9.TM2NativeFullResponseCounts.slots .leg x.1.1.1,_root_.Integration9_9.TM2NativeFullResponseCounts.slots .ordinary x.1.1.1))
@[fun_prop] theorem current_poly (order r s : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : Poly (_root_.Integration9_9.TM2NativeChoiceAverage.current order r s arity) := by
have hs : Poly (_root_.Integration9_9.TM2NativeTwoPoolAverage.current r s (_root_.Integration9_9.TM2NativeSelectedResponse.current order r s arity)) :=
⟨_root_.Integration9_9.TM2NativeTwoPoolAverage.currentProgram r s (_root_.Integration9_9.TM2NativeSelectedResponse.currentProgram order r s arity)⟩
unfold _root_.Integration9_9.TM2NativeChoiceAverage.current
exact Poly.comp (f := _root_.Integration9_9.TM2NativeTwoPoolAverage.current r s (_root_.Integration9_9.TM2NativeSelectedResponse.current order r s arity))
(g := fun x : _root_.Integration9_9.TM2NativeChoiceAverage.Request=>(x,(_root_.Integration9_9.TM2NativeFullResponseCounts.slots .leg x.1.1.1,_root_.Integration9_9.TM2NativeFullResponseCounts.slots .ordinary x.1.1.1))) hs (by fun_prop)
noncomputable def currentProgram (order r s : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) :
PolyProgram Automatic.enc Ratio.encode (_root_.Integration9_9.TM2NativeChoiceAverage.current order r s arity) := (_root_.Integration9_9.TM2NativeChoiceAverage.current_poly order r s arity).program
theorem _root_.Integration9_9.TM2NativeChoiceAverage.cast_embedding_ofFn {first second count : ℕ} (same : first=second) (embedding : Fin count↪Fin first) :
(fun index=>Fin.cast same ((Vector.ofFn embedding).get index))=
((Equiv.embeddingCongr (Equiv.refl (Fin count)) (finCongr same) embedding) : Fin count→Fin second) := by
funext index
rw [Vector.get_ofFn]
rfl
theorem _root_.Integration9_9.TM2NativeChoiceAverage.actualChoice_ofFn (security r s : ℕ) (choice : _root_.CurrentAFT.BinaryControlChoiceAverage.Choice security r s)
(hp : Function.Injective (Vector.ofFn choice.1).get) (hb : Function.Injective (Vector.ofFn choice.2).get) :
_root_.CurrentAFT.BinaryRootMetadataSerializer.actualChoice (Vector.ofFn choice.1) (Vector.ofFn choice.2) hp hb=
_root_.CurrentAFT.BinaryControlChoiceAverage.choiceEquiv security r s choice := by
apply Prod.ext
· apply Function.Embedding.ext
intro index
exact congrFun (_root_.Integration9_9.TM2NativeChoiceAverage.cast_embedding_ofFn (_root_.CurrentAFT.BinaryFullResponseCounts.current_value security).1 choice.1) index
· apply Function.Embedding.ext
intro index
exact congrFun (_root_.Integration9_9.TM2NativeChoiceAverage.cast_embedding_ofFn (_root_.CurrentAFT.BinaryFullResponseCounts.current_value security).2.1 choice.2) index
theorem _root_.Integration9_9.TM2NativeChoiceAverage.choiceAverage_eq_sum (security bits order r s : ℕ) (queue : ℤ)
(sourcePrimary : Fin r→ℕ) (sourceBody : Fin s→ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order)
(inputs : Fin arity.val.1.val→ℕ) (centers : Fin arity.val.2.val→ℕ) :
_root_.CurrentAFT.RationalFullResponseProgram.choiceAverage security bits order r s queue sourcePrimary sourceBody arity inputs centers=
(∑choice : _root_.CurrentAFT.UniformTaggedOutput.Choice security r s,
_root_.CurrentAFT.RationalFullResponseProgram.selected bits order queue (_root_.CurrentAFT.RationalFullResponseProgram.selection security r s choice)
sourcePrimary sourceBody arity inputs centers)/
(((_root_.CurrentAFT.Parameters.legCount security).descFactorial r : ℚ)*((_root_.CurrentAFT.BackgroundRates.ordinaryPool security).descFactorial s : ℚ)) := by
have hp : _root_.CurrentAFT.CyclePatternProgram.selectionFintype (_root_.CurrentAFT.Parameters.legCount security) r=
(inferInstance : Fintype (Fin r↪Fin (_root_.CurrentAFT.Parameters.legCount security))) := Subsingleton.elim _ _
have hb : _root_.CurrentAFT.CyclePatternProgram.selectionFintype (_root_.CurrentAFT.BackgroundRates.ordinaryPool security) s=
(inferInstance : Fintype (Fin s↪Fin (_root_.CurrentAFT.BackgroundRates.ordinaryPool security))) := Subsingleton.elim _ _
unfold _root_.CurrentAFT.RationalFullResponseProgram.choiceAverage
rw [hp,hb]
theorem current_value (order r s : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeChoiceAverage.Request) : _root_.Integration9_9.TM2NativeChoiceAverage.current order r s arity x=
_root_.CurrentAFT.RationalFullResponseProgram.choiceAverage x.1.1.1.length x.1.1.2.length order r s x.1.2.1
(fun i=>x.1.2.2.1[i.val]?.getD 0) (fun i=>x.1.2.2.2[i.val]?.getD 0) arity
(fun i=>x.2.1[i.val]?.getD 0) (fun i=>x.2.2[i.val]?.getD 0) := by
classical
rw [_root_.Integration9_9.TM2NativeChoiceAverage.current,_root_.Integration9_9.TM2NativeTwoPoolAverage.current_value,_root_.Integration9_9.TM2NativeFullResponseCounts.slots_native_length,
_root_.Integration9_9.TM2NativeFullResponseCounts.slots_native_length]
change (∑primary : Fin r↪Fin (_root_.CurrentAFT.BinaryFullResponseCounts.current x.1.1.1.length).leg,
∑body : Fin s↪Fin (_root_.CurrentAFT.BinaryFullResponseCounts.current x.1.1.1.length).ordinary,
_root_.Integration9_9.TM2NativeSelectedResponse.current order r s arity
(x,(List.ofFn (fun i=>(primary i).val),List.ofFn (fun i=>(body i).val)))) /
(((_root_.CurrentAFT.BinaryFullResponseCounts.current x.1.1.1.length).leg.descFactorial r : ℚ)*
((_root_.CurrentAFT.BinaryFullResponseCounts.current x.1.1.1.length).ordinary.descFactorial s : ℚ))=_
have hden : (((_root_.CurrentAFT.BinaryFullResponseCounts.current x.1.1.1.length).leg.descFactorial r : ℚ)*
((_root_.CurrentAFT.BinaryFullResponseCounts.current x.1.1.1.length).ordinary.descFactorial s : ℚ))=
(((_root_.CurrentAFT.Parameters.legCount x.1.1.1.length).descFactorial r : ℚ)*((_root_.CurrentAFT.BackgroundRates.ordinaryPool x.1.1.1.length).descFactorial s : ℚ)) := by
rw [(_root_.CurrentAFT.BinaryFullResponseCounts.current_value x.1.1.1.length).1,
(_root_.CurrentAFT.BinaryFullResponseCounts.current_value x.1.1.1.length).2.1]
rw [hden,_root_.Integration9_9.TM2NativeChoiceAverage.choiceAverage_eq_sum]
apply congrArg (fun numerator : ℚ=>numerator/
(((_root_.CurrentAFT.Parameters.legCount x.1.1.1.length).descFactorial r : ℚ)*((_root_.CurrentAFT.BackgroundRates.ordinaryPool x.1.1.1.length).descFactorial s : ℚ)))
rw [←Fintype.sum_prod_type (fun choice : _root_.CurrentAFT.BinaryControlChoiceAverage.Choice x.1.1.1.length r s=>
_root_.Integration9_9.TM2NativeSelectedResponse.current order r s arity
(x,(List.ofFn (fun i=>(choice.1 i).val),List.ofFn (fun i=>(choice.2 i).val))))]
let value := fun choice : _root_.CurrentAFT.UniformTaggedOutput.Choice x.1.1.1.length r s=>
_root_.CurrentAFT.RationalFullResponseProgram.selected x.1.1.2.length order x.1.2.1
(_root_.CurrentAFT.RationalFullResponseProgram.selection x.1.1.1.length r s choice)
(fun i=>x.1.2.2.1[i.val]?.getD 0) (fun i=>x.1.2.2.2[i.val]?.getD 0) arity
(fun i=>x.2.1[i.val]?.getD 0) (fun i=>x.2.2[i.val]?.getD 0)
apply (Finset.sum_congr rfl (fun choice _=>?_)).trans
((_root_.CurrentAFT.BinaryControlChoiceAverage.choiceEquiv x.1.1.1.length r s).sum_comp value)
have hp : Function.Injective (Vector.ofFn choice.1).get := by
intro i j h
apply choice.1.injective
simpa only [Vector.get_ofFn] using h
have hb : Function.Injective (Vector.ofFn choice.2).get := by
intro i j h
apply choice.2.injective
simpa only [Vector.get_ofFn] using h
have h:=_root_.Integration9_9.TM2NativeSelectedResponse.current_value order arity x.1.1 x.1.2.1 x.1.2.2 x.2
(Vector.ofFn choice.1) (Vector.ofFn choice.2) hp hb
rw [_root_.Integration9_9.TM2NativeChoiceAverage.actualChoice_ofFn] at h
simpa only [_root_.Integration9_9.TM2NativeSelectedResponse.input,Vector.get_ofFn] using h
/-- The entire current choice-average table is polytime on arbitrary natural
source and output coordinates. Only the generated control choices are typed
finite populations; no numeric or physical hypothesis is required. -/
theorem currentIsPoly (order r s : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeChoiceAverage.Data=>
_root_.CurrentAFT.RationalFullResponseProgram.choiceAverage x.1.1.length x.1.2.length order r s x.2.1
(fun i=>x.2.2.1[i.val]?.getD 0) (fun i=>x.2.2.2[i.val]?.getD 0)) := by
intro arity
exact ⟨(_root_.Integration9_9.TM2NativeChoiceAverage.currentProgram order r s arity).congr _ (_root_.Integration9_9.TM2NativeChoiceAverage.current_value order r s arity)⟩
end Integration9_9.TM2NativeChoiceAverage
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.CurrentMaterializedCompletion
end CurrentAFT.CurrentMaterializedCompletion
namespace CurrentAFT.CurrentMaterializedCompletion.Result
end CurrentAFT.CurrentMaterializedCompletion.Result
namespace CurrentAFT.CurrentMaterializedCompletion.Result.mk
end CurrentAFT.CurrentMaterializedCompletion.Result.mk
namespace CurrentAFT.CurrentMaterializedCompletion.complete
end CurrentAFT.CurrentMaterializedCompletion.complete
namespace CurrentAFT.CurrentMaterializedCompletion.workPolynomial
end CurrentAFT.CurrentMaterializedCompletion.workPolynomial
set_option autoImplicit false
set_option maxHeartbeats 2000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeCompletion
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal
abbrev Meta := (List Unit × List Unit) × List Unit
abbrev Tapes := List _root_.Integration9_9.TM2NativeFlagDraw.Tape × List Bool
abbrev Input := (_root_.Integration9_9.TM2NativeCompletion.Meta × _root_.Integration9_9.TM2NativePublicRejection.State) × _root_.Integration9_9.TM2NativeCompletion.Tapes
attribute [local irreducible] TM2NativeCharts.current TM2NativePublicSeed.edgeDraw
CurrentMaterializedCompletion.complete CurrentChartsDraw.drawStored
def current (x : _root_.Integration9_9.TM2NativeCompletion.Input) : _root_.Integration9_9.TM2NativeEmitter.State :=
if x.1.2.1 then
(true,(x.1.2.2,(_root_.Integration9_9.TM2NativeCharts.current ((x.1.1.1,x.1.2.2),x.2.1),
_root_.Integration9_9.TM2NativePublicSeed.edgeDraw ((x.1.1.1.1,x.1.1.2),x.2.2))))
else (false,default)
def tapesData {security bits edgeBits : ℕ} (word : _root_.CurrentAFT.CurrentPublicCompletion.Tapes security bits edgeBits) : _root_.Integration9_9.TM2NativeCompletion.Tapes :=
(List.ofFn (fun i=>_root_.Integration9_9.TM2NativeFlagDraw.tapeData (word.1 i)),List.ofFn (fun i=>_root_.AFT.BinaryArithmetic.digitBoolean (word.2 i)))
end Integration9_9.TM2NativeCompletion
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryFullResponseProgram
end CurrentAFT.BinaryFullResponseProgram
set_option autoImplicit false
set_option maxHeartbeats 1200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! The entire actual full response and defect matrix entry. Background
population products and distinct control choices share a single Gaussian
queue; the point basis is then subtracted. All numerical data and metadata
are generated by the real machine programs in this import closure. -/
namespace Integration9_9.TM2NativeFullResponse
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeFiniteSeries
open scoped BigOperators
attribute [local irreducible] PublicParameterProgram.modulus BinaryFullResponseCounts.current
RationalFullResponseProgram.choiceAverage RationalFullResponseProgram.fixedQueue
RationalFullResponseProgram.response RationalFullResponseProgram.selected
abbrev Meta := _root_.Integration9_9.TM2NativePackedRoot.Meta
abbrev Data := _root_.Integration9_9.TM2NativeFullResponse.Meta×(List ℕ×List ℕ)
abbrev Request := _root_.Integration9_9.TM2NativeRootGroupAlgebra.Query _root_.Integration9_9.TM2NativeFullResponse.Data
abbrev QueueInput := (_root_.Integration9_9.TM2NativeFullResponse.Meta×((List ℕ×List ℕ)×(List ℕ×List ℕ)))×ℤ
theorem fixedQueueIsPoly (order r s : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (fun x : _root_.Integration9_9.TM2NativeChoiceAverage.Data=>
_root_.CurrentAFT.RationalFullResponseProgram.fixedQueue x.1.1.length x.1.2.length order r s x.2.1
(fun i=>x.2.2.1[i.val]?.getD 0) (fun i=>x.2.2.2[i.val]?.getD 0)) := by
unfold _root_.CurrentAFT.RationalFullResponseProgram.fixedQueue
exact ((_root_.Integration9_9.TM2NativeBackgroundPopulation.currentIsPoly order).comp
(g := fun x : _root_.Integration9_9.TM2NativeChoiceAverage.Data=>(x.1,x.2.1)) (by fun_prop)).product
(_root_.Integration9_9.TM2NativeChoiceAverage.currentIsPoly order r s)
def queueLeaf (order r s : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeFullResponse.QueueInput) : ℚ :=
_root_.CurrentAFT.RationalFullResponseProgram.fixedQueue x.1.1.1.length x.1.1.2.length order r s x.2
(fun i=>x.1.2.1.1[i.val]?.getD 0) (fun i=>x.1.2.1.2[i.val]?.getD 0) arity
(fun i=>x.1.2.2.1[i.val]?.getD 0) (fun i=>x.1.2.2.2[i.val]?.getD 0)
@[fun_prop] theorem queueLeaf_poly (order r s : ℕ) (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : Poly (_root_.Integration9_9.TM2NativeFullResponse.queueLeaf order r s arity) := by
exact Poly.comp (f := _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (fun x : _root_.Integration9_9.TM2NativeChoiceAverage.Data=>
_root_.CurrentAFT.RationalFullResponseProgram.fixedQueue x.1.1.length x.1.2.length order r s x.2.1
(fun i=>x.2.2.1[i.val]?.getD 0) (fun i=>x.2.2.2[i.val]?.getD 0)) arity)
(g := fun x : _root_.Integration9_9.TM2NativeFullResponse.QueueInput=>((x.1.1,(x.2,x.1.2.1)),x.1.2.2))
(_root_.Integration9_9.TM2NativeFullResponse.fixedQueueIsPoly order r s arity) (by fun_prop)
def response (order r s : ℕ) (x : _root_.Integration9_9.TM2NativeFullResponse.Data) : _root_.CurrentAFT.RationalFamilyProductProgram.Table ℚ ℕ ℕ order :=
_root_.CurrentAFT.RationalFullResponseProgram.response x.1.1.length x.1.2.length order r s
(fun i=>x.2.1[i.val]?.getD 0) (fun i=>x.2.2[i.val]?.getD 0)
theorem responseIsPoly (order r s : ℕ) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (_root_.Integration9_9.TM2NativeFullResponse.response order r s) := by
intro arity
have hleaf:=_root_.Integration9_9.TM2NativeFullResponse.queueLeaf_poly order r s arity
have ha:=_root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage_poly false hleaf
have h : Poly (fun x : _root_.Integration9_9.TM2NativeFullResponse.Request=>_root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage false
(_root_.Integration9_9.TM2NativeFullResponse.queueLeaf order r s arity) (x.1.1,(x.1.2,x.2))) :=
Poly.comp (f := _root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage false (_root_.Integration9_9.TM2NativeFullResponse.queueLeaf order r s arity))
(g := fun x : _root_.Integration9_9.TM2NativeFullResponse.Request=>(x.1.1,(x.1.2,x.2))) ha (by fun_prop)
refine ⟨h.program.congr _ (fun x=>?_)⟩
rw [_root_.Integration9_9.TM2NativeRootGroupGaussian.windowAverage_eq_window]
unfold _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate _root_.Integration9_9.TM2NativeFullResponse.response _root_.CurrentAFT.RationalFullResponseProgram.response
rw [_root_.InfoLossLARNativeSupplements.h2021c53cebcb97f7.CurrentAFT.RationalScalarFamilyAverage.current_eq_window_sum]
rfl
def basis (order : ℕ) (source : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeFullResponse.Data) : _root_.CurrentAFT.RationalFamilyProductProgram.Table ℚ ℕ ℕ order :=
_root_.CurrentAFT.RationalFullResponseProgram.basis x.1.1.length x.1.2.length order source
(fun i=>x.2.1[i.val]?.getD 0) (fun i=>x.2.2[i.val]?.getD 0)
theorem basisIsPoly (order : ℕ) (source : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (_root_.Integration9_9.TM2NativeFullResponse.basis order source) := by
intro arity
unfold _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate _root_.Integration9_9.TM2NativeFullResponse.basis
by_cases h : arity=source
· subst arity
have hp : Poly (fun x : _root_.Integration9_9.TM2NativeFullResponse.Request=>_root_.Integration9_9.TM2NativeWeightedPoint.current source.val.1.val source.val.2.val
(x.1.1,((x.1.2.1,x.2.1),(x.1.2.2,x.2.2)))) :=
Poly.comp (f := _root_.Integration9_9.TM2NativeWeightedPoint.current source.val.1.val source.val.2.val)
(g := fun x : _root_.Integration9_9.TM2NativeFullResponse.Request=>(x.1.1,((x.1.2.1,x.2.1),(x.1.2.2,x.2.2))))
(_root_.Integration9_9.TM2NativeWeightedPoint.current_poly source.val.1.val source.val.2.val) (by fun_prop)
simp [_root_.CurrentAFT.RationalFullResponseProgram.basis]
simpa only [_root_.Integration9_9.TM2NativeWeightedPoint.current] using hp
· simp only [_root_.CurrentAFT.RationalFullResponseProgram.basis,dif_neg h]
exact Automatic.Poly.const 0
def defect (order : ℕ) (source : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeFullResponse.Data) : _root_.CurrentAFT.RationalFamilyProductProgram.Table ℚ ℕ ℕ order :=
_root_.CurrentAFT.RationalFullResponseProgram.defect x.1.1.length x.1.2.length order source
(fun i=>x.2.1[i.val]?.getD 0) (fun i=>x.2.2[i.val]?.getD 0)
theorem defectIsPoly (order : ℕ) (source : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : _root_.Integration9_9.TM2NativeRootGroupAlgebra.IsPoly order (_root_.Integration9_9.TM2NativeFullResponse.defect order source) :=
(_root_.Integration9_9.TM2NativeFullResponse.responseIsPoly order source.val.1.val source.val.2.val).sub (_root_.Integration9_9.TM2NativeFullResponse.basisIsPoly order source)
structure Context (order : ℕ) (source output : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) where
security : List Unit
precision : List Unit
sourcePrimary : Vector (_root_.CurrentAFT.BinaryFullResponseProgram.Color security.length) source.val.1.val
sourceBody : Vector (_root_.CurrentAFT.BinaryFullResponseProgram.Color security.length) source.val.2.val
inputs : Vector ℕ output.val.1.val
centers : Vector ℕ output.val.2.val
input_bound : ∀i,inputs.get i<_root_.CurrentAFT.BinaryFirstInverseProgram.colors security.length
center_bound : ∀i,centers.get i<_root_.CurrentAFT.BinaryFirstInverseProgram.colors security.length
end Integration9_9.TM2NativeFullResponse
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryCounterTupleDecode
end CurrentAFT.BinaryCounterTupleDecode
namespace CurrentAFT.BinaryCounterTupleDecode.append
end CurrentAFT.BinaryCounterTupleDecode.append
namespace CurrentAFT.BinaryCounterTupleDecode.current
end CurrentAFT.BinaryCounterTupleDecode.current
namespace CurrentAFT.BinaryCounterTupleDecode.current.match_1
end CurrentAFT.BinaryCounterTupleDecode.current.match_1
namespace CurrentAFT.BinaryCounterTupleDecode.workBound
end CurrentAFT.BinaryCounterTupleDecode.workBound
set_option autoImplicit false
set_option maxHeartbeats 500000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
/-! Fixed-degree base-q tuple decoding by actual division/remainder machines.
The first stored coordinate is the most significant digit, matching the
native rectangular calibration addresses. -/
namespace Integration9_9.TM2NativeRadix
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
abbrev Input := ℕ×ℕ
def digits : ℕ→_root_.Integration9_9.TM2NativeRadix.Input→List ℕ
| 0,_=>[]
| count+1,x=>digits count (x.1,x.2/x.1)++[x.2%x.1]
@[fun_prop] theorem digits_poly (count : ℕ) : Poly (_root_.Integration9_9.TM2NativeRadix.digits count) := by
induction count with
| zero => exact Automatic.Poly.const []
| succ count ih =>
change Poly (fun x : _root_.Integration9_9.TM2NativeRadix.Input=>_root_.Integration9_9.TM2NativeRadix.digits count (x.1,x.2/x.1)++[x.2%x.1])
fun_prop
theorem digits_value (base count code : ℕ) (hb : 0<base) : _root_.Integration9_9.TM2NativeRadix.digits count (base,code)=
List.ofFn (fun i=>(_root_.CurrentAFT.WeightCoordinates.tupleDecode base hb count code i).val) := by
induction count generalizing code with
| zero => rfl
| succ count ih =>
rw [_root_.Integration9_9.TM2NativeRadix.digits,ih,List.ofFn_succ_last]
simp only [_root_.CurrentAFT.WeightCoordinates.tupleDecode,Fin.lastCases_castSucc,Fin.lastCases_last]
end Integration9_9.TM2NativeRadix
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryRectangleDecode
end CurrentAFT.BinaryRectangleDecode
namespace CurrentAFT.BinaryRectangleDecode.Data
end CurrentAFT.BinaryRectangleDecode.Data
namespace CurrentAFT.BinaryRectangleDecode.Data.mk
end CurrentAFT.BinaryRectangleDecode.Data.mk
namespace CurrentAFT.BinaryRectangleDecode.Data.point
end CurrentAFT.BinaryRectangleDecode.Data.point
namespace CurrentAFT.BinaryRectangleDecode.safeWord
end CurrentAFT.BinaryRectangleDecode.safeWord
namespace CurrentAFT.RectanglePointIndex
end CurrentAFT.RectanglePointIndex
namespace CurrentAFT.RectanglePointIndex.encode
end CurrentAFT.RectanglePointIndex.encode
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! Actual arithmetic rectangular decoding with fixed-arity machine dispatch.
The decoder computes radix words, tests capacity and every safe body color,
and invokes one implemented leaf or returns zero. -/
namespace Integration9_9.TM2NativeRectangleDecode
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeFiniteSeries TM2NativeSliceProbability
open scoped BigOperators
abbrev Numbers := (ℕ×ℕ)×(ℕ×ℕ)
abbrev Input (α : Type) := α×_root_.Integration9_9.TM2NativeRectangleDecode.Numbers
abbrev Words := List ℕ×List ℕ
def primary {α : Type} {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α) : List ℕ :=
_root_.Integration9_9.TM2NativeRadix.digits arity.val.1.val (x.2.1.1,x.2.2.2/x.2.1.1^arity.val.2.val)
def body {α : Type} {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α) : List ℕ :=
_root_.Integration9_9.TM2NativeRadix.digits arity.val.2.val (x.2.1.1,x.2.2.2%x.2.1.1^arity.val.2.val)
@[fun_prop] theorem primary_poly {α : Type} [Coding α] {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : Poly (_root_.Integration9_9.TM2NativeRectangleDecode.primary (α := α) arity) := by unfold _root_.Integration9_9.TM2NativeRectangleDecode.primary;fun_prop
@[fun_prop] theorem body_poly {α : Type} [Coding α] {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : Poly (_root_.Integration9_9.TM2NativeRectangleDecode.body (α := α) arity) := by unfold _root_.Integration9_9.TM2NativeRectangleDecode.body;fun_prop
def Valid {α : Type} {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α) : Prop :=
x.2.2.1=_root_.CurrentAFT.WeightCoordinates.arityCode order arity.val.1.val arity.val.2.val ∧
x.2.2.2<x.2.1.1^(arity.val.1.val+arity.val.2.val) ∧
∀i : Fin arity.val.2.val,x.2.1.2≤(_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)[i.val]?.getD 0 ∧
(_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)[i.val]?.getD 0+x.2.1.2<x.2.1.1
instance validDecidable {α : Type} {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α) : Decidable (_root_.Integration9_9.TM2NativeRectangleDecode.Valid arity x) := by unfold _root_.Integration9_9.TM2NativeRectangleDecode.Valid;infer_instance
@[fun_prop] theorem valid_poly {α : Type} [Coding α] {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) :
Poly (fun x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α=>decide (_root_.Integration9_9.TM2NativeRectangleDecode.Valid arity x)) := by
have hs : Poly (fun x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α=>decide (∀i : Fin arity.val.2.val,
x.2.1.2≤(_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)[i.val]?.getD 0 ∧ (_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)[i.val]?.getD 0+x.2.1.2<x.2.1.1)) := by
have h:=_root_.Integration9_9.TM2NativePackedRoot.finite_all_poly (Finset.univ : Finset (Fin arity.val.2.val))
(fun i (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α)=>x.2.1.2≤(_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)[i.val]?.getD 0 ∧ (_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)[i.val]?.getD 0+x.2.1.2<x.2.1.1)
(fun i _=>by fun_prop)
simpa only [Finset.mem_univ,forall_const] using h
unfold _root_.Integration9_9.TM2NativeRectangleDecode.Valid
fun_prop
def current {α : Type} (order : ℕ) (leaf : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order→α×_root_.Integration9_9.TM2NativeRectangleDecode.Words→ℚ) (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α) : ℚ :=
∑arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order,if _root_.Integration9_9.TM2NativeRectangleDecode.Valid arity x then leaf arity (x.1,(_root_.Integration9_9.TM2NativeRectangleDecode.primary arity x,_root_.Integration9_9.TM2NativeRectangleDecode.body arity x)) else 0
noncomputable def currentProgram {α : Type} [Coding α] (order : ℕ) {leaf : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order→α×_root_.Integration9_9.TM2NativeRectangleDecode.Words→ℚ}
(machines : ∀arity,PolyProgram Automatic.enc Ratio.encode (leaf arity)) :
PolyProgram Automatic.enc Ratio.encode (_root_.Integration9_9.TM2NativeRectangleDecode.current order leaf) := by
have hp : Poly (_root_.Integration9_9.TM2NativeRectangleDecode.current order leaf) := by
unfold _root_.Integration9_9.TM2NativeRectangleDecode.current
apply _root_.Integration9_9.TM2NativeRootGroupAlgebra.finite_sum_poly
intro arity _
have hleaf : Poly (leaf arity) := ⟨machines arity⟩
have htest:=_root_.Integration9_9.TM2NativeRectangleDecode.valid_poly (α := α) arity
have hv : Poly (fun x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α=>leaf arity (x.1,(_root_.Integration9_9.TM2NativeRectangleDecode.primary arity x,_root_.Integration9_9.TM2NativeRectangleDecode.body arity x))) :=
Poly.comp (f := leaf arity) (g := fun x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α=>(x.1,(_root_.Integration9_9.TM2NativeRectangleDecode.primary arity x,_root_.Integration9_9.TM2NativeRectangleDecode.body arity x))) hleaf (by fun_prop)
exact Poly.ite_prop htest hv (Automatic.Poly.const 0)
exact hp.program
def branchData {α : Type} {order : ℕ} (arity : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeRectangleDecode.Input α)
(hb : 0<x.2.1.1) (h : _root_.Integration9_9.TM2NativeRectangleDecode.Valid arity x) : _root_.CurrentAFT.BinaryRectangleDecode.Data x.2.1.1 order x.2.1.2 where
arity:=arity
primary:=Vector.ofFn (_root_.CurrentAFT.WeightCoordinates.tupleDecode x.2.1.1 hb arity.val.1.val (x.2.2.2/x.2.1.1^arity.val.2.val))
body:=Vector.ofFn (_root_.CurrentAFT.WeightCoordinates.tupleDecode x.2.1.1 hb arity.val.2.val (x.2.2.2%x.2.1.1^arity.val.2.val))
safe:=by
intro i
have hi:=h.2.2 i
rw [_root_.Integration9_9.TM2NativeRectangleDecode.body,_root_.Integration9_9.TM2NativeRadix.digits_value _ _ _ hb] at hi
simpa only [Vector.get_ofFn,List.getElem?_ofFn,Fin.isLt,dif_pos,Option.getD_some] using hi
end Integration9_9.TM2NativeRectangleDecode
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryFullResponseMatrixEntry
end CurrentAFT.BinaryFullResponseMatrixEntry
namespace CurrentAFT.BinaryFullResponseMatrixEntry.validEntry
end CurrentAFT.BinaryFullResponseMatrixEntry.validEntry
set_option autoImplicit false
set_option maxHeartbeats 1200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! Entire full-response rectangular matrix entry from two flat binary
addresses. Both addresses are actually divided and radix decoded; safe
colors and padding are tested before the entire response machine is run. -/
namespace Integration9_9.TM2NativeFullResponseMatrix
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeFiniteSeries
open scoped BigOperators
attribute [local irreducible] PublicParameterProgram.modulus
BinaryFullResponseProgram.current RationalFullResponseProgram.defect
abbrev Meta := _root_.Integration9_9.TM2NativeFullResponse.Meta
abbrev Words := _root_.Integration9_9.TM2NativeRectangleDecode.Words
abbrev Input := _root_.Integration9_9.TM2NativeFullResponseMatrix.Meta×(ℕ×ℕ)
def colors (xs : List Unit) : ℕ := (_root_.CurrentAFT.CurrentReferenceDraw.counts xs.length).colors
@[fun_prop] theorem colors_poly : Poly _root_.Integration9_9.TM2NativeFullResponseMatrix.colors := by
refine ⟨_root_.Integration9_9.TM2NativePrime.modulusProgram.congr _ (fun xs=>?_)⟩
exact _root_.Integration9_9.TM2NativePrime.modulus_native xs
def margin (xs : List Unit) : ℕ := (_root_.CurrentAFT.CurrentReferenceDraw.counts xs.length).margin
@[fun_prop] theorem margin_poly : Poly _root_.Integration9_9.TM2NativeFullResponseMatrix.margin := by
refine ⟨_root_.Integration9_9.TM2NativeBody.margin_poly.program.congr _ (fun xs=>?_)⟩
exact (_root_.Integration9_9.TM2NativeBody.margin_value xs).trans (_root_.CurrentAFT.CurrentBinaryRectangleDecode.margin_eq xs.length).symm
def columns (order : ℕ) (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeFullResponseMatrix.colors xs^order
@[fun_prop] theorem columns_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order) := by unfold _root_.Integration9_9.TM2NativeFullResponseMatrix.columns;fun_prop
abbrev SourceInput := (_root_.Integration9_9.TM2NativeFullResponseMatrix.Meta×_root_.Integration9_9.TM2NativeFullResponseMatrix.Words)×_root_.Integration9_9.TM2NativeFullResponseMatrix.Words
def sourceLeaf (order : ℕ) (output source : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeFullResponseMatrix.SourceInput) : ℚ :=
_root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (_root_.Integration9_9.TM2NativeFullResponse.defect order source) output ((x.1.1,x.2),x.1.2)
@[fun_prop] theorem sourceLeaf_poly (order : ℕ) (output source : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : Poly (_root_.Integration9_9.TM2NativeFullResponseMatrix.sourceLeaf order output source) := by
unfold _root_.Integration9_9.TM2NativeFullResponseMatrix.sourceLeaf
exact Poly.comp (f := _root_.Integration9_9.TM2NativeRootGroupAlgebra.evaluate (_root_.Integration9_9.TM2NativeFullResponse.defect order source) output)
(g := fun x : _root_.Integration9_9.TM2NativeFullResponseMatrix.SourceInput=>((x.1.1,x.2),x.1.2))
(_root_.Integration9_9.TM2NativeFullResponse.defectIsPoly order source output) (by fun_prop)
abbrev OutputInput := (_root_.Integration9_9.TM2NativeFullResponseMatrix.Meta×ℕ)×_root_.Integration9_9.TM2NativeFullResponseMatrix.Words
def outputLeaf (order : ℕ) (output : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) (x : _root_.Integration9_9.TM2NativeFullResponseMatrix.OutputInput) : ℚ :=
_root_.Integration9_9.TM2NativeRectangleDecode.current order (_root_.Integration9_9.TM2NativeFullResponseMatrix.sourceLeaf order output)
((x.1.1,x.2),((_root_.Integration9_9.TM2NativeFullResponseMatrix.colors x.1.1.1,_root_.Integration9_9.TM2NativeFullResponseMatrix.margin x.1.1.1),
(x.1.2/_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1.1,x.1.2%_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1.1)))
@[fun_prop] theorem outputLeaf_poly (order : ℕ) (output : _root_.CurrentAFT.GradedControlAlgebra.TruncatedArity order) : Poly (_root_.Integration9_9.TM2NativeFullResponseMatrix.outputLeaf order output) := by
have h : Poly (_root_.Integration9_9.TM2NativeRectangleDecode.current order (_root_.Integration9_9.TM2NativeFullResponseMatrix.sourceLeaf order output)) :=
⟨_root_.Integration9_9.TM2NativeRectangleDecode.currentProgram order (fun source=>(_root_.Integration9_9.TM2NativeFullResponseMatrix.sourceLeaf_poly order output source).program)⟩
unfold _root_.Integration9_9.TM2NativeFullResponseMatrix.outputLeaf
exact Poly.comp (f := _root_.Integration9_9.TM2NativeRectangleDecode.current order (_root_.Integration9_9.TM2NativeFullResponseMatrix.sourceLeaf order output))
(g := fun x : _root_.Integration9_9.TM2NativeFullResponseMatrix.OutputInput=>((x.1.1,x.2),((_root_.Integration9_9.TM2NativeFullResponseMatrix.colors x.1.1.1,_root_.Integration9_9.TM2NativeFullResponseMatrix.margin x.1.1.1),
(x.1.2/_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1.1,x.1.2%_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1.1)))) h (by fun_prop)
def current (order : ℕ) (x : _root_.Integration9_9.TM2NativeFullResponseMatrix.Input) : ℚ :=
_root_.Integration9_9.TM2NativeRectangleDecode.current order (_root_.Integration9_9.TM2NativeFullResponseMatrix.outputLeaf order)
((x.1,x.2.2),((_root_.Integration9_9.TM2NativeFullResponseMatrix.colors x.1.1,_root_.Integration9_9.TM2NativeFullResponseMatrix.margin x.1.1),(x.2.1/_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1,x.2.1%_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1)))
@[fun_prop] theorem current_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeFullResponseMatrix.current order) := by
have h : Poly (_root_.Integration9_9.TM2NativeRectangleDecode.current order (_root_.Integration9_9.TM2NativeFullResponseMatrix.outputLeaf order)) :=
⟨_root_.Integration9_9.TM2NativeRectangleDecode.currentProgram order (fun output=>(_root_.Integration9_9.TM2NativeFullResponseMatrix.outputLeaf_poly order output).program)⟩
unfold _root_.Integration9_9.TM2NativeFullResponseMatrix.current
exact Poly.comp (f := _root_.Integration9_9.TM2NativeRectangleDecode.current order (_root_.Integration9_9.TM2NativeFullResponseMatrix.outputLeaf order))
(g := fun x : _root_.Integration9_9.TM2NativeFullResponseMatrix.Input=>((x.1,x.2.2),((_root_.Integration9_9.TM2NativeFullResponseMatrix.colors x.1.1,_root_.Integration9_9.TM2NativeFullResponseMatrix.margin x.1.1),
(x.2.1/_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1,x.2.1%_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1)))) h (by fun_prop)
structure Context (order : ℕ) where
security : List Unit
precision : List Unit
output : Fin (_root_.CurrentAFT.BinaryRectangleMaterialization.Size security.length order)
source : Fin (_root_.CurrentAFT.BinaryRectangleMaterialization.Size security.length order)
end Integration9_9.TM2NativeFullResponseMatrix
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryRectangleIteration
end CurrentAFT.BinaryRectangleIteration
namespace CurrentAFT.BinaryRectangleIteration.entry
end CurrentAFT.BinaryRectangleIteration.entry
namespace CurrentAFT.BinaryRectangleIteration.entryWork
end CurrentAFT.BinaryRectangleIteration.entryWork
namespace CurrentAFT.BinaryRectangleIteration.position
end CurrentAFT.BinaryRectangleIteration.position
namespace CurrentAFT.BinaryRectangleIteration.reshape
end CurrentAFT.BinaryRectangleIteration.reshape
namespace CurrentAFT.BinaryRectangleIteration.reshapePolynomial
end CurrentAFT.BinaryRectangleIteration.reshapePolynomial
namespace CurrentAFT.BinaryRectangleIteration.reshapeWork
end CurrentAFT.BinaryRectangleIteration.reshapeWork
namespace CurrentAFT.BinaryRectangleIteration.run
end CurrentAFT.BinaryRectangleIteration.run
namespace CurrentAFT.BinaryRectangleIteration.workPolynomial
end CurrentAFT.BinaryRectangleIteration.workPolynomial
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! Direct compilation of BinaryRectangleIteration.run. The number of retained
rows is fixed with the calibration order. Dynamic column lengths only control
bounded list slices, not the generation of a binary-sized range. -/
namespace Integration9_9.TM2NativeRectangle
open AFT.BinaryArithmetic
open OAI.MetricKMedian.Binary
open OAI.MetricKMedian.Binary.Automatic
open TM2NativeIteration (vectorCode)
def chunks (rows : ℕ) (x : ℕ × List ℚ) : List (List ℚ) :=
(List.range rows).map (fun row => (x.2.drop (x.1*row)).take x.1)
def rowSlice (x : (ℕ × List ℚ) × ℕ) : List ℚ := (x.1.2.drop (x.1.1*x.2)).take x.1.1
noncomputable def _root_.Integration9_9.TM2NativeRectangle.rowProgram :
PolyProgram (encodePair (encodePair Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode) Nat.bits) _root_.Integration9_9.TM2NativeIteration.vectorCode _root_.Integration9_9.TM2NativeRectangle.rowSlice := by
let context := PolyProgram.fst (encodePair Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode) Nat.bits
let index := PolyProgram.snd (encodePair Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode) Nat.bits
let columns := context.comp (PolyProgram.fst Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode)
let values := context.comp (PolyProgram.snd Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode)
let offset := (columns.fanout index).comp PolyProgram.natMul
let dropped := (values.fanout offset).comp (PolyProgram.listDrop Ratio.encode 0)
exact ((dropped.fanout columns).comp (PolyProgram.listTake Ratio.encode 0)).congr _ (fun _ => rfl)
noncomputable def chunksProgram (rows : ℕ) :
PolyProgram (encodePair Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode) (encodeList _root_.Integration9_9.TM2NativeIteration.vectorCode) (_root_.Integration9_9.TM2NativeRectangle.chunks rows) := by
let start := (PolyProgram.identity (encodePair Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode)).fanout
(PolyProgram.constant (encodePair Nat.bits _root_.Integration9_9.TM2NativeIteration.vectorCode) (encodeList Nat.bits) (List.range rows))
exact (start.comp (_root_.Integration9_9.TM2NativeRectangle.rowProgram.listMapWith 0 [])).congr _ (fun _ => rfl)
structure Request (rows : ℕ) where
columns : ℕ
matrix : Vector (Vector _root_.AFT.BinaryArithmetic.RationalBits (rows*columns)) (rows*columns)
rhs : Vector _root_.AFT.BinaryArithmetic.RationalBits (rows*columns)
ticks : List Unit
end Integration9_9.TM2NativeRectangle
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.ActualConstructiveSampler
end CurrentAFT.ActualConstructiveSampler
namespace CurrentAFT.ActualConstructiveSampler.law
end CurrentAFT.ActualConstructiveSampler.law
namespace CurrentAFT.ActualConstructiveSampler.run
end CurrentAFT.ActualConstructiveSampler.run
namespace CurrentAFT.ActualConstructiveSampler.workPolynomial
end CurrentAFT.ActualConstructiveSampler.workPolynomial
namespace CurrentAFT.PublicAffinePipeline
end CurrentAFT.PublicAffinePipeline
namespace CurrentAFT.PublicAffinePipeline.addWork
end CurrentAFT.PublicAffinePipeline.addWork
namespace CurrentAFT.PublicAffinePipeline.fairBitRun
end CurrentAFT.PublicAffinePipeline.fairBitRun
namespace CurrentAFT.PublicAffinePipeline.fairGaussian
end CurrentAFT.PublicAffinePipeline.fairGaussian
set_option autoImplicit false
set_option maxHeartbeats 1400000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
/-! The entire calibration-table producer: actual dimensions, all square
matrix entries, the real scalar right-hand side, bounded iteration, and the
retained rectangular table. Only security/precision/unary iteration buffers
are inputs; no precomputed matrix, numerical height, or time bound is assumed. -/
namespace Integration9_9.TM2NativeProducer
open AFT AFT.RationalNumerics AFT.BinaryArithmetic CurrentAFT GradedControlAlgebra
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeRootGroupAlgebra TM2NativeFiniteSeries
open scoped BigOperators
attribute [local irreducible] PublicParameterProgram.modulus CurrentProposalDimensions.current
BinaryFullResponseMatrixEntry.current TM2NativeFullResponseMatrix.current
abbrev Meta := _root_.Integration9_9.TM2NativeFullResponseMatrix.Meta
abbrev Input := _root_.Integration9_9.TM2NativeProducer.Meta×List Unit
def columnSlots (order : ℕ) (xs : List Unit) : List Unit :=
_root_.Integration9_9.TM2NativePrime.powerSlots order (_root_.Integration9_9.TM2NativeBodyKernel.paletteTicks xs)
@[fun_prop] theorem columnSlots_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeProducer.columnSlots order) := by unfold _root_.Integration9_9.TM2NativeProducer.columnSlots;fun_prop
def slots (order : ℕ) (xs : List Unit) : List Unit :=
(List.replicate ((order+1)^2) ()).flatMap (fun _=>_root_.Integration9_9.TM2NativeProducer.columnSlots order xs)
@[fun_prop] theorem slots_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeProducer.slots order) := by unfold _root_.Integration9_9.TM2NativeProducer.slots;fun_prop
theorem columnSlots_length (order : ℕ) (xs : List Unit) :
(_root_.Integration9_9.TM2NativeProducer.columnSlots order xs).length=(_root_.CurrentAFT.CurrentRectangleIndex.colors xs.length)^order := by
rw [_root_.Integration9_9.TM2NativeProducer.columnSlots,_root_.Integration9_9.TM2NativePrime.powerSlots_length,_root_.Integration9_9.TM2NativeBodyKernel.paletteTicks_length,
_root_.CurrentAFT.CurrentRectangleIndex.colors_eq]
theorem slots_length (order : ℕ) (xs : List Unit) : (_root_.Integration9_9.TM2NativeProducer.slots order xs).length=_root_.CurrentAFT.BinaryRectangleMaterialization.Size xs.length order := by
simp [_root_.Integration9_9.TM2NativeProducer.slots,List.length_flatMap,_root_.Integration9_9.TM2NativeProducer.columnSlots_length,_root_.CurrentAFT.BinaryRectangleMaterialization.Size]
def indices (order : ℕ) (xs : List Unit) : List ℕ := List.range (_root_.Integration9_9.TM2NativeProducer.slots order xs).length
@[fun_prop] theorem indices_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeProducer.indices order) := by
exact Poly.comp (f := fun xs : List Unit=>List.range xs.length) (g := _root_.Integration9_9.TM2NativeProducer.slots order) (Poly.list_indices (α := Unit)) (_root_.Integration9_9.TM2NativeProducer.slots_poly order)
theorem indices_value (order : ℕ) (xs : List Unit) : _root_.Integration9_9.TM2NativeProducer.indices order xs=List.range (_root_.CurrentAFT.BinaryRectangleMaterialization.Size xs.length order) := by rw [_root_.Integration9_9.TM2NativeProducer.indices,_root_.Integration9_9.TM2NativeProducer.slots_length]
def matrix (order : ℕ) (x : _root_.Integration9_9.TM2NativeProducer.Meta) : List (List ℚ) :=
(_root_.Integration9_9.TM2NativeProducer.indices order x.1).map (fun i=>(_root_.Integration9_9.TM2NativeProducer.indices order x.1).map (fun j=>_root_.Integration9_9.TM2NativeFullResponseMatrix.current order (x,(i,j))))
@[fun_prop] theorem matrix_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeProducer.matrix order) := by unfold _root_.Integration9_9.TM2NativeProducer.matrix;fun_prop
def rhs (order : ℕ) (xs : List Unit) : List ℚ := (_root_.Integration9_9.TM2NativeProducer.indices order xs).map (fun i=>if i=0 then 1 else 0)
@[fun_prop] theorem rhs_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeProducer.rhs order) := by unfold _root_.Integration9_9.TM2NativeProducer.rhs;fun_prop
def fields (order : ℕ) (x : _root_.Integration9_9.TM2NativeProducer.Input) : _root_.Integration9_9.TM2NativeIteration.RequestFields := (_root_.Integration9_9.TM2NativeProducer.matrix order x.1,(_root_.Integration9_9.TM2NativeProducer.rhs order x.1.1,x.2))
@[fun_prop] theorem fields_poly (order : ℕ) : Poly (_root_.Integration9_9.TM2NativeProducer.fields order) := by unfold _root_.Integration9_9.TM2NativeProducer.fields;fun_prop
/-- The encoded request is exactly the actually materialized buffers. The
vectors here only carry their proved matching dimensions. -/
def request (order : ℕ) (x : _root_.Integration9_9.TM2NativeProducer.Input) : _root_.Integration9_9.TM2NativeIteration.Request where
count:=_root_.CurrentAFT.BinaryRectangleMaterialization.Size x.1.1.length order
matrix:=Vector.ofFn (fun i=>Vector.ofFn (fun j=>_root_.Integration9_9.TM2NativeFullResponseMatrix.current order (x.1,(i.val,j.val))))
rhs:=Vector.ofFn (fun i=>if i.val=0 then 1 else 0)
ticks:=x.2
theorem _root_.Integration9_9.TM2NativeProducer.range_map_ofFn {β : Type} (n : ℕ) (f : ℕ→β) :
(List.range n).map f=List.ofFn (fun i : Fin n=>f i.val) := by
apply List.ext_getElem <;> simp
theorem _root_.Integration9_9.TM2NativeProducer.vector_get_ofFn {β : Type} {n : ℕ} (f : Fin n→β) : (Vector.ofFn f).get=f := by
funext i
exact Vector.get_ofFn f i
theorem request_fields (order : ℕ) (x : _root_.Integration9_9.TM2NativeProducer.Input) : _root_.Integration9_9.TM2NativeIteration.requestFields (_root_.Integration9_9.TM2NativeProducer.request order x)=_root_.Integration9_9.TM2NativeProducer.fields order x := by
simp only [_root_.Integration9_9.TM2NativeIteration.requestFields,_root_.Integration9_9.TM2NativeProducer.request,_root_.Integration9_9.TM2NativeProducer.fields,_root_.Integration9_9.TM2NativeProducer.matrix,_root_.Integration9_9.TM2NativeProducer.rhs,_root_.Integration9_9.TM2NativeProducer.indices_value,_root_.Integration9_9.TM2NativeProducer.range_map_ofFn,_root_.Integration9_9.TM2NativeProducer.vector_get_ofFn,Vector.get_ofFn]
noncomputable def requestProgram (order : ℕ) : PolyProgram Automatic.enc _root_.Integration9_9.TM2NativeIteration.requestCode (_root_.Integration9_9.TM2NativeProducer.request order) :=
(_root_.Integration9_9.TM2NativeProducer.fields_poly order).program.recode id (fun _=>rfl) (fun x=>congrArg _root_.Integration9_9.TM2NativeIteration.requestFieldsCode (_root_.Integration9_9.TM2NativeProducer.request_fields order x).symm)
def iterate (order : ℕ) (x : _root_.Integration9_9.TM2NativeProducer.Input) : List ℚ := _root_.Integration9_9.TM2NativeIteration.requestResult (_root_.Integration9_9.TM2NativeProducer.request order x)
noncomputable def iterationProgram (order : ℕ) : PolyProgram Automatic.enc _root_.Integration9_9.TM2NativeIteration.vectorCode (_root_.Integration9_9.TM2NativeProducer.iterate order) :=
(_root_.Integration9_9.TM2NativeProducer.requestProgram order).comp _root_.Integration9_9.TM2NativeIteration.iterationProgram
def current (order : ℕ) (x : _root_.Integration9_9.TM2NativeProducer.Input) : List (List ℚ) :=
_root_.Integration9_9.TM2NativeRectangle.chunks ((order+1)^2) (_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1,_root_.Integration9_9.TM2NativeProducer.iterate order x)
noncomputable def currentProgram (order : ℕ) : PolyProgram Automatic.enc (encodeList _root_.Integration9_9.TM2NativeIteration.vectorCode) (_root_.Integration9_9.TM2NativeProducer.current order) := by
have hc : Poly (fun x : _root_.Integration9_9.TM2NativeProducer.Input=>_root_.Integration9_9.TM2NativeFullResponseMatrix.columns order x.1.1) := by fun_prop
exact ((hc.program.fanout (_root_.Integration9_9.TM2NativeProducer.iterationProgram order)).comp (_root_.Integration9_9.TM2NativeRectangle.chunksProgram ((order+1)^2)))
end Integration9_9.TM2NativeProducer
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.PublicBitTapes
end CurrentAFT.PublicBitTapes
namespace CurrentAFT.PublicBitTapes.Encoding
end CurrentAFT.PublicBitTapes.Encoding
namespace CurrentAFT.PublicBitTapes.Encoding.mk
end CurrentAFT.PublicBitTapes.Encoding.mk
set_option autoImplicit false
set_option maxHeartbeats 1500000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeTapeCodec
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
attribute [local irreducible] CurrentProposalDimensions.current CurrentEmissionMetadata.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
abbrev Word := List Bool
def wordData {count : ℕ} (word : Fin count→Fin 2) : _root_.Integration9_9.TM2NativeTapeCodec.Word := List.ofFn (fun i=>_root_.AFT.BinaryArithmetic.digitBoolean (word i))
def take (x : ℕ×_root_.Integration9_9.TM2NativeTapeCodec.Word) : _root_.Integration9_9.TM2NativeTapeCodec.Word := x.2.take x.1
def drop (x : ℕ×_root_.Integration9_9.TM2NativeTapeCodec.Word) : _root_.Integration9_9.TM2NativeTapeCodec.Word := x.2.drop x.1
def flag (word : _root_.Integration9_9.TM2NativeTapeCodec.Word) : Bool := word.headD false
def product {α β : Type} (width : ℕ) (first : _root_.Integration9_9.TM2NativeTapeCodec.Word→α) (second : _root_.Integration9_9.TM2NativeTapeCodec.Word→β) (word : _root_.Integration9_9.TM2NativeTapeCodec.Word) : α×β :=
(first (_root_.Integration9_9.TM2NativeTapeCodec.take (width,word)),second (_root_.Integration9_9.TM2NativeTapeCodec.drop (width,word)))
def productWith {α β : Type} (width : List Unit→ℕ) (first : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→α)
(second : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→β) (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : α×β :=
(first (x.1,_root_.Integration9_9.TM2NativeTapeCodec.take (width x.1,x.2)),second (x.1,_root_.Integration9_9.TM2NativeTapeCodec.drop (width x.1,x.2)))
def groups (x : (List Unit×ℕ)×_root_.Integration9_9.TM2NativeTapeCodec.Word) : List _root_.Integration9_9.TM2NativeTapeCodec.Word :=
(List.range x.1.1.length).map (fun i=>_root_.Integration9_9.TM2NativeTapeCodec.take (x.1.2,_root_.Integration9_9.TM2NativeTapeCodec.drop (i*x.1.2,x.2)))
def indexedWith {α : Type} (slots : List Unit→List Unit) (width : List Unit→ℕ)
(leaf : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→α) (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : List α :=
(_root_.Integration9_9.TM2NativeTapeCodec.groups ((slots x.1,width x.1),x.2)).map (fun word=>leaf (x.1,word))
end Integration9_9.TM2NativeTapeCodec
end
section
namespace AFT
end AFT
namespace AFT.RationalNumerics
end AFT.RationalNumerics
namespace AFT.RationalNumerics.windowTicketBits
end AFT.RationalNumerics.windowTicketBits
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.BinaryPublicBitSizes
end CurrentAFT.BinaryPublicBitSizes
namespace CurrentAFT.BinaryPublicBitSizes.Data
end CurrentAFT.BinaryPublicBitSizes.Data
namespace CurrentAFT.BinaryPublicBitSizes.Data.mk
end CurrentAFT.BinaryPublicBitSizes.Data.mk
namespace CurrentAFT.BinaryPublicBitSizes.Lengths
end CurrentAFT.BinaryPublicBitSizes.Lengths
namespace CurrentAFT.BinaryPublicBitSizes.Lengths.mk
end CurrentAFT.BinaryPublicBitSizes.Lengths.mk
namespace CurrentAFT.BinaryPublicBitSizes.assemble
end CurrentAFT.BinaryPublicBitSizes.assemble
namespace CurrentAFT.BinaryPublicBitSizes.current
end CurrentAFT.BinaryPublicBitSizes.current
namespace CurrentAFT.BinaryPublicBitSizes.formula
end CurrentAFT.BinaryPublicBitSizes.formula
namespace CurrentAFT.BinaryPublicBitSizes.workPolynomial
end CurrentAFT.BinaryPublicBitSizes.workPolynomial
set_option autoImplicit false
set_option maxHeartbeats 1400000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeTapeLengths
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal
attribute [local irreducible] CurrentProposalDimensions.current CurrentEmissionMetadata.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
TM2NativePrime.modulus TM2NativeProfile.widthTicks TM2NativeBodyKernel.paletteTicks
TM2NativeReferenceDraw.safeTicks TM2NativeProfile.edgeTicks bodyTicks legTicks dimensionTicks
TM2NativeFullResponseCounts.slots BinaryPublicBitSizes.current
def controlsTicks (xs : List Unit) : List Unit := _root_.Integration9_9.TM2NativeCoreProposal.legTicks xs++_root_.Integration9_9.TM2NativeFullResponseCounts.slots .ordinary xs
attribute [local irreducible] controlsTicks
def activation (xs : List Unit) : ℕ := xs.length+3
def control (xs : List Unit) : ℕ := xs.length+_root_.Integration9_9.TM2NativePrime.modulus xs+1
def safe (xs : List Unit) : ℕ := xs.length+(_root_.Integration9_9.TM2NativeReferenceDraw.safeTicks xs).length+1
def anchor (xs : List Unit) : ℕ := xs.length+(_root_.Integration9_9.TM2NativeProfile.widthTicks xs).length+1
def edge (xs : List Unit) : ℕ := xs.length+2*(_root_.Integration9_9.TM2NativeProfile.edgeTicks xs).length+3
def chart (xs : List Unit) : ℕ := xs.length+_root_.Integration9_9.TM2NativePrime.modulus xs*(_root_.Integration9_9.TM2NativePrime.modulus xs*_root_.Integration9_9.TM2NativePrime.modulus xs)+1
def body (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeCoreProposal.bodyTicks xs).length*xs.length
def endpoint (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeCoreProposal.dimensionTicks xs).length*xs.length
attribute [local irreducible] activation control safe anchor edge chart body endpoint
def retriesTicks (xs : List Unit) : List Unit :=
(List.replicate 8 ()).flatMap (fun _=>(_root_.Integration9_9.TM2NativeBodyKernel.paletteTicks xs).flatMap (fun _=>xs))
end Integration9_9.TM2NativeTapeLengths
end
section
set_option autoImplicit false
set_option maxHeartbeats 1800000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeTapeSeed
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeTapeCodec
attribute [local irreducible] CurrentProposalDimensions.current CurrentEmissionMetadata.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
BinaryPublicBitSizes.current TM2NativeTapeLengths.activation TM2NativeTapeLengths.control
TM2NativeTapeLengths.safe TM2NativeTapeLengths.anchor TM2NativeTapeLengths.edge
def bits (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : _root_.Integration9_9.TM2NativeTapeCodec.Word := x.2
def flagBit (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : Bool := _root_.Integration9_9.TM2NativeTapeCodec.flag x.2
def control : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→_root_.Integration9_9.TM2NativeCoreProposal.ControlTape :=
_root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeLengths.control _root_.Integration9_9.TM2NativeTapeSeed.bits _root_.Integration9_9.TM2NativeTapeSeed.bits
abbrev EdgePair := _root_.Integration9_9.TM2NativeTapeCodec.Word×_root_.Integration9_9.TM2NativeTapeCodec.Word
def edgePair : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→_root_.Integration9_9.TM2NativeTapeSeed.EdgePair := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeLengths.edge _root_.Integration9_9.TM2NativeTapeSeed.bits _root_.Integration9_9.TM2NativeTapeSeed.bits
abbrev AnchorEdges := _root_.Integration9_9.TM2NativeTapeCodec.Word×_root_.Integration9_9.TM2NativeTapeSeed.EdgePair
def anchorEdges : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→_root_.Integration9_9.TM2NativeTapeSeed.AnchorEdges := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeLengths.anchor _root_.Integration9_9.TM2NativeTapeSeed.bits _root_.Integration9_9.TM2NativeTapeSeed.edgePair
def anchorEncoding (security : ℕ) := _root_.CurrentAFT.PublicBitTapes.bits (security+(_root_.CurrentAFT.CurrentAnchorIndexDraw.width security).count+1)
def edgesEncoding (security : ℕ) := (_root_.CurrentAFT.PublicBitTapes.edge security security).prod (_root_.CurrentAFT.PublicBitTapes.edge security security)
def anchorEdgesEncoding (security : ℕ) := (_root_.Integration9_9.TM2NativeTapeSeed.anchorEncoding security).prod (_root_.Integration9_9.TM2NativeTapeSeed.edgesEncoding security)
abbrev FlagAnchor := Bool×_root_.Integration9_9.TM2NativeTapeSeed.AnchorEdges
def flagAnchor : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→_root_.Integration9_9.TM2NativeTapeSeed.FlagAnchor := _root_.Integration9_9.TM2NativeTapeCodec.productWith (fun _=>1) _root_.Integration9_9.TM2NativeTapeSeed.flagBit _root_.Integration9_9.TM2NativeTapeSeed.anchorEdges
def flagAnchorEncoding (security : ℕ) := _root_.CurrentAFT.PublicBitTapes.flag.prod (_root_.Integration9_9.TM2NativeTapeSeed.anchorEdgesEncoding security)
def seed : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→_root_.Integration9_9.TM2NativePublicSeed.Tape := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeLengths.activation _root_.Integration9_9.TM2NativeTapeSeed.bits _root_.Integration9_9.TM2NativeTapeSeed.flagAnchor
def seedBits (xs : List Unit) : ℕ :=
_root_.Integration9_9.TM2NativeTapeLengths.activation xs+(1+(_root_.Integration9_9.TM2NativeTapeLengths.anchor xs+(_root_.Integration9_9.TM2NativeTapeLengths.edge xs+_root_.Integration9_9.TM2NativeTapeLengths.edge xs)))
def leg : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→_root_.Integration9_9.TM2NativeCoreProposal.LegTape := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeSeed.seedBits _root_.Integration9_9.TM2NativeTapeSeed.seed _root_.Integration9_9.TM2NativeTapeSeed.bits
end Integration9_9.TM2NativeTapeSeed
end
section
set_option autoImplicit false
set_option maxHeartbeats 1800000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeTapeCore
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal TM2NativeTapeCodec
attribute [local irreducible] CurrentProposalDimensions.current CurrentEmissionMetadata.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
PublicParameterProgram.modulus TM2NativeTapeLengths.controlsTicks TM2NativeBodyKernel.paletteTicks legTicks
def controlBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeLengths.control xs+_root_.Integration9_9.TM2NativeTapeLengths.safe xs
def legBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeSeed.seedBits xs+_root_.Integration9_9.TM2NativeTapeLengths.safe xs
def controls : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→List _root_.Integration9_9.TM2NativeCoreProposal.ControlTape :=
_root_.Integration9_9.TM2NativeTapeCodec.indexedWith _root_.Integration9_9.TM2NativeTapeLengths.controlsTicks _root_.Integration9_9.TM2NativeTapeCore.controlBits _root_.Integration9_9.TM2NativeTapeSeed.control
def legs : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→List _root_.Integration9_9.TM2NativeCoreProposal.LegTape := _root_.Integration9_9.TM2NativeTapeCodec.indexedWith _root_.Integration9_9.TM2NativeCoreProposal.legTicks _root_.Integration9_9.TM2NativeTapeCore.legBits _root_.Integration9_9.TM2NativeTapeSeed.leg
def queues : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→List _root_.Integration9_9.TM2NativeTapeCodec.Word := _root_.Integration9_9.TM2NativeTapeCodec.indexedWith _root_.Integration9_9.TM2NativeBodyKernel.paletteTicks _root_.Integration9_9.TM2NativeTapeLengths.safe _root_.Integration9_9.TM2NativeTapeSeed.bits
abbrev ControlState (security : ℕ) := _root_.CurrentAFT.PublicOutputExperiment.PublicIndex security→_root_.CurrentAFT.CurrentCoreProposal.ControlTape security security
abbrev LegState (security : ℕ) := Fin (_root_.CurrentAFT.Parameters.legCount security)→_root_.CurrentAFT.CurrentCoreProposal.LegTape security security
abbrev QueueState (security : ℕ) := Fin (_root_.CurrentAFT.Parameters.modulus security)→_root_.CurrentAFT.CurrentSafeDraw.Tape security security
def controlsEncoding (security : ℕ) : _root_.CurrentAFT.PublicBitTapes.Encoding (_root_.Integration9_9.TM2NativeTapeCore.ControlState security) :=
(_root_.CurrentAFT.PublicBitTapes.control security security).indexed (_root_.CurrentAFT.CurrentProposalDimensions.controlsEquiv security)
def legsEncoding (security : ℕ) : _root_.CurrentAFT.PublicBitTapes.Encoding (_root_.Integration9_9.TM2NativeTapeCore.LegState security) :=
(_root_.CurrentAFT.PublicBitTapes.leg security security).indexed (_root_.CurrentAFT.CurrentProposalDimensions.legEquiv security)
def queuesEncoding (security : ℕ) : _root_.CurrentAFT.PublicBitTapes.Encoding (_root_.Integration9_9.TM2NativeTapeCore.QueueState security) :=
(_root_.CurrentAFT.PublicBitTapes.safe security security).indexed (_root_.CurrentAFT.CurrentProposalDimensions.queueEquiv security)
def controlsData (security : ℕ) (data : _root_.Integration9_9.TM2NativeTapeCore.ControlState security) : List _root_.Integration9_9.TM2NativeCoreProposal.ControlTape :=
List.ofFn (fun i=>_root_.Integration9_9.TM2NativeCoreProposal.controlTapeData (data (_root_.CurrentAFT.CurrentProposalDimensions.controlsEquiv security i)))
def legsData (security : ℕ) (data : _root_.Integration9_9.TM2NativeTapeCore.LegState security) : List _root_.Integration9_9.TM2NativeCoreProposal.LegTape :=
List.ofFn (fun i=>_root_.Integration9_9.TM2NativeCoreProposal.legTapeData (data (_root_.CurrentAFT.CurrentProposalDimensions.legEquiv security i)))
def queuesData (security : ℕ) (data : _root_.Integration9_9.TM2NativeTapeCore.QueueState security) : List _root_.Integration9_9.TM2NativeTapeCodec.Word :=
List.ofFn (fun i=>_root_.Integration9_9.TM2NativeTapeCodec.wordData (data (_root_.CurrentAFT.CurrentProposalDimensions.queueEquiv security i)))
def controlsBits (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeTapeLengths.controlsTicks xs).length*_root_.Integration9_9.TM2NativeTapeCore.controlBits xs
def legsBits (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeCoreProposal.legTicks xs).length*_root_.Integration9_9.TM2NativeTapeCore.legBits xs
def queuesBits (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeBodyKernel.paletteTicks xs).length*_root_.Integration9_9.TM2NativeTapeLengths.safe xs
def controlsLegs : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→List _root_.Integration9_9.TM2NativeCoreProposal.ControlTape×List _root_.Integration9_9.TM2NativeCoreProposal.LegTape := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeCore.controlsBits _root_.Integration9_9.TM2NativeTapeCore.controls _root_.Integration9_9.TM2NativeTapeCore.legs
def controlsLegsEncoding (security : ℕ) := (_root_.Integration9_9.TM2NativeTapeCore.controlsEncoding security).prod (_root_.Integration9_9.TM2NativeTapeCore.legsEncoding security)
def controlsLegsData (security : ℕ) (data : _root_.Integration9_9.TM2NativeTapeCore.ControlState security×_root_.Integration9_9.TM2NativeTapeCore.LegState security) :=
(_root_.Integration9_9.TM2NativeTapeCore.controlsData security data.1,_root_.Integration9_9.TM2NativeTapeCore.legsData security data.2)
def controlsLegsBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeCore.controlsBits xs+_root_.Integration9_9.TM2NativeTapeCore.legsBits xs
def withQueues : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→(List _root_.Integration9_9.TM2NativeCoreProposal.ControlTape×List _root_.Integration9_9.TM2NativeCoreProposal.LegTape)×List _root_.Integration9_9.TM2NativeTapeCodec.Word := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeCore.controlsLegsBits _root_.Integration9_9.TM2NativeTapeCore.controlsLegs _root_.Integration9_9.TM2NativeTapeCore.queues
def withQueuesEncoding (security : ℕ) := (_root_.Integration9_9.TM2NativeTapeCore.controlsLegsEncoding security).prod (_root_.Integration9_9.TM2NativeTapeCore.queuesEncoding security)
def withQueuesData (security : ℕ) (data : (_root_.Integration9_9.TM2NativeTapeCore.ControlState security×_root_.Integration9_9.TM2NativeTapeCore.LegState security)×_root_.Integration9_9.TM2NativeTapeCore.QueueState security) :=
(_root_.Integration9_9.TM2NativeTapeCore.controlsLegsData security data.1,_root_.Integration9_9.TM2NativeTapeCore.queuesData security data.2)
def withQueuesBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeCore.controlsLegsBits xs+_root_.Integration9_9.TM2NativeTapeCore.queuesBits xs
def withBody : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→((List _root_.Integration9_9.TM2NativeCoreProposal.ControlTape×List _root_.Integration9_9.TM2NativeCoreProposal.LegTape)×List _root_.Integration9_9.TM2NativeTapeCodec.Word)×_root_.Integration9_9.TM2NativeTapeCodec.Word :=
_root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeCore.withQueuesBits _root_.Integration9_9.TM2NativeTapeCore.withQueues _root_.Integration9_9.TM2NativeTapeSeed.bits
def withBodyEncoding (security : ℕ) := (_root_.Integration9_9.TM2NativeTapeCore.withQueuesEncoding security).prod
(_root_.CurrentAFT.PublicBitTapes.bits ((_root_.CurrentAFT.CurrentProposalDimensions.current security).body*security))
def withBodyData (security : ℕ)
(data : ((_root_.Integration9_9.TM2NativeTapeCore.ControlState security×_root_.Integration9_9.TM2NativeTapeCore.LegState security)×_root_.Integration9_9.TM2NativeTapeCore.QueueState security)×
(Fin ((_root_.CurrentAFT.CurrentProposalDimensions.current security).body*security)→Fin 2)) :=
(_root_.Integration9_9.TM2NativeTapeCore.withQueuesData security data.1,_root_.Integration9_9.TM2NativeTapeCodec.wordData data.2)
def withBodyBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeCore.withQueuesBits xs+_root_.Integration9_9.TM2NativeTapeLengths.body xs
def flat : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word→(((List _root_.Integration9_9.TM2NativeCoreProposal.ControlTape×List _root_.Integration9_9.TM2NativeCoreProposal.LegTape)×List _root_.Integration9_9.TM2NativeTapeCodec.Word)×_root_.Integration9_9.TM2NativeTapeCodec.Word)×_root_.Integration9_9.TM2NativeTapeCodec.Word :=
_root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeCore.withBodyBits _root_.Integration9_9.TM2NativeTapeCore.withBody _root_.Integration9_9.TM2NativeTapeSeed.bits
def current (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : _root_.Integration9_9.TM2NativeCoreProposal.Tapes :=
let data := _root_.Integration9_9.TM2NativeTapeCore.flat x
(data.1.1.1,(data.1.1.2,(data.1.2,data.2)))
def totalBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeCore.withBodyBits xs+_root_.Integration9_9.TM2NativeTapeLengths.endpoint xs
end Integration9_9.TM2NativeTapeCore
end
section
set_option autoImplicit false
set_option maxHeartbeats 2200000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeTapes
open AFT AFT.BinaryArithmetic CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal TM2NativeTapeCodec
attribute [local irreducible] CurrentProposalDimensions.current CurrentEmissionMetadata.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
PublicParameterProgram.modulus BinaryRejectionCap.current BinaryPublicBitSizes.current
TM2NativeTapeLengths.retriesTicks TM2NativeTapeLengths.chart legTicks
abbrev Attempt := _root_.Integration9_9.TM2NativeCoreProposal.Tapes×_root_.Integration9_9.TM2NativeTapeCodec.Word
abbrev Completion := _root_.Integration9_9.TM2NativeCompletion.Tapes
abbrev Tapes := _root_.Integration9_9.TM2NativeTapeCodec.Word×(List _root_.Integration9_9.TM2NativeTapes.Attempt×_root_.Integration9_9.TM2NativeTapes.Completion)
def attempt : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → _root_.Integration9_9.TM2NativeTapes.Attempt := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeCore.totalBits _root_.Integration9_9.TM2NativeTapeCore.current _root_.Integration9_9.TM2NativeTapeSeed.bits
def attemptEncoding (security : ℕ) := (_root_.CurrentAFT.PublicBitTapes.core security security).prod (_root_.CurrentAFT.PublicBitTapes.bits security)
def attemptBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeCore.totalBits xs+xs.length
def attempts : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → List _root_.Integration9_9.TM2NativeTapes.Attempt := _root_.Integration9_9.TM2NativeTapeCodec.indexedWith _root_.Integration9_9.TM2NativeTapeLengths.retriesTicks _root_.Integration9_9.TM2NativeTapes.attemptBits _root_.Integration9_9.TM2NativeTapes.attempt
def attemptsBits (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeTapeLengths.retriesTicks xs).length*_root_.Integration9_9.TM2NativeTapes.attemptBits xs
def flagChart : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → _root_.Integration9_9.TM2NativeFlagDraw.Tape := _root_.Integration9_9.TM2NativeTapeCodec.productWith (fun _=>1) _root_.Integration9_9.TM2NativeTapeSeed.flagBit _root_.Integration9_9.TM2NativeTapeSeed.bits
def flagChartEncoding (security : ℕ) := _root_.CurrentAFT.PublicBitTapes.flag.prod
(_root_.CurrentAFT.PublicBitTapes.bits (security+_root_.CurrentAFT.Parameters.modulus security*(_root_.CurrentAFT.Parameters.modulus security*_root_.CurrentAFT.Parameters.modulus security)+1))
def flagChartBits (xs : List Unit) : ℕ := 1+_root_.Integration9_9.TM2NativeTapeLengths.chart xs
def charts : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → List _root_.Integration9_9.TM2NativeFlagDraw.Tape := _root_.Integration9_9.TM2NativeTapeCodec.indexedWith _root_.Integration9_9.TM2NativeCoreProposal.legTicks _root_.Integration9_9.TM2NativeTapes.flagChartBits _root_.Integration9_9.TM2NativeTapes.flagChart
def chartsData {security : ℕ} (tapes : _root_.CurrentAFT.CurrentChartsDraw.Tapes security security) : List _root_.Integration9_9.TM2NativeFlagDraw.Tape :=
List.ofFn (fun i=>_root_.Integration9_9.TM2NativeFlagDraw.tapeData (tapes i))
def chartsBits (xs : List Unit) : ℕ := (_root_.Integration9_9.TM2NativeCoreProposal.legTicks xs).length*_root_.Integration9_9.TM2NativeTapes.flagChartBits xs
def completion : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → _root_.Integration9_9.TM2NativeTapes.Completion := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapes.chartsBits _root_.Integration9_9.TM2NativeTapes.charts _root_.Integration9_9.TM2NativeTapeSeed.bits
def completionBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapes.chartsBits xs+_root_.Integration9_9.TM2NativeTapeLengths.edge xs
def materialized : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → List _root_.Integration9_9.TM2NativeTapes.Attempt×_root_.Integration9_9.TM2NativeTapes.Completion := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapes.attemptsBits _root_.Integration9_9.TM2NativeTapes.attempts _root_.Integration9_9.TM2NativeTapes.completion
def materializedBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapes.attemptsBits xs+_root_.Integration9_9.TM2NativeTapes.completionBits xs
def decoded : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word → _root_.Integration9_9.TM2NativeTapes.Tapes := _root_.Integration9_9.TM2NativeTapeCodec.productWith _root_.Integration9_9.TM2NativeTapeLengths.body _root_.Integration9_9.TM2NativeTapeSeed.bits _root_.Integration9_9.TM2NativeTapes.materialized
def tapesData {security : ℕ} (word : _root_.CurrentAFT.PublicBitTapes.Tapes security) : _root_.Integration9_9.TM2NativeTapes.Tapes :=
(_root_.Integration9_9.TM2NativeTapeCodec.wordData word.1,(_root_.Integration9_9.TM2NativeCappedRejection.tapeData word.2.1,_root_.Integration9_9.TM2NativeCompletion.tapesData word.2.2))
def totalBits (xs : List Unit) : ℕ := _root_.Integration9_9.TM2NativeTapeLengths.body xs+_root_.Integration9_9.TM2NativeTapes.materializedBits xs
def current (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : _root_.Integration9_9.TM2NativeTapes.Tapes := _root_.Integration9_9.TM2NativeTapes.decoded (x.1,_root_.Integration9_9.TM2NativeTapeCodec.take (_root_.Integration9_9.TM2NativeTapes.totalBits x.1,x.2))
end Integration9_9.TM2NativeTapes
end
section
namespace CurrentAFT
end CurrentAFT
namespace CurrentAFT.ActualConstructiveSampler
end CurrentAFT.ActualConstructiveSampler
namespace CurrentAFT.PublicAffinePipeline
end CurrentAFT.PublicAffinePipeline
namespace CurrentAFT.PublicAffinePipeline.run
end CurrentAFT.PublicAffinePipeline.run
namespace Integration9_9
end Integration9_9
namespace Integration9_9.NativePipelineSemantic
end Integration9_9.NativePipelineSemantic
set_option autoImplicit false
set_option maxHeartbeats 2400000
set_option maxRecDepth 10000
set_option synthInstance.maxSize 1024
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeSampler
open AFT AFT.BinaryArithmetic CurrentAFT QAlgorithms.Complexity
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2NativeCoreProposal TM2NativeTapeCodec TM2NativeEmitterAssembly
open InfoLossLAR.WorstCase
attribute [local irreducible] CurrentProposalDimensions.current CurrentEmissionMetadata.current
CurrentAFT.Parameters.bodySize CurrentAFT.Parameters.dimension CurrentAFT.Parameters.legCount
PublicParameterProgram.modulus BinaryRejectionCap.current CurrentLayoutDraw.draw CurrentMaterializedCompletion.current
CurrentMaterializedCompletion.complete CappedPublicRejection.current CurrentBinaryAffineEmitter.emit
TM2NativeProducer.current TM2NativeCappedRejection.current TM2NativeCompletion.current TM2NativeEmitter.current
TM2NativeEmitterOutput.current
abbrev Input := List Unit×List Bool
abbrev Structured := List Unit×_root_.Integration9_9.TM2NativeTapes.Tapes
def producer (order : ℕ) (xs : List Unit) : _root_.Integration9_9.TM2NativeWeightTable.Table :=
_root_.Integration9_9.TM2NativeProducer.current order ((xs,xs),xs)
attribute [local irreducible] producer
def layout (x : List Unit×_root_.Integration9_9.TM2NativeTapeCodec.Word) : _root_.Integration9_9.TM2NativeCoreProposal.Perm :=
_root_.Integration9_9.TM2NativePermutationDraw.current ((_root_.Integration9_9.TM2NativeCoreProposal.bodyTicks x.1,x.1),x.2)
attribute [local irreducible] layout
def accepted (order : ℕ) (x : _root_.Integration9_9.TM2NativeSampler.Structured) : _root_.Integration9_9.TM2NativePublicRejection.State :=
_root_.Integration9_9.TM2NativeCappedRejection.current order ((x.1,_root_.Integration9_9.TM2NativeSampler.producer order x.1),x.2.2.1)
attribute [local irreducible] accepted
def completed (order : ℕ) (x : _root_.Integration9_9.TM2NativeSampler.Structured) : _root_.Integration9_9.TM2NativeEmitter.State :=
_root_.Integration9_9.TM2NativeCompletion.current (((((x.1,x.1),x.1),_root_.Integration9_9.TM2NativeSampler.accepted order x),x.2.2.2))
attribute [local irreducible] completed
def typed (order : ℕ) (x : _root_.Integration9_9.TM2NativeSampler.Structured) : _root_.Integration9_9.TM2NativeEmitterAssembly.Output :=
_root_.Integration9_9.TM2NativeEmitterOutput.current (x.1,_root_.Integration9_9.TM2NativeEmitter.current ((x.1,(_root_.Integration9_9.TM2NativeSampler.layout (x.1,x.2.1)).1),_root_.Integration9_9.TM2NativeSampler.completed order x))
attribute [local irreducible] typed
def current (order : ℕ) (x : _root_.Integration9_9.TM2NativeSampler.Input) : Str :=
_root_.Integration9_9.TM2NativeAffineEmitter.serialize (_root_.Integration9_9.TM2NativeSampler.typed order (x.1,_root_.Integration9_9.TM2NativeTapes.current x))
end Integration9_9.TM2NativeSampler
end
section
namespace Integration9_9
end Integration9_9
namespace Integration9_9.TM2NativePrime
end Integration9_9.TM2NativePrime
namespace Integration9_9.TM2NativePrime.primeFromParameter
end Integration9_9.TM2NativePrime.primeFromParameter
namespace Integration9_9.TM2NativePrime.primeFromSamplerRequest
end Integration9_9.TM2NativePrime.primeFromSamplerRequest
set_option autoImplicit false
set_option maxHeartbeats 1200000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.TM2NativeSamplerRequest
open InfoLossLAR.WorstCase QAlgorithms.Complexity
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open LARPlatformEncoding
/-- Parse exactly the public sampler request, retaining the actual coin string
and materializing security only from the already-present unary input. -/
def fields (word : Str) : List Unit × Str :=
let first:=_root_.Integration9_9.LARPlatformEncoding.readS word
let publicInput:=(_root_.Integration9_9.LARPlatformEncoding.readS first.1).2
(((_root_.Integration9_9.LARPlatformEncoding.readS publicInput).2.map (fun _=>())),first.2)
def run (f : List Unit × Str→Str) (word : Str) : Str := f (_root_.Integration9_9.TM2NativeSamplerRequest.fields word)
end Integration9_9.TM2NativeSamplerRequest
end
Source
Companion Lean implementation for the fixed-family Gaussian affine transport theorem. The source modules and their SHA-256 hashes are recorded in the checked extraction manifest. This exact generated file has SHA-256 dd646234e1579316961f7ee691d5052073a179c75157646c463926ebacefe58f. Source modules: Integration9_9_TM2NativeChoiceAverage, Integration9_9_TM2NativeCompletion, Integration9_9_TM2NativeFullResponse, Integration9_9_TM2NativeRadix, Integration9_9_TM2NativeRectangleDecode, Integration9_9_TM2NativeFullResponseMatrix, Integration9_9_TM2NativeRectangle, Integration9_9_TM2NativeProducer, Integration9_9_TM2NativeTapeCodec, Integration9_9_TM2NativeTapeLengths, Integration9_9_TM2NativeTapeSeed, Integration9_9_TM2NativeTapeCore, Integration9_9_TM2NativeTapes, Integration9_9_TM2NativeSampler, Integration9_9_TM2NativeSamplerRequest. Alternate sparse native dependencies preserve the original non-import body bytes and all public types; this header-only packaging is recorded in sparse_live/manifest.json. Current source SHA256 d4d5d1755c1d024dabf9865b6065892b5ba296778daa1c81bbd08fe35cddda57. Native10/11 split fallback keeps every original scope-closed data body unchanged and retains the canonical module names as import facades. Current source SHA256 d4d5d1755c1d024dabf9865b6065892b5ba296778daa1c81bbd08fe35cddda57.