Combined Gaussian preprocessing and query experiment
DefinitionInfoLossLAR_FirstBridgeBundle_09affine-transportinfo-loss-larquantum-reductions
The final reduction combines the public Gaussian affine preprocessing with the single-query rank-one circuit. This interface specifies generic query layouts, randomized branches, the single-call relation, combined public coins, and the corresponding output probability experiment. The data support the exact Gaussian-to-zero-fiber advantage comparison.
Definition code
import Definitions.Def_InfoLossLAR_FirstBridgeBundle_08
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
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBody
open Integration9_9.LARCoinLayout
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open QMCNumericRuntime TM2PlatformSerialization
/-- True ancilla slots of the actual native-to-quantum compiled query program. -/
def bodyPreAncSlots (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str) : List Unit :=
(_root_.InfoLossLAR.WorstCase.unaryPayload (_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.descriptionGenerator (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) word)).map (fun _ => ())
theorem bodyPreAncSlots_length (Q : _root_.Integration9_9.GenericBody.QueryProgram) (n : ℕ) :
(_root_.Integration9_9.GenericBody.bodyPreAncSlots Q (unary n)).length=(_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.compiled (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) n).ops.length := by
unfold _root_.Integration9_9.GenericBody.bodyPreAncSlots
rw [_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.descriptionGenerator_code]
simp only [_root_.InfoLossLAR.WorstCase.BooleanFamily.code,_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.booleanFamily,List.append_assoc,_root_.InfoLossLAR.WorstCase.unaryPayload_encNat,
List.length_map,unary,List.length_replicate]
def bodyPreSlots (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str) : List Unit :=
word.map (fun _ => ())++_root_.Integration9_9.GenericBody.bodyPreAncSlots Q word++[()]
def bodyDBundleSlots (descriptions : List (Str × Str)) : List Unit :=
descriptions.flatMap (fun description => (_root_.InfoLossLAR.WorstCase.readFamilyFrame description).1.map (fun _ => ()))
theorem bodyDBundleSlots_length (D : Family) (maximum : ℕ) (query : Str) :
(_root_.Integration9_9.GenericBody.bodyDBundleSlots (_root_.InfoLossLAR.WorstCase.describedQueryBlocks D maximum)).length=_root_.InfoLossLAR.WorstCase.bundleWidth (_root_.InfoLossLAR.WorstCase.queryBlocks D maximum query) := by
have h (descriptions : List (Str × Str)) :
(_root_.Integration9_9.GenericBody.bodyDBundleSlots descriptions).length=(_root_.InfoLossLAR.WorstCase.dBundleLoadSources [] descriptions).length := by
induction descriptions with
| nil => rfl
| cons description rest ih =>
simp only [_root_.Integration9_9.GenericBody.bodyDBundleSlots,_root_.InfoLossLAR.WorstCase.dBundleLoadSources,List.flatMap_cons,List.length_append,
_root_.InfoLossLAR.WorstCase.dBlockLoadSources_length,List.length_map] at *
rw [ih]
rw [h,_root_.InfoLossLAR.WorstCase.dBundleLoadSources_physical_length D maximum query []]
def bodySelectorChoices (Q : _root_.Integration9_9.GenericBody.QueryProgram)
(word : Str) (descriptions : List (Str × Str)) : List (ℕ × ℕ) :=
(_root_.Integration9_9.GenericBody.bodyFlagAddresses Q word).zip
((_root_.InfoLossLAR.WorstCase.emitDOutputs descriptions).map (fun token =>
(_root_.Integration9_9.GenericBody.bodyPreSlots Q word).length+inputWidth token))
theorem bodySelectorChoices_length (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
(_root_.Integration9_9.GenericBody.bodySelectorChoices Q (unary n) (_root_.InfoLossLAR.WorstCase.describedQueryBlocks D (Q.padding.eval n))).length=
Q.padding.eval n+1 := by
unfold _root_.Integration9_9.GenericBody.bodySelectorChoices
rw [List.length_zip,_root_.Integration9_9.GenericBody.bodyFlagAddresses_length,List.length_map,_root_.InfoLossLAR.WorstCase.emitDOutputs_correct D _ []]
simp only [List.length_ofFn,_root_.InfoLossLAR.WorstCase.queryBlocks,unary,List.length_replicate,Nat.min_self]
/-- The exact global ancillary register, including fresh D loading and selector scratch. -/
def bodyAncSlots (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str) (descriptions : List (Str × Str)) : List Unit :=
_root_.Integration9_9.GenericBody.bodyPreAncSlots Q word++[()]++_root_.Integration9_9.GenericBody.bodyDBundleSlots descriptions++
_root_.InfoLossLAR.WorstCase.multiSelectorScratch (_root_.Integration9_9.GenericBody.bodySelectorChoices Q word descriptions)
def bodyAllSlots (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str) (descriptions : List (Str × Str)) : List Unit :=
word.map (fun _ => ())++_root_.Integration9_9.GenericBody.bodyAncSlots Q word descriptions++[()]
end Integration9_9.GenericBody
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBody
open Integration9_9.LARCoinLayout
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary
/-- The actual complete D-load source list for a body circuit of input length n. -/
def bodySources (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) : List (Bool × ℕ) :=
_root_.InfoLossLAR.WorstCase.dBundleLoadSources (_root_.Integration9_9.GenericBody.bodyPayloadAddresses Q (unary n))
(_root_.InfoLossLAR.WorstCase.describedQueryBlocks D (Q.padding.eval n))
def bodyChoices (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) : List (ℕ × ℕ) :=
_root_.Integration9_9.GenericBody.bodySelectorChoices Q (unary n) (_root_.InfoLossLAR.WorstCase.describedQueryBlocks D (Q.padding.eval n))
def bodyAnc (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) : ℕ :=
(_root_.Integration9_9.GenericBody.bodyAncSlots Q (unary n) (_root_.InfoLossLAR.WorstCase.describedQueryBlocks D (Q.padding.eval n))).length
def bodyWidth (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) : ℕ :=
n+(_root_.Integration9_9.GenericBody.bodyAnc Q D n+1)
def bodyPreWidth (Q : _root_.Integration9_9.GenericBody.QueryProgram) (n : ℕ) : ℕ :=
n+((_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.compiled (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) n).ops.length+1)
def bodyDWidth (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) : ℕ :=
_root_.InfoLossLAR.WorstCase.bundleWidth (_root_.InfoLossLAR.WorstCase.queryBlocks D (Q.padding.eval n) [])
theorem bodyChoices_length (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
(_root_.Integration9_9.GenericBody.bodyChoices Q D n).length=Q.padding.eval n+1 :=
_root_.Integration9_9.GenericBody.bodySelectorChoices_length Q D n
theorem bodySources_length (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
(_root_.Integration9_9.GenericBody.bodySources Q D n).length=_root_.Integration9_9.GenericBody.bodyDWidth Q D n :=
_root_.InfoLossLAR.WorstCase.dBundleLoadSources_physical_length D (Q.padding.eval n) [] _
theorem bodyAnc_formula (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
_root_.Integration9_9.GenericBody.bodyAnc Q D n=(_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.compiled (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) n).ops.length+1+
_root_.Integration9_9.GenericBody.bodyDWidth Q D n+4*(Q.padding.eval n+1) := by
unfold _root_.Integration9_9.GenericBody.bodyAnc _root_.Integration9_9.GenericBody.bodyAncSlots _root_.Integration9_9.GenericBody.bodyDWidth
simp only [List.length_append,List.length_singleton,_root_.InfoLossLAR.WorstCase.multiSelectorScratch_length,
_root_.Integration9_9.GenericBody.bodyPreAncSlots_length,_root_.Integration9_9.GenericBody.bodyDBundleSlots_length D _ [],_root_.Integration9_9.GenericBody.bodySelectorChoices_length]
theorem bodyWidth_formula (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
_root_.Integration9_9.GenericBody.bodyWidth Q D n=_root_.Integration9_9.GenericBody.bodyPreWidth Q n+_root_.Integration9_9.GenericBody.bodyDWidth Q D n+
(4*(Q.padding.eval n+1)+1) := by
rw [_root_.Integration9_9.GenericBody.bodyWidth,_root_.Integration9_9.GenericBody.bodyAnc_formula]
unfold _root_.Integration9_9.GenericBody.bodyPreWidth
omega
theorem bodyPrepared_bound (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
n+(_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.preparedLoadOps (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) n (_root_.Integration9_9.GenericBody.bodySources Q D n)).length ≤
_root_.Integration9_9.GenericBody.bodyWidth Q D n := by
rw [_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.preparedLoadOps_length,_root_.Integration9_9.GenericBody.bodySources_length,_root_.Integration9_9.GenericBody.bodyWidth_formula]
unfold _root_.Integration9_9.GenericBody.bodyPreWidth
omega
theorem bodySelected_bound (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
_root_.Integration9_9.GenericBody.bodyPreWidth Q n+_root_.Integration9_9.GenericBody.bodyDWidth Q D n+
4*(_root_.Integration9_9.GenericBody.bodyChoices Q D n).length ≤ _root_.Integration9_9.GenericBody.bodyWidth Q D n := by
rw [_root_.Integration9_9.GenericBody.bodyWidth_formula,_root_.Integration9_9.GenericBody.bodyChoices_length]
omega
def bodyPreparedGates (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
List (_root_.InfoLossLAR.WorstCase.BooleanGate (_root_.Integration9_9.GenericBody.bodyWidth Q D n)) :=
_root_.InfoLossLAR.WorstCase.BooleanProgram.gates n (_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.preparedLoadOps (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) n
(_root_.Integration9_9.GenericBody.bodySources Q D n)) (_root_.Integration9_9.GenericBody.bodyPrepared_bound Q D n)
def bodySelectorGates (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
List (_root_.InfoLossLAR.WorstCase.BooleanGate (_root_.Integration9_9.GenericBody.bodyWidth Q D n)) :=
_root_.InfoLossLAR.WorstCase.BooleanProgram.gates (_root_.Integration9_9.GenericBody.bodyPreWidth Q n+_root_.Integration9_9.GenericBody.bodyDWidth Q D n)
(_root_.InfoLossLAR.WorstCase.multiSelectorOps (_root_.Integration9_9.GenericBody.bodyPreWidth Q n+_root_.Integration9_9.GenericBody.bodyDWidth Q D n) 0
(_root_.Integration9_9.GenericBody.bodyChoices Q D n))
(by simpa only [_root_.InfoLossLAR.WorstCase.multiSelectorOps_length] using _root_.Integration9_9.GenericBody.bodySelected_bound Q D n)
/-- Pure dimension equality casts do not change any gate or instruction value. -/
def castBodyCircuit {left right : ℕ} (h : left=right) (circuit : Layered left) : Layered right := h ▸ circuit
def bodyDCircuit (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
Layered (_root_.Integration9_9.GenericBody.bodyWidth Q D n) :=
_root_.Integration9_9.GenericBody.castBodyCircuit (by rw [_root_.Integration9_9.GenericBody.bodyWidth_formula]; rfl)
(_root_.InfoLossLAR.WorstCase.leftCircuit (m := 4*(Q.padding.eval n+1)+1)
(_root_.InfoLossLAR.WorstCase.rightCircuit (n := _root_.Integration9_9.GenericBody.bodyPreWidth Q n) (_root_.InfoLossLAR.WorstCase.bundleCircuit (_root_.InfoLossLAR.WorstCase.queryBlocks D (Q.padding.eval n) []))))
def bodyCircuit (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
Layered (_root_.Integration9_9.GenericBody.bodyWidth Q D n) :=
_root_.InfoLossLAR.WorstCase.compileReversible (_root_.InfoLossLAR.WorstCase.booleanToReversible (_root_.Integration9_9.GenericBody.bodyPreparedGates Q D n)) ++
_root_.Integration9_9.GenericBody.bodyDCircuit Q D n ++
_root_.InfoLossLAR.WorstCase.compileReversible (_root_.InfoLossLAR.WorstCase.booleanToReversible (_root_.Integration9_9.GenericBody.bodySelectorGates Q D n))
def bodyOutput (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) (n : ℕ) :
Fin (_root_.Integration9_9.GenericBody.bodyWidth Q D n) :=
⟨_root_.InfoLossLAR.WorstCase.multiSelectorOutput (_root_.Integration9_9.GenericBody.bodyPreWidth Q n+_root_.Integration9_9.GenericBody.bodyDWidth Q D n) 0
(_root_.Integration9_9.GenericBody.bodyChoices Q D n),
(_root_.InfoLossLAR.WorstCase.multiSelectorOutput_lt _ 0 _ (by unfold _root_.Integration9_9.GenericBody.bodyPreWidth; omega)).trans_le
(_root_.Integration9_9.GenericBody.bodySelected_bound Q D n)⟩
/-- The concrete body runs the actual query compiler/load, all actual D blocks,
and the actual fresh Boolean selector on one physical register. -/
def bodyFamily (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) : Family where
anc := _root_.Integration9_9.GenericBody.bodyAnc Q D
circ := _root_.Integration9_9.GenericBody.bodyCircuit Q D
out := _root_.Integration9_9.GenericBody.bodyOutput Q D
end Integration9_9.GenericBody
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBody
open Integration9_9.LARCoinLayout
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary
def bodyDWidthPolynomial (Q : _root_.Integration9_9.GenericBody.QueryProgram) (Dbound : Polynomial ℕ) : Polynomial ℕ :=
(Q.padding+1)*(Q.padding+Dbound.comp Q.padding+1)
def bodyAncPolynomial (Q : _root_.Integration9_9.GenericBody.QueryProgram) (Dbound : Polynomial ℕ) : Polynomial ℕ :=
_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.spacePolynomial (_root_.Integration9_9.GenericBody.bodyQueryProgram Q)+1+_root_.Integration9_9.GenericBody.bodyDWidthPolynomial Q Dbound+4*(Q.padding+1)
def bodyDepthPolynomial (Q : _root_.Integration9_9.GenericBody.QueryProgram) (Dbound : Polynomial ℕ) : Polynomial ℕ :=
74*(_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.spacePolynomial (_root_.Integration9_9.GenericBody.bodyQueryProgram Q)+1+_root_.Integration9_9.GenericBody.bodyDWidthPolynomial Q Dbound)+
(Q.padding+1)*Dbound.comp Q.padding+296*(Q.padding+1)
end Integration9_9.GenericBody
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBody
open Integration9_9.LARCoinLayout
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open QMCNumericRuntime TM2PlatformSerialization TM2Boolean.RPN
/-- The actual terminal zero instruction, captured through its existing unary slots. -/
def bodyZeroWord (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str) : Str :=
encNat 0++_root_.Integration9_9.TM2PlatformSerialization.lengthToken (word.map (fun _ => ())++_root_.Integration9_9.GenericBody.bodyPreAncSlots Q word)
/-- Genuine native code for the full preprocessing and D-register loading program. -/
def bodyPreparedWords (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : List Str :=
_root_.InfoLossLAR.WorstCase.readRawBooleanFamilyWords (_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.descriptionGenerator (_root_.Integration9_9.GenericBody.bodyQueryProgram Q) word)++
[_root_.Integration9_9.GenericBody.bodyZeroWord Q word]++
_root_.InfoLossLAR.WorstCase.registerLoadGateWords (_root_.Integration9_9.GenericBody.bodyAllSlots Q word descriptions)
(_root_.Integration9_9.GenericBody.bodyPreSlots Q word).length
(_root_.InfoLossLAR.WorstCase.dBundleLoadSources (_root_.Integration9_9.GenericBody.bodyPayloadAddresses Q word) descriptions)
/-- Real native code for the actual final quantum-output selector. -/
def bodySelectorWords (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : List Str :=
_root_.InfoLossLAR.WorstCase.multiSelectorGateWords (_root_.Integration9_9.GenericBody.bodyAllSlots Q word descriptions)
((_root_.Integration9_9.GenericBody.bodyPreSlots Q word).length+(_root_.Integration9_9.GenericBody.bodyDBundleSlots descriptions).length) 0
(_root_.Integration9_9.GenericBody.bodySelectorChoices Q word descriptions)
end Integration9_9.GenericBody
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBody
open Integration9_9.LARCoinLayout
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2PlatformSerialization
/-- The actual D bundle instruction words shifted into the body's true physical register. -/
def bodyDWordLayers (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : List (List Str) :=
_root_.InfoLossLAR.WorstCase.shiftCircuitWords ((_root_.Integration9_9.GenericBody.bodyPreSlots Q word).map (fun _ => true))
(_root_.InfoLossLAR.WorstCase.bundleCircuitWordLayers (descriptions.map _root_.InfoLossLAR.WorstCase.readFamilyFrame))
end Integration9_9.GenericBody
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBody
open Integration9_9.LARCoinLayout
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open TM2PlatformSerialization InfoLossLAR.WorstCase.TM2Boolean.RPN
/-- These are literal Boolean phases on the same complete physical body register. -/
def bodyPreparedBooleanFamily (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) : _root_.InfoLossLAR.WorstCase.BooleanFamily where
anc := _root_.Integration9_9.GenericBody.bodyAnc Q D
gates := _root_.Integration9_9.GenericBody.bodyPreparedGates Q D
out := _root_.Integration9_9.GenericBody.bodyOutput Q D
def bodySelectorBooleanFamily (Q : _root_.Integration9_9.GenericBody.QueryProgram) (D : Family) : _root_.InfoLossLAR.WorstCase.BooleanFamily where
anc := _root_.Integration9_9.GenericBody.bodyAnc Q D
gates := _root_.Integration9_9.GenericBody.bodySelectorGates Q D
out := _root_.Integration9_9.GenericBody.bodyOutput Q D
def bodyOutputWord (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : Str :=
_root_.InfoLossLAR.WorstCase.TM2Boolean.RPN.boundedNat (_root_.Integration9_9.GenericBody.bodyAllSlots Q word descriptions)
(_root_.InfoLossLAR.WorstCase.multiSelectorFinalIndex ((_root_.Integration9_9.GenericBody.bodyPreSlots Q word).length+
(_root_.Integration9_9.GenericBody.bodyDBundleSlots descriptions).length) 0 (_root_.Integration9_9.GenericBody.bodySelectorChoices Q word descriptions))
def bodyPreparedBooleanDescription (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : Str :=
_root_.Integration9_9.TM2PlatformSerialization.lengthToken (_root_.Integration9_9.GenericBody.bodyAncSlots Q word descriptions)++
_root_.Integration9_9.GenericBody.bodyOutputWord Q word descriptions++
_root_.Integration9_9.TM2PlatformSerialization.serializeWords (_root_.Integration9_9.GenericBody.bodyPreparedWords Q word descriptions)
def bodySelectorBooleanDescription (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : Str :=
_root_.Integration9_9.TM2PlatformSerialization.lengthToken (_root_.Integration9_9.GenericBody.bodyAncSlots Q word descriptions)++
_root_.Integration9_9.GenericBody.bodyOutputWord Q word descriptions++
_root_.Integration9_9.TM2PlatformSerialization.serializeWords (_root_.Integration9_9.GenericBody.bodySelectorWords Q word descriptions)
def bodyPreparedQuantumDescription (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : Str :=
_root_.InfoLossLAR.WorstCase.compileReversibleDescription (_root_.InfoLossLAR.WorstCase.compileBooleanDescription
(_root_.Integration9_9.GenericBody.bodyPreparedBooleanDescription Q word descriptions))
def bodySelectorQuantumDescription (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : Str :=
_root_.InfoLossLAR.WorstCase.compileReversibleDescription (_root_.InfoLossLAR.WorstCase.compileBooleanDescription
(_root_.Integration9_9.GenericBody.bodySelectorBooleanDescription Q word descriptions))
/-- Every emitted instruction is from the actual physical prep/D/selector phases. -/
def bodyQuantumWordLayers (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : List (List Str) :=
_root_.InfoLossLAR.WorstCase.readFamilyCircuitLayers (_root_.Integration9_9.GenericBody.bodyPreparedQuantumDescription Q word descriptions)++
_root_.Integration9_9.GenericBody.bodyDWordLayers Q word descriptions++
_root_.InfoLossLAR.WorstCase.readFamilyCircuitLayers (_root_.Integration9_9.GenericBody.bodySelectorQuantumDescription Q word descriptions)
attribute [local irreducible] bodyPreparedQuantumDescription bodySelectorQuantumDescription bodyDWordLayers
def bodyDescription (Q : _root_.Integration9_9.GenericBody.QueryProgram) (word : Str)
(descriptions : List (Str × Str)) : Str :=
_root_.Integration9_9.TM2PlatformSerialization.lengthToken (_root_.Integration9_9.GenericBody.bodyAncSlots Q word descriptions)++
_root_.Integration9_9.GenericBody.bodyOutputWord Q word descriptions++
_root_.Integration9_9.TM2PlatformSerialization.serializeWords ((_root_.Integration9_9.GenericBody.bodyQuantumWordLayers Q word descriptions).map _root_.Integration9_9.TM2PlatformSerialization.serializeWords)
end Integration9_9.GenericBody
end
end
section
namespace InfoLossLAR
end InfoLossLAR
namespace InfoLossLAR.WorstCase
end InfoLossLAR.WorstCase
namespace InfoLossLAR.WorstCase.emittedOutput_get
end InfoLossLAR.WorstCase.emittedOutput_get
namespace Integration9_9
end Integration9_9
namespace Integration9_9.GenericBody
end Integration9_9.GenericBody
namespace Integration9_9.LARCoinLayout
end Integration9_9.LARCoinLayout
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBodySemantics
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open Integration9_9.GenericBody Integration9_9.LARCoinLayout
/-- A real machine together with its proved query-output encoding and genuine
polynomial bound. These are mathematical semantics, not new Uniform premises. -/
structure QuerySpecification where
machine : _root_.Integration9_9.GenericBody.QueryProgram
query : Str → Str
encoding : ∀ word,machine.f word=_root_.Integration9_9.LARCoinLayout.encodeQueryOutput
(List.replicate (machine.padding.eval word.length) ()) (query word)
query_bound : ∀ word,(query word).length ≤ machine.padding.eval word.length
end Integration9_9.GenericBodySemantics
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBodySemantics
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open Integration9_9.GenericBody
/-- Exact complete classical value vector after the real fresh preparation. -/
def bodyPreparedBits (R : _root_.Integration9_9.GenericBodySemantics.QuerySpecification) (D : Family)
(word : Str) : ℕ → Bool :=
_root_.InfoLossLAR.WorstCase.BooleanProgram.run word.length
(_root_.InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit.preparedLoadOps (_root_.Integration9_9.GenericBody.bodyQueryProgram R.machine) word.length
(_root_.Integration9_9.GenericBody.bodySources R.machine D word.length)) (_root_.InfoLossLAR.WorstCase.TM2Boolean.wordExtension word)
/-- Pure register-width transport of a quantum state. -/
def castBodyState {left right : ℕ} (h : left=right) (state : QState left) : QState right := h ▸ state
end Integration9_9.GenericBodySemantics
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBodySemantics
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean.PolyProgramCircuit
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open Integration9_9.GenericBody Integration9_9.LARCoinLayout
/-- Quoting a genuine raw Boolean-stack program yields an actual native
encoded-list program. This introduces no new computability hypothesis. -/
theorem poly_of_rawProgram {f : Str → Str} (P : PolyProgram id id f) : Poly f := by
exact ⟨((BooleanLists.unpackProgram.comp P).comp BooleanLists.packProgram).congr f (fun _ => rfl)⟩
def queryOutputOfProgram {f : Str → Str} (P : PolyProgram id id f) (word : Str) : Str :=
_root_.Integration9_9.LARCoinLayout.encodeQueryOutput (_root_.Integration9_9.LARCoinLayout.queryWireSlots P.sizeBound word) (f word)
@[fun_prop] theorem queryOutputOfProgram_poly {f : Str → Str} (P : PolyProgram id id f) :
Poly (_root_.Integration9_9.GenericBodySemantics.queryOutputOfProgram P) := by
have hp : Poly (fun word : Str => (_root_.Integration9_9.LARCoinLayout.queryWireSlots P.sizeBound word,f word)) :=
Poly.pair (f := _root_.Integration9_9.LARCoinLayout.queryWireSlots P.sizeBound) (g := f)
(_root_.Integration9_9.LARCoinLayout.queryWireSlots_poly P.sizeBound) (_root_.Integration9_9.GenericBodySemantics.poly_of_rawProgram P)
exact Poly.comp (f := fun input : List Unit × Str => _root_.Integration9_9.LARCoinLayout.encodeQueryOutput input.1 input.2)
(g := fun word : Str => (_root_.Integration9_9.LARCoinLayout.queryWireSlots P.sizeBound word,f word)) _root_.Integration9_9.LARCoinLayout.encodeQueryOutput_poly hp
/-- Actual output-layout machine for any genuine raw polynomial program. Its
padding is the program's proved output-size polynomial, on every malformed word. -/
def specificationOfProgram {f : Str → Str} (P : PolyProgram id id f) : _root_.Integration9_9.GenericBodySemantics.QuerySpecification where
machine := {
f := _root_.Integration9_9.GenericBodySemantics.queryOutputOfProgram P
program := _root_.Integration9_9.LARCoinLayout.rawPolyProgram (f := _root_.Integration9_9.GenericBodySemantics.queryOutputOfProgram P) (_root_.Integration9_9.GenericBodySemantics.queryOutputOfProgram_poly P)
padding := P.sizeBound
output_length := by
intro word
rw [_root_.Integration9_9.GenericBodySemantics.queryOutputOfProgram,_root_.Integration9_9.LARCoinLayout.encodeQueryOutput_length,_root_.Integration9_9.LARCoinLayout.queryWireSlots_length] }
query := f
encoding := by
intro word
unfold _root_.Integration9_9.GenericBodySemantics.queryOutputOfProgram _root_.Integration9_9.LARCoinLayout.queryWireSlots
simp only [List.length_map]
query_bound := P.length_bound
/-- The real native input adapter retains fair coins first in the quantum
register, but passes the exact published encPair representation to the raw pre. -/
def coinFirstProgram {pre : Str → Str} (P : PolyProgram id id pre) (coins : Polynomial ℕ) :
PolyProgram id id (fun word : Str => pre (_root_.Integration9_9.LARCoinLayout.coinFirstPair coins word)) :=
(_root_.Integration9_9.LARCoinLayout.rawPolyProgram (f := _root_.Integration9_9.LARCoinLayout.coinFirstPair coins) (_root_.Integration9_9.LARCoinLayout.coinFirstPair_poly coins)).comp P
def specificationOfPre {pre : Str → Str} (P : PolyProgram id id pre) (coins : Polynomial ℕ) :
_root_.Integration9_9.GenericBodySemantics.QuerySpecification := _root_.Integration9_9.GenericBodySemantics.specificationOfProgram (_root_.Integration9_9.GenericBodySemantics.coinFirstProgram P coins)
end Integration9_9.GenericBodySemantics
end
end
section
namespace InfoLossLAR
end InfoLossLAR
namespace InfoLossLAR.WorstCase
end InfoLossLAR.WorstCase
namespace InfoLossLAR.WorstCase.BooleanGate
end InfoLossLAR.WorstCase.BooleanGate
namespace InfoLossLAR.WorstCase.emittedOutput_get
end InfoLossLAR.WorstCase.emittedOutput_get
namespace Integration9_9
end Integration9_9
namespace Integration9_9.LARCoinLayout
end Integration9_9.LARCoinLayout
namespace Integration9_9.LARCoinLayout.castBodyState
end Integration9_9.LARCoinLayout.castBodyState
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.RandomizedCircuit
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open Integration9_9.LARCoinLayout
open QAlgorithms.Complexity Polynomial
/-- The actual coin-first input length, computed from the original input length. -/
def workLength (coins : Polynomial ℕ) (n : ℕ) : ℕ := coins.eval n+n
def ancillary (coins : Polynomial ℕ) (F : Family) (n : ℕ) : ℕ :=
coins.eval n+(n+F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins n))
def width (coins : Polynomial ℕ) (F : Family) (n : ℕ) : ℕ := n+(_root_.Integration9_9.RandomizedCircuit.ancillary coins F n+1)
def copySources (coins : Polynomial ℕ) (n : ℕ) : List (Bool × ℕ) :=
_root_.InfoLossLAR.WorstCase.inputCopySources (List.replicate (coins.eval n) ()) (List.replicate n ())
theorem copySources_length (coins : Polynomial ℕ) (n : ℕ) :
(_root_.Integration9_9.RandomizedCircuit.copySources coins n).length=_root_.Integration9_9.RandomizedCircuit.workLength coins n := by
simp only [_root_.Integration9_9.RandomizedCircuit.copySources,_root_.InfoLossLAR.WorstCase.inputCopySources_length,List.length_replicate,_root_.Integration9_9.RandomizedCircuit.workLength]
def copyGates (coins : Polynomial ℕ) (F : Family) (n : ℕ) : List (_root_.InfoLossLAR.WorstCase.BooleanGate (_root_.Integration9_9.RandomizedCircuit.width coins F n)) :=
_root_.InfoLossLAR.WorstCase.BooleanProgram.gates n (_root_.InfoLossLAR.WorstCase.registerLoadOps (_root_.Integration9_9.RandomizedCircuit.copySources coins n)) (by
rw [_root_.InfoLossLAR.WorstCase.registerLoadOps_length,_root_.Integration9_9.RandomizedCircuit.copySources_length]
unfold _root_.Integration9_9.RandomizedCircuit.workLength _root_.Integration9_9.RandomizedCircuit.width _root_.Integration9_9.RandomizedCircuit.ancillary
omega)
def hadamardCircuit (coins : Polynomial ℕ) (F : Family) (n : ℕ) : Layered (_root_.Integration9_9.RandomizedCircuit.width coins F n) :=
_root_.Integration9_9.LARCoinLayout.castBodyCircuit (by unfold _root_.Integration9_9.RandomizedCircuit.width _root_.Integration9_9.RandomizedCircuit.ancillary; omega)
(_root_.InfoLossLAR.WorstCase.rightCircuit (n := n)
(_root_.InfoLossLAR.WorstCase.leftCircuit (m := n+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins n)+1)) (_root_.InfoLossLAR.WorstCase.coinCircuit (coins.eval n))))
def queryCircuit (coins : Polynomial ℕ) (F : Family) (n : ℕ) : Layered (_root_.Integration9_9.RandomizedCircuit.width coins F n) :=
_root_.Integration9_9.LARCoinLayout.castBodyCircuit (by unfold _root_.Integration9_9.RandomizedCircuit.width _root_.Integration9_9.RandomizedCircuit.ancillary _root_.Integration9_9.RandomizedCircuit.workLength; omega)
(_root_.InfoLossLAR.WorstCase.rightCircuit (n := n) (F.circ (_root_.Integration9_9.RandomizedCircuit.workLength coins n)))
/-- One actual outer circuit copies the original word, prepares fair H coins,
and runs the already uniform body on the coin-first copied input. -/
def circuit (coins : Polynomial ℕ) (F : Family) (n : ℕ) : Layered (_root_.Integration9_9.RandomizedCircuit.width coins F n) :=
_root_.InfoLossLAR.WorstCase.compileReversible (_root_.InfoLossLAR.WorstCase.booleanToReversible (_root_.Integration9_9.RandomizedCircuit.copyGates coins F n))++
_root_.Integration9_9.RandomizedCircuit.hadamardCircuit coins F n++_root_.Integration9_9.RandomizedCircuit.queryCircuit coins F n
def output (coins : Polynomial ℕ) (F : Family) (n : ℕ) : Fin (_root_.Integration9_9.RandomizedCircuit.width coins F n) :=
⟨n+(F.out (_root_.Integration9_9.RandomizedCircuit.workLength coins n)).val,by
have h := (F.out (_root_.Integration9_9.RandomizedCircuit.workLength coins n)).isLt
unfold _root_.Integration9_9.RandomizedCircuit.width _root_.Integration9_9.RandomizedCircuit.ancillary _root_.Integration9_9.RandomizedCircuit.workLength at *
omega⟩
def family (coins : Polynomial ℕ) (F : Family) : Family where
anc := _root_.Integration9_9.RandomizedCircuit.ancillary coins F
circ := _root_.Integration9_9.RandomizedCircuit.circuit coins F
out := _root_.Integration9_9.RandomizedCircuit.output coins F
end Integration9_9.RandomizedCircuit
end
end
section
namespace Integration9_9
end Integration9_9
namespace Integration9_9.RandomizedCircuit
end Integration9_9.RandomizedCircuit
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.RandomizedCircuit
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open Integration9_9.LARCoinLayout
open QAlgorithms.Complexity Polynomial
open scoped BigOperators
/-- Reassociation from coin/word/ancilla to the body's actual input register. -/
theorem work_width (coins : Polynomial ℕ) (F : Family) (n : ℕ) :
coins.eval n+(n+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins n)+1))=
_root_.Integration9_9.RandomizedCircuit.workLength coins n+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins n)+1) := by unfold _root_.Integration9_9.RandomizedCircuit.workLength; omega
def coherentInput (coins : Polynomial ℕ) (F : Family) (word : Str) :
QState (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length)+1)) :=
_root_.Integration9_9.LARCoinLayout.castBodyState (_root_.Integration9_9.RandomizedCircuit.work_width coins F word.length)
(_root_.InfoLossLAR.WorstCase.tensorState (fun _ => _root_.InfoLossLAR.WorstCase.coinAmplitude (coins.eval word.length))
(basisInput (a := F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length)) (toBits word)))
def branchInput (coins : Polynomial ℕ) (F : Family) (word : Str)
(coin : Bits (coins.eval word.length)) :
QState (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length)+1)) :=
_root_.Integration9_9.LARCoinLayout.castBodyState (_root_.Integration9_9.RandomizedCircuit.work_width coins F word.length)
(_root_.InfoLossLAR.WorstCase.computationalBasis (Fin.append coin (Fin.append (toBits word) (fun _ => false))))
def branchOutput (coins : Polynomial ℕ) (F : Family) (word : Str)
(coin : Bits (coins.eval word.length)) :
QState (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length)+1)) :=
runLayered (F.circ (_root_.Integration9_9.RandomizedCircuit.workLength coins word.length)) (_root_.Integration9_9.RandomizedCircuit.branchInput coins F word coin)
end Integration9_9.RandomizedCircuit
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.RandomizedCircuit
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open Integration9_9.LARCoinLayout
open QAlgorithms.Complexity Polynomial
open scoped BigOperators
/-- The classical full input register is read-only in the final output state. -/
def PreservesClassicalInput (F : Family) : Prop :=
∀ word : Str,∀ output : Bits (word.length+(F.anc word.length+1)),
runLayered (F.circ word.length) (basisInput (toBits word)) output ≠ 0 →
∀ index : Fin word.length,output (Fin.castAdd (F.anc word.length+1) index)=toBits word index
def coinLabel (coins : Polynomial ℕ) (F : Family) (n : ℕ)
(input : Bits (_root_.Integration9_9.RandomizedCircuit.workLength coins n+(F.anc (_root_.Integration9_9.RandomizedCircuit.workLength coins n)+1))) : Bits (coins.eval n) :=
fun index => input ⟨index.val,by unfold _root_.Integration9_9.RandomizedCircuit.workLength; omega⟩
end Integration9_9.RandomizedCircuit
end
end
section
namespace InfoLossLAR
end InfoLossLAR
namespace InfoLossLAR.WorstCase
end InfoLossLAR.WorstCase
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.RandomizedCircuit
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.TM2Boolean
open Integration9_9.LARCoinLayout
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open QMCNumericRuntime TM2PlatformSerialization
def ancillarySlots (coins : Polynomial ℕ) (word description : Str) : List Unit :=
_root_.Integration9_9.LARCoinLayout.queryWireSlots coins word++word.map (fun _ => ())++(_root_.InfoLossLAR.WorstCase.unaryPayload description).map (fun _ => ())
def allSlots (coins : Polynomial ℕ) (word description : Str) : List Unit :=
word.map (fun _ => ())++_root_.Integration9_9.RandomizedCircuit.ancillarySlots coins word description++[()]
def copyWords (coins : Polynomial ℕ) (word description : Str) : List Str :=
_root_.InfoLossLAR.WorstCase.inputCopyGateWords (_root_.Integration9_9.RandomizedCircuit.allSlots coins word description) (_root_.Integration9_9.LARCoinLayout.queryWireSlots coins word) (word.map (fun _ => ()))
/-- Only the copy phase is compiled here; its designated output is irrelevant. -/
def copyBooleanFamily (coins : Polynomial ℕ) (F : Family) : _root_.InfoLossLAR.WorstCase.BooleanFamily where
anc := _root_.Integration9_9.RandomizedCircuit.ancillary coins F
gates := _root_.Integration9_9.RandomizedCircuit.copyGates coins F
out n := ⟨0,by omega⟩
def copyDescription (coins : Polynomial ℕ) (word description : Str) : Str :=
_root_.Integration9_9.TM2PlatformSerialization.lengthToken (_root_.Integration9_9.RandomizedCircuit.ancillarySlots coins word description)++encNat 0++_root_.Integration9_9.TM2PlatformSerialization.serializeWords (_root_.Integration9_9.RandomizedCircuit.copyWords coins word description)
def copyQuantumDescription (coins : Polynomial ℕ) (word description : Str) : Str :=
_root_.InfoLossLAR.WorstCase.compileReversibleDescription (_root_.InfoLossLAR.WorstCase.compileBooleanDescription (_root_.Integration9_9.RandomizedCircuit.copyDescription coins word description))
def hadamardWords (coins : Polynomial ℕ) (word : Str) : List (List Str) :=
_root_.InfoLossLAR.WorstCase.shiftCircuitWords word (_root_.InfoLossLAR.WorstCase.readCircuitLayers (_root_.InfoLossLAR.WorstCase.coinCircuitDescription ((_root_.Integration9_9.LARCoinLayout.queryWireSlots coins word).map (fun _ => true)))).2
def queryWords (word description : Str) : List (List Str) :=
_root_.InfoLossLAR.WorstCase.shiftCircuitWords word (_root_.InfoLossLAR.WorstCase.readFamilyCircuitLayers description)
def outputWord (coins : Polynomial ℕ) (word description : Str) : Str :=
_root_.InfoLossLAR.WorstCase.shiftWireWord word (_root_.InfoLossLAR.WorstCase.readFamilyFrame (_root_.Integration9_9.LARCoinLayout.queryWireRequest coins word,description)).2.1
/-- The literal complete randomized-family code emitted by a genuine native
program after the original uniform body's description is obtained. -/
def description (coins : Polynomial ℕ) (word bodyDescription : Str) : Str :=
_root_.Integration9_9.TM2PlatformSerialization.lengthToken (_root_.Integration9_9.RandomizedCircuit.ancillarySlots coins word bodyDescription)++_root_.Integration9_9.RandomizedCircuit.outputWord coins word bodyDescription++
_root_.Integration9_9.TM2PlatformSerialization.serializeWords ((_root_.InfoLossLAR.WorstCase.readFamilyCircuitLayers (_root_.Integration9_9.RandomizedCircuit.copyQuantumDescription coins word bodyDescription)++
_root_.Integration9_9.RandomizedCircuit.hadamardWords coins word++_root_.Integration9_9.RandomizedCircuit.queryWords word bodyDescription).map _root_.Integration9_9.TM2PlatformSerialization.serializeWords)
attribute [local irreducible] copyQuantumDescription hadamardWords queryWords
end Integration9_9.RandomizedCircuit
end
end
section
namespace Integration9_9
end Integration9_9
namespace Integration9_9.RandomizedCircuit
end Integration9_9.RandomizedCircuit
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option backward.isDefEq.respectTransparency false
namespace Integration9_9.RandomizedCircuit
open InfoLossLAR.WorstCase
open Integration9_9.LARCoinLayout Integration9_9.LARRankOneMachine Integration9_9.TM2PlatformSerialization
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
/-- The real native postprocessor returns the one bit appended by D. -/
def passOutput (word : Str) : Str := [(word.reverse.head?).getD false]
end Integration9_9.RandomizedCircuit
end
section
namespace InfoLossLAR
end InfoLossLAR
namespace InfoLossLAR.WorstCase
end InfoLossLAR.WorstCase
namespace InfoLossLAR.WorstCase.BooleanGate
end InfoLossLAR.WorstCase.BooleanGate
namespace Integration9_9
end Integration9_9
namespace Integration9_9.GenericBodySemantics
end Integration9_9.GenericBodySemantics
namespace Integration9_9.GenericBodySemantics.castBodyState
end Integration9_9.GenericBodySemantics.castBodyState
namespace Integration9_9.LARCoinLayout
end Integration9_9.LARCoinLayout
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GenericBodySemantics
open InfoLossLAR.WorstCase
open QAlgorithms.Complexity Polynomial
open OAI.MetricKMedian.Binary
open Integration9_9.RandomizedCircuit
/-- The actual full randomized family for any genuine native classical pre:
coin/input framing, verified output compiler, true D bundle/selector, and H coins. -/
def nativeFamily {pre : Str → Str} (P : PolyProgram id id pre) (coins : Polynomial ℕ) (D : Family) : Family :=
_root_.Integration9_9.RandomizedCircuit.family coins (_root_.Integration9_9.GenericBody.bodyFamily (_root_.Integration9_9.GenericBodySemantics.specificationOfPre P coins).machine D)
end Integration9_9.GenericBodySemantics
end
end
section
namespace AFT
end AFT
namespace AFT.FiniteDist
end AFT.FiniteDist
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace InfoLossLAR.WorstCase
open QAlgorithms.Complexity AFT
open scoped BigOperators Classical
/-- Literal pointwise application of independently sampled public affine data
to the observed matrix and response in each actual table block. -/
def affineObservedTable {q d N t : ℕ} [NeZero q] {Ω : Type}
(samp : Ω → Matrix (Fin d) (Fin d) ℤ × (Fin d → ℤ)) (seeds : Fin t → Ω)
(table : Fin t → Matrix (Fin d) (Fin N) (ZMod q) × (Fin d → ZMod q)) :
Fin t → Matrix (Fin d) (Fin N) (ZMod q) × (Fin d → ZMod q) :=
fun index => (matModq q (samp (seeds index)).1*(table index).1,
evalAffine (samp (seeds index)).1 (samp (seeds index)).2 (table index).2)
end InfoLossLAR.WorstCase
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1000000
namespace Integration9_9.BlockCoins
open InfoLossLAR.WorstCase QAlgorithms.Complexity
/-- The actual contiguous block decomposition of a flat fair-bit tape. -/
def blockEquiv (blocks bits : ℕ) : (Fin (blocks*bits) → Bool) ≃ (Fin blocks → Fin bits → Bool) :=
(Equiv.arrowCongr finProdFinEquiv.symm (Equiv.refl Bool)).trans (Equiv.curry (Fin blocks) (Fin bits) Bool)
/-- Fresh independent affine-block tapes and one independent rank-one tape. -/
def blocksAndTailEquiv (blocks bits tail : ℕ) :
(Fin (blocks*bits+tail) → Bool) ≃ (Fin blocks → Fin bits → Bool) × (Fin tail → Bool) :=
(_root_.Integration9_9.FairBitPadding.splitEquiv (blocks*bits) tail).trans
(Equiv.prodCongr (_root_.Integration9_9.BlockCoins.blockEquiv blocks bits) (Equiv.refl (Fin tail → Bool)))
end Integration9_9.BlockCoins
end
section
namespace Integration9_9
end Integration9_9
namespace Integration9_9.BlockCoins
end Integration9_9.BlockCoins
namespace Integration9_9.GenericBodySemantics
end Integration9_9.GenericBodySemantics
set_option autoImplicit false
set_option maxHeartbeats 1500000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GaussianRankOnePre
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.Integration
open QAlgorithms.Complexity Polynomial CurrentAFT
open OAI.MetricKMedian.Binary OAI.MetricKMedian.Binary.Automatic
open QMCNumericRuntime LARRankOneMachine LARCoinLayout TM2PlatformSerialization LARPlatformEncoding
attribute [local irreducible] TM2NativeAffinePre.fields TM2NativeAffinePre.current TM2NativeAffinePre.blockBits
/-- Real number of sampler bits consumed by the actual parsed observed table. -/
def usedCoins (m : Polynomial ℕ) (word : Str) : ℕ :=
(_root_.Integration9_9.TM2NativeAffinePre.fields word).1.2.2.length*
_root_.Integration9_9.TM2NativeAffinePre.blockBits m ((_root_.Integration9_9.TM2NativeAffinePre.fields word).1.1.map (fun _ => ()))
@[fun_prop] theorem usedCoins_poly (m : Polynomial ℕ) : Poly (_root_.Integration9_9.GaussianRankOnePre.usedCoins m) := by
have hp : Poly (fun parsed : _root_.Integration9_9.TM2NativeAffinePre.Fields × Str =>
parsed.1.2.2.length*_root_.Integration9_9.TM2NativeAffinePre.blockBits m (parsed.1.1.map (fun _ => ()))) := by
fun_prop
exact Poly.comp (f := fun parsed : _root_.Integration9_9.TM2NativeAffinePre.Fields × Str =>
parsed.1.2.2.length*_root_.Integration9_9.TM2NativeAffinePre.blockBits m (parsed.1.1.map (fun _ => ())))
(g := _root_.Integration9_9.TM2NativeAffinePre.fields) hp _root_.Integration9_9.TM2NativeAffinePre.fields_poly
def remainingCoins (m : Polynomial ℕ) (word : Str) : Str :=
(_root_.Integration9_9.TM2NativeAffinePre.fields word).2.drop (_root_.Integration9_9.GaussianRankOnePre.usedCoins m word)
@[fun_prop] theorem remainingCoins_poly (m : Polynomial ℕ) : Poly (_root_.Integration9_9.GaussianRankOnePre.remainingCoins m) := by
unfold _root_.Integration9_9.GaussianRankOnePre.remainingCoins
exact Poly.comp (f := fun x : Str × ℕ => x.1.drop x.2)
(g := fun word : Str => ((_root_.Integration9_9.TM2NativeAffinePre.fields word).2,_root_.Integration9_9.GaussianRankOnePre.usedCoins m word))
parser_drop_poly (by fun_prop)
def preparedInput (order : ℕ) (m : Polynomial ℕ) (word : Str) : Str :=
encPair (_root_.Integration9_9.GaussianRankOnePre.remainingCoins m word) (_root_.Integration9_9.TM2NativeAffinePre.current order m word)
@[fun_prop] theorem preparedInput_poly (order : ℕ) (m : Polynomial ℕ) : Poly (_root_.Integration9_9.GaussianRankOnePre.preparedInput order m) := by
unfold _root_.Integration9_9.GaussianRankOnePre.preparedInput
exact Poly.comp (f := fun pair : Str × Str => encPair pair.1 pair.2)
(g := fun word : Str => (_root_.Integration9_9.GaussianRankOnePre.remainingCoins m word,_root_.Integration9_9.TM2NativeAffinePre.current order m word)) _root_.Integration9_9.LARPlatformEncoding.encPair_poly
(Poly.pair (_root_.Integration9_9.GaussianRankOnePre.remainingCoins_poly m) (_root_.Integration9_9.TM2NativeAffinePre.current_poly order m))
/-- One actual raw preprocessor consumes independent block sampler bits first
and the fresh rank-one suffix second, finally querying the original D. -/
def current (order : ℕ) (m : Polynomial ℕ) (fallback : Str) (word : Str) : Str :=
_root_.Integration9_9.LARRankOneMachine.boundedRankOneStringPre fallback (_root_.Integration9_9.GaussianRankOnePre.preparedInput order m word)
@[fun_prop] theorem current_poly (order : ℕ) (m : Polynomial ℕ) (fallback : Str) : Poly (_root_.Integration9_9.GaussianRankOnePre.current order m fallback) :=
Poly.comp (f := _root_.Integration9_9.LARRankOneMachine.boundedRankOneStringPre fallback) (g := _root_.Integration9_9.GaussianRankOnePre.preparedInput order m)
(_root_.Integration9_9.LARRankOneMachine.boundedRankOneStringPre_poly fallback) (_root_.Integration9_9.GaussianRankOnePre.preparedInput_poly order m)
def currentProgram (order : ℕ) (m : Polynomial ℕ) (fallback : Str) :
PolyProgram id id (_root_.Integration9_9.GaussianRankOnePre.current order m fallback) := _root_.Integration9_9.LARCoinLayout.rawPolyProgram (_root_.Integration9_9.GaussianRankOnePre.current_poly order m fallback)
/-- Explicit rank-one coin polynomial from the actual ticket-count program. -/
def rankCoinBudget : Polynomial ℕ := _root_.Integration9_9.LARRankOneMachine.observedTicketCount_poly.program.sizeBound.comp (3*X)
def coins (m : Polynomial ℕ) : Polynomial ℕ := _root_.Integration9_9.TM2NativeAffineBudget.coins m+_root_.Integration9_9.GaussianRankOnePre.rankCoinBudget
end Integration9_9.GaussianRankOnePre
end
end
section
namespace InfoLossLAR
end InfoLossLAR
namespace InfoLossLAR.WorstCase
end InfoLossLAR.WorstCase
namespace Integration9_9
end Integration9_9
namespace Integration9_9.RandomizedCircuit
end Integration9_9.RandomizedCircuit
namespace Integration9_9.RandomizedCircuit.uniform_expectation_avg
end Integration9_9.RandomizedCircuit.uniform_expectation_avg
set_option autoImplicit false
set_option maxHeartbeats 1500000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
noncomputable section
namespace Integration9_9.GaussianRankOnePre
open InfoLossLAR.WorstCase InfoLossLAR.WorstCase.Integration
open QAlgorithms.Complexity Polynomial CurrentAFT
open OAI.MetricKMedian.Binary
open LARRankOneMachine LARCoinLayout GenericBodySemantics
attribute [local irreducible] famq famd current rankCoinBudget coins currentProgram
boundedRankOneStringPre observedTicketCount fixedFamilyActualSampler
/-- The fixed raw-rank-one coin budget, expressed as an actual QPT family. -/
def rankOneFamily (fallback : Str) (D : Family) : Family :=
_root_.Integration9_9.RandomizedCircuit.family _root_.Integration9_9.GaussianRankOnePre.rankCoinBudget
(_root_.Integration9_9.LARCoinLayout.bodyFamily _root_.Integration9_9.GaussianRankOnePre.rankCoinBudget (_root_.Integration9_9.LARCoinLayout.bodyQueryBudget _root_.Integration9_9.GaussianRankOnePre.rankCoinBudget fallback) fallback D)
/-- The actual final single-D-call family for Gaussian→affine→rank-one. -/
def combinedFamily (order : ℕ) (m : Polynomial ℕ) (fallback : Str) (D : Family) : Family :=
_root_.Integration9_9.GenericBodySemantics.nativeFamily (_root_.Integration9_9.GaussianRankOnePre.currentProgram order m fallback) (_root_.Integration9_9.GaussianRankOnePre.coins m) D
end Integration9_9.GaussianRankOnePre
end
end
section
set_option autoImplicit false
set_option maxHeartbeats 1600000
set_option maxRecDepth 10000
set_option backward.isDefEq.respectTransparency false
namespace InfoLossLAR.WorstCase.UnitAffineProbability
open QAlgorithms.Complexity AFT
open scoped Classical
noncomputable section
/-- Invertibility is the only matrix assumption needed for exact preservation
of the full uniform public matrix. -/
def leftMatrixEquiv {q d N : ℕ} (Q : Matrix (Fin d) (Fin d) (ZMod q)) (hQ : IsUnit Q.det) :
Matrix (Fin d) (Fin N) (ZMod q) ≃ Matrix (Fin d) (Fin N) (ZMod q) where
toFun A := Q*A
invFun A := Q⁻¹*A
left_inv A := by
change Q⁻¹*(Q*A)=A
rw [← Matrix.mul_assoc,Matrix.nonsing_inv_mul Q hQ,Matrix.one_mul]
right_inv A := by
change Q*(Q⁻¹*A)=A
rw [← Matrix.mul_assoc,Matrix.mul_nonsing_inv Q hQ,Matrix.one_mul]
def affineVectorEquiv {q d : ℕ} (Q : Matrix (Fin d) (Fin d) ℤ) (beta : Fin d → ℤ)
(hQ : IsUnit (matModq q Q).det) : (Fin d → ZMod q)≃(Fin d → ZMod q) where
toFun x := evalAffine Q beta x
invFun x := (matModq q Q)⁻¹.mulVec (x-modq q beta)
left_inv x := by simp only [evalAffine,add_sub_cancel_right,Matrix.mulVec_mulVec,
Matrix.nonsing_inv_mul _ hQ,Matrix.one_mulVec]
right_inv x := by simp only [evalAffine,Matrix.mulVec_mulVec,Matrix.mul_nonsing_inv _ hQ,
Matrix.one_mulVec,sub_add_cancel]
section Bounds
variable {q d N : ℕ} [NeZero q] {Ω : Type} [Fintype Ω] [Nonempty Ω]
variable (samp : Ω → Matrix (Fin d) (Fin d) ℤ×(Fin d → ℤ))
variable (sigma : ℝ) (hsigma : 0 < sigma) (target : FiniteDist (Fin d → ZMod q))
variable (hinv : ∀ seed,IsUnit (matModq q (samp seed).1).det)
variable (D : Family) (lam : ℕ) (pp : Str) (t : ℕ)
include hinv
end Bounds
end
end InfoLossLAR.WorstCase.UnitAffineProbability
end
Source
Companion Lean implementation for InfoLossLAR.WorstCase.fixed_family_gaussian_advantage_transfer. The definitions are extracted from the checked source modules listed in the publication manifest at /private/tmp/p2m_task4/first_bridge_extraction/publication_ready.json. Exact generated-source SHA-256: c29c193a53e94a34e8deb11cccc68461bafe9c4fbc73244c90f8fd9513101de2. Source modules: Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyLayout, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyFamily, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyResources, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyBooleanEmission, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyDEmission, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyUniform, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodySpec, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericBodyPreparedState, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeGenericQueryFactory, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeRandomizedFamily, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeRandomizedBranches, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeRandomizedBranchBasis, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeRandomizedUniform, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeRankOneCallsOnce, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeNativeCallsOnce, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeAffineActualProbability, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeBlockCoins, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeCombinedPre, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeCombinedProbability, Definitions.Def_InfoLossLAR_FirstBridge_Solutions_AdvantageBridgeUnitAffineProbability.