AUMA

Universal Maximization in Polynomial Budget

O(n^a) evaluations — every one counts

𝑓

Any Formula

Python math expressions. Reals, integers, complex, categoricals.

Fourier-Guided

Order-1 probing reveals variable structure in 2n+1 evals.

n^a

Polynomial Budget

You set the exponent. We spend exactly ceil(n^a) evaluations.

▶ Try it

x²+y²=25 Factor 1488391 z²+1=0 sin+cos z&sup5;+z+1=0 Rosenbrock

Formula (maximize this)

Variables (JSON)

Variable Names Budget Exponent (a)

⛏ Bitcoin Mining — Bernoulli BFL

AUMA Fourier probing vs brute force SHA-256d mining. BFL (Brute Force Leverage) = observed hits / expected hits. E[BFL]=1 for random. BFL>1 = AUMA beats brute force. Stacking: each eval blasts N merkle roots at the Fourier-chosen location.

Quick Test Nonce Battle Joint Exploration Full Comparison Stacked Merkle

Strategy

Budget (evals)

Lambda (difficulty threshold)

Merkle Samples (N per eval)

Strategy	Evals	Hits	E[Hits]	BFL	p-value	Zeros	ms

Paper API Docs Snake Sudoku PolySAT