What does Plum-Blossom Hashes and Base Rates conclude, in numbers, about “Same Double-Hour, Same Hexagram: the Birthday Problem and Crowd Degeneracy”?

Answer: Chapter 2 computes collisions: two people casting at random on the same day share a figure with probability 0.0833, and a crowd in one double-hour shares it entirely; across a year the actual rule makes pairs collide 2.232 times as often as an ideal hash, and 16 people make a collision more likely than not.

Scope of the numbers: Population shares, attention rates and memory rates are illustrative; all calculations are generated by the book's programs; the book analyses structure and probability, makes no personal reading, and is not business, legal or financial advice. Marked boxes separate published evidence, runnable Python calculations (18 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: 16, 2.232

hashpair-pn50%distinctdistinct
in 30in 100
ideal, 384 slots0.002602428.988.1
ideal, 192 slots0.005211727.878.1
date-time rule0.005811627.676.3
pair-p ratio, rule / ideal 384: 2.232
Show the full program
# Chapter 2. p22: the birthday problem in hexagram space, across a year.
# Casting times drawn uniformly from the 51,840 date-times of p11 give a
# non-uniform law on 192 slots. We compare three hashes: an ideal one on
# all 384 slots, an ideal one on 192, and the real date-time rule; for
# each, the collision probability of a pair (the sum of p squared), the
# group size at which a shared output becomes more likely than not, and
# the expected number of distinct outputs in a group. Exact arithmetic.
import math
from collections import Counter
from fractions import Fraction


def law():
    cnt = Counter()
    for y in range(1, 13):
        for m in range(1, 13):
            for d in range(1, 31):
                for h in range(1, 13):
                    a = y + m + d
                    t = a + h
                    cnt[(a % 8 or 8, t % 8 or 8, t % 6 or 6)] += 1
    n = 12 * 12 * 30 * 12
    return [Fraction(cnt[k], n) for k in sorted(cnt)]


def no_clash(ps, n):
    e = [Fraction(1)] + [Fraction(0)] * n
    for p in ps:
        for k in range(n, 0, -1):
            e[k] += e[k - 1] * p
    return math.factorial(n) * e[n]


def report(name, ps):
    pair = math.fsum(float(p * p) for p in ps)
    n = 2
    while no_clash(ps, n) > Fraction(1, 2):
        n += 1
    d30 = math.fsum(1 - (1 - float(p)) ** 30 for p in ps)
    d100 = math.fsum(1 - (1 - float(p)) ** 100 for p in ps)
    print("{:<22} {:>7.5f} {:>6} {:>9.1f} {:>9.1f}".format(
        name, pair, n, d30, d100))


def main():
    print("hash                   pair-p  n50%  distinct  distinct")
    print("                                     in 30    in 100")
    report("ideal, 384 slots", [Fraction(1, 384)] * 384)
    report("ideal, 192 slots", [Fraction(1, 192)] * 192)
    report("date-time rule", law())
    print("pair-p ratio, rule / ideal 384: {:.3f}".format(
        math.fsum(float(p * p) for p in law()) * 384))


if __name__ == "__main__":
    main()

Single source and citation

Fan, Y. (2026). Plum-Blossom Numerology as a Body-Use Automaton, Hash Collisions in Date-Time Casting and Base Rates of Attention-Captured Omens (Version 1.0.0), Chapter 2: Same Double-Hour, Same Hexagram: the Birthday Problem and Crowd Degeneracy. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-156 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026156,
  author    = {Fan, Yafu},
  title     = {Plum-Blossom Numerology as a Body-Use Automaton, Hash Collisions in Date-Time Casting and Base Rates of Attention-Captured Omens},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book