TNFR Logo
TheoryLearnSoftwareResearch

On this page

TNFR

Resonant Fractal Nature Theory — a mathematical framework for coherent patterns on graph-coupled networks.

About
  • Project history
  • Editorial policy
  • Contact
Resources
  • GitHub
  • PyPI
  • DOI · Zenodo
Legal
  • MIT License
  • Citation
© 2026 TNFR project — MIT licensed.DOI 10.5281/zenodo.17602860
docs
grammar
PHYSICS_VERIFICATION.md
API_CONTRACTS.mdCANONICAL_OZ_SEQUENCES.mdEMPIRICAL_CONFRONTATION_EEG.mdREADME.mdSTRUCTURAL_FIELDS_TETRAD.mdSTRUCTURAL_INTERFACE_THEORY.md
theory
APPLIED_STRUCTURAL_ANALYSIS.mdCATALOG_TYPE_HYGIENE_PROGRAMME.mdDISSIPATIVE_AND_OPEN_SYSTEMS.mdEMERGENT_ONTOLOGY.mdEXTENDED_FIELDS_AND_DERIVED_QUANTITIES.mdFUNDAMENTAL_THEORY.mdGAUGE_SYMMETRY_AND_UNIFICATION.mdGLOSSARY.mdMATHEMATICAL_DYNAMICS_BASIS.mdMINIMAL_STRUCTURAL_DEGREES.mdNUCLEUS_A_PRIME_LADDER_ATLAS.mdNUCLEUS_B_EQUIVARIANCE_OBSTRUCTIONS.mdPHYSICAL_REGIME_CORRESPONDENCES.mdREADME.mdREMESH_INFINITY_DERIVATION.mdSTRUCTURAL_CONSERVATION_THEOREM.mdSTRUCTURAL_OPERATORS.mdSTRUCTURAL_STABILITY_AND_DYNAMICS.mdTNFR_BSD_RESEARCH_NOTES.mdTNFR_HODGE_RESEARCH_NOTES.mdTNFR_NAVIER_STOKES_RESEARCH_NOTES.mdTNFR_NUMBER_THEORY.mdTNFR_P_VS_NP_RESEARCH_NOTES.mdTNFR_RIEMANN_RESEARCH_NOTES.mdTNFR_VARIATIONAL_PRINCIPLE.mdTNFR_YANG_MILLS_RESEARCH_NOTES.mdTNFR.pdfUNIFIED_GRAMMAR_RULES.md
factorization-lab
analysis
analyze_patterns.pycertificate_manifest.py
benchmarks
benchmark_analysis.pybenchmark_expansion_suite.pyfull_spectrum_factorization.pypaley_gap_extended.pypaley_gap_smoke.pytest_benchmark_suite.py
demos
experiment_contexts
exp_0b1663cd19b7.jsonexp_0bf0054b7474.jsonexp_75a4c8ca616a.jsonexp_848ee0fd1857.jsonexp_f6fe00562193.jsonexp_fdf3da424e1e.json
failure_telemetry_batch.pyfeedback_integration_demo.pyintegration_demo_snapshots.dbseed_management_integration_demo.pysnapshot_integration_demo.pytrajectory_143.jsontrajectory_77.jsontrajectory_89.jsontrajectory_91.jsontrajectory_97.json
docs
FACTORING_PLAYBOOK.mdFALSE_POSITIVE_TEST_SUITE.mdOPERATOR_CERTIFICATES.mdROADMAP.mdSPECTRAL_ROUTE.md
experiment_contexts
exp_cebe1d9e7d8e.json
notebooks
spectral_history.ipynb
scripts
run_false_positive_tests.py
tests
run_false_positive_test_suite.pytest_cli.pytest_false_positive_methodology.pytest_false_positive_verifier.pytest_feedback_integration.pytest_partitioning.pytest_seed_management.pytest_self_opt_support.pytest_snapshot_system.pytest_spectral_paley.pytest_verification_robustness.py
tnfr_factorization
__init__.pyapi.pycli.pyfailure_telemetry.pyfeedback_adapter.pyfeedback_integration.pypartitioning.pyself_opt_support.pyspectral_paley.py
demo_snapshots.dbLICENSE_SNAPSHOT.mdPACKAGE_SUMMARY.mdREADME.mdseed_management.pysnapshot_system.pytest_certificate_hashing.pytest_installation.pyverification_trajectory_77.json
benchmarks
analyze_tetrad_universality.pyb0star_alpha_canonical_product_graphs.pybenchmark_optimization_tracks.pybenchmark_utils.pyboundary_vibration.pybridge_primes_riemann.pychiral_involution.pycli_utils.pycoherence_projector_sense_index.pycommutant_bridge.pycomposition_arithmetic.pyconfinement_zones_test.pyconservation_law_validation.pydirected_paley_bridge.pyemergent_arithmetic_pulse.pyemergent_atom_dynamics.pyemergent_atomic_shells.pyemergent_base_dimension.pyemergent_dimension_dynamics.pyemergent_fractal_pulse.pyemergent_fractal_simplex_dimension.pyemergent_integers_symmetry.pyemergent_musical_nfr.pyemergent_nfr_geometry.pyemergent_nfr_where.pyemergent_rationals.pyemergent_rhythm.pyemergent_screening.pyemergent_shell_cardinals.pyemergent_shell_ordering.pyemergent_simplex_dimension.pyemergent_substrate_symmetry.pyequivariance_wall.pyexternal_phase_gate_validation.pyfield_methods_battery.pygolden_residue_remesh_bridge.pyintegrated_force_regime_study.pyinverse_spectrum_to_symmetry.pyk_phi_safety_demo.pykuramoto_farey_bridge.pymissing_piece_bridge.pymultichannel_interface_benchmark.pynavier_stokes_recipe_bridge.pynodal_propagator_residue_bridge.pyns_moment_hierarchy_cascade.pyoperational_irreducibility.pypaley_bridge.pyphase_curvature_investigation.pyphase_wall.pyphi_s_confinement_investigation.pyprimes_as_consequence.pypulse_phase_coherence_budget.pyREADME.mdremesh_infinity_riemann_baseline.pyremesh_infinity_riemann_composed.pyremesh_infinity_riemann_modified_graph.pyremesh_infinity_riemann_operator.pyremesh_infinity_riemann_spectral_basis.pyremesh_infinity_riemann_spectral_robustness.pyremesh_infinity_riemann_spectral.pyresidue_phase_vs_riemann.pystructural_interface_benchmark.pytemporal_interface_benchmark.pytetrad_results_aggregate.pyu2_destabilization_irreversibility.pyuniversality_clusters.pyxi_c_fast_experiment.py
primality-test
benchmarks
comprehensive_benchmark.py
docs
ADVANCED_INTEGRATION.mdmathematical_foundation.mdperformance_analysis.md
examples
advanced_examples.pybasic_usage.py
tnfr_primality
__init__.py__main__.pyadvanced_cli.pyadvanced_core.pycli.pyconstants.pycore.pyoptimized.py
MANIFEST.inPACKAGE_SUMMARY.mdREADME.mdRELEASE_NOTES_v1.0.mdsetup.pytest_installation.py
tests
core_physics
__init__.pytest_conservation_laws.pytest_delta_nfr_computation_paths.pytest_delta_nfr.pytest_dispersion_coherence_sign_invariance.pytest_emergent_constants_guard.pytest_lyapunov_operators.pytest_nodal_equation.pytest_structural_triad.py
data
replay_manifests
sample_run
_manifest_summary.json_manifest.json_partition_files.txt.gz
self_opt_validation
seed_alpha
paley.json
seed_beta
integration.json
seed_gamma
unknown.json
self_optimization
test_run
partitioned
test_run
test_run_p0.jsontest_run_p1.json
_manifest_summary.json_manifest.json
engines
test_pattern_discovery_manifest.pytest_self_optimization_engine.py
mathematics
__init__.pytest_autodiff.pytest_backends.pytest_dissipative_dynamics.pytest_epi.pytest_factory_patterns.pytest_metrics.pytest_navier_stokes_refounded.pytest_number_theory_canonical.pytest_operators.pytest_residue_networks.pytest_riemann_nodal_pulse.pytest_riemann_pulse_coherence.pytest_spaces.pytest_transforms.pytest_validator.py
operators
test_canonical_operators_modern.pytest_grammar_canon.pytest_grammar_canonical_consistency.pytest_grammar_dynamics.pytest_operator_contracts.pytest_operator_strategies.py
parallel
test_fractal_partition_manifest.py
physics
test_conservation_gauge_unification.pytest_dissipative_conservation.pytest_emergent_chemistry.pytest_field_cache_invalidation.pytest_gauge.pytest_phase_transition.pytest_signatures.pytest_spectral_conservation.pytest_structural_diffusion.pytest_structural_integrity.pytest_symplectic_substrate.pytest_tetrad_bounds.pytest_variational.pytest_yang_mills_closure.pytest_yang_mills_derivability.pytest_yang_mills_scaling.pytest_yang_mills_structural_gap.pytest_yang_mills_u6_sweep.py
scripts
test_run_self_opt_validation.pytest_run_self_optimization.py
sdk
__init__.pytest_simple_advanced.py
__init__.pyconftest.pyREADME.mdtest_breast_cancer_phase_gate_demo.pytest_classical_mechanics.pytest_distributed_fft.pytest_external_phase_gate_validation.pytest_factorization_entrypoint.pytest_multichannel_interface.pytest_nodal_optimizer.pytest_phase_gate_api.pytest_replay_register_manifest.pytest_signal_confrontation.pytest_structural_interface_api.pytest_structural_interface_baselines.pytest_structural_interface_benchmark.pytest_temporal_interface.pytest_vectorized_coherence_length_regression.pytest_wine_quality_phase_gate_demo.pyutils.py
examples
01_foundations
01_hello_world.py02_musical_resonance.py03_network_formation.py04_operator_sequences.py05_coherence_evolution.py06_network_topologies.py07_phase_transitions.py08_emergent_phenomena.py09_visualization_suite.py10_simplified_sdk_showcase.py
02_physics_regimes
11_classical_limit_comparison.py115_operator_contract_audit.py12_classical_mechanics_demo.py13_quantum_mechanics_demo.py14_uncertainty_and_interference.py15_train_crossing_demo.py17_conservation_law_demo.py26_gauge_structure_demo.py27_variational_principle_demo.py28_dissipative_systems_demo.py29_lyapunov_stability_demo.py30_self_optimization_demo.py31_mathematical_constants_basis.py33_complex_field_unification.py34_conservation_protocol_suite.py35_tetrad_irreducibility.py36_grammar_violation_detector.py37_operator_tetrad_synergy.py38_grammar_energy_landscape.py39_nodal_equation_decomposition.py
03_riemann_zeta
157_nodal_pulse_phase_attack.py41_von_mangoldt_zeta_demo.py42_riemann_zeros_as_resonances.py43_prime_ladder_hamiltonian_demo.py44_weil_explicit_formula_demo.py45_li_keiper_demo.py46_weil_tnfr_positivity_demo.py47_alpha_sweep_demo.py48_admissible_family_sweep_demo.py49_nodeaware_gauge_sweep_demo.py50_uniform_coercivity_demo.py51_adaptive_coercivity_demo.py52_paley_gap_coercivity_demo.py53_lyapunov_spectral_positivity_demo.py54_hilbert_polya_demo.py55_structural_zero_density_demo.py56_spectral_emergence_demo.py57_admissible_rescaling_demo.py58_oscillatory_correction_demo.py
04_riemann_L_twisted
59_dirichlet_l_function_demo.py60_dirichlet_l_continuation_demo.py61_dirichlet_l_hamiltonian_demo.py62_dirichlet_weil_explicit_formula_demo.py63_dirichlet_li_keiper_demo.py64_twisted_weil_positivity_demo.py65_twisted_alpha_sweep_demo.py66_twisted_admissible_family_sweep_demo.py67_twisted_nodeaware_gauge_sweep_demo.py68_twisted_hermite_family_demo.py69_twisted_coercivity_uniform_demo.py70_twisted_paley_gap_coercivity_demo.py71_twisted_lyapunov_spectral_demo.py72_twisted_hilbert_polya_demo.py73_twisted_structural_zero_density_demo.py74_twisted_spectral_emergence_demo.py75_twisted_admissible_rescaling_demo.py76_twisted_oscillatory_correction_demo.py
05_type_hygiene
77_remesh_infinity_residue_split_demo.py78_nuf_type_signature_demo.py79_epi_type_signature_demo.py80_phi_type_signature_demo.py81_dnfr_type_signature_demo.py82_remesh_window_type_signature_demo.py83_delta_phi_max_type_signature_demo.py84_coupling_weights_type_signature_demo.py85_tetrad_closure_signature_demo.py86_currents_closure_signature_demo.py87_aggregates_closure_signature_demo.py88_urules_consistency_signature_demo.py89_operator_catalog_discipline_signature_demo.py
06_navier_stokes
158_navier_stokes_two_face_refounded.py
07_number_theory
100_prime_families_orbits.py101_numbers_as_coupled_network.py102_nodal_flow_primes_equilibria.py116_nuf_emergent_prime_visibility.py146_primality_grammatical_inertness.py147_numbers_as_free_monoid_words.py148_capacity_arm_carries_von_mangoldt.py149_p14_is_the_capacity_arm_operator.py153_structural_frequency_rank_cyclotomy.py40_arithmetic_number_theory.py94_generative_number_construction.py95_primes_from_spectral_waves.py96_spectral_vibration_of_coherence.py97_goldbach_additive_multiplicative.pyemergent_chemistry_particles_demo.py
08_emergent_geometry
103_emergent_substrate_meets_riemann.py106_per_node_polarization_geometry.py107_orthogonal_structure_emergent_geometry.py108_emergent_field_generating_structure.py112_structure_predicts_coherence_flow.py113_overdamped_projection_bridge.py114_substrate_conserved_quantities.py117_emergent_geometry_residue_graph.py118_emergent_vs_classical_operator.py119_phase_sector_directed_residue.py120_symmetry_wall_substrate_vs_spectrum.py121_canonical_symmetry_break_negative.py122_factorization_phase_sector.py123_symmetry_sector_decomposition.py124_emergent_metric_fractal_consistency.py125_node_is_the_emergent_substrate.py126_two_layers_base_fiber.py127_base_is_emergent_not_imposed.py128_base_substrate_coemergence.py129_spectral_gap_base_fiber_clock.py130_operators_break_substrate_charges.py131_coemergent_loop_convergence.py132_geometric_phase_holonomy.py133_psi_topological_defects.py134_spectral_dimension_heat_kernel.py135_arrow_of_time_h_theorem.py136_heat_kernel_coefficients.py137_synchronization_transition.py138_structure_frequency_synchronization.py139_grammar_formal_language.py140_grammar_automaton.py141_grammar_rule_decomposition.py142_grammar_operator_quotient.py143_glyphic_function_sublanguage.py144_branching_combinator.py145_syntactic_monoid_starfree.py150_emergent_grammatical_pattern_parry.py151_grammar_in_emergent_geometry.py152_operator_contract_tetrahedron.py154_conductor_annotated_qr_spectrum.py155_ontological_position_of_numbers.py156_emergence_directness_law.py98_emergent_symplectic_substrate.py99_structural_diffusion.pyunified_fields_showcase.py
09_millennium
109_p_vs_np_coherence_synthesis.py110_bsd_rank_structural_pressure.py111_hodge_discrete_and_honest_gap.py
10_applications
159_empirical_confrontation_pipeline.py90_phase_gate_monitor_demo.py91_breast_cancer_phase_gate_demo.py92_wine_quality_phase_gate_demo.py93_structural_interface_demo.pypytorch_cuda_demo.py
README.md
scripts
replay
__init__.pyregister_manifest.py
__init__.pyREADME.mdrebuild_failure_manifest.pyrun_reproducible_benchmarks.pyrun_self_opt_validation.pyrun_self_optimization.pytnfr_is_prime.pyvalidate_conservation_law.pyverify_internal_references.py
src
core
__init__.pyevaluation.py
tnfr
backends
__init__.pyjax_backend.pynumpy_backend.pyoptimized_numpy.pyREADME.mdtorch_backend.py
cli
__init__.py__init__.pyiarguments.pyarguments.pyiexecution.pyexecution.pyiinteractive_validator.pyREADME.mdutils.pyutils.pyi
compat
__init__.pydataclass.pyjsonschema_stub.pymatplotlib_stub.pynumpy_stub.pyREADME.md
config
__init__.py__init__.pyiconstants.pyconstants.pyidefaults_core.pydefaults_init.pydefaults_metric.pydefaults.pyfeature_flags.pyfeature_flags.pyiglyph_constants.pyoperator_names.pyoperator_names.pyiphysics_derivation.pyprecision_modes.pypresets.pypresets.pyiREADME.mdsecurity.pythresholds.pytnfr_config.py
constants
__init__.py__init__.pyialiases.pyaliases.pyicanonical.pymetric.pymetric.pyioperational.py
core
__init__.pycontainer.pydefault_implementations.pyexceptions.pyinterfaces.pyREADME.md
dynamics
__init__.py__init__.pyiadaptation.pyadaptation.pyiadaptive_sequences.pyadaptive_sequences.pyiadelic.pyadvanced_cache_optimizer.pyadvanced_fft_arithmetic.pyaliases.pyaliases.pyibifurcation.pycache_aware_fft_engine.pycanonical.pycanonical.pyicomputational_hub.pycoordination.pycoordination.pyidistributed_fft.pydnfr.pydnfr.pyidynamic_limits.pyemergent_centralization.pyemergent_integration_engine.pyfeedback.pyfeedback.pyifft_backend.pyfft_cache_coordinator.pyfft_dispatchers.pyfft_engine.pyfft_workers.pyfused_dnfr.pyhomeostasis.pyhomeostasis.pyiintegrators.pyintegrators.pyilearning.pylearning.pyimetabolism.pymulti_modal_cache.pynbody_tnfr.pynbody.pynodal_optimizer.pyoptimization_orchestrator.pypropagation.pyREADME.mdruntime.pyruntime.pyisampling.pysampling.pyiselectors.pyselectors.pyiself_optimizing_engine.pyspectral_structural_fusion.pystructural_cache.pystructural_clip.pysymplectic.pyunified_backend.pyunified_mathematical_cache_orchestrator.py
engines
computation
__init__.pyfft_engine.pyunified_fft_engine.pyunified_gpu_system.py
constants
__init__.pycanonical.pyoperational.py
integration
__init__.pyemergent_integration.py
pattern_discovery
__init__.pymathematical_patterns.pymulti_modal_cache.py
self_optimization
__init__.pyengine.py
__init__.pyREADME.md
errors
__init__.pycontextual.py
factorization
__init__.py
flatten
README.md
gamma
README.md
glyph_history
README.md
glyph_runtime
README.md
immutable
README.md
initialization
README.md
io
README.md
math
__init__.pyfields_symbolic.pygrammar_validators.pyoptimizer.pyREADME.mdsymbolic.py
mathematics
__init__.pybackend.pybackend.pyidynamics.pydynamics.pyiepi.pyepi.pyigenerators.pygenerators.pyiliouville.pymetrics.pymetrics.pyinumber_theory.pyoperators_factory.pyoperators_factory.pyioperators.pyoperators.pyioptimized_primality.pyprojection.pyprojection.pyiREADME.mdruntime.pyruntime.pyispaces.pyspaces.pyispectral.pytransforms.pytransforms.pyiunified_cache.pyunified_numerical.pyzeta.py
metrics
__init__.py__init__.pyibuffer_cache.pybuffer_cache.pyicache_utils.pycoherence.pycoherence.pyicommon.pycommon.pyicore.pycore.pyidiagnosis.pydiagnosis.pyiemergence.pyexport.pyexport.pyiglyph_timing.pyglyph_timing.pyilearning_metrics.pylearning_metrics.pyilocal_coherence.pyphase_coherence.pyphase_compatibility.pyREADME.mdreporting.pyreporting.pyisense_index.pysense_index.pyitelemetry.pytetrad.pytrig_cache.pytrig_cache.pyitrig.pytrig.pyi
multiscale
__init__.pyhierarchical.pyREADME.md
navier_stokes
__init__.pyconservative_face.pyoperator.py
node
README.md
observers
README.md
operators
network_analysis
__init__.pysource_detection.py
postconditions
__init__.pymutation.py
preconditions
__init__.pycoherence.pydissonance.pyemission.pymutation.pyreception.pyresonance.py
strategies
__init__.pydefaults.pygpu_strategies.pystrategy.py
__init__.py__init__.pyialgebra.pycanonical_patterns.pycascade.pycoherence.pycontraction.pycoupling.pycycle_detection.pydefinitions_base.pydefinitions.pydefinitions.pyidissonance.pyemission.pyexpansion.pygrammar_application.pygrammar_canon.pygrammar_context.pygrammar_core.pygrammar_dynamics.pygrammar_error_factory.pygrammar_memoization.pygrammar_patterns.pygrammar_telemetry.pygrammar_types.pygrammar_u6.pygrammar_validate.pygrammar.pygrammar.pyihamiltonian.pyhealth_analyzer.pyintrospection.pyjitter.pyjitter.pyilifecycle.pymetabolism.pymetrics_basic.pymetrics_core.pymetrics_network.pymetrics_structural.pymetrics_u6.pymetrics.pymutation.pynodal_equation.pyoperator_contracts.pypattern_detection.pypatterns.pyREADME.mdreception.pyrecursivity.pyregistry.pyregistry.pyiremesh.pyremesh.pyiresonance.pyself_organization.pysilence.pystructural_units.pytransition.py
parallel
__init__.pyauto_scaler.pydistributed.pyengine.pymonitoring.pypartitioner.pyREADME.md
performance
guardrails.py
physics
__init__.py_helpers.pycalibration.pycanonical.pycell.pyclassical_mechanics.pyconservation_gauge_unification.pyconservation.pydissipative_conservation.pyemergent_chemistry.pyemergent_particles.pyextended.pyfields.pygauge.pyintegrity.pyinteractions.pylife.pylyapunov.pypatterns.pyphase_transition.pyquantum_mechanics.pyREADME.mdsignatures.pyspectral_conservation.pyspectral_metrics.pystructural_diffusion.pysymplectic_substrate.pytelemetry.pyunified.pyvariational.pyvectorized_ops.py
primality
__init__.py
recipes
__init__.pycookbook.pyREADME.md
riemann
__init__.pyadmissible_family_sweep.pyadmissible_rescaling.pyaggregates_closure_signature.pyalpha_sweep.pyanalytic_continuation_dirichlet.pyanalytic_continuation.pycoercivity_uniform.pycoupling_weights_type_signature.pycurrents_closure_signature.pydelta_phi_max_type_signature.pydirichlet_l.pydnfr_type_signature.pyepi_type_signature.pyhilbert_polya.pyli_keiper.pylyapunov_spectral_positivity.pynodal_pulse.pynodeaware_gauge_sweep.pynuf_type_signature.pyoperator_catalog_discipline_signature.pyoperator.pyoscillatory_correction.pypaley_gap_coercivity.pyphi_type_signature.pyprime_ladder_hamiltonian.pypulse_coherence.pyremesh_infinity_residue_split.pyremesh_window_type_signature.pyspectral_emergence.pystructural_zero_density.pytelemetry.pytetrad_closure_signature.pytwisted_admissible_family_sweep.pytwisted_admissible_rescaling.pytwisted_alpha_sweep.pytwisted_coercivity_uniform.pytwisted_hermite_family.pytwisted_hilbert_polya.pytwisted_li_keiper.pytwisted_lyapunov_spectral_positivity.pytwisted_nodeaware_gauge_sweep.pytwisted_oscillatory_correction.pytwisted_paley_gap_coercivity.pytwisted_prime_ladder_hamiltonian.pytwisted_spectral_emergence.pytwisted_structural_zero_density.pytwisted_weil_explicit_formula.pytwisted_weil_positivity.pyurules_consistency_signature.pyvon_mangoldt.pyweil_explicit_formula.pyweil_positivity.py
schemas
__init__.pygrammar.jsonREADME.md
sdk
__init__.py__init__.pyiadaptive_system.pyadaptive_system.pyibuilders.pybuilders.pyifluent.pyfluent.pyiREADME.mdself_opt.pysimple.pytemplates.pytemplates.pyiutils.py
security
__init__.pycrypto.pydatabase.pyREADME.mdsubprocess.pyvalidation.py
sequencing
__init__.pypatterns.pyREADME.md
services
__init__.pyorchestrator.pyREADME.md
sparse
__init__.pyREADME.mdrepresentations.py
structural
README.md
telemetry
__init__.pycache_metrics.pycache_metrics.pyiconstants.pynu_f.pynu_f.pyiREADME.mdunified_telemetry_system.pyverbosity.pyverbosity.pyi
tools
__init__.pydomain_templates.pyREADME.mdsequence_generator.pytnfr_is_prime_cli_optimized.pytnfr_is_prime_cli.py
topology
__init__.pyasymmetry.pyREADME.md
utils
cache_layers.pycache.pycache.pyicallbacks.pycallbacks.pyichunks.pychunks.pyidata.pydata.pyifast_diameter.pygraph.pygraph.pyiinit.pyinit.pyiio.pyio.pyinumeric.pynumeric.pyiREADME.mdtopology.pyunified_cache.py
validation
__init__.py__init__.pyiaggregator.pybase.pycompatibility.pycompatibility.pyiconfig.pygraph.pygraph.pyihealth.pyinput_validation.pyinterface_baselines.pyinvariants.pymultichannel_interface.pyphase_gate.pyREADME.mdrules.pyrules.pyiruntime.pyruntime.pyisequence_validator.pysignal_confrontation.pysoft_filters.pysoft_filters.pyispectral.pyspectral.pyistructural_interface.pytemporal_interface.pyunified_validation_system.pyvalidator.pywindow.pywindow.pyi
visualization
__init__.pycascade_viz.pyhierarchy.pyREADME.mdsequence_plotter.py
yang_mills
__init__.pyclosure.pyderivability.pyscaling.pystructural_gap.pyu6_sweep.py
__init__.py__init__.pyi_compat.py_version.py_version.pyialias.pyalias.pyibackend_config.pycache.pycache.pyiexecution.pyexecution.pyiflatten.pyflatten.pyigamma.pygamma.pyiglyph_history.pyglyph_history.pyiglyph_runtime.pyglyph_runtime.pyiimmutable.pyimmutable.pyiinitialization.pyinitialization.pyiio.pyio.pyilocking.pylocking.pyinode.pynode.pyiobservers.pyobservers.pyiontosim.pyontosim.pyipy.typedrng.pyrng.pyisecure_config.pyselector.pyselector.pyisense.pysense.pyistructural.pystructural.pyitokens.pytokens.pyitrace.pytrace.pyitypes.pytypes.pyiunits.pyunits.pyi
tetrad_evaluator.py
.pre-commit-config.yaml.semgrep.yaml.zenodo.jsonARCHITECTURE.mdbandit.yamlCHANGELOG.mdCITATION.cffCONTRIBUTING.mdEMERGENT_CANON_AUDIT.mdEMERGENT_DERIVATION_PLAN.mdLICENSE.mdMakefileMANIFEST.inpyproject.tomlpyrightconfig.jsonPYTORCH_CUDA_INTEGRATION.mdREADME.mdSECURITY.mdTESTING.mdTNFR_Website_Content_Brief.md
FILE: benchmarks/missing_piece_bridge.py

