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

The largest noncontextual subset of the 600-cell's seventy-five bases has size sixty-five

Brent W. Jonah

Published Jul 7, 2026• 1 citation
Publisher

Abstract

The 60 rays and 75 orthonormal bases derived from the vertices of the 600-cell form the well-known Kochen-Specker system of Waegell and Aravind. This note determines exactly the largest number of the 75 bases that a single {0,1} ray assignment can satisfy (exactly one ray valued 1 per satisfied basis): the answer is 65, so at least ten bases must fail. This improves the lower bound of nine failures obtained by Waegell, Aravind, Megill and Pavicic (2011) from parity-proof coverings, answers the question they left open, and settles the corresponding open problem restated by Aravind, Burton, Nunez Ponasso and Richter (2026) for the 600-cell. The lower bound is an explicit 17-ray assignment verified in exact Q(sqrt5) arithmetic; the upper bound is certified both by two independent integer-programming solvers and by an explicit family of 150 parity proofs (ten orbits under the triacontagonal C15 symmetry) admitting no nine-element hitting set. The tight noncontextuality inequality is 65 versus the quantum value 75 (ratio 15/11 in the +/-1 normalization). A transfer proposition brackets the analogous 120-cell maximum in [600, 625]. Verification: run python3 verify.py with proofs150.txt in the same directory. It rebuilds the system from the two stated generators and re-verifies the construction anchors, the certificate count of 65, the ten failing bases, and the validity of all 150 parity proofs in seconds, without any solver.

DOI
10.5281/zenodo.21249804

Related papers

The largest noncontextual subset of the 120-cell's six hundred seventy-five bases has size six hundred

Brent W. Jonah

The 300 rays and 675 orthonormal bases of the 120-cell form the Kochen-Specker system of Waegell and Aravind. This note determines exactly the largest number of the 675 bases satisfiable by a single {0,1} ray assignment (exactly one ray valued 1 per satisfied basis): the answer is 600, so at least seventy-five bases must fail. The proof avoids the intractable full-system optimization entirely: left and right multiplication by the binary icosahedral group partition the rays into five left and five right blocks, each an isometric copy of the 600-cell system; a single 60-ray integer program, proven optimal and transported to all ten blocks by the icosian symmetry, gives the per-block frontier 2*(block-only satisfied) + (doubly satisfied) <= 120; summing over each partition double-counts the doubly embedded bases and collapses the bound to 600. An explicit assignment attains 600. This improves the transfer bracket [600, 625] of DOI 10.5281/zenodo.21249805 to an exact value and closes the third member of the open family of Aravind, Burton, Nunez Ponasso and Richter. Whether parity proofs alone force the bound (as they provably do for the 600-cell and the two-qubit system) is posed as the sharpened open question: the argument gives hitting number h <= 75, and h = 75 remains to be decided. Verification: run python3 verify_max600.py with rays300.txt in the same directory. Structural checks are instant; the two 60-ray integer programs finish in minutes; no full-system optimization is used anywhere.

•Jul 9, 2026•1 citation

The largest noncontextual subset of the two-qubit 60-105 system has size ninety-three

Brent W. Jonah

The 60 complex rays and 105 orthonormal bases arising from the two-qubit Pauli group form the Kochen-Specker system of Waegell and Aravind (2011), recently named by Aravind, Burton, Nunez Ponasso and Richter (2026) as a natural target for symmetry-based analysis. This note determines exactly the largest number of the 105 bases satisfiable by a single {0,1} ray assignment: the answer is 93, so at least twelve bases must fail. The optimum has clean structure: an attaining assignment selects exactly one state from each of the fifteen maximal abelian subgroups of the Pauli group, so all fifteen stabilizer bases are satisfied and all twelve failures are hybrid bases. The bound is certified by two independent integer-programming solvers (CBC proven optimum; HiGHS optimality and infeasibility of 94), and the attaining assignment is re-verified in exact Gaussian-integer arithmetic. The tight inequality is 93 versus the quantum value 105 (ratio 35/27 in the +/-1 normalization). This is the exact two-qubit analog of the value 65 of 75 determined by the author for the 600-cell system. Verification: run python3 verify2q.py with rays60c.txt in the same directory; it rebuilds the system from the fixed data and re-verifies the anchors (60 rays, 105 bases, seven per ray), the certificate count of 93, the transversal property, and the twelve failing bases in seconds, without any solver.

•Jul 7, 2026•1 citation

The 120-cell Kochen-Specker system is not rigid

