Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Constraint Network Cryptography B: Sieve-Time Tree Spectral Geometry of Shor's Algorithm and Prime Rigidity Kernel Reading

changzheng zhou, ZIQING zhou

Published Sep 3, 2026• 0 citations
Publisher

Abstract

Under the framework of constraint network geometry, this paper reconstructsthe core mechanism of Shor’s quantum factoring algorithm as a spectral diagnosticprocess. By establishing a projective correspondence between the power orbits inthe multiplicative group modulo N and the causal hierarchy structure of sievetime trees, we argue that the period r is geometrically equivalent to the length ofa closed causal chain in the projection fibre, and that this length is constrainedby the factor structure of Euler’s totient function φ(N). The quantum Fouriertransform is reformulated as a spectral condensation operator that maps from thelocal constraint layer in the time domain to the global periodic layer in the frequencydomain; its mathematical backbone is furnished by Pontryagin duality and sheaftheoretic section spaces. The two-register entangled state is mapped to a twonode coupling system in an intertextual network, where the information potentialdifference is transmitted via a correlation matrix and its generalised inverse.This paper attempts to distinguish standard number-theoretic facts from crossdomain heuristic mappings. The boundary of this distinction is given in Chapter8; known ambiguous zones exist (e.g., the q|r ideal condition in Chapter 5, the G2parameter correspondence in Chapter 6). The three layers are connected throughinterlayer composition and conditional reduction, and we clearly distinguish provenfacts, conditional heuristic mappings, and conjectures awaiting formalisation.Keywords: Shor’s algorithm; sieve-time tree; multiplicative group modulo N;quantum Fourier transform; constraint network; spectral condensation; prime rigidity kernel; intertextual coupling

DOI
10.5281/zenodo.22269740

Related papers

Constraint Network Cryptography A: Constraint Network Phase Transition of Quantum Computational Advantage- From Shor's Algorithm to Information Barriers

changzheng zhou, ZIQING zhou

This paper reinterprets the collapse of classical public-key cryptography byquantum computation as a computational complexity phase transition in constraintnetworks. Within the ontology of constraint networks, the security of RSA and elliptic curve cryptography depends on the exponential information barriers formedby multiplicative cohesion or scalar multiplication cohesion in classical graph geometry, whereas Shor’s algorithm lifts the state space to spectral geometry in Hilbertspace via the quantum Fourier transform, directly reading the hidden period, andthus reduces the information barrier of the splitting operator from sub-exponentialor exponential depth to polynomial order. Grover’s algorithm is interpreted as acompression of the traversal entropy by the quantum diffusion operator, which onlytakes the square root of the barrier depth for symmetric ciphers without alteringtheir exponential nature. For post-quantum cryptography, the hardness of latticecryptography is attributed to the rigidity of high-dimensional lattices, whose localdensity extrema cannot be penetrated by Fourier-type spectral operators; the security of hash-based signatures depends on the traversal entropy compression limitof collision search. The paper further provides a categorical formulation of quantum immunity criteria using the constraint-network category and the approximateadjoint structure of lifting and reduction, and explicitly demarcates the honestboundary and cognitive debt. The entire argument follows the axiom of information conservation, emphasizing that quantum advantage originates from geometricphase transitions rather than information generation.

•Sep 3, 2026•0 citations

Constraint Network Cryptography C: Constraint Network Rigidity of Post-Quantum Cryptography — Why Lattice Cryptography Is Quantum-Resistant

changzheng zhou, ZIQING zhou

Under the constraint network phase transition framework, the computationalhardness underlying post-quantum cryptographic standards manifests three fundamental types of rigidity: spectrum-hiding, geometric torsion, and one-way condensation. The vulnerability of integer factorisation and discrete logarithms stems fromthe spectral manifestness of their rigidity kernels — the hidden subgroup structurecan be directly extracted in the frequency domain by the quantum Fourier transform. The quantum resistance of the shortest vector problem, the closest vectorproblem, and the learning with errors problem in lattice cryptography is rootedin the incompressibility of local geometric extrema in a high-dimensional continuous metric space: their rigidity kernels are neither encodable by characters offinite abelian groups, nor can their geometric entropy, which grows linearly withdimension, be altered by diffusive quantum operators beyond reducing exponential constants without changing the exponential type. Hash-based signatures relyon the information potential well of one-way condensation operators and remainexponentially secure even in the quantum random oracle model. This paper provides a quantum immunity criterion at the operator-algebra level and extends itto a generalised criterion covering both spectral-diagnostic and diffusive quantumoperator families, and retrospectively verifies the sufficiency of the parameter designs of Kyber, Dilithium, and SPHINCS+. The entire argument carries explicitcondition-depth annotations, and the entropy budget for cross-domain mappingsis constrained by the axiom of information conservation, thereby establishing thegeometric foundation of post-quantum cryptography within honest boundaries.