missing_piece_bridge.py

benchmarks/missing_piece_bridge.py

Camino 12 -- are the two B2 escapes ONE missing canonical piece, or two?

commutant_bridge.py (Camino 7) proved the Riemann and Yang-Mills walls have the SAME SHAPE: in both, the reachable set of the TNFR catalog is the COMMUTANT of a group, and each open target lives in the orthogonal complement the commutant cannot reach. It named the two escapes:

  • RH escape : a node-distinct diagonal P2 = diag(nu_f = log p) that breaks the S_n commutant (acts on the BASE space V = C^n).
  • YM escape : non-commuting generators su(d) that break the colour-scalar commutant (act on the FIBRE space C^d).

The repo memory records a stronger, UNPROVEN conjecture (cross-program synthesis, 2026-06-12): "the missing non-Abelian canonical derivation (YM Branch B) and the S_n-breaking structure RH needs (T-HP / G4) may be the SAME absent canonical piece -- closing one gives the other." Camino 7 showed same SHAPE; it never tested same PIECE. This harness tests the conjecture directly, and it can FALSIFY it.

THE QUESTION (falsifiable): Is there a SINGLE structural object X such that adjoining X to the catalog breaks BOTH the S_n commutant (RH) and the colour-scalar commutant (YM), with the SAME non-derivability reason? If yes -> "closing one gives the other" is literally true. If no -> the conjecture is refuted and replaced by whatever weaker statement survives.