Brent W. Jonah

Aravind, Burton, Nunez Ponasso and Richter (2026) proved that the 60-ray Kochen-Specker system of the 600-cell is not rigid and conjectured that the 300-ray/675-basis system of the 120-cell is rigid. This note shows it is not. The golden-ring lift phi from Z[alpha]^4 to Z^8 underlying their 600-cell construction preserves orthogonality for arbitrary golden-ring vectors, because the Z^8 inner product of two lifts equals the rational part of their R^4 inner product. Applied to the 300 rays of the 120-cell, the lift is an 8-dimensional rank-one realization satisfying all 4050 orthogonality relations while acquiring 7200 additional ones (exact integer census), so no unitary can map it into the original rays. An explicit integer witness pair is given, and the same computation reproduces the known 600-cell counts (450 orthogonal pairs, 360 extra). The rigidity of Gosset's polytope 4_21, and dimension-preserving rigidity of the 120-cell in R^4, remain open. Verification: run python3 verify_rigidity.py with rays300.txt in the same directory; it re-verifies the identity, the full census (4050 and 7200), and the witness in seconds. The bonus tool solve120.py is a self-contained long-run decider for the still-open exact 120-cell noncontextuality maximum (usage in its header).

•Jul 7, 2026•0 citations

The maximum exactly-one satisfaction of the E8 Kochen–Specker system is 1680

Brent W. Jonah

In the Kochen–Specker system of the E8 root system (120 rays, 2025 orthonormal bases), the largest number of bases containing exactly one selected ray is 1680, so every selection fails at least 345 bases. Every maximizer selects 14 rays whose orthogonality graph is seven disjoint edges; there are exactly 1080 maximizers, one for each antipodal pair of norm-4 vectors z of the E8 lattice (the rays r with |⟨r,z⟩| = 2). The proof combines a symmetry-reduced degree-4 Boolean moment relaxation with exact rational dual certificates, a certificate excluding induced three-vertex paths at the optimum, and a classification in the mod-2 quadratic space of E8. The upper bound, the classification, the certificates and two checking programs were produced with a GPT-based AI assistant in one session; these two programs are not independent review. An AI referee then checked that proof with its own code and reproduced every bound exactly. The certificate data are committed by SHA-256. Status: computer-assisted; exact rational certificates; AI-refereed (same model family as the coordinating assistant); not formally verified; not peer reviewed.

•Oct 21, 2026•0 citations

Triacontagonal proofs of the Bell–Kochen–Specker theorem

P. K. Aravind, Justin Y. J. Burton, Guillermo Nuñez Ponasso +1 more

Abstract Coxeter pointed out that a number of polytopes can be projected orthogonally into two dimensions in such a way that their vertices lie on a number of concentric regular triacontagons (or 30-gons). Among them are the 600-cell and 120-cell in four dimensions and Gosset’s polytope 4 21 in eight dimensions. We show how these projections can be modified into Kochen–Specker diagrams from which parity proofs of the Bell–Kochen–Specker theorem are easily extracted. Our construction trivially yields parity proofs of fifteen bases for all three polytopes and also allows many other proofs of the same type to be constructed for two of them. The defining feature of these proofs is that they have a fifteen-fold symmetry about the center of the Kochen–Specker diagram and thus involve both rays and bases that are multiples of fifteen. Any proof of this type can be written as a word made up of an odd number of distinct letters, each representing an orbit of fifteen bases. Knowing the word representing a proof makes it possible to infer all its characteristics without first having to recover its bases. A comparison is made with earlier approaches that have been used to obtain parity proofs in these polytopes, and some directions in which this work can be extended are discussed.

arXiv:2510.01063•Journal of Physics A Mathematical and Theoretical•Mar 23, 2026•0 citations

Parity proofs of the Kochen–Specker theorem based on the Lie algebra E8

Mordecai Waegell, P K Aravind

The 240 root vectors of the Lie algebra E8 lead to a system of 120 rays in a real eight-dimensional Hilbert space that contains a large number of parity proofs of the Kochen–Specker (KS) theorem. After introducing the rays in a triacontagonal representation due to Coxeter, we present their KS diagram in the form of a 'basis table' showing all 2025 bases (i.e., sets of eight mutually orthogonal rays) formed by the rays. Only a few of the bases are actually listed, but simple rules are given, based on the symmetries of E8, for obtaining all the other bases from the ones shown. The basis table is an object of great interest because all the parity proofs of E8 can be exhibited as subsets of it. We show how the triacontagonal representation of E8 facilitates the identification of substructures that are more easily searched for their parity proofs. We have found hundreds of different types of parity proofs, ranging from 9 bases (or contexts) at the low end to 35 bases at the high end, and involving projectors of various ranks and multiplicities. After giving an overview of the proofs we found, we present a few concrete examples of the proofs that illustrate both their generic features as well as some of their more unusual properties. In particular, we present a proof involving 34 rays and 9 bases that appears to provide the most compact proof of the KS theorem found to date in eight-dimensions.

