Show description
The Probabilistic Future
The Probabilistic Future
The Probabilistic Future
A New Era of Computation: From Deterministic Logic to Thermodynamic AI.
This is your guide to a new computing paradigm that doesn't fight noise, but uses it as a resource.
The Paradigm Shift
The Present: Deterministic Compute
Analogy: The Calculator
Always gives one, precise answer. 5 + 5 = 10.
Core Principle: Fights Randomness
Spends enormous energy (and creates heat) to force transistors into perfect 0s or 1s, suppressing all thermal noise.
The Future: Probabilistic Compute
Analogy: The Sampler
Gives a distribution of answers. "It's 80% likely to be 1, 20% to be 0."
Core Principle: Uses Randomness
Leverages inherent thermal noise. A **p-bit** (probabilistic bit) fluctuates naturally. An input voltage just **biases the probability**, and the output is a **random sample**.
How to "Program" a TSU
You don't write `for` loops. You "compile" your real-world problem into a physical model of energy. This is a three-step process.
1
The Real-World Problem
"Find the most efficient delivery route for a fleet of 100 trucks."
→
↓
2
The "Compiler" (Software)
Translate the problem into an Energy-Based Model (EBM).
Probabilistic Graphical Model (PGM): A high-level "map" of your problem. Nodes = trucks, cities. Edges = routes, costs.
Energy-Based Model (EBM): A *type* of PGM. You define an **Energy Function** where the "best" answer has the "lowest" energy.
Energy = (Total_Fuel_Cost)
+ (Total_Driver_Time)
+ (Penalty_for_Late_Delivery)
+ (Penalty_for_Exceeding_Capacity)
→
↓
3
The Hardware (Physics)
The TSU (Thermodynamic Sampling Unit) *physically* settles into its lowest energy state. By feeding it your EBM, the answer isn't "calculated"—it's **sampled** from the hardware's natural equilibrium.
10 Problems for the `thrml` Simulator
You can start today by building these energy functions in software using Extropic's `thrml` simulator. The key is framing the problem as an EBM.
1.…
The Probabilistic Future
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>The Probabilistic Future</title>
<!-- Tailwind CSS CDN -->
<script src="https://cdn.tailwindcss.com"></script>
<!-- Google Font: Inter -->
<link rel="preconnect" href="https://fonts.googleapis.com">
<link rel="preconnect" href="https://fonts.gstatic.com" crossorigin>
<link href="https://fonts.googleapis.com/css2?family=Inter:wght@400;600;700;900&display=swap" rel="stylesheet">
<style>
/* Applying the 'Inter' font */
body {
font-family: 'Inter', sans-serif;
}
/* Custom styles for gold text */
.text-gold {
color: #FBBF24; /* amber-400 */
}
.border-gold {
border-color: #F59E0B; /* amber-500 */
}
.border-gold-faded {
border-color: rgba(245, 158, 11, 0.3); /* amber-500 with 30% opacity */
}
.bg-card {
background-color: #111111; /* Slightly off-black for cards */
}
.bg-code {
background-color: #27272a; /* zinc-800 */
}
</style>
</head>
<body class="bg-black text-gray-200">
<!-- Header / Hero Section -->
<header class="py-24 text-center">
<div class="max-w-4xl mx-auto px-6">
<h1 class="text-5xl md:text-7xl font-bold text-gold mb-6">
The Probabilistic Future
</h1>
<p class="text-xl md:text-2xl text-gray-300">
A New Era of Computation: From Deterministic Logic to Thermodynamic AI.
</p>
<p class="mt-4 text-lg text-gray-400">
This is your guide to a new computing paradigm that doesn't fight noise, but uses it as a resource.
</p>
</div>
</header>
<main class="max-w-5xl mx-auto px-6 pb-24 space-y-24">
<!-- Section 2: The Paradigm Shift (Infographic) -->
<section>
<h2 class="text-4xl font-bold text-center mb-12">The <span class="text-gold">Paradigm Shift</span></h2>
<div class="grid md:grid-cols-2 gap-8">
<!-- Column 1: Deterministic (GPU) -->
<div class="bg-card p-8 rounded-xl border border-gold-faded">
<h3 class="text-2xl font-bold text-white mb-4">The Present: Deterministic Compute</h3>
<div class="w-full h-40 bg-gray-800 rounded-lg flex items-center justify-center mb-4">
<svg xmlns="http://www.w3.org/2000/svg" fill="none" viewBox="0 0 24 24" stroke-width="1.5" stroke="currentColor" class="w-20 h-20 text-blue-400">
<path stroke-linecap="round" stroke-linejoin="round" d="M11.25 4.5l7.5 7.5-7.5 7.5m-6-15l7.5 7.5-7.5 7.5" />
</svg>
</div>
<p class="text-lg font-semibold text-white">Analogy: The Calculator</p>
<p class="text-gray-400 mb-4">Always gives one, precise answer. 5 + 5 = 10.</p>
<p class="font-semibold text-red-400">Core Principle: Fights Randomness</p>
<p class="text-gray-400">
Spends enormous energy (and creates heat) to force transistors into perfect 0s or 1s, suppressing all thermal noise.
</p>
</div>
<!-- Column 2: Probabilistic (TSU) -->
<div class="bg-card p-8 rounded-xl border border-gold-faded">
<h3 class="text-2xl font-bold text-white mb-4">The Future: Probabilistic Compute</h3>
<div class="w-full h-40 bg-gray-800 rounded-lg flex items-center justify-center mb-4">
<svg xmlns="http://www.w3.org/2000/svg" fill="none" viewBox="0 0 24 24" stroke-width="1.5" stroke="currentColor" class="w-20 h-20 text-gold">
<path stroke-linecap="round" stroke-linejoin="round" d="M6 13.5V3.75m0 9.75a1.5 1.5 0 011.5-1.5H15a1.5 1.5 0 011.5 1.5v3.75m-7.5-6.75a.75.75 0 00-1.5 0v6.75a.75.75 0 001.5 0v-6.75z" />
<path stroke-linecap="round" stroke-linejoin="round" d="M12.75 12.75h.008v.008h-.008v-.008z" />
<path stroke-linecap="round" stroke-linejoin="round" d="M3 21h18M12 3.75h.008v.008H12V3.75z" />
</svg>
</div>
<p class="text-lg font-semibold text-white">Analogy: The Sampler</p>
<p class="text-gray-400 mb-4">Gives a distribution of answers. "It's 80% likely to be 1, 20% to be 0."</p>
<p class="font-semibold text-green-400">Core Principle: Uses Randomness</p>
<p class="text-gray-400">
Leverages inherent thermal noise. A **p-bit** (probabilistic bit) fluctuates naturally. An input voltage just **biases the probability**, and the output is a **random sample**.
</p>
</div>
</div>
</section>
<!-- Section 3: The "Compiler" (PGM -> EBM -> TSU) -->
<section>
<h2 class="text-4xl font-bold text-center mb-12">How to "Program" a <span class="text-gold">TSU</span></h2>
<p class="text-lg text-gray-400 text-center max-w-3xl mx-auto mb-16">
You don't write `for` loops. You "compile" your real-world problem into a physical model of energy. This is a three-step process.
</p>
<div class="flex flex-col md:flex-row items-center justify-between space-y-8 md:space-y-0 md:space-x-8">
<!-- Step 1: The Problem -->
<div class="flex-1 text-center">
<div class="w-24 h-24 bg-gold text-black rounded-full flex items-center justify-center text-3xl font-bold mx-auto mb-4">1</div>
<h3 class="text-2xl font-bold text-white mb-2">The Real-World Problem</h3>
<p class="text-lg text-gray-400">"Find the most efficient delivery route for a fleet of 100 trucks."</p>
</div>
<div class="text-gold text-4xl hidden md:block">→</div>
<div class="text-gold text-4xl md:hidden">↓</div>
<!-- Step 2: The "Compiler" (Software) -->
<div class="flex-1 bg-card p-8 rounded-xl border border-gold-faded">
<div class="w-24 h-24 bg-gold text-black rounded-full flex items-center justify-center text-3xl font-bold mx-auto mb-4">2</div>
<h3 class="text-2xl font-bold text-white mb-2 text-center">The "Compiler" (Software)</h3>
<p class="text-lg text-gray-400 text-center mb-4">Translate the problem into an <b class="text-gold">Energy-Based Model (EBM)</b>.</p>
<p class="text-gray-300 mb-2"><b class="text-white">Probabilistic Graphical Model (PGM):</b> A high-level "map" of your problem. Nodes = trucks, cities. Edges = routes, costs.</p>
<p class="text-gray-300 mb-4"><b class="text-white">Energy-Based Model (EBM):</b> A *type* of PGM. You define an **Energy Function** where the "best" answer has the "lowest" energy.</p>
<pre class="bg-code p-4 rounded-lg text-sm text-gold">
Energy = (Total_Fuel_Cost)
+ (Total_Driver_Time)
+ (Penalty_for_Late_Delivery)
+ (Penalty_for_Exceeding_Capacity)</pre>
</div>
<div class="text-gold text-4xl hidden md:block">→</div>
<div class="text-gold text-4xl md:hidden">↓</div>
<!-- Step 3: The Hardware (Physics) -->
<div class="flex-1 text-center">
<div class="w-24 h-24 bg-gold text-black rounded-full flex items-center justify-center text-3xl font-bold mx-auto mb-4">3</div>
<h3 class="text-2xl font-bold text-white mb-2">The Hardware (Physics)</h3>
<p class="text-lg text-gray-400">The TSU (Thermodynamic Sampling Unit) *physically* settles into its lowest energy state. By feeding it your EBM, the answer isn't "calculated"—it's **sampled** from the hardware's natural equilibrium.</p>
</div>
</div>
</section>
<!-- Section 4: 10 Problems for the `thrml` Simulator -->
<section>
<h2 class="text-4xl font-bold text-center mb-4">10 Problems for the <span class="text-gold">`thrml` Simulator</span></h2>
<p class="text-lg text-gray-400 text-center max-w-3xl mx-auto mb-16">
You can start today by building these energy functions in software using Extropic's `thrml` simulator. The key is framing the problem as an EBM.
</p>
<div class="grid grid-cols-1 md:grid-cols-2 gap-6">
<!-- Problem 1: Max-Cut -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">1. Max-Cut Problem</h3>
<p class="text-gray-400 mb-3">Split a graph's nodes into two groups to maximize the connections *between* the groups.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> Assign `High Energy` (a penalty) to any two connected nodes that are in the *same* group. The TSU will naturally find the state that minimizes this penalty, maximizing the cut.</p>
</div>
<!-- Problem 2: Traveling Salesman (TSP) -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">2. Traveling Salesman Problem</h3>
<p class="text-gray-400 mb-3">Find the shortest possible route that visits every city exactly once and returns to the start.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> Assign `Energy = Total_Distance`. Add a massive `High Energy` penalty if a city is visited twice or not at all. The TSU will find the route with the lowest total energy (distance).</p>
</div>
<!-- Problem 3: Graph Coloring -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">3. Graph Coloring</h3>
<p class="text-gray-400 mb-3">Find the minimum number of colors needed for a map so no two adjacent regions share a color.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> Assign a `High Energy` penalty to any two adjacent nodes that have the *same* color. The TSU will find a coloring state that minimizes penalties.</p>
</div>
<!-- Problem 4: Boolean SAT (Satisfiability) -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">4. Boolean Satisfiability (SAT)</h3>
<p class="text-gray-400 mb-3">Given a complex logic formula (e.g., `(A or !B) and (B or C)`), find a set of True/False values that makes the whole formula true.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> Assign `Energy = 1` for every logic clause that is *false*. The TSU will seek the lowest energy state, `Energy = 0`, which represents a valid solution.</p>
</div>
<!-- Problem 5: Portfolio Optimization -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">5. Portfolio Optimization</h3>
<p class="text-gray-400 mb-3">From thousands of stocks, build a portfolio that maximizes expected return for a given level of risk (variance).</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> `Energy = (Target_Risk - Portfolio_Risk)² - (Portfolio_Return)`. The TSU will sample portfolios that minimize this energy, finding states with low risk and high return.</p>
</div>
<!-- Problem 6: Supply Chain Optimization -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">6. Supply Chain Optimization</h3>
<p class="text-gray-400 mb-3">Find the optimal flow of goods from factories to warehouses to customers to minimize cost.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> `Energy = Total_Shipping_Cost + Total_Storage_Cost`. Add `High Energy` penalties for routes that exceed warehouse capacity or miss delivery deadlines.</p>
</div>
<!-- Problem 7: Image Denoising -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">7. Image Denoising</h3>
<p class="text-gray-400 mb-3">Given a grainy or corrupted image, reconstruct the clean, original version.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> Assign `Low Energy` if a pixel's value is similar to its neighbors (smoothness) *and* similar to the original noisy pixel (data fidelity). The TSU "settles" on the clean image.</p>
</div>
<!-- Problem 8: Protein Folding -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">8. Protein Folding</h3>
<p class="text-gray-400 mb-3">Predict the 3D structure of a protein from its amino acid sequence.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> The energy function *is* the physics model of atomic bonds. The TSU samples 3D configurations to find the one with the minimum physical (free) energy, which is the stable, folded state.</p>
</div>
<!-- Problem 9: Molecular Binding (Drug Discovery) -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">9. Molecular Binding</h3>
<p class="text-gray-400 mb-3">Out of millions of potential drug molecules, which one will "fit" best into a target protein's binding site?</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> Assign `Low Energy` to a drug molecule's shape and charge that perfectly complements the protein's binding site. The TSU samples molecules to find the lowest-energy (best-fit) candidate.</p>
</div>
<!-- Problem 10: Network Design -->
<div class="bg-card p-6 rounded-lg border border-gold-faded transition-all hover:border-gold">
<h3 class="text-xl font-bold text-white mb-2">10. Network Design (5G/Fiber)</h3>
<p class="text-gray-400 mb-3">Design a telecommunications network that maximizes coverage and bandwidth while minimizing latency and cost.</p>
<p class="text-gold"><b class="text-white">EBM Frame:</b> `Energy = (Cost_of_Cable + Latency)`. Add `High Energy` penalties for any (user, bandwidth) pair that fails to meet its minimum service-level agreement (SLA).</p>
</div>
</div>
</section>
<!-- Section 5: Call to Action -->
<section class="text-center py-16">
<h2 class="text-4xl font-bold text-gold mb-6">Start Building the Future.</h2>
<p class="text-xl text-gray-300 max-w-2xl mx-auto mb-8">
This hardware is coming. The best way to prepare is to master the software that simulates it.
</p>
<ol class="text-lg text-gray-400 space-y-4 mb-12">
<li>1. Explore the <b class="text-white">`extropic-ai/thrml`</b> repository on GitHub.</li>
<li>2. Pick one of the 10 problems above.</li>
<li>3. Start writing the energy function.</li>
</ol>
<a href="https://github.com/extropic-ai/thrml" target="_blank" rel="noopener noreferrer"
class="inline-block bg-gold text-black font-bold text-lg px-10 py-4 rounded-lg transition-transform hover:scale-105">
Explore the `thrml` Simulator
</a>
</section>
</main>
<!-- Footer -->
<footer class="text-center py-12 border-t border-gold-faded">
<p class="text-gray-500">A new paradigm in artificial intelligence, built on the laws of thermodynamics.</p>
</footer>
</body>
</html>