The Holographic Bound as a Code Selection Principle
on the FCC Lattice
Raghu Kulkarni
SSMTheory Group, IDrive Inc., Calabasas, CA 91302, USA
raghu@idrive.com
Abstract
The Face-Centered Cubic (FCC) lattice supports two CSS quantum error correction
codes: the full code [[3L
3
, 2L
3
+2, 3]] with K = 12 connectivity, and the sheet code
[[L
3
, 2L, L]] obtained by restricting to one of three triad sheets. If the FCC lattice
is identified with Planck-scale spacetime geometry, the Bekenstein-Hawking entropy
bound S ≤ A/(4ℓ
2
P
) constrains the number of independent degrees of freedom (log-
ical qubits) in any region. We show that the full FCC code violates this bound
at every lattice size (k ∼ L
3
, volume scaling), while the sheet code satisfies it for
L ≥ 4 (k ∼ L, sub-area scaling). At L = 4, the three-sheet code utilizes a fraction
ln 2 ≈ 69% of the holographic capacity — the maximum at any admissible lattice
size. The holographic principle thus acts as a code selection rule on the FCC lattice,
uniquely selecting the sheet decomposition — in which the 3D lattice reduces to 3L
independent 2D toric codes — as the physically admissible encoding.
1 Introduction
The holographic principle states that the maximum information content of a region of
spacetime scales with its boundary area, not its volume [1, 2]. The Bekenstein-Hawking
entropy bound makes this precise:
S ≤
A
4ℓ
2
P
(1)
where A is the area of the bounding surface and ℓ
P
is the Planck length. This bound is
central to quantum gravity and is realized exactly in the AdS/CFT correspondence [3].
Independently, quantum error correction has emerged as a framework for understanding
the structure of spacetime [4, 5, 6]. The connection between QEC codes and holography
has been explored through tensor network models (HaPPY code [5]), where the bulk-
boundary correspondence of AdS/CFT is realized as a quantum error correction code
mapping bulk logical qubits to boundary physical qubits.
In this paper, we apply the Bekenstein-Hawking bound to a specific lattice QEC code.
The FCC lattice supports two code families: the full [[3L
3
, 2L
3
+2, 3]] code [10] and the
sheet code [[L
3
, 2L, L]] [11]. We show that the holographic bound selects the sheet code
as the unique physically consistent encoding, and that this selection forces the 3D lattice
to decompose into 2D layers.
1
2 Setup
Consider an FCC lattice of linear dimension L (even) with Planck-scale spacing a = ℓ
P
,
defined on a 3-torus (periodic boundary conditions in all three directions). The torus has
no boundary in the usual sense; we define the bounding area as the area of the maximal
cross-sectional surface separating one fundamental domain from its periodic copies:
Cross-sectional area: A = 6L
2
ℓ
2
P
(2)
(six faces of the cubic fundamental domain, each of area L
2
ℓ
2
P
).
We adopt information-theoretic units where entropy S is measured in qubits and the
Bekenstein-Hawking bound is expressed as
k ≤
A
4ℓ
2
P
ln 2
(3)
absorbing the ln 2 conversion between nats and bits. This convention is standard in
quantum information treatments of the holographic bound [8]. Numerically:
k ≤
6L
2
4 ln 2
=
3L
2
2 ln 2
≈ 2.16 L
2
(4)
We identify k (the number of logical qubits of the lattice QEC code) with the number of
independent degrees of freedom in the region. This identification is standard in the QEC-
spacetime literature [4, 6]: logical qubits represent the bulk degrees of freedom protected
by the error correction code, and the holographic bound constrains how many such degrees
of freedom a region of spacetime can support.
3 The Two FCC Codes
3.1 Full FCC code
The full code on the FCC lattice [10] has:
k
full
= 2L
3
+ 2 (5)
This scales as L
3
— proportional to the volume.
3.2 Sheet code
The sheet code [11], obtained by restricting to the three triad sheets of the FCC lattice,
has:
k
sheet
= 6L (6)
(three sheets, each encoding 2L logical qubits). This scales as L — sub-linear in the area.
2
4 Holographic Selection
Proposition 1 (Full code violates the bound). For all L ≥ 1:
k
full
= 2L
3
+ 2 >
3L
2
2 ln 2
(7)
The full FCC code is holographically inadmissible at every lattice size.
Proof. The ratio k
full
/k
bound
= (2L
3
+ 2) · 2 ln 2/(3L
2
) ≈ 0.924 L for large L. At L = 2:
k
full
= 18, bound = 8.7; already violated. The ratio grows linearly with L.
Proposition 2 (Sheet code satisfies the bound for L ≥ 4).
k
sheet
= 6L ≤
3L
2
2 ln 2
⇐⇒ L ≥ 4 ln 2 ≈ 2.77 (8)
For even L, the smallest admissible size is L = 4.
Proof. 6L ≤ 3L
2
/(2 ln 2) reduces to 4 ln 2 ≤ L. Since 4 ln 2 ≈ 2.77 and L must be a
positive even integer, the minimum is L = 4.
Observation 1 (Maximum utilization at L = 4). At L = 4 (the smallest admissible even
L):
k
sheet
= 24, k
bound
=
3 × 16
2 ln 2
≈ 34.6 (9)
The sheet code uses 24/34.6 ≈ 69% of the holographic capacity. The utilization ratio at
L = 4 is exactly ln 2:
k
sheet
k
bound
=
6L
3L
2
/(2 ln 2)
=
4 ln 2
L
L=4
= ln 2 ≈ 0.693 (10)
This ratio decreases monotonically with L: the code moves further below the bound as the
lattice grows. Figure 1 shows both codes against the bound.
L k
full
k
sheet
Bound Full Sheet Utilization
2 18 12 8.7 violates violates —
4 130 24 34.6 violates satisfies 69%
6 434 36 77.9 violates satisfies 46%
10 2,002 60 216.4 violates satisfies 28%
20 16,002 120 865.6 violates satisfies 14%
5 Implications
5.1 The bound forces 2D decomposition
The full FCC code treats the lattice as a 3D object with volume-scaling degrees of freedom.
The holographic bound forbids this. The sheet code decomposes the same 3D lattice into
3
2 4 6 8 10 12 14 16 18 20
Lattice size
L
10
1
10
2
10
3
10
4
Logical qubits
k
Holographic Bound vs FCC Codes
Full FCC code:
k
= 2
L
3
+ 2
Sheet code:
k
= 6
L
BH bound: 3
L
2
/(2ln 2)
Forbidden region
2 4 6 8 10 12 14 16 18 20
Lattice size
L
0
2
4
6
8
10
12
Utilization
k
/
k
bound
ln 2 0.693
Forbidden
(
k
/
k
bound
> 1)
Holographic Utilization
Full FCC: 0.92
L
Sheet: 4ln 2/
L
Figure 1: Left: logical qubit count k vs lattice size L for the full FCC code (2L
3
+2,
red), the sheet code (6L, green), and the Bekenstein-Hawking bound (3L
2
/(2 ln 2), blue
dashed). The full code violates the bound at every L; the sheet code satisfies it for
L ≥ 4. Right: utilization ratio k/k
bound
. Values above 1 (red shading) are holographically
forbidden. At L = 4, the sheet code utilization is exactly ln 2 ≈ 0.693.
3L independent 2D toric codes [11], each defined on a rotated square lattice of dimension
L. The holographic bound thus forces the FCC lattice to be interpreted not as a 3D
structure but as a collection of 2D layers.
This is the content of the holographic principle: the physical degrees of freedom of a
3D region are encoded on its 2D boundary. On the FCC lattice, this abstract principle
becomes a concrete code selection rule — it selects the sheet decomposition as the unique
admissible encoding. Figure 2 illustrates this selection.
Volume scaling
Full FCC:
k
= 2
L
3
+ 2
× Violates BH bound
S
xy
S
xz
S
yz
3 sets of 2D layers
Sheet code:
k
= 6
L
Satisfies BH bound
0 250 500 750 1000 1250 1500 1750 2000
Logical qubits
k
Full FCC
BH bound
Sheet code
k
= 2002
k
= 216
k
= 60
At
L
= 10
Figure 2: Left: full FCC code treats the lattice as a 3D object with volume-scaling
information — holographically forbidden. Center: sheet decomposition separates the
lattice into three sets of 2D layers — holographically admitted. Right: at L = 10, the
full code stores k = 2,002 (volume), the bound allows k ≈ 216 (area), and the sheet code
stores k = 60 (sub-area).
4
5.2 Connection to AdS/CFT
In the AdS/CFT correspondence, the bulk gravitational theory is encoded in a lower-
dimensional boundary theory. Tensor network models [5] realize this as a QEC code: the
bulk logical qubits are protected by a code whose physical qubits live on the boundary.
The FCC sheet code provides a flat-space lattice realization of this bulk-boundary struc-
ture. While standard AdS/CFT tensor networks employ hyperbolic geometries (negative
curvature), the FCC lattice on a 3-torus has zero curvature, placing it in the domain of
flat-space holography [9]. The “bulk” is the 3D FCC lattice. The “boundary” is the set of
2D toric code layers. The holographic bound ensures that the bulk information (k = 6L)
does not exceed the boundary capacity (3L
2
/(2 ln 2)), and the ln 2 utilization at L = 4
shows that the smallest admissible FCC lattice nearly saturates the holographic capacity.
5.3 The minimum lattice size
The bound L ≥ 4 ln 2 ≈ 2.77 for the three-sheet code means that for even L, the smallest
admissible size is L = 4. At L = 2, even the sheet code violates the bound (k = 12 > 8.7).
This provides a holographic lower bound on the lattice size: if the FCC lattice describes
Planck-scale spacetime, the minimum admissible region has L = 4, containing 3L
3
= 192
edges encoding k = 24 logical degrees of freedom at ln 2 ≈ 69% of the holographic capacity.
6 Caveats
The identification of k (code logical qubits) with the Bekenstein-Hawking entropy S is an
assumption, not a derivation. In the QEC-spacetime literature [4, 6], this identification
is motivated by the observation that logical qubits represent bulk degrees of freedom, but
a rigorous derivation from first principles does not exist.
The FCC lattice as Planck-scale spacetime geometry is the central hypothesis of the
SSM framework [12]. This hypothesis is not established; the present paper explores its
consequences if assumed.
The 3-torus has no boundary in the usual sense. We apply the bound to the cross-
sectional area of the fundamental domain (6L
2
ℓ
2
P
), interpreted as the area separating one
fundamental domain from its periodic copies. This is consistent with how the holographic
bound is applied to closed cosmologies [7, 8], where the relevant area is the maximal
cross-section of the spatial slice.
7 Conclusion
On the FCC lattice, the Bekenstein-Hawking bound acts as a code selection principle: it
forbids the full [[3L
3
, 2L
3
+2, 3]] code (volume-scaling information) and admits the sheet
code [[L
3
, 2L, L]] (sub-area-scaling information) for L ≥ 4. At L = 4, the sheet code uti-
lizes a fraction ln 2 ≈ 69% of the holographic capacity — the maximum at any admissible
5
lattice size.
The selected code is 3L copies of the 2D toric code — the 3D FCC lattice decomposes
entirely into 2D layers. If the FCC lattice represents Planck-scale spacetime, then the
holographic principle forces this 2D decomposition: the three spatial dimensions of the
FCC structure are not independent but are three sets of 2D sheets sharing vertices.
This provides a concrete, calculable example in which the holographic principle selects
among QEC codes on a fixed lattice, and the selected code has purely 2D structure.
References
[1] G. ’t Hooft, “Dimensional reduction in quantum gravity,” arXiv:gr-qc/9310026
(1993).
[2] L. Susskind, J. Math. Phys. 36, 6377 (1995). doi:10.1063/1.531249
[3] J. Maldacena, Int. J. Theor. Phys. 38, 1113 (1999). doi:10.1023/A:1026654312961
[4] A. Almheiri, X. Dong, and D. Harlow, JHEP 04, 163 (2015).
doi:10.1007/JHEP04(2015)163
[5] F. Pastawski, B. Yoshida, D. Harlow, and J. Preskill, JHEP 06, 149 (2015).
doi:10.1007/JHEP06(2015)149
[6] D. Harlow, Rev. Mod. Phys. 88, 015002 (2017). doi:10.1103/RevModPhys.88.015002
[7] R. Bousso, JHEP 07, 004 (1999). doi:10.1088/1126-6708/1999/07/004
[8] R. Bousso, Rev. Mod. Phys. 74, 825 (2002). doi:10.1103/RevModPhys.74.825
[9] A. Bagchi, Phys. Rev. Lett. 105, 171601 (2010).
doi:10.1103/PhysRevLett.105.171601
[10] R. Kulkarni, arXiv:2603.20294 (2026).
[11] R. Kulkarni, Zenodo (2026). doi:10.5281/zenodo.19412464
[12] R. Kulkarni, “Constructive Verification of K=12 Lattice Saturation: A
Spacetime Geometry from Discrete Holographic Growth,” Zenodo (2026).
doi:10.5281/zenodo.18294925
6
