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: src/tnfr/riemann/dnfr_type_signature.py

dnfr_type_signature.py

ΔNFR-Type Signature — Diagnostic for the T-ΔNFR Conjecture (§13quadraginta).

This module implements a purely diagnostic quantity, the ΔNFR-Type Signature :math:\\mathcal{S}_{\\Delta\\mathrm{NFR}}, that quantifies on canonical TNFR network evolutions whether the canonical nodal gradient :math:\\Delta\\mathrm{NFR} \\in \\mathbb{R} admits an irreducible tensor-rank lift (e.g. a per-node vector or rank-2 tensor over the constituent gradient channels phase, EPI, νf), or whether the single scalar slot written by :func:tnfr.dynamics.dnfr.default_compute_delta_nfr is structurally sufficient.

Methodological scope (mandatory honesty)

This module is a diagnostic only. It does not construct, promote, or modify any canonical operator. It does not advance G4 = RH. It does not by itself decide the T-ΔNFR Conjecture (which requires the forcing-axiom reduction of §13quadraginta-prima and the final verdict of §13quadraginta-secunda — both deferred to B3b/B3c).

The diagnostic probes two orthogonal axes:

  1. Tensor storage axis — the fraction of (node, step) samples at which the canonical per-node ΔNFR slot stores a non-scalar value (vector, tensor, mapping, or otherwise non-float payload). Under the canonical implementation :func:tnfr.dynamics.dnfr.default_compute_delta_nfr, the slot is always a scalar by construction, so this fraction is structurally 0 — exactly mirroring w_frac = 0 of the B2a φ-diagnostic and bepi_frac = 0 of the B1a EPI-diagnostic.
  2. Rank-entropy axis — Shannon entropy of the normalised singular-value distribution of the per-node gradient-component matrix :math:M_i \\in \\mathbb{R}^{T \\times 3} whose columns are the per-step mean-neighbour differences in the three canonical gradient channels :math:(d\\theta, d\\mathrm{EPI}, d\\nu_f), averaged across nodes and normalised by :math:\\log 3 (the maximum rank). A multi-rank gradient stream is a necessary condition for the canonical dynamics to require a tensor-valued ΔNFR (a rank-1 scalar projection is fully equivalent to the tensor stream if the three channels collapse to a single rank).

A high :math:\\mathcal{S}_{\\Delta\\mathrm{NFR}} is a necessary-condition check: it says only that canonical gradient accumulation on a TNFR graph carries irreducible multi-channel content that a rank-1 scalar reading necessarily compresses. It does not prove that the canonical type of ΔNFR is a non-trivial tensor element.

A low :math:\\mathcal{S}_{\\Delta\\mathrm{NFR}} plus a zero tensor storage fraction is the empirically expected outcome — structurally consistent with the catalog row 1 typing :math:\\Delta\\mathrm{NFR} \\in \\mathbb{R} and with the scalar nodal-equation contract :math:(\\nu_f, \\Delta\\mathrm{NFR}) \\mapsto \\partial\\mathrm{EPI}/\\partial t enforced at src/tnfr/operators/nodal_equation.py:1-160.

References

  • theory/TNFR_RIEMANN_RESEARCH_NOTES.md §13quadraginta
  • theory/CATALOG_TYPE_HYGIENE_PROGRAMME.md §4 row B3
  • src/tnfr/dynamics/dnfr.py:2387::default_compute_delta_nfr (canonical scalar-writing implementation)
  • src/tnfr/constants/aliases.py:9::ALIAS_DNFR (canonical per-node storage alias)
  • src/tnfr/operators/nodal_equation.py:1-160 (scalar contract)

Source Code

