What does Almanac Lattices, Jianchu Congruences and Runes conclude, in numbers, about “What a Reversal Can Say, and How Much the Rune Set Matters”?
Answer: A Norns reading shows no reversal with probability 0.3197, 2.56 times the shortcut. Reversals come mostly from the first and third aettir, because most second-aett runes are symmetric. Variants of the rune set move the numbers a little (mean 0.8750 to 1.0000), and none of them comes close to the shortcut.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.3197, 0.8750, 1.0000
| stones reversible | mean | P(none) | readings to tell | |
| 24 | 15 | 0.9375 | 0.3197 | 16 |
| 24 | 14 | 0.8750 | 0.3498 | 13 |
| 24 | 16 | 1.0000 | 0.2915 | 21 |
| 25 | 15 | 0.9000 | 0.3378 | 14 |
Show the full program
# Chapter 6. p12: How much the answer depends on the rune set. Modern
# sets differ: some add a blank rune (25 stones, the blank never
# reversed), and makers draw some runes so that 14 or 16 of them look
# different turned over. For each variant: the mean number reversed in a
# Norns reading of 3, the chance of none, and the readings a sceptic
# would need to tell the exact law from the shortcut binomial (3, 1/2)
# by the mean, two-sided alpha 0.05, power 0.80.
import math
from fractions import Fraction
from math import comb
from statistics import NormalDist
def law(n, N, rev):
p = [Fraction(0)] * (n + 1)
for k in range(max(0, n - (N - rev)), min(n, rev) + 1):
pk = Fraction(comb(rev, k) * comb(N - rev, n - k), comb(N, n))
for r in range(k + 1):
p[r] += pk * Fraction(comb(k, r), 2 ** k)
return p
if __name__ == "__main__":
z = NormalDist().inv_cdf(0.975) + NormalDist().inv_cdf(0.80)
print(" stones reversible mean P(none) readings to tell")
for N, rev in ((24, 15), (24, 14), (24, 16), (25, 15)):
p = law(3, N, rev)
mean = float(sum(r * x for r, x in enumerate(p)))
var = float(sum(r * r * x for r, x in enumerate(p))) - mean ** 2
n = math.ceil((z * math.sqrt(var) / (1.5 - mean)) ** 2)
print(" {:6d} {:9d} {:.4f} {:.4f} {:8d}".format(
N, rev, mean, float(p[0]), n))Single source and citation
Fan, Y. (2026). Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics (Version 1.0.0), Chapter 6: What a Reversal Can Say, and How Much the Rune Set Matters. 5D Library. https://doi.org/10.5281/zenodo.24090239
DOI: 10.5281/zenodo.24090239 · Read the monograph · 5DL-B-091 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026091,
author = {Fan, Yafu},
title = {Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090239},
url = {https://doi.org/10.5281/zenodo.24090239}
}Other chapter answers in this book
- Chapter 1 · Almanac Rules as Boolean Predicates, and the Vanishing Pure Day
- Chapter 2 · The Twelve Officers as a Piecewise Congruence, and Which Day Is the Jie Day
- Chapter 3 · Joint Periods: Stem-Branch Days, the Twenty-Eight Lodges and the Week
- Chapter 4 · Satisfiability: When No Day Is Acceptable, and When Every Day Is Both
- Chapter 5 · Reversed Runes: A Hypergeometric-Binomial Law
- Chapter 7 · The Shuihudi Daybooks, the Qing Imperial Compilation on Day Selection, and the Runes of Havamal
- Chapter 8 · Auditing an Almanac App and a Pre-Registered Test