WHAT THIS HARNESS FINDS (preview -- the strong reading is REFUTED, a precise weaker one SURVIVES): (1) NOT THE SAME OBJECT. The RH escape D is a DIAGONAL (Cartan / torus, hence Abelian: [D, D'] = 0) operator on the BASE V = C^n; the YM escape su(d) is OFF-diagonal (root direction), NON-Abelian ([T_x,T_y] != 0) on the FIBRE C^d. Different spaces, different commutation, different position in gl. A single matrix cannot be both. (2) SAME RECIPE. Both escapes are the identical structural move: "adjoin an operator that fails to commute with the existing invariant structure", yielding TRACELESS non-Abelian generators -- so(n) on the base for RH (the commutator [A, D] of the symmetric coupling with the diagonal is real anti-symmetric, tr = 0), su(d) on the fibre for YM. (3) ONE INGREDIENT, ONE SPACE ONLY. The single diagonal D does double duty on the BASE -- it opens Fix(S_n)^perp (the RH complement) AND, via [A, D] in so(n), turns the base algebra non-Abelian. But D acts trivially on the fibre: D (x) I_d COMMUTES with I_n (x) T_a, so the base ingredient CANNOT supply the fibre's non-commuting generators. The YM gap keeps its own, independent missing piece. (4) SAME NON-DERIVABILITY ROOT. Both ingredients are absent for the SAME nodal reason: dEPI/dt = nu_f . dNFR has no per-node slot (RH: D = diag(nu_f=log p) read as IMPOSED input, B0*-beta) and no per-fibre multiplet slot (YM: Y3 = OPEN_DERIVABILITY_GAP, canonical gauge U(1), no non-commuting generators).

ENGINE (known theorems -- independent ground truth, all pre-TNFR):

  • gl(n) = h (+) n: the Cartan h (diagonal) and the root spaces n (off-diagonal E_ij) split M_n(C); [D, E_ij] = (d_i - d_j) E_ij, so distinct diagonal entries make every root non-degenerate (visible); [E_ij, E_ji] = E_ii - E_jj != 0, so the root spaces are non-commuting (su-type).
  • commutator of two real symmetric matrices is real anti-symmetric: (AD-DA)^T = DA - AD = -(AD-DA), so [A, D] in so(n) (traceless, non-Abelian) whenever it is nonzero -- and it is nonzero iff A has an off-diagonal entry A_ij != 0 with d_i != d_j.
  • tensor factorisation: (D (x) I_d)(I_n (x) T) = D (x) T = (I_n (x) T) (D (x) I_d), so a base operator and a fibre operator always commute -- base structure cannot manufacture fibre structure.

TNFR reading (AGENTS.md + src/tnfr/yang_mills + src/tnfr/dynamics/adelic): the node-distinct diagonal is the canonical adelic carrier nu_f = log p (CANONICAL, but read by the engine as IMPOSED input, the B0*-beta P2 = NodeIndexedCouplingWeights that AGENTS.md shows is not nodal-derivable); the YM side is audited by tnfr.yang_mills.audit_nonabelian_derivability (conservative verdict OPEN_DERIVABILITY_GAP). This harness reuses the Camino-7 machinery directly (adjacency_laplacian, canonical_per_node_diagonal, su2_generators, commutator_norm, symmetric_projector from commutant_bridge.py).

HONEST SCOPE -- structural CHECKS pass; the THESIS verdict is OPEN (by design): The four structural checks pass at machine precision. Their NET reading REFUTES the strong unifying conjecture: there is NO single object X that breaks both walls (the escapes live on different tensor factors, base vs fibre, and D (x) I commutes with I (x) T). What survives is a precise WEAKER unification: both gaps are the SAME RECIPE (break a commutant by adjoining a non-commuting, traceless operator) sharing ONE non-derivability root (no per-node / per-fibre slot in the nodal equation). So the synthesis reduces "two mysteries" to "one recipe with two independent realisations", NOT to "one piece". It SHARPENS the conjecture; it closes nothing. Finite toy-graph

  • su(2) linear algebra; nothing here proves RH, the Yang-Mills mass gap, or closes G4. R (continuum) and pi remain assumed substrate.

Run: python benchmarks/missing_piece_bridge.py

Status: RESEARCH (missing-piece falsifier; Camino 12 of the unification map).

Source Code

python
"""
benchmarks/missing_piece_bridge.py

Camino 12 -- are the two B2 escapes ONE missing canonical piece, or two?

commutant_bridge.py (Camino 7) proved the Riemann and Yang-Mills walls have
the SAME SHAPE: in both, the reachable set of the TNFR catalog is the
COMMUTANT of a group, and each open target lives in the orthogonal complement
the commutant cannot reach. It named the two escapes:

  - RH escape : a node-distinct diagonal P2 = diag(nu_f = log p) that breaks
                the S_n commutant (acts on the BASE space V = C^n).
  - YM escape : non-commuting generators su(d) that break the colour-scalar
                commutant (act on the FIBRE space C^d).

The repo memory records a stronger, UNPROVEN conjecture (cross-program
synthesis, 2026-06-12): "the missing non-Abelian canonical derivation (YM
Branch B) and the S_n-breaking structure RH needs (T-HP / G4) may be the SAME
absent canonical piece -- closing one gives the other." Camino 7 showed same
SHAPE; it never tested same PIECE. This harness tests the conjecture directly,
and it can FALSIFY it.

THE QUESTION (falsifiable):
  Is there a SINGLE structural object X such that adjoining X to the catalog
  breaks BOTH the S_n commutant (RH) and the colour-scalar commutant (YM),
  with the SAME non-derivability reason? If yes -> "closing one gives the
  other" is literally true. If no -> the conjecture is refuted and replaced by
  whatever weaker statement survives.

WHAT THIS HARNESS FINDS (preview -- the strong reading is REFUTED, a precise
weaker one SURVIVES):
  (1) NOT THE SAME OBJECT. The RH escape D is a DIAGONAL (Cartan / torus,
      hence Abelian: [D, D'] = 0) operator on the BASE V = C^n; the YM escape
      su(d) is OFF-diagonal (root direction), NON-Abelian ([T_x,T_y] != 0) on
      the FIBRE C^d. Different spaces, different commutation, different
      position in gl. A single matrix cannot be both.
  (2) SAME RECIPE. Both escapes are the identical structural move: "adjoin an
      operator that fails to commute with the existing invariant structure",
      yielding TRACELESS non-Abelian generators -- so(n) on the base for RH
      (the commutator [A, D] of the symmetric coupling with the diagonal is
      real anti-symmetric, tr = 0), su(d) on the fibre for YM.
  (3) ONE INGREDIENT, ONE SPACE ONLY. The single diagonal D does double duty
      on the BASE -- it opens Fix(S_n)^perp (the RH complement) AND, via
      [A, D] in so(n), turns the base algebra non-Abelian. But D acts
      trivially on the fibre: D (x) I_d COMMUTES with I_n (x) T_a, so the base
      ingredient CANNOT supply the fibre's non-commuting generators. The YM
      gap keeps its own, independent missing piece.
  (4) SAME NON-DERIVABILITY ROOT. Both ingredients are absent for the SAME
      nodal reason: dEPI/dt = nu_f . dNFR has no per-node slot (RH:
      D = diag(nu_f=log p) read as IMPOSED input, B0*-beta) and no per-fibre
      multiplet slot (YM: Y3 = OPEN_DERIVABILITY_GAP, canonical gauge U(1), no
      non-commuting generators).

ENGINE (known theorems -- independent ground truth, all pre-TNFR):
  - gl(n) = h (+) n: the Cartan h (diagonal) and the root spaces n
    (off-diagonal E_ij) split M_n(C); [D, E_ij] = (d_i - d_j) E_ij, so
    distinct diagonal entries make every root non-degenerate (visible);
    [E_ij, E_ji] = E_ii - E_jj != 0, so the root spaces are non-commuting
    (su-type).
  - commutator of two real symmetric matrices is real anti-symmetric:
    (AD-DA)^T = DA - AD = -(AD-DA), so [A, D] in so(n) (traceless, non-Abelian)
    whenever it is nonzero -- and it is nonzero iff A has an off-diagonal entry
    A_ij != 0 with d_i != d_j.
  - tensor factorisation: (D (x) I_d)(I_n (x) T) = D (x) T = (I_n (x) T)
    (D (x) I_d), so a base operator and a fibre operator always commute --
    base structure cannot manufacture fibre structure.

TNFR reading (AGENTS.md + src/tnfr/yang_mills + src/tnfr/dynamics/adelic): the
node-distinct diagonal is the canonical adelic carrier nu_f = log p
(CANONICAL, but read by the engine as IMPOSED input, the B0*-beta
P2 = NodeIndexedCouplingWeights that AGENTS.md shows is not nodal-derivable);
the YM side is audited by tnfr.yang_mills.audit_nonabelian_derivability
(conservative verdict OPEN_DERIVABILITY_GAP). This harness reuses the Camino-7
machinery directly (adjacency_laplacian, canonical_per_node_diagonal,
su2_generators, commutator_norm, symmetric_projector from commutant_bridge.py).

HONEST SCOPE -- structural CHECKS pass; the THESIS verdict is OPEN (by design):
  The four structural checks pass at machine precision. Their NET reading
  REFUTES the strong unifying conjecture: there is NO single object X that
  breaks both walls (the escapes live on different tensor factors, base vs
  fibre, and D (x) I commutes with I (x) T). What survives is a precise WEAKER
  unification: both gaps are the SAME RECIPE (break a commutant by adjoining a
  non-commuting, traceless operator) sharing ONE non-derivability root (no
  per-node / per-fibre slot in the nodal equation). So the synthesis reduces
  "two mysteries" to "one recipe with two independent realisations", NOT to
  "one piece". It SHARPENS the conjecture; it closes nothing. Finite toy-graph
  + su(2) linear algebra; nothing here proves RH, the Yang-Mills mass gap, or
  closes G4. R (continuum) and pi remain assumed substrate.

Run:
    python benchmarks/missing_piece_bridge.py

Status: RESEARCH (missing-piece falsifier; Camino 12 of the unification map).
"""

from __future__ import annotations

import os
import sys

import networkx as nx
import numpy as np

sys.path.insert(0, os.path.dirname(os.path.abspath(__file__)))
# Robust fallback so the harness also runs without PYTHONPATH=src preset.
sys.path.insert(
    0, os.path.join(os.path.dirname(os.path.abspath(__file__)), "..", "src")
)
# Camino 12 builds directly on Camino 7: reuse its exact machinery so the two
# B2 escapes here are the SAME objects C7 named, not re-derived look-alikes.
from commutant_bridge import (  # noqa: E402
    adjacency_laplacian,
    canonical_per_node_diagonal,
    commutator_norm,
    su2_generators,
    symmetric_projector,
)
from composition_arithmetic import automorphism_matrices  # noqa: E402

# Optional: the canonical engine's own non-Abelian derivability verdict.
try:  # pragma: no cover - exercised only when the package is importable
    from tnfr.yang_mills import audit_nonabelian_derivability  # noqa: E402

    _HAVE_AUDIT = True
except Exception:  # pragma: no cover
    _HAVE_AUDIT = False

TOL = 1e-9
_NONZERO = 1e-3


def elementary_matrix(n, i, j):
    """E_ij: the n x n matrix with a single 1 in position (i, j)."""
    E = np.zeros((n, n), dtype=float)
    E[i, j] = 1.0
    return E


# --------------------------------------------------------------------------- #
# TEST 1 -- the two escapes are NOT the same object (the strong reading fails)
# --------------------------------------------------------------------------- #
def test_escapes_not_identical():
    print("=" * 78)
    print(
        "TEST 1 -- NOT ONE OBJECT: D is Abelian-on-base, su(d) is "
        "non-Abelian-on-fibre"
    )
    print("=" * 78)
    n = 5
    # RH escape: a node-distinct diagonal on the BASE V = C^n. Two such
    # diagonals ALWAYS commute -- a single D is an Abelian (Cartan) element.
    d1, _label = canonical_per_node_diagonal(n)
    d2 = np.diag(np.arange(1, n + 1, dtype=float) ** 2)  # another distinct D
    d_abelian = commutator_norm(d1, d2)

    # YM escape: su(2) generators on the FIBRE C^d. They do NOT commute.
    tx, ty, _tz = su2_generators()
    su_nonabelian = commutator_norm(tx, ty)

    # Convention-independent discriminators (the "real vs complex" framing is
    # convention-dependent: in the Hermitian sigma/2 basis sigma_x, sigma_z are
    # real, only sigma_y is imaginary). The robust distinction is structural:
    #  - dimension: D acts on the BASE C^n, T_a on the FIBRE C^d -> shapes
    #               differ
    #  - position : D is DIAGONAL (Cartan / torus), every su(2) generator has a
    #               nonzero OFF-diagonal part (root direction).
    d_shape = d1.shape
    t_shape = tx.shape
    different_spaces = d_shape != t_shape
    d_offdiag = float(np.linalg.norm(d1 - np.diag(np.diag(d1))))
    t_offdiag = max(float(np.linalg.norm(T - np.diag(np.diag(T)))) for T in (tx, ty))

    ok = (
        d_abelian < TOL
        and su_nonabelian > _NONZERO
        and different_spaces
        and d_offdiag < TOL
        and t_offdiag > _NONZERO
    )
    print(f"  RH escape D  : node-distinct DIAGONAL on BASE {d_shape}")
    print(
        f"                 -- two such D commute, ||[D1, D2]|| = "
        f"{d_abelian:.2e} (ABELIAN / Cartan); off-diag = {d_offdiag:.2e}"
    )
    print(
        f"  YM escape su : OFF-diagonal generators on FIBRE {t_shape} -- "
        f"||[T_x, T_y]|| = {su_nonabelian:.3f} (NON-Abelian)"
    )
    print(
        f"  different spaces (base vs fibre): {different_spaces} ; "
        f"D off-diag ~0: {d_offdiag < TOL} ; T off-diag > 0: "
        f"{t_offdiag > _NONZERO}"
    )
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- a single matrix cannot "
        "be both; the strong 'same object' reading is REFUTED"
    )
    print()
    return ok


# --------------------------------------------------------------------------- #
# TEST 2 -- but both escapes are the SAME RECIPE: adjoin a non-commuting,
#           traceless operator -> so(n) on the base / su(d) on the fibre
# --------------------------------------------------------------------------- #
def test_same_structural_recipe():
    print("=" * 78)
    print(
        "TEST 2 -- SAME RECIPE: adjoin a non-commuting traceless operator "
        "(so(n) / su(d))"
    )
    print("=" * 78)
    n = 5
    G = nx.complete_graph(n)  # prime-relabelling symmetry S_5
    nodes = list(G.nodes())
    mats = automorphism_matrices(G, nodes)
    A, _L = adjacency_laplacian(G, nodes)
    D, _label = canonical_per_node_diagonal(n)

    # RH side: D breaks the S_n commutant, and [A, D] -- the existing
    # symmetric coupling against the diagonal -- is a real ANTI-SYMMETRIC
    # (so(n)) generator.
    rh_break = max(commutator_norm(D, P) for P in mats)
    comm_AD = A @ D - D @ A
    rh_gen_norm = float(np.linalg.norm(comm_AD))
    rh_antisym = float(np.linalg.norm(comm_AD + comm_AD.T))  # so(n): M^T = -M
    rh_traceless = abs(float(np.trace(comm_AD)))

    # YM side: su(2) generators are TRACELESS, anti-Hermitian, non-commuting.
    tx, ty, tz = su2_generators()
    ym_gen = 1j * tz  # i.sigma_z/2 in su(2) (anti-Hermitian)
    ym_nonabelian = commutator_norm(tx, ty)
    ym_traceless = abs(complex(np.trace(ym_gen)))
    ym_antiherm = float(np.linalg.norm(ym_gen + ym_gen.conj().T))

    ok = (
        rh_break > _NONZERO
        and rh_gen_norm > _NONZERO
        and rh_antisym < TOL
        and rh_traceless < TOL
        and ym_nonabelian > _NONZERO
        and ym_traceless < TOL
        and ym_antiherm < TOL
    )
    print(
        f"  RH (base)  : [D, P_s] != 0 (max = {rh_break:.2f}) breaks S_n ; "
        f"[A, D] is so(n)"
    )
    print(
        f"               ||[A,D]|| = {rh_gen_norm:.2f}, anti-symmetry "
        f"||[A,D]+[A,D]^T|| = {rh_antisym:.2e}, |tr| = {rh_traceless:.2e}"
    )
    print(
        f"  YM (fibre) : [T_x,T_y] != 0 (= {ym_nonabelian:.3f}) ; "
        f"i.sigma_z/2 in su(2), |tr| = {ym_traceless:.2e}, "
        f"anti-Herm = {ym_antiherm:.2e}"
    )
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- one recipe "
        "(non-commuting traceless adjunction), two spaces: "
        "so(n) base / su(d) fibre"
    )
    print()
    return ok