python
"""ΔNFR-Type Signature — Diagnostic for the T-ΔNFR Conjecture (§13quadraginta).

This module implements a purely diagnostic quantity, the **ΔNFR-Type
Signature** :math:`\\mathcal{S}_{\\Delta\\mathrm{NFR}}`, that
quantifies on canonical TNFR network evolutions whether the canonical
nodal gradient :math:`\\Delta\\mathrm{NFR} \\in \\mathbb{R}` admits an
*irreducible* tensor-rank lift (e.g. a per-node vector or rank-2
tensor over the constituent gradient channels ``phase``, ``EPI``,
``νf``), or whether the single scalar slot written by
:func:`tnfr.dynamics.dnfr.default_compute_delta_nfr` is structurally
sufficient.

Methodological scope (mandatory honesty)
----------------------------------------
This module is a *diagnostic only*.  It does **not** construct,
promote, or modify any canonical operator.  It does **not** advance
G4 = RH.  It does **not** by itself decide the T-ΔNFR Conjecture
(which requires the forcing-axiom reduction of §13quadraginta-prima
and the final verdict of §13quadraginta-secunda — both deferred to
B3b/B3c).

The diagnostic probes two orthogonal axes:

1. **Tensor storage axis** — the fraction of ``(node, step)`` samples
   at which the canonical per-node ΔNFR slot stores a non-scalar
   value (vector, tensor, mapping, or otherwise non-``float`` payload).
   Under the canonical implementation
   :func:`tnfr.dynamics.dnfr.default_compute_delta_nfr`, the slot is
   always a scalar by construction, so this fraction is structurally
   ``0`` — exactly mirroring ``w_frac = 0`` of the B2a φ-diagnostic
   and ``bepi_frac = 0`` of the B1a EPI-diagnostic.
2. **Rank-entropy axis** — Shannon entropy of the normalised
   singular-value distribution of the per-node gradient-component
   matrix :math:`M_i \\in \\mathbb{R}^{T \\times 3}` whose columns are
   the per-step mean-neighbour differences in the three canonical
   gradient channels :math:`(d\\theta, d\\mathrm{EPI}, d\\nu_f)`,
   averaged across nodes and normalised by :math:`\\log 3` (the
   maximum rank).  A multi-rank gradient stream is a *necessary*
   condition for the canonical dynamics to require a tensor-valued
   ΔNFR (a rank-1 scalar projection is fully equivalent to the
   tensor stream if the three channels collapse to a single rank).

A high :math:`\\mathcal{S}_{\\Delta\\mathrm{NFR}}` is a
*necessary-condition* check: it says only that canonical gradient
accumulation on a TNFR graph carries irreducible multi-channel
content that a rank-1 scalar reading necessarily compresses.  It does
**not** prove that the canonical type of ΔNFR is a non-trivial
tensor element.

A low :math:`\\mathcal{S}_{\\Delta\\mathrm{NFR}}` plus a zero tensor
storage fraction is the empirically expected outcome — structurally
consistent with the catalog row 1 typing
:math:`\\Delta\\mathrm{NFR} \\in \\mathbb{R}` and with the scalar
nodal-equation contract
:math:`(\\nu_f, \\Delta\\mathrm{NFR}) \\mapsto
\\partial\\mathrm{EPI}/\\partial t` enforced at
``src/tnfr/operators/nodal_equation.py:1-160``.

References
----------
- ``theory/TNFR_RIEMANN_RESEARCH_NOTES.md`` §13quadraginta
- ``theory/CATALOG_TYPE_HYGIENE_PROGRAMME.md`` §4 row B3
- ``src/tnfr/dynamics/dnfr.py:2387::default_compute_delta_nfr``
  (canonical scalar-writing implementation)
- ``src/tnfr/constants/aliases.py:9::ALIAS_DNFR`` (canonical
  per-node storage alias)
- ``src/tnfr/operators/nodal_equation.py:1-160`` (scalar contract)
"""

from __future__ import annotations

import math
from dataclasses import dataclass, field
from typing import Any

import numpy as np

__all__ = [
    "DnfrTypeSignatureCertificate",
    "compute_dnfr_type_signature",
]


def _shannon_entropy(probabilities: np.ndarray) -> float:
    """Shannon entropy in nats of a probability vector.

    Zero-probability entries are skipped (``0 · log 0 := 0``).
    """
    p = np.asarray(probabilities, dtype=float)
    p = p[p > 0.0]
    if p.size == 0:
        return 0.0
    return float(-np.sum(p * np.log(p)))


def _wrap_to_pi(angle: float) -> float:
    """Wrap ``angle`` to the canonical fundamental domain ``[-π, π]``.

    Mirrors :func:`tnfr.physics._helpers.wrap_angle` without importing
    it (the diagnostic must be runnable in isolation if needed).
    """
    return (float(angle) + math.pi) % (2.0 * math.pi) - math.pi


