A Google Notebook on Shadow Money: How to see the unseeable.

 


The Audio Podcast does a great job of explaining the concept... but the equation they show in the video is AWESOME!!! LOL

Popular posts from this blog

Casimir-Coupled Tachyonic Venting (CCTV): Hawking Radiation as Stroboscopic Phase Instability with Noether-Complete Energy Ledger

Image
Faster-Than-Light as Frame, Not Cheat — Why the Channel Saves Causality, Information, and Entropy Faster-Than-Light as Frame, Not Cheat — Why the Channel Saves Causality, Information, and Entropy https://www.youtube.com/watch?v=Oui9sGtn5wg The claim is simple: faster-than-light can be real as a frame-of-reference fact inside a quantum channel without violating causality. In that same picture, information is not lost in black holes, and the second law remains intact. The only trick is to stop treating “speed” as a sacred scalar and start acknowledging the lane you’re measuring in. Switch the lane—switch the operational frame—and the mystery becomes arithmetic. 1) Channel-Relative Speed Is the Point Ordinary light plods along in the background medium defined by the exterior geometry. A pumped quantum channel near a horizon defines a different medium. Inside that channel, the bright structure can overtake ambient light and appear...
Read more

The Prime-Polygon Lune: Grounding the Riemann Line with a Geodesic–Chiral Geometry

Image
  The Prime-Polygon Lune: Grounding the Riemann Line with a Geodesic–Chiral Geometry YouTube Video 1 YouTube Podcast 1 A direct geometric route to the zeta spectrum, twin-prime infinitude, and an RSA entropy shortfall -------------------------------------------------------------------------------- Abstract This paper presents a complete geometric framework that grounds the Riemann Hypothesis (RH) and, as a direct consequence, establishes the infinitude of twin primes and quantifies a structural vulnerability in RSA encryption. Our central object is the "Prime-Polygon Lune," an elementary construction derived from the Euclidean phasor walk H_m(t) = Σ e^(ipt) . We prove three foundational geometric identities: an exact formula for the polygon's area (Q1), a decomposition into a master triangle, inner strip, and residual lune (Q2), and a universal bound on the lune's size (Q3). The core thesis is that standard analysis fails because it measures the prime signal on a fla...
Read more

Building a Computer from Dirt and Rocks: A Journey from First Principles & Binary Energy Dynamics: Resolving the Information Loss Paradox in Black Holes

Image
  Google's AI Podcast When people talk about computers, they sound like priests reciting a code no one else can read. Everything is hidden under layers—kernels, stacks, caches, quantum foam if you let them talk long enough. It’s impressive, sure, but it builds the wrong mythology. The machine isn’t that mysterious. It’s just the modern mask of a very old impulse: to trap thought in matter. A computer is a physical argument. Someone once said, “if I push this and not that, I can make a pattern appear.” That’s all this has ever been. A chain of “if” and “then” baked into stone, then copper, then silicon. The words have gotten fancier, the voltages smaller, the loops tighter. But the logic hasn’t aged a day. The strange thing about learning computing now is that it’s usually taught upside down. You start with syntax before you ever learn what a state is. You’re handed a glowing screen and told to “write a loop,” as if you already know what repetition feels like to a machine. The fie...
Read more