5D Library › Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics · 中文

Chapter 5. Reversed Runes: A Hypergeometric-Binomial Law

Fifteen runes can be reversed, nine cannot

The Elder Futhark, the oldest runic alphabet, has 24 runes, traditionally arranged in three aettir (families) of eight (Page 1987). Modern rune divination, which dates from the twentieth century, reads a rune drawn upside down as “reversed” (merkstave) with a changed meaning (Blum 1982). But nine runes look the same when turned over: Gebo, Hagalaz, Naudhiz, Isa, Jera, Eihwaz, Sowilo, Ingwaz and Dagaz. They have no reversed reading. Only 15 runes can be read reversed.

So the number of reversed runes in a draw is not binomial with p=1/2p = 1/2, as it is often treated. Drawing nn runes without replacement, the number KK of reversible runes among them is hypergeometric with parameters (24, 15, nn); each of those KK lands reversed with probability one half, so given KK the number RR reversed is binomial (K,1/2)(K, 1/2). The exact law of RR is the mixture.

Calculation

# Chapter 5. p09: How many reversed runes in a draw? Of the 24 runes of
# the Elder Futhark, 9 look the same turned upside down (Gebo, Hagalaz,
# Naudhiz, Isa, Jera, Eihwaz, Sowilo, Ingwaz, Dagaz), so only 15 can be
# read "reversed" (merkstave). Drawing n runes without replacement, the
# number K of reversible runes is hypergeometric (24, 15, n); each lands
# reversed with probability 1/2, so R given K is binomial (K, 1/2). The
# exact law of R is compared with the common shortcut binomial (n, 1/2).
from fractions import Fraction
from math import comb

FUTHARK = ("Fehu Uruz Thurisaz Ansuz Raidho Kenaz Gebo Wunjo "
           "Hagalaz Naudhiz Isa Jera Eihwaz Perthro Algiz Sowilo "
           "Tiwaz Berkano Ehwaz Mannaz Laguz Ingwaz Dagaz Othala").split()
SAME_TURNED = {"Gebo", "Hagalaz", "Naudhiz", "Isa", "Jera", "Eihwaz",
               "Sowilo", "Ingwaz", "Dagaz"}

def exact(n, N=24, rev=15):
    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

def naive(n):
    return [Fraction(comb(n, r), 2 ** n) for r in range(n + 1)]

if __name__ == "__main__":
    rev = sum(1 for r in FUTHARK if r not in SAME_TURNED)
    print("   runes {}, reversible {}, same when turned {}".format(
        len(FUTHARK), rev, len(SAME_TURNED)))
    for n, name in ((1, "one rune"), (3, "Norns, 3"), (5, "cross, 5"),
                    (9, "nine")):
        e, b = exact(n), naive(n)
        mean = sum(r * x for r, x in enumerate(e))
        print("   {:9s}: mean reversed {:.4f} (shortcut {:.1f}, {:.1f} x)"
              .format(name, float(mean), n / 2, n / 2 / float(mean)))
        print("     r    " + "".join("{:6d}".format(r) for r in range(n + 1)))
        print("     exact" + "".join("{:6.3f}".format(float(x)) for x in e))
        print("     short" + "".join("{:6.3f}".format(float(x)) for x in b))
#    runes 24, reversible 15, same when turned 9
#    one rune : mean reversed 0.3125 (shortcut 0.5, 1.6 x)
#      r         0     1
#      exact 0.688 0.312
#      short 0.500 0.500
#    Norns, 3 : mean reversed 0.9375 (shortcut 1.5, 1.6 x)
#      r         0     1     2     3
#      exact 0.320 0.451 0.201 0.028
#      short 0.125 0.375 0.375 0.125
#    cross, 5 : mean reversed 1.5625 (shortcut 2.5, 1.6 x)
#      r         0     1     2     3     4     5
#      exact 0.146 0.354 0.327 0.143 0.029 0.002
#      short 0.031 0.156 0.312 0.312 0.156 0.031
#    nine     : mean reversed 2.8125 (shortcut 4.5, 1.6 x)
#      r         0     1     2     3     4     5     6     7     8     9
#      exact 0.028 0.132 0.261 0.286 0.190 0.079 0.020 0.003 0.000 0.000
#      short 0.002 0.018 0.070 0.164 0.246 0.246 0.164 0.070 0.018 0.002

