Predictability

Conditional entropy, memory depth, sample entropy
temporaldim information6 metrics

What It Measures

How much does knowing the past help predict the future?

Computes conditional entropy H(X_t | X_{t-1}, ..., X_{t-k}) at increasing depths k = 1, 2, 4, 8. If the conditional entropy drops as you add more history, the signal has memory — past values constrain the future. Also includes sample entropy (SampEn), a phase-space regularity measure.

Metrics

excess_predictability

Total information gain from knowing the past 8 values: H(X) - H(X | past_8). De Bruijn sequence scores 3.0 (maximally predictable — it's constructed so every 8-bit pattern appears exactly once, making the next bit deterministic given the last 7). Hilbert walk (2.90) and sawtooth (2.89) are nearly as predictable. White noise scores 0.0 (the past tells you nothing).

sample_entropy

Regularity of the phase-space trajectory. Low = self-similar, predictable. High = complex, unpredictable. Pi digits (2.22) and BSL residues (2.21) are the most irregular signals in the atlas — close to the theoretical maximum for byte-valued data. Devil's staircase scores 0.019 (nearly zero — its long constant plateaus create trivially self-similar trajectories). Constants score exactly 0.0.

entropy_decay_rate

How fast does conditional entropy decrease with depth? Baker map has the steepest positive slope (0.26): it reveals more structure at each depth. De Bruijn has the steepest negative slope (-0.31): it becomes maximally predictable at depth 7 and the entropy collapses. Near zero means either unpredictable at all depths (noise) or already fully predicted at depth 1 (simple periodic).

cond_entropy_k1

Conditional entropy at depth 1: H(X_t | X_{t-1}). White noise scores ~3.0 (knowing the previous value tells you nothing). Logistic period-3 scores 0.0 (the previous value fully determines the next). This is the simplest predictability measure — first-order Markov constraint.

cond_entropy_k8

Conditional entropy at depth 8: H(X_t | X_{t-1},...,X_{t-8}). The gap between k1 and k8 reveals hidden long-range dependencies — PRNG outputs score identically at k1 and k8 (memoryless), while the baker map drops from 2.8 to 2.3 (its 2D structure creates long-range predictability invisible at lag 1).

transition_entropy_variance

Variance of per-context conditional entropy across all observed symbol contexts. Champernowne (0.125) scores highest — some contexts are highly predictable while others are maximally uncertain. Middle-Square (0.071) and Intermittent Silence (0.085) also score high. Constants and periodic orbits score 0.0 (all contexts equally predictable). This captures heterogeneity in predictability: a signal with low mean conditional entropy but high variance has pockets of both predictable and unpredictable structure.

Atlas Rankings

cond_entropy_k1
SourceOriginValue
Arnold Cat Mapiterated-maps2.9977
XorShift32algorithmic-bytes2.9977
Wichmann-Hillalgorithmic-bytes2.9976
···
Logistic r=3.2 (Period-2)iterated-maps0.0000
Logistic r=3.83 (Period-3 Window)iterated-maps0.0000
Logistic r=3.74 (Period-5 Window)iterated-maps0.0000
cond_entropy_k8
SourceOriginValue
MINSTD (Park-Miller)algorithmic-bytes2.9998
MT19937 (Mersenne Twister)algorithmic-bytes2.9998
√2 Digitsnumber-theory2.9998
···
Logistic r=3.2 (Period-2)iterated-maps0.0000
Sine Map (Feigenbaum)iterated-maps0.0000
Logistic r=3.83 (Period-3 Window)iterated-maps0.0000
entropy_decay_rate
SourceOriginValue
Sunspot Numberastrophysical0.1954
Network Packet Sizesalgorithmic-bytes0.1717
Shuffled Blocksstochastic-process0.1521
···
De Bruijn Sequencesymbolic-dynamics-0.3130
Copeland-Erdősnumber-theory-0.3053
Champernownenumber-theory-0.2172
excess_predictability
SourceOriginValue
De Bruijn Sequencesymbolic-dynamics3.0000
Riemann-Hardy-Littlewoodnumber-theory2.9204
Hilbert Walksymbolic-dynamics2.8961
···
Pink Noisestochastic-process0.0000
Blue Noisestochastic-process0.0000
ARMA(2,1)stochastic-process0.0000
sample_entropy
SourceOriginValue
Earthquake Magnitudesgeophysical2.3584
Ramanujan Taunumber-theory2.2412
Wigner Semicirclerandom-matrix-quantum2.2365
···
OTOC Growthrandom-matrix-quantum0.0025
Mian-Chowlanumber-theory0.0100
Sawtooth Wavesignal-synthesis0.0193
transition_entropy_variance
SourceOriginValue
Champernownenumber-theory0.1319
Intermittent Silencestochastic-process0.0847
Intermittency Type-IIiterated-maps0.0685
···
Logistic r=3.83 (Period-3 Window)iterated-maps0.0000
Logistic r=3.2 (Period-2)iterated-maps0.0000
Logistic r=3.74 (Period-5 Window)iterated-maps0.0000

When It Lights Up

Predictability's sample_entropy and entropy_decay_rate were key discriminators in the negative re-evaluation study (2026-03-05). Standard map (44 significant metrics), Arnold cat (19), and GARCH (29) were reclassified from negative to positive detections largely on Predictability metrics. Sample entropy distinguishes deterministic chaos (moderate, ~1.5) from true noise (high, ~2.2) and periodicity (low, <0.5).

Open in Atlas
← BoltzmannNonstationarity →