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

Preface: Days, Officers and Runes, Counted

Note

Please read this first. This book studies the structure of Chinese almanac day selection and of modern rune casting as calendar algebra and combinatorial probability. It does not claim that any day is lucky or unlucky, or that runes foretell anything. The calendar facts (stem-branch days, solar terms, lodges) are computed from published astronomical data; the selection of rules, the list of unfavourable lodges and the two people’s birth years are illustrative models; all data are generated by the programs printed in the book. The book is not religious, legal or financial advice.

Volume 66 computed the four pillars and their calendar boundaries. This book turns to the almanac’s daily verdicts and to the rune spreads sold beside them. Each comes with a common belief: that an expert almanac can always find a perfectly clean day; that the twelve officers simply cycle; that a lucky date stays lucky; and that a drawn rune is reversed half the time. This book writes them as runnable arithmetic and then asks when they hold.

What the book contains

Chapter 1 writes almanac rules as Boolean predicates on the days of 2027 and stacks them, and compares two schools. Chapter 2 writes the twelve officers as a piecewise congruence and asks which day is the jie day. Chapter 3 computes the joint periods of stem-branch days, lodges and the week, and whether a date’s verdict carries to the next year, and Chapter 4 treats day selection as a satisfiability problem. Chapter 5 derives the exact law of reversed runes in the Elder Futhark, and Chapter 6 its consequences and its sensitivity to the rune set. Chapter 7 reads the Shuihudi daybooks, the Qing imperial compilation on day selection and the Havamal. Chapter 8 gives an audit of almanac apps and a pre-registered test.

Claims corrected on checking

  1. A perfectly clean day is often impossible. Seven rule sets leave 33 pure days in 2027 (0.090); in 0.496 of weeks no day is clean at all, and adding rules drives the share towards zero (p01, p07).
  2. Schools disagree because they choose different rules. Two schools built from the same components agree barely beyond chance (kappa 0.050), and 0.690 of days carry both good and bad marks (p02, p08).
  3. The officers do not simply cycle. They repeat at each jie; a plain cycle is wrong on 336 days of 2027, and almanacs for Tokyo or Los Angeles differ from Beijing’s on 1 and 8 days (p03, p04). Which officer repeats at Lichun depends on the year: in 2027 it is jian.
  4. A lucky date is not lucky again next year. Stem-branch days and lodges share a 420-day period; the same date gets the same verdict in 2027 and 2028 only 0.685 of the time, against 0.619 by chance (p05, p06).
  5. A rune is reversed with probability 0.3125, not one half. Nine of the 24 runes look the same upside down; a Norns reading shows no reversal with probability 0.320 rather than 0.125 (p09, p11).
  6. The Havamal says nothing of reversed runes, and rival almanac schools are as old as the officers. The Shuihudi daybook already copied two systems side by side (Chapter 7).

How to read the boxes

Marked boxes separate published evidence, runnable Python calculations (16 programs, standard library only, fixed random seeds, each actually run at build time with its real output printed below it), classical sources, notes and the author’s hypotheses; every hypothesis states what result would show it wrong. Programs and their output use ASCII characters only.

Disclosure

The author uses the works of 5D Library, including this book, as the methodological basis of his community courses, the 5D Ascension Cards (Dimensional Shift Card Decks) and the Yafu AI knowledge base, and runs a number of websites, including a day-selection and direction site, paid online reading software, subscriptions, reports, courses, business licences and advisory services, so he has a direct commercial interest in the subject of this book. The book promotes no software, course, card deck or service, uses no user data from the author’s businesses, and accepts no sponsorship. Its parameters are synthetic or illustrative. The test in Chapter 8 must follow a pre-registered protocol, and its results will be published whether positive or negative.

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).