One nat per cell

In the deepest corners of physics, where the rules of the very large and the very small collide, there sits a question that has puzzled scientists for decades: what is a black hole made of? We know that black holes have a boundary called an event horizon, a point of no return where gravity is so strong that not even light can escape. We also know that these objects possess a property called entropy, a measure of hidden information or disorder. For a long time, physicists believed that the amount of this hidden information was directly tied to the surface area of the black hole, not its volume. This idea, known as the area law, suggests that the horizon is covered in tiny, discrete units of information, much like a screen is covered in pixels. However, the standard way of explaining this has always required a specific theory about the microscopic building blocks of the universe, such as strings or quantum loops. Scientists would pick a theory, count the possible states within that theory, and then adjust the numbers until they matched the observed area law. The result was always correct, but the explanation felt like it depended entirely on which theory you started with.

A new approach, proposed by Ira Wolfson of Braude Academic College of Engineering, attempts to answer this question without naming any specific microscopic building blocks. Instead of guessing what the black hole is made of, the researcher asks a simpler question: how much information can a single, smallest possible patch of the horizon hold? The answer, derived through a fresh look at how information scrambles in a chaotic system, is exactly one natural unit of information, known as a nat, per patch. This finding suggests that the famous formula for black hole entropy is not a coincidence of a specific theory, but a fundamental consequence of how quantum mechanics and chaos interact at the very limit of what can be observed.

The story begins with the idea of a resolution floor. Imagine trying to take a picture of a surface that is being stretched and twisted by extreme forces. In the quantum world, there is a limit to how small a detail can be distinguished, defined by the Planck scale. Wolfson treats the horizon of a black hole as a surface tiled with these smallest possible patches, each with an area equal to the square of the Planck length. These patches are the smallest units of space that any observer can ever hope to resolve. The researcher does not assume these patches contain specific particles or strings. Instead, the patches are treated as containers for a quantum state, represented by a mathematical map called a Wigner function. This map describes the probability of finding the system in various configurations, but unlike a standard probability map, it can take on negative values, reflecting the strange nature of quantum mechanics.

The key to the discovery lies in the behavior of black holes as the fastest scramblers in nature. When a black hole forms or swallows matter, its horizon does not just sit still; it churns with chaotic motion. This motion stretches the quantum state into incredibly long, thin filaments, folding them back and forth across the surface of the horizon. This process, known as stretch-and-fold mixing, happens so rapidly that within a specific timeframe, the filaments become so thin and so densely packed that they thread through every single one of the smallest patches on the horizon. Because the filaments are thinner than the resolution floor, no observer can tell if a specific patch is empty or occupied, or how many times a filament has passed through it. The only thing that remains visible is the fact that the patch is crossed by some number of filaments, but the order and exact position of those crossings are lost forever.

This loss of detail is where the counting begins. If a patch is crossed by a filament, the crossing could happen in any order. If it is crossed twice, there are two possible orders; if three times, there are six possible orders. However, because the scrambling process destroys the ability to distinguish these orders, all these different arrangements collapse into a single, indistinguishable state. The researcher calculates the total number of possible ways a patch can be crossed by summing up these possibilities, weighted by how many ways they can be ordered. This mathematical sum, which includes the possibility of zero crossings, one crossing, two crossings, and so on, adds up to a specific number: the mathematical constant e. In the language of information theory, the logarithm of e is exactly one nat. This means that a single patch of the horizon, once it has been thoroughly scrambled, carries exactly one nat of irreducible uncertainty. It is not a guess, nor does it depend on what the black hole is made of; it is a direct result of the geometry of the scrambling process and the limit of what can be observed.

Since the horizon is made of many of these independent patches, the total amount of information is simply the number of patches multiplied by the information each one holds. If there are N patches, the total information is N nats. This leads directly to the area law, because the number of patches is determined by the total area of the horizon divided by the area of a single patch. The researcher notes that to get the exact famous formula used by physicists today, one must multiply this result by a factor of one-quarter. This factor is not derived from the counting of states but is a separate geometric consequence of how much of the universe's phase space is actually accessible to an observer near the horizon. When this factor is applied, the result matches the Bekenstein-Hawking entropy formula perfectly.

The significance of this work is that it removes the need to assume a specific microscopic theory to explain black hole entropy. Previous explanations required scientists to say, "If the universe is made of strings, then the entropy is this," or "If it is made of loops, then the entropy is that." This new derivation shows that the entropy arises simply because the horizon is a quantum system that scrambles information so thoroughly that it becomes impossible to distinguish the details of the crossings. The result holds true regardless of whether the black hole is made of strings, loops, or something else entirely. The only requirement is that the system follows the rules of quantum mechanics and that the horizon acts as a chaotic scrambler. The paper argues that the entropy is not a property of the constituents, but a property of the horizon's own inability to be resolved in detail.

This perspective shifts the understanding of black holes from objects defined by their internal ingredients to objects defined by their limits of observation. The entropy is not a measure of what is hidden inside, but a measure of what is hidden by the horizon's own chaotic motion. The calculation relies on the fact that the horizon is a complete scrambler, ensuring that no patch can ever be certified as empty. By the time the scrambling is complete, every patch is a tangle of unresolved crossings, and the only thing left to count is the number of patches themselves. The finding suggests that the area law is a universal feature of any horizon that scrambles information, making it a robust prediction of quantum mechanics and gravity that does not depend on the specific details of a theory of everything.

The paper also touches on how this logic might apply to other theories of gravity. If the rules of gravity were slightly different, the size of the smallest patch would change, but the logic of the counting would remain the same. The number of nats per patch would still be one, and the total entropy would still be proportional to the area, just with a different scaling factor. This reinforces the idea that the relationship between area and entropy is a fundamental truth about how information is stored in the universe, rather than an accident of a particular model. The derivation stands as a theory-free explanation, relying only on the concepts of irreducible uncertainty and the chaotic nature of horizons.

In the end, the work offers a clear, concrete picture of what the horizon counts. It counts the number of ways a chaotic system can hide its details from an observer who is limited by the resolution floor. It does not count strings or loops, but rather the indistinguishable crossings of a scrambled quantum state. The result is a simple, elegant number: one nat per cell. This finding brings the mysterious entropy of black holes down to a basic combinatorial fact, showing that the complexity of the universe can sometimes be reduced to the simple act of counting what cannot be seen.