What does Plum-Blossom Hashes and Base Rates conclude, in numbers, about “Date-Time Casting as a Hash: Only Half of 384 Slots Are Ever Hit”?
Answer: Chapter 1 proves that the 51,840 combinations of year, month, day and hour reach only 192 of 384 designed slots, because the lower trigram and the moving line come from one total divided by 8 and by 6 and so share a parity; the output entropy is only 7.499 bits, and a day has only 12 results.
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: 12, 192, 384, 51840, 7.499
| inputs (year, month, day, hour) | 51,840 |
| output slots, 64 hexagrams x 6 lines | 384 |
| slots ever reached (image size) | 192 |
| hexagrams reached, moving line ignored | 64 |
| inputs per reached slot: min 153, max 384, median 336 | |
| input entropy log2(inputs) 15.662 bits | |
| ceiling log2(384) 8.585 bits | |
| ceiling of the image log2(192) | 7.585 bits |
| output entropy, uniform inputs | 7.499 bits |
| distinct outputs inside one day | 12 |
| moving line has the parity of the lower trigram: True | |
Show the full program
# Chapter 1. p11: date-time casting as a hash into 384 slots; its image.
# Rule as printed in the Meihua Yishu tradition: upper trigram = (year
# branch + lunar month + lunar day) mod 8, lower trigram = (that + hour
# branch) mod 8, moving line = (that total) mod 6, a remainder of 0 read
# as 8 or 6; trigrams numbered Qian 1 Dui 2 Li 3 Zhen 4 Xun 5 Kan 6
# Gen 7 Kun 8. Domain (illustrative): 12 year branches x 12 months x 30
# days x 12 double-hours, every month taken as 30 days. Exact count.
import math
from collections import Counter
def cast(y, m, d, h):
a = y + m + d
t = a + h
return (a % 8 or 8, t % 8 or 8, t % 6 or 6)
def main():
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):
cnt[cast(y, m, d, h)] += 1
n = 12 * 12 * 30 * 12
sizes = sorted(cnt.values())
h_out = -math.fsum(c / n * math.log2(c / n) for c in sizes)
print("inputs (year, month, day, hour) {:>8,}".format(n))
print("output slots, 64 hexagrams x 6 lines {:>8}".format(64 * 6))
print("slots ever reached (image size) {:>8}".format(len(cnt)))
print("hexagrams reached, moving line ignored{:>8}".format(
len({(u, lo) for u, lo, _ in cnt})))
print("inputs per reached slot: min {}, max {}, median {}".format(
sizes[0], sizes[-1], sizes[len(sizes) // 2]))
print("input entropy log2(inputs) {:>8.3f} bits".format(
math.log2(n)))
print("ceiling log2(384) {:>8.3f} bits".format(
math.log2(384)))
print("ceiling of the image log2(192) {:>8.3f} bits".format(
math.log2(len(cnt))))
print("output entropy, uniform inputs {:>8.3f} bits".format(
h_out))
one_day = {cast(5, 12, 17, h) for h in range(1, 13)}
print("distinct outputs inside one day {:>8}".format(
len(one_day)))
par = all((lo - mv) % 2 == 0 for _, lo, mv in cnt)
print("moving line has the parity of the lower trigram: {}".format(
par))
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 1: Date-Time Casting as a Hash: Only Half of 384 Slots Are Ever Hit. 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
- Chapter 2 · Same Double-Hour, Same Hexagram: the Birthday Problem and Crowd Degeneracy
- Chapter 3 · The Body-Use Rule Is Subtraction Modulo 5: a Five-State Automaton and Its Verdicts
- Chapter 4 · Forking Paths through Season, Nucleus and Change: How Often One Figure Supports Both Verdicts
- Chapter 5 · Base Rates of the External Omen: Partitions of Symbols, a Poisson Clock and Attention Capture
- Chapter 6 · What a Fit Found After the Fact Is Worth: Likelihood Ratios, Selective Memory and Barnum Sentences
- Chapter 7 · The Sources Examined: the Plum-Viewing Case, Wang Chong on Divination and Ghosts, and Bacon's Votive Tablets
- Chapter 8 · Practice and Refutation: a Copy Checker, Pre-Registered Tests and the Conditions That Would Overturn This Book