def _build_canonical_demo_graph(n_nodes: int, seed: int) -> Any:
    """Build a small canonical ring graph for the ΔNFR trajectory probe.

    Uses :func:`tnfr.sdk.TNFR.create` to obtain a TNFR network with
    canonical defaults and a fixed ring topology so the diagnostic is
    deterministic given the seed.  The initial phase / EPI / νf
    distributions are deterministic mild perturbations so canonical
    evolution starts away from a trivial symmetric fixed point.
    """
    from ..sdk import TNFR

    net = TNFR.create(int(n_nodes)).ring()
    G = net.G
    rng = np.random.default_rng(int(seed))
    for node in list(G.nodes()):
        G.nodes[node]["EPI"] = float(0.5 + 0.05 * (rng.random() - 0.5))
        G.nodes[node]["theta"] = _wrap_to_pi(
            float(2.0 * math.pi * (rng.random() - 0.5))
        )
        # νf must remain strictly positive; perturb mildly around the default.
        current_vf = float(G.nodes[node].get("nu_f", 1.0))
        G.nodes[node]["nu_f"] = max(0.05, current_vf + 0.05 * (rng.random() - 0.5))
    return G


def _read_node_scalars(G: Any, node: Any) -> tuple[float, float, float, Any]:
    """Read the canonical scalar triple ``(θ, EPI, νf)`` plus the raw ΔNFR slot.

    Reads use canonical accessors only.  The raw ΔNFR slot is returned
    unconverted so the tensor-storage axis can detect any non-scalar
    payload.
    """
    from ..physics._helpers import get_phase

    attrs = G.nodes[node]
    theta = _wrap_to_pi(get_phase(G, node))
    epi = float(attrs.get("EPI", 0.0))
    vf = float(attrs.get("nu_f", attrs.get("νf", 1.0)))
    raw_dnfr = attrs.get("dnfr", attrs.get("ΔNFR", 0.0))
    return theta, epi, vf, raw_dnfr


def _is_scalar_payload(value: Any) -> bool:
    """Return ``True`` iff ``value`` is a single real scalar.

    A scalar is: Python ``int``, Python ``float``, NumPy 0-d array, or
    NumPy scalar.  Anything iterable / sequence / mapping / object with
    ``len(...)`` > 1 is *non-scalar* and is counted toward the tensor
    storage fraction.
    """
    if isinstance(value, (int, float)):
        return True
    if isinstance(value, np.generic):
        return True
    if isinstance(value, np.ndarray):
        return value.ndim == 0
    return False


def _collect_neighbour_gradient_triples(G: Any, nodes: list[Any]) -> np.ndarray:
    """For each node, compute the mean-neighbour gradient triple.

    Returns a ``(n_nodes, 3)`` array whose row ``i`` is
    :math:`(\\overline{\\Delta\\theta_i},
    \\overline{\\Delta\\mathrm{EPI}_i},
    \\overline{\\Delta\\nu_{f,i}})` averaged over the neighbours of
    node ``i``.  Isolated nodes contribute a zero row.
    """
    n = len(nodes)
    triples = np.zeros((n, 3), dtype=float)
    if n == 0:
        return triples
    # Cache scalars for each node once per step.
    scalars: dict[Any, tuple[float, float, float]] = {}
    for node in nodes:
        theta, epi, vf, _ = _read_node_scalars(G, node)
        scalars[node] = (theta, epi, vf)
    for i, node in enumerate(nodes):
        neighbours = list(G.neighbors(node))
        if not neighbours:
            continue
        theta_i, epi_i, vf_i = scalars[node]
        d_theta = 0.0
        d_epi = 0.0
        d_vf = 0.0
        for nb in neighbours:
            if nb not in scalars:
                theta_nb, epi_nb, vf_nb, _ = _read_node_scalars(G, nb)
                scalars[nb] = (theta_nb, epi_nb, vf_nb)
            theta_nb, epi_nb, vf_nb = scalars[nb]
            d_theta += _wrap_to_pi(theta_i - theta_nb)
            d_epi += epi_i - epi_nb
            d_vf += vf_i - vf_nb
        k = float(len(neighbours))
        triples[i, 0] = d_theta / k
        triples[i, 1] = d_epi / k
        triples[i, 2] = d_vf / k
    return triples


