Exact CaB₆ packing attainment
An all-pairs argument for the proposed optimum, replacing the earlier finite attainment check. This is the two-size CaB₆ packing family, distinct from the equal-ball fcc motion.
Six balls per cell. Every original bar preserved. A lattice that shears from the open cab framework into face-centred cubic packing, while its density increases throughout the motion.
The new construction covers every parameter value and every periodic image. Two separately written arithmetic implementations replay its finite certificate. Independent human review and historical priority remain open.
A valid dense endpoint does not tell us how to get there. The construction below supplies the journey: the octahedron inside each cell stays fixed, while the vectors that repeat it through space change. The connecting bars swivel, keeping exactly the same length.
Drag to turn the view, or use the view buttons. The slider also works with arrow keys. Playback starts only when you press Play.
The older searches found sampled paths to both hcp and fcc, including one-octahedron cells. Their evidence remains VERIFIED NUMERICALLY. This is a separate fcc witness with an all-parameter argument. A certified continuous hcp path is still an open question.
Use units in which the six centres are P = {±e₁, ±e₂, ±e₃}, each ball has radius 1/√2, and each bar has length √2. The infinite packing consists of p + nL(s), for p ∈ P and integer row vectors n ∈ ℤ³.
L(s) = (2 + a)I + tC
t = 2s / (1 + s²)
a = √2(1 − s²) / (1 + s²)
0 ≤ s ≤ 1
⎡ 0 −1 −1 ⎤
C = ⎢ 1 0 −1 ⎥
⎣ 1 −1 0 ⎦The twelve octahedron edges do not move. Each of the three connecting bars has squared length a² + 2t² = 2. This identity holds throughout the interval.
The symmetric part of L has eigenvalues d, d + t, d − t, where d = 2 + a and d − t ≥ 1. Thus |nL| ≥ |n|. Every translation with |n|² ≥ 12 is safely too far away to overlap, even after allowing for the motif offsets.
171 translations and 19 distinct motif differences leave 3,248 non-self distance conditions. Clearing the positive denominator makes each a quartic. All 16,240 Bernstein coefficients are nonnegative in exact arithmetic over ℚ(√2). Since the Bernstein basis is nonnegative on [0, 1], every remaining distance is safe for the entire motion.
The endpoint has determinant 12; the six motif cosets fill a translate of the even-parity lattice D₃, which is fcc. A derivative argument shows the determinant decreases strictly along the motion. The ball volume stays constant, so the packing fraction increases strictly to π/√18.
Here PROVEN means a written argument with an exact finite computational component. It does not mean peer reviewed or formalized in a proof assistant. A reviewer still needs to inspect the analytic reduction and the arithmetic implementations.
The literature audit found a clear precedent: Borcea and Streinu, Periodic tilings and auxetic deployments (2021), Section 7, discuss regular cross-polytopes connected by bars in arbitrary dimensions. The earlier suggestion that this family had not been found in the literature has been withdrawn.
Their deployment example and this equal-bar packing problem use different proportions and periodic descriptions. A useful comparison must separate fixed-lattice Bloch modes, variable-lattice motions, rigid-body kinematics and finite-stiffness spring elasticity. They are different questions, even when a diagram looks similar.
| Ingredient or result | Current position |
|---|---|
| Tilings, cab net, bridged cross-polytopes | Established structures, credited to earlier work. |
| Mode and stress counts; unit-spring elasticity | Written all-n arguments for n ≥ 3, numerical replay through n = 8. Priority of the exact formulas is unresolved. |
| The explicit equal-bar fcc motion | Written proof and exact certificate submitted for review. Historical priority unresolved. |
| Physical hexaborides or devices | No material transition or working device demonstrated by this ideal geometric model. |
Goodwin (2006) is a close precedent for linearly bridged rigid-unit frameworks. Li, Refson and Dove (2023) investigate actual hexaborides. The comparison note records which sources were read in full, by section, or only through abstracts. Search non-discovery does not establish novelty.
The assessment and priorities led to the literature comparison, the continuous-motion construction and a focused paper. The same audit also proposed a stronger attainment proof and proposed a repair for gaps in certificate coverage. These submissions are linked below; the research drafts have not been accepted by an outside reviewer.
An all-pairs argument for the proposed optimum, replacing the earlier finite attainment check. This is the two-size CaB₆ packing family, distinct from the equal-ball fcc motion.
The previous commitment registry omitted existing results and paths. The fix covers all eight baseline result certificates and four stored folding paths, with eleven regression tests. Hashes establish which artifacts were checked; they do not prove mathematical claims.
Corrected the family-level prior-art claim, compared model assumptions and prepared precise questions for a periodic-rigidity specialist.
Added the explicit curve, written reductions, two exact implementations and three rejection controls. Full local verification passed across all nine results on this branch. A separate 501-state sample also passed both existing numerical fold checkers.
A five-page paper concentrates on the motion, its certificate and its limits. It includes the model, proof, reproduction instructions, precedents and disclosed AI assistance.
All five PRs remain open at this October 2026 site update; follow each PR for its current review state. The proof branch depends on the proposed commitment fix, and the paper depends on the proof branch.
This is meaningful, reproducible mathematical exploration. Its value lies in a construction others can inspect and reuse, explicit statements that can be challenged, and explanations that connect geometry to rigidity. The present record does not establish a major breakthrough, historical priority or a practical material application.
Ahraz Arifuddin from Aska Digital leads the project. Earlier exploration and endpoint data were developed with Claude Opus 5.5 from Anthropic. GPT-6 derived the continuous construction, wrote its proof and first exact implementation; GPT-6.1 Sol wrote a separate arithmetic replay and reviewed the reductions; GPT-6 Luna handled repository publication. These are internal AI contributions. No independent human mathematical review is claimed.
On the result branch, run make verify-fold-continuous PY=python3 for the standard-library exact replay. The certificate binds its proof and code by SHA-256. For the established broader project, see the original preprint and repository.