What does Four-Pillar Computation conclude, in numbers, about “The Yuanhai ziping, the Sanming tonghui and the Ditian sui”?
Answer: The *Yuanhai ziping* takes the day as master, and the ten gods are coordinates on \(\mathbb{Z}_5 \times \mathbb{Z}_2\) with the day stem at the origin. The days in command of the *Sanming tonghui* and other books fill thirty days each month but disagree with the hidden-stem list in five branches; the 18, 9 and 3 days of the storage branches are the 0.6, 0.3 and 0.1 common in software. The working rules for the start of luck assume a 360-day year. The *Ditian sui* treats strength as the key of the art, and Chapter 5 shows that it is also the step most dependent on convention.
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. printed values that match the answer: 0.1, 0.3, 0.6, 18, 360
| branch days (stem:days) only in days only in list | |
| zi ren | 10 gui:20 ren - |
| chou gui | 9 xin:3 ji:18 - - |
| yin wu | 7 bing:7 jia:16 - - |
| mao jia | 10 yi:20 jia - |
| chen yi | 9 gui:3 wu:18 - - |
| si wu | 5 geng:9 bing:16 - - |
| wu bing | 10 ji:9 ding:11 bing - |
| wei ding | 9 yi:3 ji:18 - - |
| shen wu | 10 ren:3 geng:17 - - |
| you geng | 10 xin:20 geng - |
| xu xin | 9 ding:3 wu:18 - - |
| hai wu | 7 jia:5 ren:18 wu - |
| every month sums to 30 days: True | |
| the four storage branches (chou chen wei xu) split 30 as [3, 9, 18] | |
| in all four: True | |
| year of 360.0000 days | 1 day -> 120.00 days of age, |
| 1 double-hour | 10.00 |
| year of 365.2422 days | 1 day -> 121.75 days of age, |
| 1 double-hour | 10.15 |
| Reading: the days-in-command table sums correctly but does not | |
| match the hidden-stem list in five branches; the storage branches | |
| split their 30 days 18 / 9 / 3, the same 0.6 / 0.3 / 0.1 as S2. | |
| The age glosses of the luck-cycle rule assume a 360-day year. |
Show the full program
# Chapter 7. Two classical tables read as data.
# (1) "Days in command" (one commonly printed version, as in p09): each
# month's 30 days are shared among stems. We check the sums, compare the
# stems with the hidden-stem list, and look at the proportions.
# (2) The luck-cycle rule "three days make one year": its usual glosses,
# one day = four months and one double-hour = ten days, assume a year of
# 360 days (12 months of 30). We check them against 360 and 365.2422.
BRANCHES = ("zi", "chou", "yin", "mao", "chen", "si", "wu", "wei", "shen",
"you", "xu", "hai")
STEMS = ("jia", "yi", "bing", "ding", "wu", "ji", "geng", "xin", "ren",
"gui")
HIDDEN = ((9,), (5, 9, 7), (0, 2, 4), (1,), (4, 1, 9), (2, 4, 6), (3, 5),
(5, 3, 1), (6, 8, 4), (7,), (4, 7, 3), (8, 0))
DAYS = (((8, 10), (9, 20)), ((9, 9), (7, 3), (5, 18)),
((4, 7), (2, 7), (0, 16)), ((0, 10), (1, 20)),
((1, 9), (9, 3), (4, 18)), ((4, 5), (6, 9), (2, 16)),
((2, 10), (5, 9), (3, 11)), ((3, 9), (1, 3), (5, 18)),
((4, 10), (8, 3), (6, 17)), ((6, 10), (7, 20)),
((7, 9), (3, 3), (4, 18)), ((4, 7), (0, 5), (8, 18)))
if __name__ == "__main__":
print(" branch days (stem:days) only in days"
" only in list")
for b, name in enumerate(BRANCHES):
stems = [s for s, _ in DAYS[b]]
extra = [STEMS[s] for s in stems if s not in HIDDEN[b]]
miss = [STEMS[s] for s in HIDDEN[b] if s not in stems]
cells = " ".join("{}:{}".format(STEMS[s], d) for s, d in DAYS[b])
print(" {:6s} {:28s} {:12s} {}".format(
name, cells, " ".join(extra) or "-", " ".join(miss) or "-"))
print(" every month sums to 30 days: {}".format(
all(sum(d for _, d in row) == 30 for row in DAYS)))
tomb = [sorted(d for _, d in DAYS[b]) for b in (1, 4, 7, 10)]
print(" the four storage branches (chou chen wei xu) split 30 as {}"
.format(tomb[0]))
print(" in all four: {}".format(all(t == [3, 9, 18] for t in tomb)))
for year in (360, 365.2422):
print(" year of {:8.4f} days: 1 day -> {:6.2f} days of age,"
.format(year, year / 3))
print(" 1 double-hour -> {:5.2f}".format(
year / 3 / 12))
print("\nReading: the days-in-command table sums correctly but does not")
print("match the hidden-stem list in five branches; the storage branches")
print("split their 30 days 18 / 9 / 3, the same 0.6 / 0.3 / 0.1 as S2.")
print("The age glosses of the luck-cycle rule assume a 360-day year.")Single source and citation
Fan, Y. (2026). Four-Pillar Calendrical Computation and Formal Rule Engines (Version 1.0.0), Chapter 7: The Yuanhai ziping, the Sanming tonghui and the Ditian sui. 5D Library. https://doi.org/10.5281/zenodo.24090180
DOI: 10.5281/zenodo.24090180 · Read the monograph · 5DL-B-066 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026066,
author = {Fan, Yafu},
title = {Four-Pillar Calendrical Computation and Formal Rule Engines},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090180},
url = {https://doi.org/10.5281/zenodo.24090180}
}Other chapter answers in this book
- Chapter 1 · The Julian Day and the Congruences of the Four Pillars
- Chapter 2 · Three Conventions for the Zi Hour, and True Solar Time
- Chapter 3 · Timing Errors and the Edges of the Double-Hours
- Chapter 4 · The Ten Gods Are Z5 × Z2, the Hidden Stems Weight Vectors
- Chapter 5 · Strength Is Scoring on a Weighted Graph
- Chapter 6 · Two Chart Engines and a Set of Test Vectors
- Chapter 8 · A Four-Step Check, an Agreement Study and a Pre-Registered Matching Test