def _per_node_rank_entropy(
    component_history: np.ndarray, *, eps: float = 1e-12
) -> tuple[np.ndarray, np.ndarray]:
    """Per-node Shannon entropy of normalised singular values.

    ``component_history`` has shape ``(n_nodes, n_steps, 3)``.  For each
    node, stack the per-step rows into a ``(n_steps, 3)`` matrix and
    compute its SVD; normalise the singular values to a probability
    vector and return the Shannon entropy (nats).  Also returns the
    raw singular-value matrix ``(n_nodes, 3)``.
    """
    n_nodes = component_history.shape[0]
    entropies = np.zeros(n_nodes, dtype=float)
    sv_matrix = np.zeros((n_nodes, 3), dtype=float)
    for i in range(n_nodes):
        M = component_history[i]  # shape (n_steps, 3)
        if M.shape[0] < 1:
            continue
        if not np.any(np.abs(M) > eps):
            sv_matrix[i] = np.zeros(3)
            continue
        # SVD on a (T, 3) matrix returns at most 3 singular values.
        try:
            sv = np.linalg.svd(M, compute_uv=False)
        except np.linalg.LinAlgError:
            continue
        if sv.size < 3:
            sv = np.pad(sv, (0, 3 - sv.size), constant_values=0.0)
        sv_matrix[i] = sv
        total = float(np.sum(sv))
        if total <= eps:
            continue
        p = sv / total
        entropies[i] = _shannon_entropy(p)
    return entropies, sv_matrix


def _evolve_and_collect(
    G: Any, nodes: list[Any], n_steps: int
) -> tuple[np.ndarray, int, int]:
    """Run ``n_steps`` canonical evolution steps and collect gradient triples.

    Returns
    -------
    component_history : np.ndarray of shape ``(n_nodes, n_steps, 3)``
        Per-node, per-step ``(d_theta, d_epi, d_vf)`` triples.
    n_scalar_samples : int
        Number of ``(node, step)`` samples in which the canonical ΔNFR
        slot stored a scalar payload.
    n_total_samples : int
        Total number of ``(node, step)`` samples inspected.
    """
    from ..constants import inject_defaults
    from ..dynamics import step

    inject_defaults(G)
    n = len(nodes)
    history = np.zeros((n, int(n_steps), 3), dtype=float)
    n_scalar_samples = 0
    n_total_samples = 0
    for t in range(int(n_steps)):
        step(G)
        # Inspect canonical ΔNFR slot for non-scalar payloads.
        for node in nodes:
            n_total_samples += 1
            raw = G.nodes[node].get("dnfr", G.nodes[node].get("ΔNFR", 0.0))
            if _is_scalar_payload(raw):
                n_scalar_samples += 1
        # Re-compute the per-node mean-neighbour gradient triple.
        history[:, t, :] = _collect_neighbour_gradient_triples(G, nodes)
    return history, n_scalar_samples, n_total_samples


