cargo
Rust package manager (36 subcommands).
kolmogorov-onsager-hurst
Turbulence scaling theory: K41 energy cascade, Onsager's anomalous dissipation, and Hurst exponent for long-range dependence
Full skill instructions
"Big whirls have little whirls that feed on their velocity, and little whirls have lesser whirls and so on to viscosity." — Lewis Fry Richardson (1922)
This skill connects three foundational concepts in scaling theory:
| Contributor | Year | Key Insight |
|---|---|---|
| Kolmogorov | 1941 | E(k) ~ k^(-5/3) energy spectrum |
| Onsager | 1949 | Anomalous dissipation at Hölder h ≤ 1/3 |
| Hurst | 1951 | H exponent measures long-range dependence |
Kolmogorov's 1941 theory (K41) describes turbulent flow:
Energy injection (large scales)
↓
Inertial range: E(k) ~ ε^(2/3) k^(-5/3)
↓
Dissipation (viscous scales)
Where:
k = wavenumber (inverse length scale)
ε = energy dissipation rate
E(k) = energy spectrum
import numpy as np
def kolmogorov_spectrum(k, epsilon=1.0, C_K=1.5):
"""
Kolmogorov energy spectrum E(k) = C_K * ε^(2/3) * k^(-5/3)
Args:
k: wavenumber array
epsilon: energy dissipation rate
C_K: Kolmogorov constant (~1.5)
Returns:
Energy spectrum E(k)
"""
return C_K * (epsilon ** (2/3)) * (k ** (-5/3))
Lars Onsager conjectured that:
Hölder continuity: |v(x) - v(y)| ≤ C |x - y|^h
h > 1/3 → Energy conserved (Euler equations)
h = 1/3 → Critical threshold (K41 prediction)
h < 1/3 → Anomalous dissipation possible
Onsager's conjecture was proven in stages:
This work contributed to Fields Medal recognition.
The Hurst exponent H ∈ (0, 1) measures persistence in time series:
H = 0.5 → Random walk (Brownian motion, no memory)
H > 0.5 → Persistent (trending, positive correlation)
H < 0.5 → Anti-persistent (mean-reverting, negative correlation)
For K41 turbulence, velocity increments have H = 1/3:
Structure function: S_p(r) = <|v(x+r) - v(x)|^p> ~ r^(ζ_p)
K41 prediction: ζ_p = p/3
For p=2: ζ_2 = 2/3
Hurst exponent H = ζ_2 / 2 = 1/3
import numpy as np
def hurst_rs(series):
"""
Estimate Hurst exponent via R/S analysis.
Returns H where:
H = 0.5: random walk
H > 0.5: persistent (trending)
H < 0.5: anti-persistent (mean-reverting)
"""
n = len(series)
if n < 20:
return 0.5
max_k = int(np.log2(n)) - 1
rs_values = []
ns = []
for k in range(2, max_k + 1):
size = n // (2 ** k)
if size < 4:
break
rs_list = []
for i in range(2 ** k):
subseries = series[i * size:(i + 1) * size]
mean = np.mean(subseries)
cumdev = np.cumsum(subseries - mean)
R = np.max(cumdev) - np.min(cumdev)
S = np.std(subseries, ddof=1)
if S > 0:
rs_list.append(R / S)
if rs_list:
rs_values.append(np.mean(rs_list))
ns.append(size)
if len(ns) < 2:
return 0.5
# Linear regression in log-log space
log_n = np.log(ns)
log_rs = np.log(rs_values)
slope, _ = np.polyfit(log_n, log_rs, 1)
return slope
def hurst_dfa(series, order=1):
"""
Detrended Fluctuation Analysis (DFA) for Hurst estimation.
More robust than R/S for non-stationary series.
"""
n = len(series)
cumsum = np.cumsum(series - np.mean(series))
scales = []
flucts = []
for scale in range(10, n // 4):
segments = n // scale
if segments < 1:
break
local_trends = []
for seg in range(segments):
start = seg * scale
end = start + scale
segment = cumsum[start:end]
# Detrend with polynomial
x = np.arange(scale)
coeffs = np.polyfit(x, segment, order)
trend = np.polyval(coeffs, x)
local_trends.append(np.sqrt(np.mean((segment - trend) ** 2)))
scales.append(scale)
flucts.append(np.mean(local_trends))
if len(scales) < 2:
return 0.5
log_scales = np.log(scales)
log_flucts = np.log(flucts)
slope, _ = np.polyfit(log_scales, log_flucts, 1)
return slope
┌─────────────────────────────────────────────────────────────────────┐
│ KOLMOGOROV-ONSAGER-HURST TRIAD │
├─────────────────────────────────────────────────────────────────────┤
│ │
│ KOLMOGOROV (Spectrum) ONSAGER (Regularity) HURST (Memory) │
│ ──────────────────── ───────────────────── ─────────────── │
│ E(k) ~ k^(-5/3) Hölder h = 1/3 H = 1/3 │
│ │
│ Energy cascade Critical roughness Persistence │
│ Inertial range Dissipation threshold Structure fn │
│ │
│ ────────────────── EQUIVALENCE RELATIONS ────────────────────── │
│ │
│ Spectral exponent β = 2H + 1 = 5/3 │
│ Hölder exponent h = H = 1/3 │
│ Fractal dimension D = 2 - H = 5/3 │
│ │
└─────────────────────────────────────────────────────────────────────┘
β = 2H + 1 (spectral exponent ↔ Hurst)
h = H (Hölder ↔ Hurst for fBm)
D = 2 - H (fractal dimension ↔ Hurst)
For K41: H = 1/3
→ β = 5/3 ✓ (Kolmogorov spectrum)
→ h = 1/3 ✓ (Onsager threshold)
→ D = 5/3 ✓ (fractal dimension)
def market_regime(prices):
"""
Classify market regime by Hurst exponent.
"""
returns = np.diff(np.log(prices))
H = hurst_dfa(returns)
if H > 0.55:
return "TRENDING", H
elif H < 0.45:
return "MEAN_REVERTING", H
else:
return "RANDOM_WALK", H
Long-range dependence in network traffic (Leland et al. 1994):
Trit: -1 (MINUS/Validator)
kolmogorov-onsager-hurst measures and validates scaling properties.
It quantifies rather than generates.
GF(3) Triads:
kolmogorov-onsager-hurst (-1) ⊗ langevin-dynamics (0) ⊗ fokker-planck-analyzer (+1) = 0 ✓
kolmogorov-onsager-hurst (-1) ⊗ bifurcation-generator (0) ⊗ lyapunov-function (+1) = 0 ✓
kolmogorov-onsager-hurst (-1) ⊗ structural-stability (0) ⊗ attractor (+1) = 0 ✓
Home: Prof (profunctor category)
Poly Op: ⊗ (tensor)
Kan Role: Ran (right Kan extension - measurement/observation)
The Hurst exponent acts as a RIGHT adjoint:
Ran_H(Turbulence) = Scaling Law
Measuring H from data is computing a limit (right Kan extension).
/kolmogorov-onsager-hurst
Analyzes time series for scaling properties and regime classification.
Rust package manager (36 subcommands).
Translate Figma nodes into production-ready code with 1:1 visual fidelity using the Figma MCP workflow (design context, screenshots, assets, and project-convention translation). Trigger when the user provides Figma URLs or node IDs, or asks to implement designs or components that must match Figma...
**Status**: 🌳 Production Ready (upstream in StringZilla v3+) **Type**: High-Performance String Operations / SIMD-Accelerated Text Processing **Principle**: Zero-copy views, SIMD/SWAR acceleration, deterministic hashing **Frame**: Cross-language interoperability (C, C++, Python, Rust, Go, Swift, ...
Conformal Geometric Algebra (CGA) for circles, spheres, and Möbius transformations
Verifies code implements exactly what documentation specifies for blockchain audits. Use when comparing code against whitepapers, finding gaps between specs and implementation, or performing compliance checks for protocol implementations.
Systems programming and performance optimization using Zig. Provides low-level abstractions, memory-safe compiled code, and performance benchmarking. Use for system-level operations, optimization, and interoperability with C/POSIX APIs.
Topological soliton detection and agency bridge with anyonic fusion algebra for concept composition
PayPal MCP server integration for invoices, payments, subscriptions, disputes, and transaction reporting via @paypal/mcp.
Unison language - content-addressed functional programming with abilities for effects, distributed computing, and structural types. Use for pure functional code, effect management, distributed systems, and refactoring-safe codebases.
Google Tasks management via TasksACSet. Transforms task operations into GF(3)-typed Interactions, routes to triadic queues, detects saturation for task-zero-as-condensed-state.
World C Skill
Syrup binary serialization for OCapN/CapTP wire format. Canonical encoding for capability messages.
Generate, edit, and beat-sync AI video with leading models in one workspace.
The world's fastest calendar for remote work
Transform Your Design with AI Designer by ImgCreator.ai
Revolutionizing Video Production with AI-Powered Creativity
Extend an image past the frame and let AI fill the new aspect ratio.
Discover your celebrity doppelgänger with StarByFace!
ChainClarity explains 700+ crypto whitepapers in plain English, with layered summaries, comparisons, research tools, alerts, and a $4.99 Pro plan.
Opus.ai: Revolutionize Your Web Experience