Research notes and source code
Read the arguments, inspect their supporting programs, or download the original source files. Code pages include line links and highlighting for supported languages.
Repository research notes
Browse 138 files
- Branching coefficient readers with final-only breadth docs/research-programs/branching-coefficient-readers.md
- Cross-scale reuse: terminal masks, union compilation and release time docs/research-programs/cross-scale-mask-union.md
- Cross-scale composition: short routes are not ready routes docs/research-programs/cross-scale-routing-contract.md
- Learned widths: future rank, a prepared reader, and the missing producer docs/research-programs/cross-width-parity-reader.md
- Width-ready registration without old-mask rewriting docs/research-programs/cross-width-registration.md
- Entry 129: persistent composition and negative readout docs/research-programs/entry-129-persistent-composition.md
- Exact counter observations and persistent count classes docs/research-programs/finite-observation-counter-actions.md
- Parity complements: composition is small, streamed residuals need not be docs/research-programs/parity-complement-cut-access.md
- Universal refinement receipts and the bounded-diversity escape docs/research-programs/shared-refinement-receipt-boundary.md
- Assessment 124: persistence proofs and charged substitution site/docs/foundations-runs/run-124-review.md
- Assessment159: primary proofs and dense affine recompilation site/docs/foundations-runs/run-159-review.md
- Assessment160: learned Boolean parity cells site/docs/foundations-runs/run-160-review.md
- Assessment161: live dependencies and coordinate recycling site/docs/foundations-runs/run-161-review.md
- Assessment164: coordinate adoption and primary-proof review site/docs/foundations-runs/run-164-review.md
- Assessment170: dense suffixes finance short-name composition site/docs/foundations-runs/run-170-review.md
- Assessment175: exact observations and moving count classes site/docs/foundations-runs/run-175-review.md
- Learned widths: future rank, a prepared reader, and the missing producer docs/research-programs/cross-width-parity-reader.md · cited revision
- Width-ready registration without old-mask rewriting docs/research-programs/cross-width-registration.md · cited revision
- Current count classes require version-aware routing docs/research-programs/count-class-access-boundary.md
- Assessment 176: current count classes need version-aware routing site/docs/foundations-runs/run-176-review.md
- Name weights do not pay for arbitrary class broadcasts docs/research-programs/name-weighted-class-routing.md
- Assessment 177: name weights and shared class predicates site/docs/foundations-runs/run-177-review.md
- Final diversity forces a future work window docs/research-programs/final-diversity-completion-debt.md
- Assessment 178: final diversity forces paid future work site/docs/foundations-runs/run-178-review.md
- Later-partition adoption: conservation of earlier incidences docs/research-programs/partition-adoption-certificate.md
- Late keys: metric discovery reduces to versioned finite actions docs/research-programs/late-key-metric-actions.md
- Prefix depth profiles: the missing joint access operation docs/research-programs/prefix-depth-profile-access.md
- Indexed preparation and readable unfinished work docs/research-programs/indexed-preparation-readout.md
- Assessment139: late profile correction and dynamic join maintenance site/docs/foundations-runs/run-139-review.md
- Assessment144: prefix-image readout and persistent checkpoint access site/docs/foundations-runs/run-144-review.md
- Assessment153: prefix-profile access boundary site/docs/foundations-runs/run-153-review.md
- Assessment154: primary proofs for indexing and scheduled work site/docs/foundations-runs/run-154-review.md
- Assessment 179: readable composition notes and source evidence site/docs/foundations-runs/run-179-review.md
- Assessment 180: completion debt and the release of correction work site/docs/foundations-runs/run-180-review.md
- Input-dominated class updates and reusable binary balls docs/research-programs/input-dominated-class-routing.md
- Assessment 181: input-dominated classes and reusable balls site/docs/foundations-runs/run-181-review.md
- Deadline-safe reuse with missing levels docs/research-programs/name-funded-ball-reuse.md
- Assessment 182: name-funded pending reuse of nested balls site/docs/foundations-runs/run-182-review.md
- Assessment 183: native reuse with missing levels site/docs/foundations-runs/run-183-review.md
- Assessment 184: arbitrary bounded holes have a native export site/docs/foundations-runs/run-184-review.md
- Readable pending work: queue proofs and the gap-list construction site/docs/foundations-runs/run-185-review.md
- Assessment 186: different maxima and the cost of new holes site/docs/foundations-runs/run-186-review.md
- Assessment 187: fixed live slots for unbounded promotions site/docs/foundations-runs/run-187-review.md
- Assessment 188: interval endpoints do not pay early minimum access site/docs/foundations-runs/run-188-review.md
- Short names make suffix reuse locally readable docs/research-programs/name-dominated-suffix-reuse.md
- Assessment 189: name-sensitive search closes a restricted suffix case site/docs/foundations-runs/run-189-review.md
- Persistent minima: what the priority-structure proofs supply site/docs/foundations-runs/run-190-review.md
- Editorial review of persistent composition notes site/docs/foundations-runs/run-191-review.md
- Threshold screening before persistent minimum readout docs/research-programs/threshold-refinement-frontier.md
- Assessment 192: screening debt and the missing persistent frontier site/docs/foundations-runs/run-192-review.md
- A local frontier for persistent suffix minima docs/research-programs/sparse-age-suffix-reuse.md
- Assessment 193: a local frontier removes the suffix name gate site/docs/foundations-runs/run-193-review.md
- Two suffix maxima with delayed classification docs/research-programs/two-maximum-suffix-reuse.md
- Assessment 194: two maxima with paid delayed classification site/docs/foundations-runs/run-194-review.md
- Persistent order: catenation supplies structure, not a successor oracle site/docs/foundations-runs/run-195-review.md
- Ordered suffix maxima with input-paid splicing docs/research-programs/ordered-suffix-reuse.md
- Ordered ranges with paid successor access site/docs/foundations-runs/run-196-review.md
- Editorial review of the suffix construction sequence site/docs/foundations-runs/run-197-review.md
- Interval reuse through persistent length bands docs/research-programs/banded-interval-reuse.md
- Persistent interval coverage with strict query deadlines site/docs/foundations-runs/run-198-review.md
- Many interval components with scale-sparse boundaries docs/research-programs/scale-sparse-band-reuse.md
- Many components with scale-sparse boundaries site/docs/foundations-runs/run-199-review.md
- Mixed-region sharing and the cost of pending work site/docs/foundations-runs/run-200-review.md
- Mixed-region budgets with input-paid preparation docs/research-programs/mixed-budget-band-reuse.md
- Complete-level input pays for mixed-region preparation site/docs/foundations-runs/run-201-review.md
- Sparse completion certificates: preparation without full levels docs/research-programs/sparse-completion-certificates.md
- Sparse completion and the cost of eager output site/docs/foundations-runs/run-202-review.md
- Reading the composition and reuse results site/docs/foundations-runs/run-203-review.md
- Sparse content reuse along learned spines docs/research-programs/learned-spine-profile-reuse.md
- Sparse content reuse along learned spines site/docs/foundations-runs/run-204-review.md
- Routing does not settle selected-row incidence site/docs/foundations-runs/run-205-review.md
- Clipped cones: the missing activation interface site/docs/foundations-runs/run-206-review.md
- Learned contexts and current residual answers docs/research-programs/learned-context-contraction.md
- Shared contexts make residual answers affordable site/docs/foundations-runs/run-207-review.md
- Early unique routing and the learned-hierarchy boundary docs/research-programs/routed-context-boundary.md
- Assessment 208: early routing and the learned-hierarchy boundary site/docs/foundations-runs/run-208-review.md
- Editorial review: recent composition and reuse readings site/docs/foundations-runs/run-209-review.md
- Persistent copying and changing ancestor answers site/docs/foundations-runs/run-210-review.md
- Unbounded learned contexts with query-paid codes docs/research-programs/tagged-context-reuse.md
- Assessment 211: permanent ownership and query-paid codes site/docs/foundations-runs/run-211-review.md
- Context codes at the scale of future questions docs/research-programs/length-class-context-codes.md
- Assessment 212: immutable codes by residual scale site/docs/foundations-runs/run-212-review.md
- Context names can destroy a cheap union geometry docs/research-programs/context-code-geometry.md
- Assessment 213: when context codes fragment a complete cone site/docs/foundations-runs/run-213-review.md
- Freeze the support, then compose in its branching coordinates docs/research-programs/frozen-support-reuse.md
- Assessment 214: frozen support and current branching answers site/docs/foundations-runs/run-214-review.md
- Persistent meanings and changing support coordinates site/docs/foundations-runs/run-215-review.md
- Grow support in separately owned components docs/research-programs/support-component-reuse.md
- Assessment 216: support growth without old-row migration site/docs/foundations-runs/run-216-review.md
- An unbounded component directory needs its own budget docs/research-programs/component-directory-budget.md
- Review 217: the missing component-directory charge site/docs/foundations-runs/run-217-review.md
- Growing support inside an input-learned envelope docs/research-programs/fixed-envelope-reuse.md
- Assessment 218: a learned fixed envelope for growing support site/docs/foundations-runs/run-218-review.md
- Sparse growing support through exact row classes docs/research-programs/cosingleton-support-reuse.md
- Assessment 219: sparse support through co-singleton classes site/docs/foundations-runs/run-219-review.md
- Assessment 220: compact differences still need a paid extension test site/docs/foundations-runs/run-220-review.md
- Assessment 221: reading the current composition frontier site/docs/foundations-runs/run-221-review.md
- Bounded omissions from input-paid scans docs/research-programs/scanned-omission-reuse.md
- Assessment 222: positive records pay for bounded omissions site/docs/foundations-runs/run-222-review.md
- Independent stores: separate service, bounded or routed readout docs/research-programs/independent-store-reuse.md
- Assessment 223: independent stores without common codes site/docs/foundations-runs/run-223-review.md
- Bounded ownership does not supply timely source access docs/research-programs/overlap-owner-access.md
- Assessment 224: owner discovery without timely source access site/docs/foundations-runs/run-224-review.md
- Assessment 225: transporting a search position between stores site/docs/foundations-runs/run-225-review.md
- Shared targets through a routed owner and bounded exceptions docs/research-programs/routed-scatter-reuse.md
- Assessment 226: routing large rows and materializing bounded exceptions site/docs/foundations-runs/run-226-review.md
- Assessment 227: reading the shared-target frontier site/docs/foundations-runs/run-227-review.md
- Shared foreign rows as independent reindexings docs/research-programs/namespace-reindexing-frontier.md
- Assessment 228: current activation under independent reindexings site/docs/foundations-runs/run-228-review.md
- Remaining query symbols can pay for learned reindexing docs/research-programs/suffix-paid-reindexing.md
- Assessment 229: a meaningful suffix pays learned access site/docs/foundations-runs/run-229-review.md
- When a stored answer becomes a usable answer site/docs/foundations-runs/run-230-review.md
- Learned suffix programs can keep one current activation dictionary docs/research-programs/delayed-suffix-reuse.md
- Assessment 231: learned suffix programs with paid delayed output site/docs/foundations-runs/run-231-review.md
- Release envelopes for persistent composition docs/research-programs/release-envelope-reuse.md
- Assessment 232: producer-checked release envelopes site/docs/foundations-runs/run-232-review.md
- Editorial review: delayed and speculative readout site/docs/foundations-runs/run-233-review.md
- Growing speculation: service cuts and the unresolved native scheduler docs/research-programs/speculative-service-frontier.md
- Assessment 234: growing speculation needs compatible service states site/docs/foundations-runs/run-234-review.md
- A feasible schedule is not yet an accessible policy site/docs/foundations-runs/run-235-review.md
- Shared traversal and selector-index routing docs/research-programs/crossindex-routing-frontier.md
- Shared traversal still needs a selector index site/docs/foundations-runs/run-236-review.md
- Shared activation indexes bypass long private tails docs/research-programs/activation-contraction-reuse.md
- Earlier paid contraction makes late answers accessible site/docs/foundations-runs/run-237-review.md
- A fixed normalization basis for independently learned views docs/research-programs/shared-boundary-normalizers.md
- Different learned views share one current index basis site/docs/foundations-runs/run-238-review.md
- Editorial review: shared work, routing and normalization site/docs/foundations-runs/run-239-review.md
- Recognizing a filler does not yet maintain its current answer site/docs/foundations-runs/run-240-review.md
- Learned filler words with a shared current-answer index docs/research-programs/learned-filler-reuse.md
- Learned fillers and bounded current-answer fibres site/docs/foundations-runs/run-241-review.md
- Unbounded filler fibres with a deferred shared index docs/research-programs/deferred-filler-index.md
- Assessment 242: unbounded filler fibres and current pending answers site/docs/foundations-runs/run-242-review.md
- Current shared answers across unbounded name lengths docs/research-programs/multiscale-filler-index.md
- Assessment 243: shared current answers across length classes site/docs/foundations-runs/run-243-review.md
- Short answers, late receipts and current-version routing docs/research-programs/cross-scale-receipt-frontier.md
- Assessment 244: late contraction receipts and current routing site/docs/foundations-runs/run-244-review.md
- Persistence overhead does not supply the current selector site/docs/foundations-runs/run-245-review.md
- A current selector cannot be copied into every owner path cheaply site/docs/foundations-runs/run-246-review.md
Repository source code
Browse 120 files
- check_ancestral_selectors.py tools/research/check_ancestral_selectors.py
- check_anchor_refinement.py tools/research/check_anchor_refinement.py
- check_bounded_type_dynamics.py tools/research/check_bounded_type_dynamics.py
- check_branching_coefficient_readers.py tools/research/check_branching_coefficient_readers.py
- check_count_class_actions.py tools/research/check_count_class_actions.py
- check_density_independent_readers.py tools/research/check_density_independent_readers.py
- check_final_one_profile.py tools/research/check_final_one_profile.py
- check_group_degree_boundary.py tools/research/check_group_degree_boundary.py
- check_hybrid_composition.py tools/research/check_hybrid_composition.py
- check_interval_boundary_composition.py tools/research/check_interval_boundary_composition.py
- check_learned_row_keys.py tools/research/check_learned_row_keys.py
- check_learned_width_cache.py tools/research/check_learned_width_cache.py
- check_mixed_region_budget.py tools/research/check_mixed_region_budget.py
- check_normalized_composition.py tools/research/check_normalized_composition.py
- check_prefix_cylinder_composition.py tools/research/check_prefix_cylinder_composition.py
- check_prefix_frontier_composition.py tools/research/check_prefix_frontier_composition.py
- check_residue_selectors.py tools/research/check_residue_selectors.py
- check_row_typed_composition.py tools/research/check_row_typed_composition.py
- check_stable_row_palettes.py tools/research/check_stable_row_palettes.py
- check_unambiguous_type_composition.py tools/research/check_unambiguous_type_composition.py
- check_gapcvp_parameters.py evidence/gapcvp-parameter-audit/check_gapcvp_parameters.py · cited revision
- check_causal_future_gcd.py tools/checks/check_causal_future_gcd.py · cited revision
- Basic.lean formalizations/frontier-derivative/FrontierDerivative/Basic.lean · cited revision
- PrincipalCover.lean formalizations/frontier-derivative/FrontierDerivative/PrincipalCover.lean · cited revision
- CoverExamples.lean formalizations/frontier-derivative/FrontierDerivative/CoverExamples.lean · cited revision
- CoverNormalization.lean formalizations/frontier-derivative/FrontierDerivative/CoverNormalization.lean · cited revision
- CloneProbe.lean formalizations/frontier-derivative/FrontierDerivative/CloneProbe.lean · cited revision
- RootSharing.lean formalizations/frontier-derivative/FrontierDerivative/RootSharing.lean · cited revision
- RootSharingMachine.lean formalizations/frontier-derivative/FrontierDerivative/RootSharingMachine.lean · cited revision
- FrontierAllocator.lean formalizations/frontier-derivative/FrontierDerivative/FrontierAllocator.lean · cited revision
- RejectingSink.lean formalizations/frontier-derivative/FrontierDerivative/RejectingSink.lean · cited revision
- ControlFunctional.lean formalizations/frontier-derivative/FrontierDerivative/ControlFunctional.lean · cited revision
- FiniteRefinement.lean formalizations/frontier-derivative/FrontierDerivative/FiniteRefinement.lean · cited revision
- FiniteReindexing.lean formalizations/frontier-derivative/FrontierDerivative/FiniteReindexing.lean · cited revision
- LastActionRefinement.lean formalizations/frontier-derivative/FrontierDerivative/LastActionRefinement.lean · cited revision
- BoundedActionWindow.lean formalizations/frontier-derivative/FrontierDerivative/BoundedActionWindow.lean · cited revision
- ActionWindowEscapeExamples.lean formalizations/frontier-derivative/FrontierDerivative/ActionWindowEscapeExamples.lean · cited revision
- Main.lean publications/persistent-stacks-scaffolding/lean/FPRDTransfer/Theorem16/Main.lean · cited revision
- Corollaries.lean publications/persistent-stacks-scaffolding/lean/FPRDTransfer/Theorem16/Corollaries.lean · cited revision
- PEGCorollary.lean formalizations/frontier-derivative/FrontierDerivative/PEGCorollary.lean · cited revision
- check_metric_group.py publications/metric-group-regularity/audit/check_metric_group.py · cited revision
- check_translation_regularities.py publications/metric-group-regularity/audit/check_translation_regularities.py · cited revision
- check_ae_22_08_all_b_selector.py tools/checks/check_ae_22_08_all_b_selector.py · cited revision
- check_count_class_access.py tools/research/check_count_class_access.py
- check_name_weighted_classes.py tools/research/check_name_weighted_classes.py
- check_completion_debt.py tools/research/check_completion_debt.py
- check_partition_adoption.py tools/research/check_partition_adoption.py
- check_metric_action_receipts.py tools/research/check_metric_action_receipts.py
- check_prefix_profile_access.py tools/research/check_prefix_profile_access.py
- check_action_prefix_images.py tools/research/check_action_prefix_images.py
- check_indexed_preparation_readout.py tools/research/check_indexed_preparation_readout.py
- check_late_profile_correction.py tools/research/check_late_profile_correction.py
- check_input_dominated_classes.py tools/research/check_input_dominated_classes.py
- check_name_funded_ball_reuse.py tools/research/check_name_funded_ball_reuse.py
- check_profile_observation_cover.py tools/research/check_profile_observation_cover.py
- check_bounded_fringe_reuse.py tools/research/check_bounded_fringe_reuse.py
- check_single_hole_reuse.py tools/research/check_single_hole_reuse.py
- check_colored_hole_reuse.py tools/research/check_colored_hole_reuse.py
- check_gap_hole_exports.py tools/research/check_gap_hole_exports.py
- check_born_hole_lanes.py tools/research/check_born_hole_lanes.py
- check_recycled_hole_lanes.py tools/research/check_recycled_hole_lanes.py
- check_interval_reuse_frontier.py tools/research/check_interval_reuse_frontier.py
- check_name_dominated_suffix.py tools/research/check_name_dominated_suffix.py
- check_threshold_refinement.py tools/research/check_threshold_refinement.py
- check_dyadic_minimum_frontier.py tools/research/check_dyadic_minimum_frontier.py
- check_sparse_age_minimum.py tools/research/check_sparse_age_minimum.py
- check_two_maximum_suffix.py tools/research/check_two_maximum_suffix.py
- check_ordered_suffix.py tools/research/check_ordered_suffix.py
- check_banded_interval_reuse.py tools/research/check_banded_interval_reuse.py
- check_banded_interval_independent.py tools/research/check_banded_interval_independent.py
- check_scale_sparse_band_reuse.py tools/research/check_scale_sparse_band_reuse.py
- check_scale_sparse_band_independent.py tools/research/check_scale_sparse_band_independent.py
- check_mixed_region_coupling.py tools/research/check_mixed_region_coupling.py
- check_mixed_budget_producer.py tools/research/check_mixed_budget_producer.py
- check_mixed_budget_independent.py tools/research/check_mixed_budget_independent.py
- check_sparse_completion_certificates.py tools/research/check_sparse_completion_certificates.py
- check_sparse_completion_independent.py tools/research/check_sparse_completion_independent.py
- check_learned_spine_profiles.py tools/research/check_learned_spine_profiles.py
- check_learned_spine_independent.py tools/research/check_learned_spine_independent.py
- check_spine_incidence.py tools/research/check_spine_incidence.py
- check_spine_incidence_independent.py tools/research/check_spine_incidence_independent.py
- check_clipped_cone_events.py tools/research/check_clipped_cone_events.py
- check_clipped_cone_events_independent.py tools/research/check_clipped_cone_events_independent.py
- check_learned_contexts.py tools/research/check_learned_contexts.py
- check_learned_contexts_independent.py tools/research/check_learned_contexts_independent.py
- check_routed_contexts_independent.py tools/research/check_routed_contexts_independent.py
- check_pending_substitution.py tools/research/check_pending_substitution.py
- check_late_prefix_cache.py tools/research/check_late_prefix_cache.py
- check_tagged_contexts_independent.py tools/research/check_tagged_contexts_independent.py
- check_banded_context_codes_independent.py tools/research/check_banded_context_codes_independent.py
- check_context_code_geometry.py tools/research/check_context_code_geometry.py
- check_frozen_support_reuse.py tools/research/check_frozen_support_reuse.py
- check_finite_image_composition.py tools/research/check_finite_image_composition.py
- check_frozen_row_composition.py tools/research/check_frozen_row_composition.py
- check_support_component_reuse.py tools/research/check_support_component_reuse.py
- check_component_directory.py tools/research/check_component_directory.py
- check_envelope_reuse.py tools/research/check_envelope_reuse.py
- check_cosingleton_reuse.py tools/research/check_cosingleton_reuse.py
- check_bounded_omission_basis.py tools/research/check_bounded_omission_basis.py
- check_scanned_omission_reuse.py tools/research/check_scanned_omission_reuse.py
- check_independent_store_reuse.py tools/research/check_independent_store_reuse.py
- check_overlap_owner_directory.py tools/research/check_overlap_owner_directory.py
- check_owner_graph_kernel.py tools/research/check_owner_graph_kernel.py
- check_routed_scatter.py tools/research/check_routed_scatter.py
- check_namespace_reindexing.py tools/research/check_namespace_reindexing.py
- check_suffix_paid_reindexing.py tools/research/check_suffix_paid_reindexing.py
- check_release_deadlines.py tools/research/check_release_deadlines.py
- check_delayed_suffix_reuse.py tools/research/check_delayed_suffix_reuse.py
- check_release_envelope_reuse.py tools/research/check_release_envelope_reuse.py
- check_speculative_service.py tools/research/check_speculative_service.py
- check_crossindex_routing.py tools/research/check_crossindex_routing.py
- check_activation_contraction.py tools/research/check_activation_contraction.py
- check_boundary_normalizers.py tools/research/check_boundary_normalizers.py
- check_pattern_dispatch.py tools/research/check_pattern_dispatch.py
- check_learned_filler_reuse.py tools/research/check_learned_filler_reuse.py
- check_deferred_filler_index.py tools/research/check_deferred_filler_index.py
- check_multiscale_filler_index.py tools/research/check_multiscale_filler_index.py
- check_cross_scale_receipts.py tools/research/check_cross_scale_receipts.py
- check_persistent_selector_contracts.py tools/research/check_persistent_selector_contracts.py
- check_selector_shadow.py tools/research/check_selector_shadow.py
Research readings
Browse 349 files
- FPRD research loop state site/public/evidence/FPRD-research-loop-state.md
- FPRD author-first and communication policy site/public/evidence/FPRD-researcher-communication-policy.md
- FPRD hunt packet: the anyon-proliferation presentation site/public/evidence/anyon-proliferation-presentation/FPRD-hunt-anyon-proliferation-presentation-2026-09-06.md
- The Cartier-residual Bethe family and its Calogero–Moser fiber site/public/evidence/bethe-calogero-normal-family/FPRD-Bethe-Calogero-Cartier-residual-and-A2-2026-09-07.md
- The normalized Bethe discriminant and the averaged Calogero force site/public/evidence/bethe-calogero-normal-family/FPRD-Bethe-Calogero-discriminant-and-average-operator-2026-09-07.md
- Persistent nilpotence is not converted into a critical family by integrability site/public/evidence/bethe-calogero-normal-family/FPRD-Bethe-Calogero-persistent-nilpotence-stopping-audit-2026-09-07.md
- A length-nine collision at the square elliptic curve site/public/evidence/bethe-calogero-normal-family/FPRD-Bethe-Calogero-square-lattice-collision-2026-09-07.md
- HUNT packet: the flavor-normal Bethe–Calogero family site/public/evidence/bethe-calogero-normal-family/FPRD-hunt-bethe-calogero-normal-family-2026-09-07.md
- The positive-kernel gate is the complete COR conjecture site/public/evidence/complete-crouzeix-similarity/FPRD-complete-crouzeix-positive-kernel-circularity-audit-2026-09-08.md
- FPRD hunt packet: the complete Crouzeix similarity metric site/public/evidence/complete-crouzeix-similarity/FPRD-hunt-complete-crouzeix-similarity-2026-09-08.md
- Degree-zero descent for six-root quantum gluing modules site/public/evidence/dehn-filled-quantum-trace/FPRD-CK-injectivity-and-GY-PP-bridge-candidate-2026-09-08.md
- The empty-sector obstruction to Dehn-filling base change site/public/evidence/dehn-filled-quantum-trace/FPRD-Dehn-filled-quantum-trace-empty-sector-obstruction-2026-09-08.md
- Generic boundary reconstruction for the Dehn-filled quantum trace site/public/evidence/dehn-filled-quantum-trace/FPRD-Dehn-filled-quantum-trace-generic-boundary-reconstruction-2026-09-08.md
- Positive geometric fillings and the quantum-trace quotient site/public/evidence/dehn-filled-quantum-trace/FPRD-Dehn-filled-quantum-trace-positive-geometric-filling-2026-09-08.md
- FPRD hunt packet: the Dehn-filled 3D quantum trace site/public/evidence/dehn-filled-quantum-trace/FPRD-hunt-dehn-filled-quantum-trace-2026-09-08.md
- Actual incidence, normal Euler degree, and a two-angle vacuum theorem site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/FPRD-actual-incidence-two-angle-vacuum-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/FPRD-research-loop-state.md
- Actual-incidence two-angle vacuum theorem site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/README.md
- Hostile audit: actual-incidence two-angle vacuum theorem site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/hostile-audit.md
- Sources and priority boundaries site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/source-ledger.md
- An actual one-sided Nahm detector for the filled vacuum site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/FPRD-actual-Nahm-vacuum-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/FPRD-research-loop-state.md
- Actual one-sided Nahm vacuum packet site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/README.md
- Internal audit: actual one-sided Nahm vacuum site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/internal-audit.md
- Source and dependency ledger site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/source-ledger.md
- The balanced pairing: an exact normal-index bridge and a vanishing theorem site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/FPRD-balanced-pairing-vanishing-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/FPRD-research-loop-state.md
- Balanced pairing: reproducibility packet site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/README.md
- Hostile internal audit: the balanced pairing site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/hostile-audit.md
- Source and influence ledger site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/source-ledger.md
- A nonzero filling target with zero six-root vacuum site/public/evidence/dehn-filled-quantum-trace/central-meridian-attack/FPRD-central-meridian-vacuum-2026-09-08.md
- Full six-root meridian vacuum certificate site/public/evidence/dehn-filled-quantum-trace/central-meridian-attack/README.md
- Internal audit: central meridian vacuum site/public/evidence/dehn-filled-quantum-trace/central-meridian-attack/internal-audit.md
- Sources, dependencies, and intellectual influences site/public/evidence/dehn-filled-quantum-trace/central-meridian-attack/source-ledger.md
- Hostile publication audit: CK comparison injectivity site/public/evidence/dehn-filled-quantum-trace/ck-publication-audit/hostile-publication-audit.md
- Fresh source and bounded-priority ledger site/public/evidence/dehn-filled-quantum-trace/ck-publication-audit/source-and-priority-ledger.md
- Clean excess intersections extinguish point-local meridian detectors site/public/evidence/dehn-filled-quantum-trace/clean-excess-meridian-attack/FPRD-clean-excess-meridian-obstruction-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/clean-excess-meridian-attack/FPRD-research-loop-state.md
- Clean-excess meridian detector obstruction site/public/evidence/dehn-filled-quantum-trace/clean-excess-meridian-attack/README.md
- Hostile internal audit: clean-excess meridian detectors site/public/evidence/dehn-filled-quantum-trace/clean-excess-meridian-attack/hostile-audit.md
- Source and priority ledger — clean-excess meridian obstruction site/public/evidence/dehn-filled-quantum-trace/clean-excess-meridian-attack/source-ledger.md
- Cyclic polarization and the meridian vacuum boundary site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/FPRD-cyclic-polarization-and-meridian-boundary-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/FPRD-research-loop-state.md
- Cyclic polarization and the meridian vacuum boundary site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/README.md
- Internal audit: cyclic transport and meridian boundary site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/internal-audit.md
- Sources and dependencies site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/source-ledger.md
- Cohomological degrees outside the quantum-trace image site/public/evidence/dehn-filled-quantum-trace/face-defect-attack/FPRD-face-defect-quotient-2026-09-08.md
- Face-defect quotient packet site/public/evidence/dehn-filled-quantum-trace/face-defect-attack/README.md
- Internal self-audit: face-defect quotient site/public/evidence/dehn-filled-quantum-trace/face-defect-attack/internal-audit.md
- Sources, dependencies, and influence site/public/evidence/dehn-filled-quantum-trace/face-defect-attack/source-ledger.md
- Source ledger — generic boundary reconstruction and nonvanishing site/public/evidence/dehn-filled-quantum-trace/generic-boundary-source-ledger.md
- A global index detector for the native meridian cokernel site/public/evidence/dehn-filled-quantum-trace/global-meridian-index-attack/FPRD-global-meridian-index-detector-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/global-meridian-index-attack/FPRD-research-loop-state.md
- Global meridian-index ATTACK packet site/public/evidence/dehn-filled-quantum-trace/global-meridian-index-attack/README.md
- Hostile audit — global meridian-index detector site/public/evidence/dehn-filled-quantum-trace/global-meridian-index-attack/hostile-audit.md
- Source and priority ledger — global meridian-index detector site/public/evidence/dehn-filled-quantum-trace/global-meridian-index-attack/source-ledger.md
- Hostile internal audit — CK comparison injectivity site/public/evidence/dehn-filled-quantum-trace/gy-pp-bridge-hostile-audit.md
- Source and limited priority ledger site/public/evidence/dehn-filled-quantum-trace/gy-pp-bridge-source-and-priority-ledger.md
- The longitude difference: exact coefficients and a strict-angle cancellation obstruction site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/FPRD-longitude-difference-obstruction-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/FPRD-research-loop-state.md
- Longitude-difference ATTACK evidence site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/README.md
- Hostile internal audit — longitude difference site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/hostile-audit.md
- Primary-source and priority ledger — longitude difference site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/source-ledger.md
- The minimal meridian quotient: a zero trace into a nonzero target site/public/evidence/dehn-filled-quantum-trace/minimal-trace-kernel-attack/FPRD-minimal-meridian-quotient-2026-09-08.md
- Minimal meridian quotient packet site/public/evidence/dehn-filled-quantum-trace/minimal-trace-kernel-attack/README.md
- Internal audit: the minimal meridian quotient site/public/evidence/dehn-filled-quantum-trace/minimal-trace-kernel-attack/internal-audit.md
- Sources, dependencies, and influence site/public/evidence/dehn-filled-quantum-trace/minimal-trace-kernel-attack/source-ledger.md
- The transverse defect of a local 2-3 move site/public/evidence/dehn-filled-quantum-trace/move-defect-attack/FPRD-local-move-defect-2026-09-09.md
- Internal audit: local move defect site/public/evidence/dehn-filled-quantum-trace/move-defect-attack/internal-audit.md
- Provisional confirmation cards site/public/evidence/dehn-filled-quantum-trace/move-defect-attack/maturity-cards.md
- Closed normal sectors and nonzero quantum-trace cokernels site/public/evidence/dehn-filled-quantum-trace/normal-sector-attack/FPRD-normal-sector-nonvanishing-2026-09-08.md
- Internal audit: closed normal sectors site/public/evidence/dehn-filled-quantum-trace/normal-sector-attack/internal-audit.md
- Provisional confirmation cards: normal-sector extension site/public/evidence/dehn-filled-quantum-trace/normal-sector-attack/maturity-cards.md
- A one-sided Nahm functional for the filled quantum gluing module site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/FPRD-one-sided-Nahm-detector-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/FPRD-research-loop-state.md
- One-sided seed attack site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/README.md
- Audit of the one-sided Nahm functional site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/internal-audit.md
- Source and influence ledger site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/source-ledger.md
- Peripheral insertions and the balanced vacuum pairing site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/FPRD-peripheral-projection-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/FPRD-research-loop-state.md
- Peripheral projection packet site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/README.md
- Internal proof audit site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/internal-audit.md
- Source ledger site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/source-ledger.md
- A degree gap removes the native phase restriction site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/FPRD-phase-free-Nahm-vacuum-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/FPRD-research-loop-state.md
- Phase-free native Nahm vacuum site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/README.md
- Internal audit: phase-free degree separation site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/internal-audit.md
- Sources, dependencies, and intellectual influences site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/source-ledger.md
- Source ledger — positive geometric filling and PP branch conjugacy site/public/evidence/dehn-filled-quantum-trace/positive-geometric-source-ledger.md
- Signed-angle convergence and detection away from the unit site/public/evidence/dehn-filled-quantum-trace/signed-angle-attack/FPRD-signed-angle-detector-2026-09-08.md
- Internal audit and limits site/public/evidence/dehn-filled-quantum-trace/signed-angle-attack/internal-audit.md
- Confirmation maturity pilot: two distinct claims site/public/evidence/dehn-filled-quantum-trace/signed-angle-attack/maturity-pilot.md
- The local collar square and signed six-root peripheral transport site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/FPRD-local-collar-square-2026-09-08.md
- FPRD research loop state site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/FPRD-research-loop-state.md
- A source-native six-root peripheral lift site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/FPRD-six-root-peripheral-lift-2026-09-08.md
- Signed six-root peripheral transport site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/README.md
- Hostile internal audit: native six-root peripheral lift site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/hostile-audit.md
- Internal hostile audit: the local collar square site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/local-collar-hostile-audit.md
- Local collar continuation: source ledger site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/local-collar-source-ledger.md
- Six-root peripheral lift: primary-source ledger site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/source-ledger.md
- Retraction: the proposed Choi–Lam dual obstruction is false site/public/evidence/energy-shell-quantum-bootstrap/FPRD-energy-shell-choi-lam-dual-obstruction-2026-09-07.md
- The degree budget is essential in the energy-shell quantum bootstrap site/public/evidence/energy-shell-quantum-bootstrap/FPRD-energy-shell-degree-budget-counterexample-2026-09-07.md
- FPRD hunt packet: the energy-shell order in the quantum-mechanical bootstrap site/public/evidence/energy-shell-quantum-bootstrap/FPRD-hunt-energy-shell-quantum-bootstrap-2026-09-07.md
- JT gravity: the fixed-fan obstruction to a canonical BF–polytope bridge site/public/evidence/jt-gravity-presentation-bridge/FPRD-JT-fixed-fan-obstruction-2026-09-06.md
- JT presentation bridge: literature audit before the next attack site/public/evidence/jt-gravity-presentation-bridge/FPRD-JT-literature-audit-2026-09-06.md
- JT defect amplitudes: reconstruction, a polytope presentation, and the missing gauge-theory input site/public/evidence/jt-gravity-presentation-bridge/FPRD-JT-two-boundary-reconstruction-2026-09-06.md
- Selfridge attack: complete classification of the first two complementary minimum layers site/public/evidence/selfridge-integer-complexity/complementary-min-layer-closure/FPRD-Selfridge-complementary-min-layer-closure-2026-09-06.md
- Selfridge attack: complete closure of the complementary f=0 cancellation locus site/public/evidence/selfridge-integer-complexity/f0-cancellation-closure/FPRD-Selfridge-f0-cancellation-closure-2026-09-06.md
- FPRD research loop state site/public/evidence/selfridge-integer-complexity/f0-cancellation-closure/FPRD-research-loop-state.md
- FPRD research loop state site/public/evidence/selfridge-integer-complexity/uniform-finiteness-and-f0-triple-minimum/FPRD-research-loop-state.md
- HUNT packet: the sharp Rips threshold for integer lattices site/public/evidence/sharp-rips-threshold-integer-lattices/FPRD-hunt-sharp-rips-threshold-integer-lattices-2026-09-07.md
- Sharp lattice-Rips carrier route: exact reductions and stopping audit site/public/evidence/sharp-rips-threshold-integer-lattices/FPRD-sharp-Rips-carrier-route-audit-2026-09-07.md
- HUNT packet: the hidden braid-arrangement filtration in subleading Yang–Mills collinear limits site/public/evidence/stirling-collinear-amplitudes/FPRD-hunt-stirling-collinear-amplitudes-2026-09-07.md
- Six-point obstruction to the proposed Stirling-filtration bridge site/public/evidence/stirling-collinear-amplitudes/FPRD-stirling-collinear-six-point-obstruction-2026-09-07.md
- HUNT packet: semisimplicity in supertannakian categories site/public/evidence/supertannakian-semisimplicity/FPRD-hunt-supertannakian-semisimplicity-2026-09-06.md
- A Kac–Grassmann reduction for supertannakian semisimplicity site/public/evidence/supertannakian-semisimplicity/FPRD-supertannakian-candidate-resolution-2026-09-06.md
- Publication audit: semisimplicity under odd symmetry site/public/evidence/supertannakian-semisimplicity/FPRD-supertannakian-publication-audit-2026-09-06.md
- Rank-one calibration for the supertannakian attack site/public/evidence/supertannakian-semisimplicity/FPRD-supertannakian-rank-one-calibration-2026-09-06.md
- The odd-slice theorem for the rank-one supertannakian carrier site/public/evidence/supertannakian-semisimplicity/FPRD-supertannakian-rank-one-slice-theorem-2026-09-06.md
- Exact controls for the Kac–Grassmann candidate proof site/public/evidence/supertannakian-semisimplicity/candidate-resolution-checks/README.md
- Publication-audit controls site/public/evidence/supertannakian-semisimplicity/publication-audit-checks/README.md
- Sylvester–Möbius attack: the line homotopy closes rank two and misses the top diagonal site/public/evidence/sylvester-mobius-syzygies/FPRD-Sylvester-Mobius-line-homotopy-stopping-audit-2026-09-07.md
- Sylvester line quadrics: an exact rank-gap characterization and its syzygetic boundary site/public/evidence/sylvester-mobius-syzygies/FPRD-Sylvester-Mobius-secant-gap-boundary-2026-09-08.md
- HUNT packet: Sylvester lines and the first syzygies of graded Möbius algebras site/public/evidence/sylvester-mobius-syzygies/FPRD-hunt-sylvester-mobius-syzygies-2026-09-07.md
- Reproducing the boundary-context checks site/public/formal/boundary-context/README-runtime.md
- FPRD ChatGPT research rollup site/public/packets/2026-07-29-complete-rollup/README.md
- FPRD Lab clean-chat handoff site/public/packets/2026-07-29-rollup-raw/00-handoff-and-prior-guidance/FPRD-Lab-clean-chat-handoff-2026-07-29.md
- FPRD cycle dual and gauge-reduced parity-comb theorem site/public/packets/2026-07-29-rollup-raw/00-handoff-and-prior-guidance/FPRD-cycle-dual-and-parity-comb-handoff.md
- FPRD state-conditioned height theorem — audit and repository packet site/public/packets/2026-07-29-rollup-raw/00-handoff-and-prior-guidance/FPRD-state-height-audit-packet.md
- FPRD Lab clean-chat handoff site/public/packets/2026-07-29-rollup-raw/00-handoff-and-prior-guidance/Pasted-markdown-handoff-variant.md
- FPRD causal/origami source bundle site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/INDEX.md
- FPRD accessible-field sewing: working theorem draft site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/accessible-field-sewing-draft.md
- Accessible certificates and the full finite-horizon Pareto field site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/accessible-pareto-field-theorem.md
- Bounded-role causal certificates at one supplied cut site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/bounded-role-causal-factorization.md
- Cone factorization and an exact cut-snapshot–track frontier site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/cone-factorization-state-track-frontier.md
- Relational admission and causal sewing site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/relational-sewing-draft.md
- Residual access factorization: what moved, what did not, and the next theorem site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/residual-access-factorization-synthesis.md
- Sewing-seam counterexamples and the missing hypotheses site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/sewing-seam-counterexamples.md
- Virtual creases after the fixed-comb theorem site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/virtual-crease-causal-width.md
- Comparator map: bounded-fold incidence and formula resources site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/litrev/bounded-fold-incidence-comparators.md
- Comparator map: cone factorization and the causal-track doctrine site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/litrev/cone-factorization-comparators.md
- Bounded-fold piecewise isometry and signed-affine incidence site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/notes/bounded-fold-piecewise-isometry.md
- The Fold-and-Look formula-resource theorem site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/notes/fold-look-formula-resource-theorem.md
- The palindrome construction is optimal in four coordinates site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/notes/fold-palindrome-restricted-frontier.md
- WFL: one deliberately weak fold-and-look model site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/notes/wfl-weak-fold-look-model.md
- Matching families: equal continuation complexity, unequal folding demand site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/probes/k-fold-incidence-and-permutations.md
- Adversarial audit of the fold resource accounting site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/verify/fold-resource-accounting-audit.md
- Virtual-crease causal-width chain: capture and independent audit site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/origami/docs/verify/virtual-crease-causal-width-audit.md
- Horizon joins and hinge images site/public/packets/2026-07-29-rollup-raw/02-horizon-join-and-origami-image/fprd-horizon-join-origami-image-report-2026-07-29.md
- Diagonal realizability census for up-growing 2D presentations site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/diagonal_embedding_search_results.md
- FPRD work cycle: counterfactual access entropy and irrevocable reservations site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/fprd-adaptive-access-entropy-cycle-2026-07-29.md
- FPRD work cycle: the exact adaptive track-allocation law site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/fprd-adaptive-track-allocation-cycle-2026-07-29.md
- WFL residual-row capacity cycle site/public/packets/2026-07-29-rollup-raw/04-wfl-residual-row/CYCLE-SUMMARY-AND-RECOVERY-NOTE.md
- Derived-control prefix parity: hostile audit site/public/packets/2026-07-29-rollup-raw/05-derived-control-and-cocycle/derived-control-prefix-parity-hostile-audit-2026-07-29.md
- FPRD cycle: derived controls, observable output cocycles, and exact archive height site/public/packets/2026-07-29-rollup-raw/05-derived-control-and-cocycle/fprd-derived-control-cocycle-cycle-2026-07-29.md
- Derived prefix control: exact WFL construction and audit site/public/packets/2026-07-29-rollup-raw/05-derived-control-and-cocycle/fprd-derived-prefix-control-proof-2026-07-29.md
- FPRD Cross-Area Probe Set 1 site/public/packets/2026-07-29-rollup-raw/06-broader-fprd-probes/FPRD-cross-area-probes-set-1.md
- FPRD Cross-Area Probe Set 2 site/public/packets/2026-07-29-rollup-raw/06-broader-fprd-probes/FPRD-cross-area-probes-set-2.md
- FPRD Framework-Shape Probe site/public/packets/2026-07-29-rollup-raw/06-broader-fprd-probes/FPRD-framework-shape-probe-arithmetic.md
- FPRD Hostile-Referee Framework Audit site/public/packets/2026-07-29-rollup-raw/06-broader-fprd-probes/FPRD-hostile-referee-framework-audit.md
- FPRD Lab site update provenance site/public/packets/2026-07-29-rollup-raw/07-site-provenance/site-update-history.md
- FPRD ChatGPT research rollup site/public/packets/2026-07-29-rollup-raw/README.md
- Recovery status site/public/packets/2026-07-29-rollup-raw/RECOVERY-STATUS.md
- Research-cycle summaries site/public/packets/2026-07-29-rollup-raw/RUN-SUMMARIES.md
- Rollup verification site/public/packets/2026-07-29-rollup-raw/VERIFICATION.md
- Comparator note: canonical divisors for FPRD Boolean future-update vectors site/public/packets/2026-07-29-rooted-atlas-semantic-gcd/fprd-common-divisor-comparator-note-2026-07-29.md
- FPRD cycle: the five-site rooted semantic-GCD obstruction site/public/packets/2026-07-29-rooted-atlas-semantic-gcd/fprd-rooted-atlas-semantic-gcd-cycle-2026-07-29.md
- Reconciled hostile audit of the two-hinge observable epi-GCD site/public/packets/2026-07-29-rooted-atlas-semantic-gcd/observable-gcd-hostile-audit.md
- Causal full-future epi-GCD failure on the five-site two-hinge carrier site/public/packets/2026-07-29-rooted-atlas-semantic-gcd/semantic-epi-gcd-counterexample-proof.md
- Two-hinge common divisors do not by themselves compress rooted atlases site/public/packets/2026-07-29-two-hinge-common-divisor/fprd-two-hinge-common-divisor-cycle-2026-07-29.md
- Hostile audit: rooted-atlas compression and the epi-GCD proposal site/public/packets/2026-07-29-two-hinge-common-divisor/hostile-audit-rooted-atlas-epi-gcd.md
- A tensor-opposite proof of the anyon-proliferation identity site/public/papers/anyon-proliferation-identity/README.md
- Afterword: FPRD Lab’s contribution site/public/papers/anyon-proliferation-identity/fprd-afterword.md
- Abstract site/public/papers/ck-degree-zero-descent/CK-degree-zero-descent-publication.md
- CK degree-zero descent: publication release site/public/papers/ck-degree-zero-descent/README.md
- Afterword: FPRD Lab’s contribution site/public/papers/ck-degree-zero-descent/fprd-afterword.md
- Remembering information and reaching it site/public/papers/residual-counts-and-access/README.md
- Combined proof audit and terminal-marker strengthening site/public/papers/residual-counts-and-access/mathematical-audit.md
- The grammar for our non-PEG language site/public/papers/residual-counts-and-access/residual-counts-and-access.md
- Supertannakian semisimplicity paper site/public/papers/supertannakian-semisimplicity/README.md
- Afterword: FPRD Lab’s contribution site/public/papers/supertannakian-semisimplicity/fprd-afterword.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/anyon-proliferation-identity.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/ck-degree-zero-descent.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/direct-palindrome-scaffolding.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/fprd-program-overview.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/gapcvp-parameter-retuning.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/metric-group-regularity.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/persistent-scaffold-causal-algebra.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/persistent-stacks-scaffolding.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/supertannakian-semisimplicity.md
- Afterword: FPRD Lab’s contribution site/public/publication-afterwords/unary-scaffold-coherent-cubical-algebra.md
- Raw transfer custody site/public/raw/README.md
- Publication checks — updated 10 September 2026 site/public/reading-editions/publication-audit.md
- FPRD-T170: The causal selection chain rule site/public/research-artifacts/causal-selection-chain-rule/causal-selection-chain-rule.md
- FPRD-T171: Finite obstruction duality for causal selection site/public/research-artifacts/causal-selection-obstructions/causal-selection-obstructions.md
- FPRD-T169: Causal selection spectra and finite escape site/public/research-artifacts/causal-selection-spectrum/causal-selection-spectrum.md
- FPRD-T172: Acceptance-blind selection and sequential uniformization site/public/research-artifacts/causal-selection-uniformization/causal-selection-uniformization.md
- Cell-probe obstructions to stationary transport site/public/research-artifacts/cell-probe-stationary-transport/cell-probe-stationary-transport.md
- Cut-response factorization and linear observer dimension site/public/research-artifacts/cut-response-dimension/cut-response-dimension.md
- FPRD-T159: Distance-one scaffolds collapse to finite automata site/public/research-artifacts/distance-one-collapse/distance-one-collapse.md
- FPRD-T160: Distance-two normal form for scaffolding automata site/public/research-artifacts/distance-two-normal-form/distance-two-normal-form.md
- FPRD-T167 and FPRD-T168: Finite causal selector covers site/public/research-artifacts/finite-causal-selector-covers/finite-causal-selector-covers.md
- FPRD-T158: Finite future observers internalize into stationary transport site/public/research-artifacts/finite-future-observers/finite-future-observers.md
- Finite-horizon response capacity of scaffolding automata site/public/research-artifacts/finite-horizon-scaffold-capacity/finite-horizon-capacity.md
- FPRD-T166: Finite-state causal preimages preserve stationary transport site/public/research-artifacts/finite-state-causal-preimages/finite-state-causal-preimages.md
- The forgotten-action question is resolved negatively site/public/research-artifacts/forgotten-action-resolution/forgotten-action-resolution.md
- One advice matrix has a small score; one added dimension need not site/public/research-artifacts/foundations/advice-score-increments.md
- Residuals, balanced contexts, and the cost of joining retained words site/public/research-artifacts/foundations/automata-realization-boundary.md
- Local construction and uniform context application site/public/research-artifacts/foundations/balanced-context-application.md
- SAT with a first-clause base and finitely many extra variables site/public/research-artifacts/foundations/base-extra-variable-sat.md
- Coupled pieces: an average composition lower bound site/public/research-artifacts/foundations/block-expansion-composition.md
- Boundary-equivalence lemma for Boolean formula fragments site/public/research-artifacts/foundations/boundary-context-formalization.md
- Small components with comparable name lengths admit native recognition site/public/research-artifacts/foundations/bounded-components-native-constraints.md
- A small vertex cover permits native constraint recognition site/public/research-artifacts/foundations/bounded-cover-native-constraints.md
- Bounded stack skew can be absorbed into finite control site/public/research-artifacts/foundations/bounded-stack-skew.md
- Bounded-threshold erasure in a real-time catenable deque site/public/research-artifacts/foundations/bounded-threshold-catenation-audit.md
- A large normal form need not mean expensive future queries site/public/research-artifacts/foundations/canonical-output-and-future-queries.md
- A fringe simulation for catenable concatenation site/public/research-artifacts/foundations/catenable-concat-fringe-simulation.md
- When can stack information be forgotten? site/public/research-artifacts/foundations/checked-stack-erasure.md
- When a finite input clock cannot recover a stored decision site/public/research-artifacts/foundations/clock-synthesis-obstruction.md
- Horn composition with linear clock padding site/public/research-artifacts/foundations/clocked-horn-transfer.md
- Compact affine fragments: composition through stored linear information site/public/research-artifacts/foundations/compact-affine-composition.md
- Compact affine composition with redundant linear storage site/public/research-artifacts/foundations/compact-affine-redundancy.md
- Independent constraint components need no shared name scale site/public/research-artifacts/foundations/component-local-name-scales.md
- Independent composition: a classical lower bound with explicit costs site/public/research-artifacts/foundations/composition-access-audit.md
- Composition literature: what the representation must support site/public/research-artifacts/foundations/composition-literature-review.md
- Persistent Horn joins without rebuilding leaf indexes site/public/research-artifacts/foundations/compositional-horn-join.md
- Correlated word caches that remain valid after updates site/public/research-artifacts/foundations/correlated-word-cache-invariants.md
- A counter-free real-time persistent queue site/public/research-artifacts/foundations/counter-free-real-time-queue-2026-09-30.md
- A counter-free real-time persistent queue site/public/research-artifacts/foundations/counter-free-real-time-queue.md
- Adding state preserves the dynamics of a star site/public/research-artifacts/foundations/decorated-star-dynamics.md
- Dense exceptions preserve the leading composition constant site/public/research-artifacts/foundations/dense-defect-composition.md
- Composing restoration memory across nested calls site/public/research-artifacts/foundations/editions/nested-restoration-interfaces-v1.md
- Elimination, compiled representations and the input deadline site/public/research-artifacts/foundations/elimination-compilation-review.md
- Equal-support SAT without a common literal order site/public/research-artifacts/foundations/equal-support-survivor-sat.md
- Equality SAT: linear work and the native input deadline site/public/research-artifacts/foundations/equality-sat-input-clock.md
- Expanding dependencies force quadratic composition reads site/public/research-artifacts/foundations/expanding-dependency-composition.md
- External repair reduces to deleting coefficient rows site/public/research-artifacts/foundations/external-repair-rank-deletion.md
- Finite-boundary splicing closes green pop site/public/research-artifacts/foundations/finite-boundary-pop-certificate.md
- Shared mutation can coexist with complete checkpoints site/public/research-artifacts/foundations/finite-shared-core.md
- When does a finite summary make forgetting local? site/public/research-artifacts/foundations/finite-summary-erasure.md
- Deciding whether a fixed input clock stays close to a pushdown stack site/public/research-artifacts/foundations/fixed-clock-decidability.md
- Flat segments cannot absorb unrestricted catenation site/public/research-artifacts/foundations/flat-segment-growth-obstruction.md
- Foundations: observations, compilation and normal forms site/public/research-artifacts/foundations/foundational-contracts.md
- When a small diagram fails, the future queries may still be manageable site/public/research-artifacts/foundations/grid-closure-and-persistent-queries.md
- Partial restoration: two residuals and the memory between them site/public/research-artifacts/foundations/history/partial-restoration-residuals-v1.md
- Safe Horn reassociation and the exact cost of eager synchronization site/public/research-artifacts/foundations/horn-quiescent-reassociation.md
- A representation ready after every arriving coefficient site/public/research-artifacts/foundations/incremental-shared-tabulation.md
- Checking one finite indexed construction language site/public/research-artifacts/foundations/indexed-plan-checking.md
- Proof levels need not be runtime counters site/public/research-artifacts/foundations/indexed-prefix-repair.md
- Inferring stack clocks from finite control site/public/research-artifacts/foundations/inferred-stack-clocks.md
- Internal repair also needs a growing constant site/public/research-artifacts/foundations/internal-repair-obstruction.md
- Small fragments need a controlled joint interface site/public/research-artifacts/foundations/joint-order-frontiers.md
- Late values: unique successful prediction still exceeds deterministic scaffolds site/public/research-artifacts/foundations/late-values-unambiguous-scaffolds.md
- Quadratic composition cost with arbitrary linear advice site/public/research-artifacts/foundations/linear-advice-composition.md
- More prepared storage can reduce local composition work site/public/research-artifacts/foundations/local-block-tabulation.md
- Finite certificates for bounded persistent word interfaces site/public/research-artifacts/foundations/local-fringe-certificate-theorem.md
- Complete checkpoints for locally navigated trees site/public/research-artifacts/foundations/local-tree-checkpoints.md
- Nearly quadratic reads after independent preparation site/public/research-artifacts/foundations/matroid-entropy-composition.md
- Nested clauses under arbitrary literal order site/public/research-artifacts/foundations/nested-clause-order.md
- Composing restoration memory across nested calls site/public/research-artifacts/foundations/nested-restoration-interfaces.md
- Eliminating mutation may require changing how data is routed site/public/research-artifacts/foundations/oblivious-mutation-elimination.md
- Reading an answer and constructing its residual site/public/research-artifacts/foundations/observation-versus-residual-construction.md
- Finite certificates that respect the bottom boundary site/public/research-artifacts/foundations/one-counter-certificates.md
- Syntactic quotients and bounded persistent context application site/public/research-artifacts/foundations/operational-syntactic-algebra.md
- Overlapping affine fragments: a classical compatibility obstruction site/public/research-artifacts/foundations/overlapping-affine-compatibility.md
- Equality SAT: two names, one current value site/public/research-artifacts/foundations/paired-name-access-review.md
- Partial restoration: two residuals and the memory between them site/public/research-artifacts/foundations/partial-restoration-residuals.md
- Persistent Horn closure with charged local work site/public/research-artifacts/foundations/persistent-horn-closure.md
- Prefix clauses have a native SAT recognizer site/public/research-artifacts/foundations/prefix-clause-native-sat.md
- A sharp quadratic cost of combining compact fragments site/public/research-artifacts/foundations/quadratic-composition-multiplicity.md
- Removing redundant advice without losing the read bound site/public/research-artifacts/foundations/quotient-correction-composition.md
- Large matrix rank does not exclude row-scale saving site/public/research-artifacts/foundations/rank-perturbation-composition.md
- The real-time frontier for persistent filtering site/public/research-artifacts/foundations/real-time-filtering-frontier.md
- Local rectangle consistency limits the use of saved parities site/public/research-artifacts/foundations/rectangle-consistency-composition.md
- The exact cost of restoring a regular history site/public/research-artifacts/foundations/regular-history-restoration.md
- Regular stack certificates for bounded synchronization site/public/research-artifacts/foundations/regular-stack-certificates.md
- Relation composition: sharing, receipts and future queries site/public/research-artifacts/foundations/relation-composition-independent-access.md
- A sharp limit on repairing disjoint blocks site/public/research-artifacts/foundations/repair-space-obstruction.md
- Remembering a computation is not the same as being able to resume it site/public/research-artifacts/foundations/replay-access-and-compilation.md
- Can local computation preserve its past at constant cost? site/public/research-artifacts/foundations/representation-theorem-candidates.md
- Reversible restoration forces group memory site/public/research-artifacts/foundations/reversible-summary-congruence.md
- Joining prepared row fragments: unfinished work adds site/public/research-artifacts/foundations/row-fragment-join-accounting.md
- Row-parity advice saves reads, but is not exactly optimal site/public/research-artifacts/foundations/row-parity-composition.md
- SAT fragments: future behavior, information and persistent dynamics site/public/research-artifacts/foundations/sat-boundary-dynamics.md
- An unconditional XOR-SAT obstruction for scaffolding automata site/public/research-artifacts/foundations/sat-scaffold-affine-obstruction.md
- SAT families inside scaffolding automata site/public/research-artifacts/foundations/sat-scaffold-literature-review.md
- A conditional SAT boundary for scaffolding automata site/public/research-artifacts/foundations/sat-scaffold-omv-boundary.md
- When propagation is hard and replay is enough site/public/research-artifacts/foundations/sat-scaffold-propagation-and-replay.md
- SAT dynamics: small summaries, shared updates and unique certificates site/public/research-artifacts/foundations/sat-scaffold-structural-review.md
- Complete checkpoints through nested ownership site/public/research-artifacts/foundations/scoped-checkpoint-composition.md
- Sealed affine boundaries: small summaries and the cost of maintaining them site/public/research-artifacts/foundations/sealed-affine-boundaries.md
- Segmented transport for repeated filtering site/public/research-artifacts/foundations/segmented-filter-transport.md
- Persistent Horn composition with selective fact routing site/public/research-artifacts/foundations/selective-horn-routing.md
- A classical baseline for bounded-input applications site/public/research-artifacts/foundations/semilinear-persistent-baseline.md
- Shared cores support ordinary three-literal clauses site/public/research-artifacts/foundations/shared-core-bounded-arity-sat.md
- A bounded shared core can coordinate arbitrarily many constraint pieces site/public/research-artifacts/foundations/shared-core-native-constraints.md
- Uniform construction with shared block levels site/public/research-artifacts/foundations/shared-level-uniform-selection.md
- A local-view certificate for single-chain pop site/public/research-artifacts/foundations/single-chain-pop-certificate.md
- Stable references impose a lookup cost site/public/research-artifacts/foundations/stable-handle-obstruction.md
- Bounded disagreement, stored feedback, and local observation site/public/research-artifacts/foundations/stack-observer-compilation.md
- Stored-element word richness and the remaining shape obligation site/public/research-artifacts/foundations/stored-word-richness.md
- Synthesizing memory that survives substitutions site/public/research-artifacts/foundations/substitution-stable-restoration.md
- The exact query cost of a prepared equality interface site/public/research-artifacts/foundations/two-affine-query-minimum.md
- Synthesizing finite input clocks on two input blocks site/public/research-artifacts/foundations/two-block-clock-synthesis.md
- Two-sided boundary certificates for catenation site/public/research-artifacts/foundations/two-sided-boundary-catenation.md
- Two stages of averaging control arbitrary dense advice patterns site/public/research-artifacts/foundations/two-stage-contraction-composition.md
- Head removal with typed word-cache views site/public/research-artifacts/foundations/typed-head-tail-views.md
- Unary SAT has a native scaffold recognizer site/public/research-artifacts/foundations/unary-sat-native-scaffolding.md
- Unary constraints separate scaffolds from online tapes site/public/research-artifacts/foundations/unary-sat-online-separation.md
- Cheap witnesses and uniform residual construction site/public/research-artifacts/foundations/uniform-residual-selection.md
- Repair whole vectors: a quadratic bound beyond linear decomposition site/public/research-artifacts/foundations/vector-correction-composition.md
- When retained frames can carry the missing history site/public/research-artifacts/foundations/visible-checkpoint-erasure.md
- Left-quotient finite audit site/public/research-artifacts/left-quotient-regular-expressions/README.md
- FPRD-T173: Effective selection horizons for regular hidden sources site/public/research-artifacts/regular-source-selection-horizon/regular-source-selection-horizon.md
- A persistent selector with exponential residual fan-out site/public/research-artifacts/replay-fanout/persistent-selector.md
- Replay fan-out: small completed slices can hide large residual memory site/public/research-artifacts/replay-fanout/replay-fanout-theorem.md
- FPRD-T155: The support-quotient theorem for replayable memory site/public/research-artifacts/replayable-memory/support-quotient-theorem.md
- FPRD-T156: Residual towers and canonical transport site/public/research-artifacts/residual-tower/residual-tower-theorem.md
- Left-quotient result review site/public/research-artifacts/result-review-2026-09-01-batch-15/README.md
- Result review batch 16 site/public/research-artifacts/result-review-2026-09-01-batch-16/README.md
- Result review batch 17 site/public/research-artifacts/result-review-2026-09-01-batch-17/README.md
- Transformation-degree and linear-loop review audit site/public/research-artifacts/result-review-2026-09-01-batch-18/README.md
- Matrix-power and reversible-rewriting review evidence site/public/research-artifacts/result-review-2026-09-01-batch-19/README.md
- Rational-sequence and Dyck-quotient review evidence site/public/research-artifacts/result-review-2026-09-01-batch-20/README.md
- Recognition-cut and Fold-and-Look review evidence site/public/research-artifacts/result-review-2026-09-01-batch-21/README.md
- Result review evidence: causal tracks and weighted height site/public/research-artifacts/result-review-2026-09-01-batch-22/README.md
- Weighted-height boundary review site/public/research-artifacts/result-review-2026-09-01-batch-23/README.md
- Completion-radius and two-arm review site/public/research-artifacts/result-review-2026-09-01-batch-24/README.md
- Fixed-correction and gradient-ambiguity review evidence site/public/research-artifacts/result-review-2026-09-01-batch-25/README.md
- Hostile audit — two-reservoir latency theorem site/public/research-artifacts/reverse-add-latency/hostile-audit.md
- Decimal 196 finite-orbit audit site/public/research-artifacts/reverse-add-orbit-audit/README.md
- FPRD-T154: The universal row-count barrier site/public/research-artifacts/row-count-barrier/row-count-barrier.md
- Distance-two scaffolds have unbounded graph width site/public/research-artifacts/scaffold-grid-width/scaffold-grid-width.md
- Scaffold proof review: Run 01 site/public/research-artifacts/scaffold-proof-review/run-01.md
- Run 02: recover the editions before revising them site/public/research-artifacts/scaffold-proof-review/run-02.md
- Run 03: initial records across the four papers site/public/research-artifacts/scaffold-proof-review/run-03.md
- Run 04: the Draft 1 receipt gaps and the Draft 2 repairs site/public/research-artifacts/scaffold-proof-review/run-04.md
- Run 05: sequence contract and companion alignment site/public/research-artifacts/scaffold-proof-review/run-05.md
- Run 06: how the sequence claim changed site/public/research-artifacts/scaffold-proof-review/run-06.md
- Run 07: native views and port-word observations site/public/research-artifacts/scaffold-proof-review/run-07.md
- Run 08: the exact simultaneous-record compiler interface site/public/research-artifacts/scaffold-proof-review/run-08.md
- Run 09: timing, reversal, and the empty word site/public/research-artifacts/scaffold-proof-review/run-09.md
- Run 10: unary guards and terminal geometry site/public/research-artifacts/scaffold-proof-review/run-10.md
- Pumping certificates and the missing recurrence theorem site/public/research-artifacts/scaffold-pumping-certificates/scaffold-pumping-certificates.md
- FPRD-T175: The stack-clock dichotomy for letter projections site/public/research-artifacts/stack-clock-dichotomy/stack-clock-dichotomy.md
- FPRD-T157: Stationary transport spectra site/public/research-artifacts/stationary-transport-spectrum/stationary-transport-spectrum.md
- FPRD-T161: Structural normal form for scaffolding automata site/public/research-artifacts/structural-scaffold-normal-form/structural-scaffold-normal-form.md
- FPRD-T174: Synchronized stack clocks make causal selection effective site/public/research-artifacts/synchronized-stack-selection/synchronized-stack-selection.md
Published source code
Browse 266 files
- verify-persistent-nilpotence-no-go.py site/public/evidence/bethe-calogero-normal-family/verify-persistent-nilpotence-no-go.py
- verify-square-lattice-collision.py site/public/evidence/bethe-calogero-normal-family/verify-square-lattice-collision.py
- verify_discriminant_attack.py site/public/evidence/bethe-calogero-normal-family/verify_discriminant_attack.py
- verify_flavor_normalization.py site/public/evidence/bethe-calogero-normal-family/verify_flavor_normalization.py
- verify_normal_family_attack.py site/public/evidence/bethe-calogero-normal-family/verify_normal_family_attack.py
- verify-sharp-nilpotent.py site/public/evidence/complete-crouzeix-similarity/verify-sharp-nilpotent.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/build-release.py
- verify-actual-incidence.py site/public/evidence/dehn-filled-quantum-trace/actual-incidence-attack/verify-actual-incidence.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/build-release.py
- verify-actual-nahm.py site/public/evidence/dehn-filled-quantum-trace/actual-nahm-attack/verify-actual-nahm.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/build-release.py
- verify-balanced-pairing.py site/public/evidence/dehn-filled-quantum-trace/balanced-pairing-attack/verify-balanced-pairing.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/central-meridian-attack/build-release.py
- verify-central-meridian.py site/public/evidence/dehn-filled-quantum-trace/central-meridian-attack/verify-central-meridian.py
- verify-ck-pbw.py site/public/evidence/dehn-filled-quantum-trace/ck-publication-audit/verify-ck-pbw.py
- verify-ck-weyl-legacy.py site/public/evidence/dehn-filled-quantum-trace/ck-publication-audit/verify-ck-weyl-legacy.py
- verify-clean-excess.py site/public/evidence/dehn-filled-quantum-trace/clean-excess-meridian-attack/verify-clean-excess.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/build-release.py
- verify-cyclic-polarization.py site/public/evidence/dehn-filled-quantum-trace/cyclic-polarization-attack/verify-cyclic-polarization.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/face-defect-attack/build-release.py
- verify-face-defect.py site/public/evidence/dehn-filled-quantum-trace/face-defect-attack/verify-face-defect.py
- verify-global-meridian-index.py site/public/evidence/dehn-filled-quantum-trace/global-meridian-index-attack/verify-global-meridian-index.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/build-release.py
- verify-longitude-difference.py site/public/evidence/dehn-filled-quantum-trace/longitude-difference-attack/verify-longitude-difference.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/minimal-trace-kernel-attack/build-release.py
- verify-minimal-quotient.py site/public/evidence/dehn-filled-quantum-trace/minimal-trace-kernel-attack/verify-minimal-quotient.py
- verify-move-defect.py site/public/evidence/dehn-filled-quantum-trace/move-defect-attack/verify-move-defect.py
- verify-normal-sector.py site/public/evidence/dehn-filled-quantum-trace/normal-sector-attack/verify-normal-sector.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/build-release.py
- verify-one-sided-seed.py site/public/evidence/dehn-filled-quantum-trace/one-sided-seed-attack/verify-one-sided-seed.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/build-release.py
- verify-peripheral-projection.py site/public/evidence/dehn-filled-quantum-trace/peripheral-projection-attack/verify-peripheral-projection.py
- build-release.py site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/build-release.py
- verify-phase-free-nahm.py site/public/evidence/dehn-filled-quantum-trace/phase-free-nahm-attack/verify-phase-free-nahm.py
- verify-signed-angle.py site/public/evidence/dehn-filled-quantum-trace/signed-angle-attack/verify-signed-angle.py
- verify-local-collar.py site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/verify-local-collar.py
- verify-six-root-peripheral.py site/public/evidence/dehn-filled-quantum-trace/six-root-peripheral-attack/verify-six-root-peripheral.py
- verify-empty-sector-obstruction.py site/public/evidence/dehn-filled-quantum-trace/verify-empty-sector-obstruction.py
- verify-generic-boundary-reconstruction.py site/public/evidence/dehn-filled-quantum-trace/verify-generic-boundary-reconstruction.py
- verify-gy-pp-bridge.py site/public/evidence/dehn-filled-quantum-trace/verify-gy-pp-bridge.py
- verify-peripheral-filling-base-change.py site/public/evidence/dehn-filled-quantum-trace/verify-peripheral-filling-base-change.py
- verify-positive-geometric-filling.py site/public/evidence/dehn-filled-quantum-trace/verify-positive-geometric-filling.py
- verify-choi-lam-dual-obstruction.py site/public/evidence/energy-shell-quantum-bootstrap/verify-choi-lam-dual-obstruction.py
- verify-degree-budget-counterexample.py site/public/evidence/energy-shell-quantum-bootstrap/verify-degree-budget-counterexample.py
- jt-fixed-fan-ambiguity-check.py site/public/evidence/jt-gravity-presentation-bridge/jt-fixed-fan-ambiguity-check.py
- verify-hunt-calibration.py site/public/evidence/stirling-collinear-amplitudes/verify-hunt-calibration.py
- verify-six-point-obstruction.py site/public/evidence/stirling-collinear-amplitudes/verify-six-point-obstruction.py
- verify_structural_controls.py site/public/evidence/supertannakian-semisimplicity/candidate-resolution-checks/verify_structural_controls.py
- verify_publication_controls.py site/public/evidence/supertannakian-semisimplicity/publication-audit-checks/verify_publication_controls.py
- verify-flat-koszul-blocks.py site/public/evidence/sylvester-mobius-syzygies/verify-flat-koszul-blocks.py
- verify-incidence-homotopy-obstruction.py site/public/evidence/sylvester-mobius-syzygies/verify-incidence-homotopy-obstruction.py
- verify-secant-gap-boundary.py site/public/evidence/sylvester-mobius-syzygies/verify-secant-gap-boundary.py
- verify-truncated-pg32-control.py site/public/evidence/sylvester-mobius-syzygies/verify-truncated-pg32-control.py
- Adaptive.lean site/public/formal/boundary-context/Adaptive.lean
- Audit.lean site/public/formal/boundary-context/Audit.lean
- Contexts.lean site/public/formal/boundary-context/Contexts.lean
- Examples.lean site/public/formal/boundary-context/Examples.lean
- Fragments.lean site/public/formal/boundary-context/Fragments.lean
- Summaries.lean site/public/formal/boundary-context/Summaries.lean
- check.sh site/public/formal/boundary-context/check.sh
- proc-self-compat.c site/public/formal/boundary-context/proc-self-compat.c
- FPRDTransfer.lean site/public/formal/persistent-stacks/lean/FPRDTransfer.lean
- Compile.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Compile.lean
- Example.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Example.lean
- FiniteEnum.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/FiniteEnum.lean
- LMR.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/LMR.lean
- Examples.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/PEG/Examples.lean
- Semantics.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/PEG/Semantics.lean
- Syntax.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/PEG/Syntax.lean
- TableEval.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/PEG/TableEval.lean
- TableEvalExamples.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/PEG/TableEvalExamples.lean
- RealtimeTransfer.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/RealtimeTransfer.lean
- StackEncoding.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/StackEncoding.lean
- StackMachine.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/StackMachine.lean
- TapeZipper.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/TapeZipper.lean
- Corollaries.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Corollaries.lean
- FixtureAudit.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/FixtureAudit.lean
- Grammar.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Grammar.lean
- Neighbourhood.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Invariants/Neighbourhood.lean
- Path.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Invariants/Path.lean
- StateLabel.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Invariants/StateLabel.lean
- Main.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Main.lean
- Normalize.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Normalize.lean
- Reachability.lean site/public/formal/persistent-stacks/lean/FPRDTransfer/Theorem16/Reachability.lean
- lakefile.toml site/public/formal/persistent-stacks/lean/lakefile.toml
- fig-dependency-ladder.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-dependency-ladder.tex
- fig-endpoint-receipt.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-endpoint-receipt.tex
- fig-factorization.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-factorization.tex
- fig-mirror-proof.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-mirror-proof.tex
- fig-owner-cycle.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-owner-cycle.tex
- fig-receipt-rope.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-receipt-rope.tex
- fig-scaffold-example.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-scaffold-example.tex
- fig-shadow-proof.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-shadow-proof.tex
- fig-sharing.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-sharing.tex
- fig-three-cases.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-three-cases.tex
- fig-tuple-packing.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-tuple-packing.tex
- fig-two-routes.tex site/public/library/publications/direct-palindrome-scaffolding/figures/draft-6/fig-two-routes.tex
- check_cone_factorization.py site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/check_cone_factorization.py
- check_virtual_crease_causal_width.py site/public/packets/2026-07-29-rollup-raw/01-causal-origami-source/causal/check_virtual_crease_causal_width.py
- check_horizon_join.py site/public/packets/2026-07-29-rollup-raw/02-horizon-join-and-origami-image/check_horizon_join.py
- check_one_hinge.py site/public/packets/2026-07-29-rollup-raw/02-horizon-join-and-origami-image/check_one_hinge.py
- check_access_kraft.py site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/check_access_kraft.py
- check_causal_poset_transfer.py site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/check_causal_poset_transfer.py
- check_late_key_partition.py site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/check_late_key_partition.py
- diagonal_embedding_search.py site/public/packets/2026-07-29-rollup-raw/03-adaptive-access-and-reservations/diagonal_embedding_search.py
- check_derived_control_fold.py site/public/packets/2026-07-29-rollup-raw/05-derived-control-and-cocycle/check_derived_control_fold.py
- check_derived_prefix_parity.py site/public/packets/2026-07-29-rollup-raw/05-derived-control-and-cocycle/check_derived_prefix_parity.py
- check_causal_future_gcd.py site/public/packets/2026-07-29-rooted-atlas-semantic-gcd/check_causal_future_gcd.py
- check_semantic_epi_gcd.py site/public/packets/2026-07-29-rooted-atlas-semantic-gcd/check_semantic_epi_gcd.py
- check_two_hinge_epi_gcd.py site/public/packets/2026-07-29-two-hinge-common-divisor/check_two_hinge_epi_gcd.py
- check_two_hinge_observable_gcd_audit.py site/public/packets/2026-07-29-two-hinge-common-divisor/check_two_hinge_observable_gcd_audit.py
- fprd-afterword.tex site/public/papers/anyon-proliferation-identity/fprd-afterword.tex
- main.tex site/public/papers/anyon-proliferation-identity/main.tex
- CK-degree-zero-descent-publication.tex site/public/papers/ck-degree-zero-descent/CK-degree-zero-descent-publication.tex
- fprd-afterword.tex site/public/papers/ck-degree-zero-descent/fprd-afterword.tex
- check_conditioned_profiles.py site/public/papers/residual-counts-and-access/check_conditioned_profiles.py
- check_residual_extensions.py site/public/papers/residual-counts-and-access/check_residual_extensions.py
- check_tree_witness.py site/public/papers/residual-counts-and-access/check_tree_witness.py
- residual-counts-and-access.tex site/public/papers/residual-counts-and-access/residual-counts-and-access.tex
- fprd-afterword.tex site/public/papers/supertannakian-semisimplicity/fprd-afterword.tex
- main.tex site/public/papers/supertannakian-semisimplicity/main.tex
- render-html.mjs site/public/papers/supertannakian-semisimplicity/render-html.mjs
- check_publication_examples.py site/public/reading-editions/check_publication_examples.py
- verify_replay_slice.py site/public/research-artifacts/adaptive-replay-slice/verify_replay_slice.py
- c7_base_compiler.py site/public/research-artifacts/c7-compiler-review/c7_base_compiler.py
- c7_independent_review.py site/public/research-artifacts/c7-compiler-review/c7_independent_review.py
- c7_typed_language_compiler.py site/public/research-artifacts/c7-compiler-review/c7_typed_language_compiler.py
- verify_selection_chain_rule.py site/public/research-artifacts/causal-selection-chain-rule/verify_selection_chain_rule.py
- verify_selection_obstructions.py site/public/research-artifacts/causal-selection-obstructions/verify_selection_obstructions.py
- verify_selection_spectrum.py site/public/research-artifacts/causal-selection-spectrum/verify_selection_spectrum.py
- verify_uniformization_bridge.py site/public/research-artifacts/causal-selection-uniformization/verify_uniformization_bridge.py
- verify_transport_obstruction.py site/public/research-artifacts/cell-probe-stationary-transport/verify_transport_obstruction.py
- verify_cut_response.py site/public/research-artifacts/cut-response-dimension/verify_cut_response.py
- verify_distance_one_collapse.py site/public/research-artifacts/distance-one-collapse/verify_distance_one_collapse.py
- verify_distance_two_normal_form.py site/public/research-artifacts/distance-two-normal-form/verify_distance_two_normal_form.py
- verify_selector_covers.py site/public/research-artifacts/finite-causal-selector-covers/verify_selector_covers.py
- verify_future_observers.py site/public/research-artifacts/finite-future-observers/verify_future_observers.py
- verify_horizon_capacity.py site/public/research-artifacts/finite-horizon-scaffold-capacity/verify_horizon_capacity.py
- verify_causal_preimages.py site/public/research-artifacts/finite-state-causal-preimages/verify_causal_preimages.py
- verify_resolution_logic.py site/public/research-artifacts/forgotten-action-resolution/verify_resolution_logic.py
- advice-score-check.py site/public/research-artifacts/foundations/advice-score-check.py
- basis-change-check.py site/public/research-artifacts/foundations/basis-change-check.py
- check_indexed_plans.py site/public/research-artifacts/foundations/check_indexed_plans.py
- check_one_counter_certificates.py site/public/research-artifacts/foundations/check_one_counter_certificates.py
- check_regular_stack_certificates.py site/public/research-artifacts/foundations/check_regular_stack_certificates.py
- infer_stack_clocks.py site/public/research-artifacts/foundations/infer_stack_clocks.py
- rectangle-consistency-check.py site/public/research-artifacts/foundations/rectangle-consistency-check.py
- row-parity-counterexample-check.py site/public/research-artifacts/foundations/row-parity-counterexample-check.py
- synthesize_two_block_clocks.py site/public/research-artifacts/foundations/synthesize_two_block_clocks.py
- verify_automata_boundary.py site/public/research-artifacts/foundations/verify_automata_boundary.py
- verify_balanced_context.py site/public/research-artifacts/foundations/verify_balanced_context.py
- verify_block_expansion.py site/public/research-artifacts/foundations/verify_block_expansion.py
- verify_bounded_stack_skew.py site/public/research-artifacts/foundations/verify_bounded_stack_skew.py
- verify_bounded_threshold_catenation.py site/public/research-artifacts/foundations/verify_bounded_threshold_catenation.py
- verify_catenable_concat_fringe.py site/public/research-artifacts/foundations/verify_catenable_concat_fringe.py
- verify_clocked_horn.py site/public/research-artifacts/foundations/verify_clocked_horn.py
- verify_compact_affine.py site/public/research-artifacts/foundations/verify_compact_affine.py
- verify_compact_affine_redundancy.py site/public/research-artifacts/foundations/verify_compact_affine_redundancy.py
- verify_composition_access.py site/public/research-artifacts/foundations/verify_composition_access.py
- verify_correlated_caches.py site/public/research-artifacts/foundations/verify_correlated_caches.py
- verify_counter_free_real_time_queue.py site/public/research-artifacts/foundations/verify_counter_free_real_time_queue.py
- verify_covering_composition.py site/public/research-artifacts/foundations/verify_covering_composition.py
- verify_direction_stress_test.py site/public/research-artifacts/foundations/verify_direction_stress_test.py
- verify_finite_summary_erasure.py site/public/research-artifacts/foundations/verify_finite_summary_erasure.py
- verify_flat_segment_growth.py site/public/research-artifacts/foundations/verify_flat_segment_growth.py
- verify_gap_reductions.py site/public/research-artifacts/foundations/verify_gap_reductions.py
- verify_grid_closure.py site/public/research-artifacts/foundations/verify_grid_closure.py
- verify_horn_join.py site/public/research-artifacts/foundations/verify_horn_join.py
- verify_horn_reassociation.py site/public/research-artifacts/foundations/verify_horn_reassociation.py
- verify_incremental_shared_tabulation.py site/public/research-artifacts/foundations/verify_incremental_shared_tabulation.py
- verify_indexed_prefix_repair.py site/public/research-artifacts/foundations/verify_indexed_prefix_repair.py
- verify_internal_repair.py site/public/research-artifacts/foundations/verify_internal_repair.py
- verify_linear_storage_limits.py site/public/research-artifacts/foundations/verify_linear_storage_limits.py
- verify_local_block_tabulation.py site/public/research-artifacts/foundations/verify_local_block_tabulation.py
- verify_local_fringe_certificates.py site/public/research-artifacts/foundations/verify_local_fringe_certificates.py
- verify_nested_restoration_interfaces.py site/public/research-artifacts/foundations/verify_nested_restoration_interfaces.py
- verify_order_frontier.py site/public/research-artifacts/foundations/verify_order_frontier.py
- verify_pair_chain_pop.py site/public/research-artifacts/foundations/verify_pair_chain_pop.py
- verify_partial_restoration.py site/public/research-artifacts/foundations/verify_partial_restoration.py
- verify_persistent_horn.py site/public/research-artifacts/foundations/verify_persistent_horn.py
- verify_quotient_correction.py site/public/research-artifacts/foundations/verify_quotient_correction.py
- verify_rank_deletion.py site/public/research-artifacts/foundations/verify_rank_deletion.py
- verify_real_time_filtering_frontier.py site/public/research-artifacts/foundations/verify_real_time_filtering_frontier.py
- verify_regular_history_restoration.py site/public/research-artifacts/foundations/verify_regular_history_restoration.py
- verify_repair_space_obstruction.py site/public/research-artifacts/foundations/verify_repair_space_obstruction.py
- verify_residual_allocation.py site/public/research-artifacts/foundations/verify_residual_allocation.py
- verify_reversible_summary_congruence.py site/public/research-artifacts/foundations/verify_reversible_summary_congruence.py
- verify_sat_boundary.py site/public/research-artifacts/foundations/verify_sat_boundary.py
- verify_segmented_filter_transport.py site/public/research-artifacts/foundations/verify_segmented_filter_transport.py
- verify_selective_horn.py site/public/research-artifacts/foundations/verify_selective_horn.py
- verify_shared_level_selection.py site/public/research-artifacts/foundations/verify_shared_level_selection.py
- verify_short_dependencies.py site/public/research-artifacts/foundations/verify_short_dependencies.py
- verify_single_chain_pop.py site/public/research-artifacts/foundations/verify_single_chain_pop.py
- verify_sparse_dependencies.py site/public/research-artifacts/foundations/verify_sparse_dependencies.py
- verify_stack_erasure.py site/public/research-artifacts/foundations/verify_stack_erasure.py
- verify_stack_observer.py site/public/research-artifacts/foundations/verify_stack_observer.py
- verify_stored_word_richness.py site/public/research-artifacts/foundations/verify_stored_word_richness.py
- verify_substitution_stable_restoration.py site/public/research-artifacts/foundations/verify_substitution_stable_restoration.py
- verify_two_sided_catenation.py site/public/research-artifacts/foundations/verify_two_sided_catenation.py
- verify_typed_views.py site/public/research-artifacts/foundations/verify_typed_views.py
- verify_uniform_selection.py site/public/research-artifacts/foundations/verify_uniform_selection.py
- verify_vector_correction.py site/public/research-artifacts/foundations/verify_vector_correction.py
- verify_visible_checkpoint_erasure.py site/public/research-artifacts/foundations/verify_visible_checkpoint_erasure.py
- check_antimirov_independent.py site/public/research-artifacts/left-quotient-regular-expressions/check_antimirov_independent.py
- check_left_quotient.py site/public/research-artifacts/left-quotient-regular-expressions/check_left_quotient.py
- check_b3_hurwitz_obstruction.py site/public/research-artifacts/planar-factorization-receipts/check_b3_hurwitz_obstruction.py
- check_local_to_global.py site/public/research-artifacts/quotient-arsenal-local-to-global-review/check_local_to_global.py
- verify_regular_selection_horizon.py site/public/research-artifacts/regular-source-selection-horizon/verify_regular_selection_horizon.py
- check_relative_degree_exhaustive.py site/public/research-artifacts/relative-degree-rational-series/check_relative_degree_exhaustive.py
- verify_persistent_selector.py site/public/research-artifacts/replay-fanout/verify_persistent_selector.py
- verify_replay_fanout.py site/public/research-artifacts/replay-fanout/verify_replay_fanout.py
- verify_support_quotient.py site/public/research-artifacts/replayable-memory/verify_support_quotient.py
- verify_residual_tower.py site/public/research-artifacts/residual-tower/verify_residual_tower.py
- cohomological_sewing_review.py site/public/research-artifacts/result-review-2026-09-01-batch-10/cohomological_sewing_review.py
- matrix_quotient_audit.py site/public/research-artifacts/result-review-2026-09-01-batch-11/matrix_quotient_audit.py
- trace_cover_boundary_audit.py site/public/research-artifacts/result-review-2026-09-01-batch-11/trace_cover_boundary_audit.py
- graph_deck_audit.py site/public/research-artifacts/result-review-2026-09-01-batch-12/graph_deck_audit.py
- hurwitz_fibre_audit.py site/public/research-artifacts/result-review-2026-09-01-batch-12/hurwitz_fibre_audit.py
- quotient_arsenal_boundary_audit.py site/public/research-artifacts/result-review-2026-09-01-batch-13/quotient_arsenal_boundary_audit.py
- collatz_reverse_add_audit.py site/public/research-artifacts/result-review-2026-09-01-batch-14/collatz_reverse_add_audit.py
- audit_left_quotient_review.py site/public/research-artifacts/result-review-2026-09-01-batch-15/audit_left_quotient_review.py
- relative_reverse_add_review.py site/public/research-artifacts/result-review-2026-09-01-batch-16/relative_reverse_add_review.py
- commutative_lrs_review.py site/public/research-artifacts/result-review-2026-09-01-batch-17/commutative_lrs_review.py
- transformation_linear_loop_review.py site/public/research-artifacts/result-review-2026-09-01-batch-18/transformation_linear_loop_review.py
- matrix_vass_review.py site/public/research-artifacts/result-review-2026-09-01-batch-19/matrix_vass_review.py
- pentagon_shannon_independent_review.py site/public/research-artifacts/result-review-2026-09-01-batch-2/pentagon_shannon_independent_review.py
- learning_dyck_review.py site/public/research-artifacts/result-review-2026-09-01-batch-20/learning_dyck_review.py
- recognition_fold_review.py site/public/research-artifacts/result-review-2026-09-01-batch-21/recognition_fold_review.py
- review_prequery_height.py site/public/research-artifacts/result-review-2026-09-01-batch-22/review_prequery_height.py
- audit_weighted_height_boundaries.py site/public/research-artifacts/result-review-2026-09-01-batch-23/audit_weighted_height_boundaries.py
- audit_completion_two_arm.py site/public/research-artifacts/result-review-2026-09-01-batch-24/audit_completion_two_arm.py
- audit_fixed_correction_gradient.py site/public/research-artifacts/result-review-2026-09-01-batch-25/audit_fixed_correction_gradient.py
- uniform_xcc_independent_review.py site/public/research-artifacts/result-review-2026-09-01-batch-3/uniform_xcc_independent_review.py
- compatibility_overhead_independent_review.py site/public/research-artifacts/result-review-2026-09-01-batch-4/compatibility_overhead_independent_review.py
- transfer_rigidity_independent_review.py site/public/research-artifacts/result-review-2026-09-01-batch-5/transfer_rigidity_independent_review.py
- synchronization_semantic_review.py site/public/research-artifacts/result-review-2026-09-01-batch-6/synchronization_semantic_review.py
- starred_shuffle_independent_review.py site/public/research-artifacts/result-review-2026-09-01-batch-7/starred_shuffle_independent_review.py
- l_trivial_quotient_family_review.py site/public/research-artifacts/result-review-2026-09-01-batch-8/l_trivial_quotient_family_review.py
- kernel_and_minimal_shuffle_review.py site/public/research-artifacts/result-review-2026-09-01-batch-9/kernel_and_minimal_shuffle_review.py
- diversity_reversible_independent_review.py site/public/research-artifacts/result-review-2026-09-01/diversity_reversible_independent_review.py
- prove_high_slope_relay.py site/public/research-artifacts/reverse-add-latency/prove_high_slope_relay.py
- verify_high_slope_independent.py site/public/research-artifacts/reverse-add-latency/verify_high_slope_independent.py
- check_196_orbit.py site/public/research-artifacts/reverse-add-orbit-audit/check_196_orbit.py
- verify_196_orbit.py site/public/research-artifacts/reverse-add-orbit-audit/verify_196_orbit.py
- verify_row_count_barrier.py site/public/research-artifacts/row-count-barrier/verify_row_count_barrier.py
- verify_grid_scaffold.py site/public/research-artifacts/scaffold-grid-width/verify_grid_scaffold.py
- check_compiler_interface.py site/public/research-artifacts/scaffold-proof-review/check_compiler_interface.py
- check_native_observation_shift.py site/public/research-artifacts/scaffold-proof-review/check_native_observation_shift.py
- check_receipt_repairs.py site/public/research-artifacts/scaffold-proof-review/check_receipt_repairs.py
- check_sequence_contract_alignment.py site/public/research-artifacts/scaffold-proof-review/check_sequence_contract_alignment.py
- check_sequence_history.py site/public/research-artifacts/scaffold-proof-review/check_sequence_history.py
- check_transfer_composition.py site/public/research-artifacts/scaffold-proof-review/check_transfer_composition.py
- check_unary_guards.py site/public/research-artifacts/scaffold-proof-review/check_unary_guards.py
- check_virtual_initialization.py site/public/research-artifacts/scaffold-proof-review/check_virtual_initialization.py
- verify_native_structural_normal_form.py site/public/research-artifacts/scaffold-proof-review/verify_native_structural_normal_form.py
- verify_destructor_separation.py site/public/research-artifacts/scaffold-pumping-certificates/verify_destructor_separation.py
- verify_live_quotient_pumping.py site/public/research-artifacts/scaffold-pumping-certificates/verify_live_quotient_pumping.py
- verify_paired_retraction_pumping.py site/public/research-artifacts/scaffold-pumping-certificates/verify_paired_retraction_pumping.py
- verify_pumping_certificates.py site/public/research-artifacts/scaffold-pumping-certificates/verify_pumping_certificates.py
- verify_stack_wqo_obstruction.py site/public/research-artifacts/scaffold-pumping-certificates/verify_stack_wqo_obstruction.py
- verify_typed_context_pumping.py site/public/research-artifacts/scaffold-pumping-certificates/verify_typed_context_pumping.py
- verify_wqo_pumping.py site/public/research-artifacts/scaffold-pumping-certificates/verify_wqo_pumping.py
- verify_stack_clock_dichotomy.py site/public/research-artifacts/stack-clock-dichotomy/verify_stack_clock_dichotomy.py
- verify_transport_spectrum.py site/public/research-artifacts/stationary-transport-spectrum/verify_transport_spectrum.py
- verify_structural_normal_form.py site/public/research-artifacts/structural-scaffold-normal-form/verify_structural_normal_form.py
- verify_synchronized_stack_selection.py site/public/research-artifacts/synchronized-stack-selection/verify_synchronized_stack_selection.py