arXiv:1502.04350•Journal of Physics A Mathematical and Theoretical•May 14, 2015•21 citations
The 60 rays and 75 orthonormal bases derived from the vertices of the 600-cell form the well-known Kochen-Specker system of Waegell and Aravind. This note determines exactly the largest number of the 75 bases that a single {0,1} ray assignment can satisfy (exactly one ray valued 1 per satisfied basis): the answer is 65, so at least ten bases must fail. This improves the lower bound of nine failures obtained by Waegell, Aravind, Megill and Pavicic (2011) from parity-proof coverings, answers the question they left open, and settles the corresponding open problem restated by Aravind, Burton, Nunez Ponasso and Richter (2026) for the 600-cell. The lower bound is an explicit 17-ray assignment verified in exact Q(sqrt5) arithmetic; the upper bound is certified both by two independent integer-programming solvers and by an explicit family of 150 parity proofs (ten orbits under the triacontagonal C15 symmetry) admitting no nine-element hitting set. The tight noncontextuality inequality is 65 versus the quantum value 75 (ratio 15/11 in the +/-1 normalization). A transfer proposition brackets the analogous 120-cell maximum in [600, 625]. Verification: run python3 verify.py with proofs150.txt in the same directory. It rebuilds the system from the two stated generators and re-verifies the construction anchors, the certificate count of 65, the ten failing bases, and the validity of all 150 parity proofs in seconds, without any solver.
The 300 rays and 675 orthonormal bases of the 120-cell form the Kochen-Specker system of Waegell and Aravind. This note determines exactly the largest number of the 675 bases satisfiable by a single {0,1} ray assignment (exactly one ray valued 1 per satisfied basis): the answer is 600, so at least seventy-five bases must fail. The proof avoids the intractable full-system optimization entirely: left and right multiplication by the binary icosahedral group partition the rays into five left and five right blocks, each an isometric copy of the 600-cell system; a single 60-ray integer program, proven optimal and transported to all ten blocks by the icosian symmetry, gives the per-block frontier 2*(block-only satisfied) + (doubly satisfied) <= 120; summing over each partition double-counts the doubly embedded bases and collapses the bound to 600. An explicit assignment attains 600. This improves the transfer bracket [600, 625] of DOI 10.5281/zenodo.21249805 to an exact value and closes the third member of the open family of Aravind, Burton, Nunez Ponasso and Richter. Whether parity proofs alone force the bound (as they provably do for the 600-cell and the two-qubit system) is posed as the sharpened open question: the argument gives hitting number h <= 75, and h = 75 remains to be decided. Verification: run python3 verify_max600.py with rays300.txt in the same directory. Structural checks are instant; the two 60-ray integer programs finish in minutes; no full-system optimization is used anywhere.
The 60 complex rays and 105 orthonormal bases arising from the two-qubit Pauli group form the Kochen-Specker system of Waegell and Aravind (2011), recently named by Aravind, Burton, Nunez Ponasso and Richter (2026) as a natural target for symmetry-based analysis. This note determines exactly the largest number of the 105 bases satisfiable by a single {0,1} ray assignment: the answer is 93, so at least twelve bases must fail. The optimum has clean structure: an attaining assignment selects exactly one state from each of the fifteen maximal abelian subgroups of the Pauli group, so all fifteen stabilizer bases are satisfied and all twelve failures are hybrid bases. The bound is certified by two independent integer-programming solvers (CBC proven optimum; HiGHS optimality and infeasibility of 94), and the attaining assignment is re-verified in exact Gaussian-integer arithmetic. The tight inequality is 93 versus the quantum value 105 (ratio 35/27 in the +/-1 normalization). This is the exact two-qubit analog of the value 65 of 75 determined by the author for the 600-cell system. Verification: run python3 verify2q.py with rays60c.txt in the same directory; it rebuilds the system from the fixed data and re-verifies the anchors (60 rays, 105 bases, seven per ray), the certificate count of 93, the transversal property, and the twelve failing bases in seconds, without any solver.
Aravind, Burton, Nunez Ponasso and Richter (2026) proved that the 60-ray Kochen-Specker system of the 600-cell is not rigid and conjectured that the 300-ray/675-basis system of the 120-cell is rigid. This note shows it is not. The golden-ring lift phi from Z[alpha]^4 to Z^8 underlying their 600-cell construction preserves orthogonality for arbitrary golden-ring vectors, because the Z^8 inner product of two lifts equals the rational part of their R^4 inner product. Applied to the 300 rays of the 120-cell, the lift is an 8-dimensional rank-one realization satisfying all 4050 orthogonality relations while acquiring 7200 additional ones (exact integer census), so no unitary can map it into the original rays. An explicit integer witness pair is given, and the same computation reproduces the known 600-cell counts (450 orthogonal pairs, 360 extra). The rigidity of Gosset's polytope 4_21, and dimension-preserving rigidity of the 120-cell in R^4, remain open. Verification: run python3 verify_rigidity.py with rays300.txt in the same directory; it re-verifies the identity, the full census (4050 and 7200), and the witness in seconds. The bonus tool solve120.py is a self-contained long-run decider for the still-open exact 120-cell noncontextuality maximum (usage in its header).
In the Kochen–Specker system of the E8 root system (120 rays, 2025 orthonormal bases), the largest number of bases containing exactly one selected ray is 1680, so every selection fails at least 345 bases. Every maximizer selects 14 rays whose orthogonality graph is seven disjoint edges; there are exactly 1080 maximizers, one for each antipodal pair of norm-4 vectors z of the E8 lattice (the rays r with |⟨r,z⟩| = 2). The proof combines a symmetry-reduced degree-4 Boolean moment relaxation with exact rational dual certificates, a certificate excluding induced three-vertex paths at the optimum, and a classification in the mod-2 quadratic space of E8. The upper bound, the classification, the certificates and two checking programs were produced with a GPT-based AI assistant in one session; these two programs are not independent review. An AI referee then checked that proof with its own code and reproduced every bound exactly. The certificate data are committed by SHA-256. Status: computer-assisted; exact rational certificates; AI-refereed (same model family as the coordinating assistant); not formally verified; not peer reviewed.
Abstract Coxeter pointed out that a number of polytopes can be projected orthogonally into two dimensions in such a way that their vertices lie on a number of concentric regular triacontagons (or 30-gons). Among them are the 600-cell and 120-cell in four dimensions and Gosset’s polytope 4 21 in eight dimensions. We show how these projections can be modified into Kochen–Specker diagrams from which parity proofs of the Bell–Kochen–Specker theorem are easily extracted. Our construction trivially yields parity proofs of fifteen bases for all three polytopes and also allows many other proofs of the same type to be constructed for two of them. The defining feature of these proofs is that they have a fifteen-fold symmetry about the center of the Kochen–Specker diagram and thus involve both rays and bases that are multiples of fifteen. Any proof of this type can be written as a word made up of an odd number of distinct letters, each representing an orbit of fifteen bases. Knowing the word representing a proof makes it possible to infer all its characteristics without first having to recover its bases. A comparison is made with earlier approaches that have been used to obtain parity proofs in these polytopes, and some directions in which this work can be extended are discussed.
The 240 root vectors of the Lie algebra E8 lead to a system of 120 rays in a real eight-dimensional Hilbert space that contains a large number of parity proofs of the Kochen–Specker (KS) theorem. After introducing the rays in a triacontagonal representation due to Coxeter, we present their KS diagram in the form of a 'basis table' showing all 2025 bases (i.e., sets of eight mutually orthogonal rays) formed by the rays. Only a few of the bases are actually listed, but simple rules are given, based on the symmetries of E8, for obtaining all the other bases from the ones shown. The basis table is an object of great interest because all the parity proofs of E8 can be exhibited as subsets of it. We show how the triacontagonal representation of E8 facilitates the identification of substructures that are more easily searched for their parity proofs. We have found hundreds of different types of parity proofs, ranging from 9 bases (or contexts) at the low end to 35 bases at the high end, and involving projectors of various ranks and multiplicities. After giving an overview of the proofs we found, we present a few concrete examples of the proofs that illustrate both their generic features as well as some of their more unusual properties. In particular, we present a proof involving 34 rays and 9 bases that appears to provide the most compact proof of the KS theorem found to date in eight-dimensions.