@dataclass(frozen=True)
class DnfrTypeSignatureCertificate:
    """Result of the ΔNFR-Type Signature diagnostic on a canonical network.

    Attributes
    ----------
    signature : float
        :math:`\\mathcal{S}_{\\Delta\\mathrm{NFR}} \\in [0, 1]`.  ``0``
        means scalar-adequate (rank-1 collapse of the three gradient
        channels); ``1`` means maximum-rank-entropy (uniform mass on
        all three singular values).
    tensor_storage_fraction : float
        Fraction of ``(node, step)`` samples in which the canonical
        ΔNFR slot stored a *non-scalar* payload.  ``0.0`` is the
        empirically expected value under the canonical scalar contract
        of :func:`tnfr.dynamics.dnfr.default_compute_delta_nfr`; any
        non-zero value flags that canonical evolution writes a
        non-scalar that the scalar reader necessarily compresses.
    tensor_storage_count : int
        Absolute number of ``(node, step)`` samples whose ΔNFR slot
        held a non-scalar payload.
    n_nodes : int
        Number of nodes in the diagnostic graph.
    n_steps : int
        Number of evolution steps taken (gradient-triple history has
        ``n_steps`` rows per node).
    mean_rank_entropy_nats : float
        Mean Shannon entropy (across nodes) of the normalised
        singular-value distribution of the gradient-triple matrix,
        in nats.
    effective_rank : float
        :math:`R_{\\mathrm{eff}} = \\exp(H_{\\mathrm{rank}})` —
        effective tensor rank in :math:`[1, 3]`.  Scalar-adequate iff
        :math:`R_{\\mathrm{eff}} \\approx 1`.
    mean_singular_values : tuple[float, float, float]
        Mean across nodes of the three singular values of
        :math:`M_i` (largest first).
    verdict : str
        One of ``"SCALAR_DNFR_ADEQUATE"`` (signature <
        ``scalar_threshold`` AND zero tensor storage fraction),
        ``"TENSOR_LIFT_NECESSARY"`` (signature > ``tensor_threshold``
        OR non-zero tensor storage fraction), or ``"INDETERMINATE"``.
    diagnostics : dict
        Auxiliary fields (per-node entropies, per-node singular values,
        thresholds, seed, scalar/total sample counts, etc.).
    """

    signature: float
    tensor_storage_fraction: float
    tensor_storage_count: int
    n_nodes: int
    n_steps: int
    mean_rank_entropy_nats: float
    effective_rank: float
    mean_singular_values: tuple[float, float, float]
    verdict: str
    diagnostics: dict[str, Any] = field(default_factory=dict)

    def summary(self) -> str:
        sv = self.mean_singular_values
        lines = [
            "DeltaNFR-Type Signature certificate (diagnostic only — §13quadraginta.5)",
            f"  signature S_DNFR         : {self.signature:.6f}   (0 = scalar rank-1, 1 = uniform rank-3)",
            f"  tensor storage fraction  : {self.tensor_storage_fraction:.4f}"
            f"  ({self.tensor_storage_count}/{self.n_nodes * self.n_steps} samples)",
            f"  mean rank entropy        : {self.mean_rank_entropy_nats:.4f} nats"
            f" (max log 3 = {math.log(3.0):.4f})",
            f"  effective rank R_eff     : {self.effective_rank:.4f}   (in [1, 3])",
            f"  mean singular values     : (sigma1={sv[0]:.4f},"
            f" sigma2={sv[1]:.4f}, sigma3={sv[2]:.4f})",
            f"  graph: {self.n_nodes} nodes, {self.n_steps} evolution steps",
            f"  verdict                  : {self.verdict}",
            "  scope: necessary-condition diagnostic; does NOT advance G4 = RH",
        ]
        return "\n".join(lines)


