Paste your code
Python · C++ · JavaScript
Temperature:
K
Array size n:
How it works
D3 framework
The analyser identifies irreversible operations — assignments, comparisons, overwrites — and counts how many bits are erased per execution.
Irreversible (bits erased):
x = 5 ← 1 assignment
arr[i] = arr[j] ← 1 overwrite
if a > b ← 1 comparison
hash(x) ← many bits
Reversible (zero cost):
Toffoli gate ← 0 bits erased
Fredkin gate ← 0 bits erased
Quantum circuit ← 0 bits erased
x = 5 ← 1 assignment
arr[i] = arr[j] ← 1 overwrite
if a > b ← 1 comparison
hash(x) ← many bits
Reversible (zero cost):
Toffoli gate ← 0 bits erased
Fredkin gate ← 0 bits erased
Quantum circuit ← 0 bits erased
Landauer limit: E ≥ kB·T·ln2 per bit
D3 limit: r ≥ 2G·kB·T·ln2/c⁴ per bit
Universal ratio: D3/Landauer = 2G/c⁴ = 1.65×10⁻⁴⁴ m/J
D3 limit: r ≥ 2G·kB·T·ln2/c⁴ per bit
Universal ratio: D3/Landauer = 2G/c⁴ = 1.65×10⁻⁴⁴ m/J
Analysis results
Complete