# --------------------------------------------------------------------------- #
# TEST 3 -- one ingredient, one space only: D unifies the BASE side but cannot
#           reach the FIBRE -> "closing one gives the other" fails by space
# --------------------------------------------------------------------------- #
def test_one_ingredient_two_complements():
    print("=" * 78)
    print(
        "TEST 3 -- ONE INGREDIENT, ONE SPACE: D unifies the base side, "
        "cannot reach the fibre"
    )
    print("=" * 78)
    n = 5
    d = 2
    G = nx.complete_graph(n)
    nodes = list(G.nodes())
    mats = automorphism_matrices(G, nodes)
    A, _L = adjacency_laplacian(G, nodes)
    D, _label = canonical_per_node_diagonal(n)
    Pi = symmetric_projector(mats)
    eye = np.eye(n)

    # (a) On the BASE, the single D does double duty:
    #     (i) opens Fix(S_n)^perp -- the RH complement (leak from a sym seed)
    leak = float(np.linalg.norm((eye - Pi) @ (D @ (Pi @ eye[:, 0]))))
    #     (ii) [A, D] in so(n) turns the base algebra non-Abelian
    base_nonabelian = float(np.linalg.norm(A @ D - D @ A))

    # (b) But D acts trivially on the FIBRE: lifted to V (x) C^d it commutes
    #     with EVERY fibre generator I_n (x) T_a -- a base operator cannot
    #     manufacture fibre non-commutativity.
    tx, ty, tz = su2_generators()
    D_base = np.kron(D, np.eye(d))
    fibre_reach = 0.0
    for T in (tx, ty, tz):
        T_fibre = np.kron(eye, T)
        fibre_reach = max(fibre_reach, commutator_norm(D_base, T_fibre))

    ok = leak > _NONZERO and base_nonabelian > _NONZERO and fibre_reach < TOL
    print(
        f"  (a) base side: D opens Fix(S_n)^perp (leak = {leak:.2f}) AND "
        f"[A,D] in so(n) (||[A,D]|| = {base_nonabelian:.2f})"
    )
    print(
        f"  (b) fibre side: D (x) I commutes with EVERY I (x) T_a "
        f"(max ||[.,.]|| = {fibre_reach:.2e})"
    )
    print(
        "      -> the base ingredient D cannot supply the fibre's "
        "non-commuting generators"
    )
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- one ingredient unifies "
        "the BASE; the FIBRE keeps an INDEPENDENT missing piece"
    )
    print()
    return ok