•Sep 3, 2026•0 citations

Constraint Network Cryptography G; The Honest Boundary of Constraint Network Mappings — From Cross-Domain Analogies to Computable Formal Audits

changzheng zhou, ZIQING zhou

Constraint network theory takes information conservation and computabilityas its underlying axioms, reconstructing quantum computational advantage as ageometric phase transition and cryptographic hardness as a topology of information barriers. This paper conducts a systematic audit of the honest boundaryof constraint network mappings, identifying three meta-patterns of cross-domainmapping failure: existence-computability confusion, category-transition omission,and parameter-condition masking. Based on this diagnostic framework, we carryout itemised audits of three core formal gaps: the correspondence between thequantum Fourier transform and sheaf cohomology faces a fundamental algebraicincompatibility between unitarity and nilpotence; the inference chain from structural uniqueness to computational hardness in theorem-rigidity cryptography lacksa reduction and the entropy of a single instance is insufficient to support modernsecurity standards; the claimed immunity of non-associative algebras to Grover’salgorithm confuses structural immunity with parametric immunity. The audit results revise the quantum immunity spectrum into a precise combination of twoindependent dimensions: Shor immunity and Grover immunity, and provide ameta-methodological foundation for the transition of constraint network theoryfrom programmatic construction to verifiable science.

•Sep 5, 2026•0 citations

Constraint Network Cryptography B2: Dissipative Realisation of Spectral-Layer Readout—Spectral Readout Principle and Relocation of the Computational Phase-Transition Boundary

changzheng zhou, ZIQING zhou

Period finding is the arithmetic core of integer factorisation. Given a base acoprime to N, the goal is to find the order r of the element a in the multiplicativegroup Z∗N. Quantum computation uses the quantum Fourier transform to accomplish frequency-domain concentration of the periodic signal in a single step, whereasclassical randomised algorithms can only sample point by point in the time domain.This article establishes and systematically expounds a unified spectral readoutprinciple: on the Cayley graph of a cyclic subgroup ⟨b⟩, the identity observationof any ergodic translation-invariant dynamics is a functional of its dual characterspectral data, and the period r is encoded in this functional as a discrete invariant;unitary readout (Fourier support set) and dissipative readout (heat-kernel poweraverage) are two extreme instances of this principle, and the readout complexityis controlled solely by the spectral gap of the transition operator. This articlegives a sieve criterion for lower bounds on the spectral gap (the sieve-hole condition), proves that the exponential range of dyadic generating sets is incompressiblewithin an additive constant, and constructs the first provably fast-mixing example outside the dyadic case (a triple-generator set, with asymptotic iteration countabout 42% of the dyadic one). The core theorem determines the precise asymptotics of the universal spectral-gap constant: for Mersenne moduli r = 2m −1, theworst eigenvalue asymptotically attains the extremum with an explicit constantc0 = j≥1(1 −cos(π/2j−1)) ≈ 3.3946; Fermat-type moduli r = 2m + 1 approachthe same constant from below, forming a two-sided sandwich. This leads to theuniversal constant conjecture: if it holds, the constant in the known spectral-gaplower bound can be precisely improved by about 3.39 times. Furthermore, the variable of the “classical/quantum” phase-transition boundary is relocated to parallelaccess capability Π, a rigorous computational-model semantics of Π (Bulk-RAM)is given, two foundational theorems are proved, and the sublinear simulation lowerbound problem for heat-kernel readout is proposed as the first concrete instance ofthe Π-non-simulability barrier.

•Sep 15, 2026•0 citations

Constraint Network Cryptography F: Constraint Network Phase Transition of Non-Associative Algebras — Zero Divisors as Information Annihilation Operators