For one rune the chance of a reversal is 0.3125, not 0.5. For the three-rune Norns spread the mean number reversed is 0.9375, not 1.5; a reading with no reversal at all has probability 0.320 against 0.125 under the shortcut, and one with all three reversed 0.028 against 0.125. For a five-rune cross the mean is 1.5625; for nine runes 2.8125, and a nine-rune cast with no reversal has probability 0.028, against 0.002 under the shortcut. The shortcut overstates reversals by a factor of 1.6 on average and badly misjudges the extremes.

Number of reversed runes in a five-rune cross: exact law against the binomial shortcut (p09).

The law, checked by casting

Calculation

# Chapter 5. p10: Casting the runes 100,000 times (seed 91). For each
# Norns reading three runes are drawn from a bag without replacement and
# each lands upright or turned with probability 1/2; a turned rune of the
# 9 symmetric ones still reads upright. Compared with the exact law of
# p09: the share of drawn runes read reversed (exactly 15/48 = 0.3125),
# and the share of "heavy" readings with two or more reversed runes
# (exactly 0.229, against 0.5 under the shortcut).
import random

FUTHARK = ("Fehu Uruz Thurisaz Ansuz Raidho Kenaz Gebo Wunjo "
           "Hagalaz Naudhiz Isa Jera Eihwaz Perthro Algiz Sowilo "
           "Tiwaz Berkano Ehwaz Mannaz Laguz Ingwaz Dagaz Othala").split()
SAME_TURNED = {"Gebo", "Hagalaz", "Naudhiz", "Isa", "Jera", "Eihwaz",
               "Sowilo", "Ingwaz", "Dagaz"}

def draw(rng, k):
    """k runes without replacement, using rng.random() only."""
    bag = list(FUTHARK)
    out = []
    for _ in range(k):
        out.append(bag.pop(int(rng.random() * len(bag))))
    return out

if __name__ == "__main__":
    rng = random.Random(91)
    n, rev_total, heavy, counts = 100000, 0, 0, [0, 0, 0, 0]
    for _ in range(n):
        r = sum(1 for rune in draw(rng, 3)
                if rng.random() < 0.5 and rune not in SAME_TURNED)
        rev_total += r
        heavy += r >= 2
        counts[r] += 1
    print("   share of drawn runes read reversed: {:.4f}".format(
        rev_total / (3 * n)))
    print("   readings by reversed count: " + " ".join(
        "{}={:.3f}".format(r, c / n) for r, c in enumerate(counts)))
    print("   readings with 2 or more reversed: {:.3f}".format(heavy / n))
    rng2 = random.Random(91)
    upright9 = sum(1 for _ in range(n)
                   if not any(rng2.random() < 0.5 and rune not in
                              SAME_TURNED
                              for rune in draw(rng2, 9)))
    print("   nine-rune casts with no reversal at all: {:.3f}".format(
        upright9 / n))
#    share of drawn runes read reversed: 0.3132
#    readings by reversed count: 0=0.319 1=0.451 2=0.201 3=0.029
#    readings with 2 or more reversed: 0.230
#    nine-rune casts with no reversal at all: 0.028

In 100,000 simulated Norns readings, 0.3132 of drawn runes were read reversed (exactly 0.3125); the shares of readings with 0, 1, 2 and 3 reversals were 0.319, 0.451, 0.201 and 0.029, matching the exact law; readings “heavy” with two or more reversals made up 0.230 (exactly 0.229, against 0.5 under the shortcut); and 0.028 of nine-rune casts showed no reversal at all.

Note

Reversal is a modern convention. Runic inscriptions were written in many orientations, and nothing in them or in the medieval rune poems assigns a separate meaning to an upside-down rune. The reversed reading and the list of runes that “cannot” reverse belong to modern divination; the arithmetic in this chapter describes that practice, not ancient usage.

Summary

Only 15 of the 24 Elder Futhark runes can be reversed, so a drawn rune is reversed with probability 0.3125, a Norns reading shows no reversal with probability 0.320 (not 0.125), and the mean number reversed is 0.9375 (not 1.5). The binomial shortcut with one half is wrong for every spread.

References

Blum, Ralph. 1982. The Book of Runes. St. Martin’s Press.
Page, R. I. 1987. Runes. Reading the Past. British Museum Publications.

Fan, Y. (2026). Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics: Constraint Satisfaction Paradoxes, Solar-Term Phase Jumps and Elder Futhark Inversion Distributions [黄历择吉布尔格、建除十二直同余与卢恩符文组合学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090239 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).