# --------------------------------------------------------------------------- #
# TEST 4 -- honest OPEN: the two ingredients share ONE non-derivability root
# --------------------------------------------------------------------------- #
def test_shared_nonderivability():
    print("=" * 78)
    print("TEST 4 -- HONEST OPEN: both ingredients absent for the SAME nodal " "reason")
    print("=" * 78)
    n = 5
    G = nx.complete_graph(n)
    nodes = list(G.nodes())
    mats = automorphism_matrices(G, nodes)
    D, d_label = canonical_per_node_diagonal(n)

    # RH side: D = diag(nu_f = log p) breaks S_n but is read as IMPOSED input
    # (no per-node slot in dEPI/dt = nu_f . dNFR; B0*-beta P2 not derivable).
    rh_break = max(commutator_norm(D, P) for P in mats)
    rh_imposed = "log p" in d_label or "diag(1..n)" in d_label

    # YM side: non-commuting generators are needed but Y3 audits them as not
    # derivable from nodal data.
    tx, ty, _tz = su2_generators()
    ym_break = commutator_norm(tx, ty)

    verdict_line = "OPEN_DERIVABILITY_GAP (canonical default; package not imported)"
    canon_ok = True
    if _HAVE_AUDIT:
        try:
            report = audit_nonabelian_derivability()
            any_noncomm = any(c.has_noncommuting_generators for c in report.candidates)
            verdict_line = (
                f"{report.verdict} ; gauge = {report.canonical_gauge_group} ; "
                f"non-commuting generators on any route = {any_noncomm}"
            )
            canon_ok = report.verdict == "OPEN_DERIVABILITY_GAP" and not any_noncomm
        except Exception as exc:  # pragma: no cover
            verdict_line = f"(canonical audit unavailable: {exc})"

    ok = rh_break > _NONZERO and ym_break > _NONZERO and rh_imposed and canon_ok
    print(f"  RH ingredient : D = diag({d_label})")
    print(
        f"                  breaks S_n (||[D,P_s]|| = {rh_break:.2f}) but "
        "is IMPOSED input"
    )
    print(
        "                  (no per-node slot in dEPI/dt = nu_f . dNFR; " "B0*-beta P2)."
    )
    print(
        f"  YM ingredient : non-commuting [T_x,T_y] (= {ym_break:.3f}) "
        "needed, but its"
    )
    print("                  derivation is the open Y3 gap. Canonical audit:")
    print(f"                  {verdict_line}")
    print(
        f"  VERDICT: {'PASS' if ok else 'FAIL'} -- two ingredients, ONE "
        "shared non-derivability root (no per-node / per-fibre slot)"
    )
    print()
    return ok