def compute_dnfr_type_signature(
    *,
    n_nodes: int = 24,
    n_steps: int = 64,
    seed: int = 17,
    scalar_threshold: float = 0.15,
    tensor_threshold: float = 0.5,
) -> DnfrTypeSignatureCertificate:
    """Compute the ΔNFR-Type Signature on a canonical TNFR ring evolution.

    Parameters
    ----------
    n_nodes : int, default 24
        Size of the ring graph used as the canonical probe.
    n_steps : int, default 64
        Number of evolution steps after the initial state.  Per-node
        gradient-triple history has ``n_steps`` rows.
    seed : int, default 17
        Deterministic seed for the initial phase / EPI / νf
        perturbation.
    scalar_threshold : float, default 0.15
        Below this signature value AND with zero tensor storage
        fraction, the verdict is ``"SCALAR_DNFR_ADEQUATE"``.
    tensor_threshold : float, default 0.5
        Above this signature value OR with non-zero tensor storage
        fraction, the verdict is ``"TENSOR_LIFT_NECESSARY"``.

    Returns
    -------
    DnfrTypeSignatureCertificate
        Diagnostic certificate.

    Notes
    -----
    The diagnostic uses two orthogonal axes:

    - **Tensor storage axis**: per ``(node, step)`` sample, inspect
      the canonical ΔNFR slot
      (``G.nodes[node]["dnfr"]`` / ``ALIAS_DNFR``) for non-scalar
      payloads.  Under the canonical implementation
      :func:`tnfr.dynamics.dnfr.default_compute_delta_nfr`, every
      slot is a Python ``float``; the storage fraction is therefore
      structurally ``0`` by construction — exactly mirroring the
      :math:`w_{\\mathrm{frac}} = 0` outcome of the B2a φ-diagnostic
      and the :math:`\\mathrm{bepi\\_frac} = 0` outcome of the B1a
      EPI-diagnostic.
    - **Rank-entropy axis**: per node, build the gradient-triple
      matrix :math:`M_i \\in \\mathbb{R}^{n_{\\mathrm{steps}} \\times 3}`
      from the per-step mean-neighbour differences in the three
      canonical gradient channels :math:`(d\\theta, d\\mathrm{EPI},
      d\\nu_f)`.  Compute the SVD, normalise the three singular
      values to a probability vector, and report the Shannon entropy
      averaged across nodes, normalised by :math:`\\log 3`.

    This is a *purely diagnostic* computation on canonical TNFR data.
    It does not construct any new operator and does not modify the
    13-operator catalog.
    """
    if int(n_nodes) < 3:
        raise ValueError("n_nodes must be >= 3 for a meaningful ring graph")
    if int(n_steps) < 4:
        raise ValueError("n_steps must be >= 4 for a meaningful trajectory")

    G = _build_canonical_demo_graph(int(n_nodes), int(seed))
    nodes = list(G.nodes())
    component_history, n_scalar_samples, n_total_samples = _evolve_and_collect(
        G, nodes, int(n_steps)
    )
    actual_n_nodes = len(nodes)
    actual_n_steps = int(component_history.shape[1]) if actual_n_nodes > 0 else 0

    # Tensor storage axis (always 0 under canonical scalar contract).
    if n_total_samples > 0:
        n_tensor_samples = n_total_samples - n_scalar_samples
        tensor_fraction = float(n_tensor_samples) / float(n_total_samples)
    else:
        n_tensor_samples = 0
        tensor_fraction = 0.0

    # Rank-entropy axis.
    per_node_entropy, per_node_sv = _per_node_rank_entropy(component_history)
    mean_entropy = float(np.mean(per_node_entropy)) if actual_n_nodes > 0 else 0.0
    mean_sv = (
        (
            float(np.mean(per_node_sv[:, 0])),
            float(np.mean(per_node_sv[:, 1])),
            float(np.mean(per_node_sv[:, 2])),
        )
        if actual_n_nodes > 0
        else (0.0, 0.0, 0.0)
    )

    max_entropy = math.log(3.0)
    signature = mean_entropy / max_entropy if max_entropy > 0.0 else 0.0
    signature = float(min(max(signature, 0.0), 1.0))
    effective_rank = float(math.exp(mean_entropy)) if mean_entropy > 0.0 else 1.0

    if signature < float(scalar_threshold) and tensor_fraction == 0.0:
        verdict = "SCALAR_DNFR_ADEQUATE"
    elif signature > float(tensor_threshold) or tensor_fraction > 0.0:
        verdict = "TENSOR_LIFT_NECESSARY"
    else:
        verdict = "INDETERMINATE"

    diagnostics: dict[str, Any] = {
        "per_node_rank_entropy_nats": per_node_entropy.tolist(),
        "per_node_singular_values": per_node_sv.tolist(),
        "scalar_threshold": float(scalar_threshold),
        "tensor_threshold": float(tensor_threshold),
        "max_entropy_nats": float(max_entropy),
        "n_scalar_samples": int(n_scalar_samples),
        "n_tensor_samples": int(n_tensor_samples),
        "n_total_samples": int(n_total_samples),
        "seed": int(seed),
    }

    return DnfrTypeSignatureCertificate(
        signature=signature,
        tensor_storage_fraction=float(tensor_fraction),
        tensor_storage_count=int(n_tensor_samples),
        n_nodes=int(actual_n_nodes),
        n_steps=int(actual_n_steps),
        mean_rank_entropy_nats=float(mean_entropy),
        effective_rank=float(effective_rank),
        mean_singular_values=mean_sv,
        verdict=verdict,
        diagnostics=diagnostics,
    )