changzheng zhou, ZIQING zhou

Within the framework of constraint network phase transition, this paper incorporates the zero-divisor structure of non-associative algebras into the quantum immunity spectrum and proposes the information annihilation operator as the fourthcore topological operator. Through a rigorous analysis of the sixteen-dimensionalCayley–Dickson algebra over a finite field, we establish its zero-divisor subspaceas an eight-dimensional maximal isotropic subspace, and on this basis construct aleft-multiplication product and the information annihilation operator. Quantumimmunity is distinguished into a structural layer and a parametric layer: underthe strengthened assumption of Proposition 9.2 (requiring the embedding map to preserve the additive group structure of Zk 0), the hiddensubgroup framework of Shor’s algorithm cannot be embedded directly;in the general case, Shor immunity depends on the injectivity of theleft-multiplication product L(m;·) or the aperiodicity of its value distribution, and this dependence constitutes a cognitive debt of conditionaldepth 1. Grover’s algorithm only provides a square-root speedup, and its immunity depends on the sequence length parameter, guaranteed by k ≥ λ/(8log2p).The spectral mapping of weight matrices in p-block representation theory provides aheuristic deterministic anchor for key generation, but remains conjectural. Finally,we provide a discrimination algorithm for the four classes of quantum immunityspectra, locating the non-associative annihilation type at the pole of dynamicalirreversibility. The full list of cognitive debts and open problems points the wayfor subsequent rigorous work.

•Sep 4, 2026•0 citations

Holographic Constraint Network Spectral Flow Program C: Spectral Entanglement Entropy and Holographic Area Law — The Ryu-Takayanagi Formula within the Constraint Network Framework

changzheng zhou, ZIQING zhou

This paper encodes the subsystem entanglement structure of boundary conformal field theory into a weighted graph and defines the spectral entanglemententropy via the spectral theory of the Dirichlet-to-Neumann map. Within the constraint network framework, a continuum limit and a mechanism for dimensionalemergence are introduced to establish a rigorous transition from discrete spectrato continuous holographic geometry. It is proved that, in the rigid limit, the spectral entanglement entropy strictly decomposes into the sum of a geometric areaterm and a topological correction term: the area term arises from a strictly positive lower bound on the spectral gap of the Dirichlet-to-Neumann map and ispinned by the curvature of the extremal surface; the topological correction termoriginates from the nullity of the coarse-grained rigid kernel, whose value is proportional to the absolute value of the Euler characteristic. It is further proved thatthe stability of a quantum extremal surface is equivalent to the algebraic connectivity of the quotient graph being strictly positive, a condition characterized bythe Fiedler value. This yields three testable predictions, encompassing a universal difference in the topological correction, multi-surface transitions for non-convexregions, and the finite-temperature spectral-gap scaling, and reveals a deep isomorphism with holographic quantum error correction. This framework unifies thegeometric origin, quantum corrections, and the recoverability of error correction ofthe Ryu-Takayanagi formula within a single spectral flow structure.

