Exact Binary Runs Test

How to use Exact Binary Runs Test

Count changes between adjacent symbols, enumerate the possible run-count frequencies by exact compositions of the two fixed class counts, then form the chosen inclusive tail. The entire distribution must sum to its binomial sample space.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Count changes between adjacent symbols, enumerate the possible run-count frequencies by exact compositions of the two fixed class counts, then form the chosen inclusive tail. The entire distribution must sum to its binomial sample space.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• A separator-free string of 2–200 zero/one symbols with both classes present. Alternatives are fewer, more and twice-smaller-tail two-sided; no normal approximation is used.
• No median dichotomization, inferred missing values, cryptographic randomness certification, automatic significance decision or proof of randomness. Exchangeability conditional on the class counts is the declared null model.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.