def main():
    print(__doc__)
    t1 = test_escapes_not_identical()
    t2 = test_same_structural_recipe()
    t3 = test_one_ingredient_two_complements()
    t4 = test_shared_nonderivability()

    print("=" * 78)
    print("SUMMARY")
    print("=" * 78)
    print(
        f"  TEST 1 not one object (base/fibre, Abelian/non-Abelian) : "
        f"{'PASS' if t1 else 'FAIL'}"
    )
    print(
        f"  TEST 2 same recipe (so(n) base / su(d) fibre)           : "
        f"{'PASS' if t2 else 'FAIL'}"
    )
    print(
        f"  TEST 3 one ingredient unifies base only, not fibre      : "
        f"{'PASS' if t3 else 'FAIL'}"
    )
    print(
        f"  TEST 4 shared non-derivability root                     : "
        f"{'PASS' if t4 else 'FAIL'}"
    )
    structural = t1 and t2 and t3 and t4
    print()
    print(f"  STRUCTURAL CHECKS: {'ALL PASS' if structural else 'SOME FAIL'}")
    print()
    print("  THESIS VERDICT: OPEN (by design). The strong unifying")
    print("  conjecture -- 'one absent canonical piece; closing one gives the")
    print("  other' -- is REFUTED: the two B2 escapes act on different tensor")
    print("  factors (the base V = C^n for RH, the fibre C^d for YM), D is")
    print("  Abelian-on-base while su(d) is non-Abelian-on-fibre, and")
    print("  D (x) I commutes with I (x) T_a, so the base ingredient cannot")
    print("  supply the fibre's generators. What SURVIVES is a precise weaker")
    print("  unification: both gaps are the SAME RECIPE (break a commutant by")
    print("  adjoining a non-commuting, traceless operator -- so(n) on the")
    print("  base, su(d) on the fibre) sharing ONE non-derivability root (no")
    print("  per-node / per-fibre slot in dEPI/dt = nu_f . dNFR). The")
    print("  synthesis reduces 'two mysteries' to 'one recipe with two")
    print("  independent realisations', NOT to 'one piece'. It SHARPENS the")
    print("  conjecture; it closes nothing. R and pi remain")
    print("  assumed substrate; nothing here proves RH or the YM mass gap.")
    return 0 if structural else 1


if __name__ == "__main__":
    raise SystemExit(main())