•Jul 9, 2026•0 citations
Under the framework of constraint network geometry, this paper reconstructsthe core mechanism of Shor’s quantum factoring algorithm as a spectral diagnosticprocess. By establishing a projective correspondence between the power orbits inthe multiplicative group modulo N and the causal hierarchy structure of sievetime trees, we argue that the period r is geometrically equivalent to the length ofa closed causal chain in the projection fibre, and that this length is constrainedby the factor structure of Euler’s totient function φ(N). The quantum Fouriertransform is reformulated as a spectral condensation operator that maps from thelocal constraint layer in the time domain to the global periodic layer in the frequencydomain; its mathematical backbone is furnished by Pontryagin duality and sheaftheoretic section spaces. The two-register entangled state is mapped to a twonode coupling system in an intertextual network, where the information potentialdifference is transmitted via a correlation matrix and its generalised inverse.This paper attempts to distinguish standard number-theoretic facts from crossdomain heuristic mappings. The boundary of this distinction is given in Chapter8; known ambiguous zones exist (e.g., the q|r ideal condition in Chapter 5, the G2parameter correspondence in Chapter 6). The three layers are connected throughinterlayer composition and conditional reduction, and we clearly distinguish provenfacts, conditional heuristic mappings, and conjectures awaiting formalisation.Keywords: Shor’s algorithm; sieve-time tree; multiplicative group modulo N;quantum Fourier transform; constraint network; spectral condensation; prime rigidity kernel; intertextual coupling
This paper reinterprets the collapse of classical public-key cryptography byquantum computation as a computational complexity phase transition in constraintnetworks. Within the ontology of constraint networks, the security of RSA and elliptic curve cryptography depends on the exponential information barriers formedby multiplicative cohesion or scalar multiplication cohesion in classical graph geometry, whereas Shor’s algorithm lifts the state space to spectral geometry in Hilbertspace via the quantum Fourier transform, directly reading the hidden period, andthus reduces the information barrier of the splitting operator from sub-exponentialor exponential depth to polynomial order. Grover’s algorithm is interpreted as acompression of the traversal entropy by the quantum diffusion operator, which onlytakes the square root of the barrier depth for symmetric ciphers without alteringtheir exponential nature. For post-quantum cryptography, the hardness of latticecryptography is attributed to the rigidity of high-dimensional lattices, whose localdensity extrema cannot be penetrated by Fourier-type spectral operators; the security of hash-based signatures depends on the traversal entropy compression limitof collision search. The paper further provides a categorical formulation of quantum immunity criteria using the constraint-network category and the approximateadjoint structure of lifting and reduction, and explicitly demarcates the honestboundary and cognitive debt. The entire argument follows the axiom of information conservation, emphasizing that quantum advantage originates from geometricphase transitions rather than information generation.
Under the constraint network phase transition framework, the computationalhardness underlying post-quantum cryptographic standards manifests three fundamental types of rigidity: spectrum-hiding, geometric torsion, and one-way condensation. The vulnerability of integer factorisation and discrete logarithms stems fromthe spectral manifestness of their rigidity kernels — the hidden subgroup structurecan be directly extracted in the frequency domain by the quantum Fourier transform. The quantum resistance of the shortest vector problem, the closest vectorproblem, and the learning with errors problem in lattice cryptography is rootedin the incompressibility of local geometric extrema in a high-dimensional continuous metric space: their rigidity kernels are neither encodable by characters offinite abelian groups, nor can their geometric entropy, which grows linearly withdimension, be altered by diffusive quantum operators beyond reducing exponential constants without changing the exponential type. Hash-based signatures relyon the information potential well of one-way condensation operators and remainexponentially secure even in the quantum random oracle model. This paper provides a quantum immunity criterion at the operator-algebra level and extends itto a generalised criterion covering both spectral-diagnostic and diffusive quantumoperator families, and retrospectively verifies the sufficiency of the parameter designs of Kyber, Dilithium, and SPHINCS+. The entire argument carries explicitcondition-depth annotations, and the entropy budget for cross-domain mappingsis constrained by the axiom of information conservation, thereby establishing thegeometric foundation of post-quantum cryptography within honest boundaries.
Constraint network theory takes information conservation and computabilityas its underlying axioms, reconstructing quantum computational advantage as ageometric phase transition and cryptographic hardness as a topology of information barriers. This paper conducts a systematic audit of the honest boundaryof constraint network mappings, identifying three meta-patterns of cross-domainmapping failure: existence-computability confusion, category-transition omission,and parameter-condition masking. Based on this diagnostic framework, we carryout itemised audits of three core formal gaps: the correspondence between thequantum Fourier transform and sheaf cohomology faces a fundamental algebraicincompatibility between unitarity and nilpotence; the inference chain from structural uniqueness to computational hardness in theorem-rigidity cryptography lacksa reduction and the entropy of a single instance is insufficient to support modernsecurity standards; the claimed immunity of non-associative algebras to Grover’salgorithm confuses structural immunity with parametric immunity. The audit results revise the quantum immunity spectrum into a precise combination of twoindependent dimensions: Shor immunity and Grover immunity, and provide ameta-methodological foundation for the transition of constraint network theoryfrom programmatic construction to verifiable science.
Period finding is the arithmetic core of integer factorisation. Given a base acoprime to N, the goal is to find the order r of the element a in the multiplicativegroup Z∗N. Quantum computation uses the quantum Fourier transform to accomplish frequency-domain concentration of the periodic signal in a single step, whereasclassical randomised algorithms can only sample point by point in the time domain.This article establishes and systematically expounds a unified spectral readoutprinciple: on the Cayley graph of a cyclic subgroup ⟨b⟩, the identity observationof any ergodic translation-invariant dynamics is a functional of its dual characterspectral data, and the period r is encoded in this functional as a discrete invariant;unitary readout (Fourier support set) and dissipative readout (heat-kernel poweraverage) are two extreme instances of this principle, and the readout complexityis controlled solely by the spectral gap of the transition operator. This articlegives a sieve criterion for lower bounds on the spectral gap (the sieve-hole condition), proves that the exponential range of dyadic generating sets is incompressiblewithin an additive constant, and constructs the first provably fast-mixing example outside the dyadic case (a triple-generator set, with asymptotic iteration countabout 42% of the dyadic one). The core theorem determines the precise asymptotics of the universal spectral-gap constant: for Mersenne moduli r = 2m −1, theworst eigenvalue asymptotically attains the extremum with an explicit constantc0 = j≥1(1 −cos(π/2j−1)) ≈ 3.3946; Fermat-type moduli r = 2m + 1 approachthe same constant from below, forming a two-sided sandwich. This leads to theuniversal constant conjecture: if it holds, the constant in the known spectral-gaplower bound can be precisely improved by about 3.39 times. Furthermore, the variable of the “classical/quantum” phase-transition boundary is relocated to parallelaccess capability Π, a rigorous computational-model semantics of Π (Bulk-RAM)is given, two foundational theorems are proved, and the sublinear simulation lowerbound problem for heat-kernel readout is proposed as the first concrete instance ofthe Π-non-simulability barrier.
Within the framework of constraint network phase transition, this paper incorporates the zero-divisor structure of non-associative algebras into the quantum immunity spectrum and proposes the information annihilation operator as the fourthcore topological operator. Through a rigorous analysis of the sixteen-dimensionalCayley–Dickson algebra over a finite field, we establish its zero-divisor subspaceas an eight-dimensional maximal isotropic subspace, and on this basis construct aleft-multiplication product and the information annihilation operator. Quantumimmunity is distinguished into a structural layer and a parametric layer: underthe strengthened assumption of Proposition 9.2 (requiring the embedding map to preserve the additive group structure of Zk 0), the hiddensubgroup framework of Shor’s algorithm cannot be embedded directly;in the general case, Shor immunity depends on the injectivity of theleft-multiplication product L(m;·) or the aperiodicity of its value distribution, and this dependence constitutes a cognitive debt of conditionaldepth 1. Grover’s algorithm only provides a square-root speedup, and its immunity depends on the sequence length parameter, guaranteed by k ≥ λ/(8log2p).The spectral mapping of weight matrices in p-block representation theory provides aheuristic deterministic anchor for key generation, but remains conjectural. Finally,we provide a discrimination algorithm for the four classes of quantum immunityspectra, locating the non-associative annihilation type at the pole of dynamicalirreversibility. The full list of cognitive debts and open problems points the wayfor subsequent rigorous work.
This paper encodes the subsystem entanglement structure of boundary conformal field theory into a weighted graph and defines the spectral entanglemententropy via the spectral theory of the Dirichlet-to-Neumann map. Within the constraint network framework, a continuum limit and a mechanism for dimensionalemergence are introduced to establish a rigorous transition from discrete spectrato continuous holographic geometry. It is proved that, in the rigid limit, the spectral entanglement entropy strictly decomposes into the sum of a geometric areaterm and a topological correction term: the area term arises from a strictly positive lower bound on the spectral gap of the Dirichlet-to-Neumann map and ispinned by the curvature of the extremal surface; the topological correction termoriginates from the nullity of the coarse-grained rigid kernel, whose value is proportional to the absolute value of the Euler characteristic. It is further proved thatthe stability of a quantum extremal surface is equivalent to the algebraic connectivity of the quotient graph being strictly positive, a condition characterized bythe Fiedler value. This yields three testable predictions, encompassing a universal difference in the topological correction, multi-surface transitions for non-convexregions, and the finite-temperature spectral-gap scaling, and reveals a deep isomorphism with holographic quantum error correction. This framework unifies thegeometric origin, quantum corrections, and the recoverability of error correction ofthe Ryu-Takayanagi formula within a single spectral flow structure.