Skip to content
#edge computing Open access

Void Network Geometry and Bell Non-Locality: Withdrawal of the c√(3/2) Propagation Speed

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications Noncommutative and Quantum Gravity Theories

Abstract

Version 1.0 of this record claimed that the octahedral-void network of the BCC Planck foam has nearest-neighbour spacing shorter than the bubble spacing, and that voids therefore propagate at c_V = c√(3/2) ≈ 1.22c, supplying a finite-speed mechanism for Bell non-locality. That result is withdrawn. Two errors are identified. First, the void spacing is wrong: BCC has three octahedral holes per lattice site, at the face centres and the edge midpoints of the conventional cube, and the nearest-neighbour spacing of the full void network is a/2, not a/√2. Second, the speed ratio is inverted: with a common hop time a shorter hop is slower, not faster. The propagation front of each network is computed exactly (support function of the hop set, confirmed by breadth-first search). Under a common hop time the void front never exceeds the bubble front in any direction (ratio 1 along ⟨100⟩, 1/2 along ⟨110⟩, 1/3 along ⟨111⟩); under a common hop speed both networks reach exactly c in their fastest direction. No model yields a ratio above 1. Independently, any finite influence speed is excluded: experiment bounds such a speed above roughly 10⁴ c (Salart et al. 2008), and Bancal et al. (2012) prove that every finite-speed influence model permits superluminal signalling, so "the void carries no information" cannot rescue a finite c_V. The surviving content is the lattice geometry of the two networks. The mechanism of Bell correlations in UFFT is the one already published in Paper #45 (DOI: 10.5281/zenodo.19307111): the void channel of H = L + ηV is the antipodal map through the incompressible bulk, with no propagation and no speed, and no-signalling follows from incompressibility. The pair state is derived in Paper #75 (DOI: 10.5281/zenodo.21323993). Changes in this version: title changed to state the withdrawal; abstract rewritten, with the v1.0 abstract reproduced in §1 for the record; §2 geometry corrected (all six octahedral sites per cube, d_V = a/2); §3 replaces the speed ratio with the propagation-front theorem and computed table; §4 added (exclusion of any finite influence speed); §5 withdrawn and replaced by a pointer to Papers #45 and #75; verification script verify_void_network_speed_2026-10-05.py added. Unified Foam Field Theory, Part XXXIII. Framework v9. Verification script in the UFFT GitHub repository.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.