What does Boundary Hours, Twins and Bone Weight conclude, in numbers, about “Bone Weight, the Heavier Half: 4 Liang 7 Qian to 7 Liang 2 Qian”?
Answer: This chapter read the twenty-six heavier weights of the bone-weight table, from 4 liang 7 qian to 7 liang 2 qian. Exact enumeration shows: 5 liang and above is 18.06%, 6 liang and above only 1.64%, 4244 combinations; the heaviest weight that can be produced is 7 liang 1 qian, with 16 combinations, and 7 liang 2 qian does not exist in this set of tables, so the limits of the verses and of the tables do not line up. The heavy end is pushed by the four parts in turn; from 6 liang upwards it depends on a heavy year (ten years such as Ji Mao and Wu Wu) plus one of the two sixteen-qian hours, Zi and Si, and every combination from 6 liang 6 qian upwards was born in the Zi or the Si hour. Heavy weights are therefore the most sensitive to rectification: 0.837 of the combinations of 6 liang and above drop out of the system band with a single hour's error. Every cell is written out in four parts, gist of the verse, structure, pressure baseline and wealth capacity, with the heavy-cell readings focused on how such people overstep their limits in good times; the chapter gives one pre-registrable test with the sample sizes it needs.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations, 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: 1.64, 16, 18.06, 4244
| cases 259200 | heaviest reachable 71 | |||
| weight | cases | share% | one-in | at-or-above% |
| 47 | 11194 | 4.319 | 23 | 30.528 |
| 48 | 11216 | 4.327 | 23 | 26.209 |
| 49 | 9907 | 3.822 | 26 | 21.882 |
| 50 | 7735 | 2.984 | 34 | 18.060 |
| 51 | 6490 | 2.504 | 40 | 15.076 |
| 52 | 5466 | 2.109 | 47 | 12.572 |
| 53 | 4518 | 1.743 | 57 | 10.463 |
| 54 | 4232 | 1.633 | 61 | 8.720 |
| 55 | 4054 | 1.564 | 64 | 7.087 |
| 56 | 3476 | 1.341 | 75 | 5.523 |
| 57 | 2684 | 1.035 | 97 | 4.182 |
| 58 | 2262 | 0.873 | 115 | 3.147 |
| 59 | 1650 | 0.637 | 157 | 2.274 |
| 60 | 1064 | 0.410 | 244 | 1.637 |
| 61 | 888 | 0.343 | 292 | 1.227 |
| 62 | 660 | 0.255 | 393 | 0.884 |
| 63 | 468 | 0.181 | 554 | 0.630 |
| 64 | 368 | 0.142 | 704 | 0.449 |
| 65 | 292 | 0.113 | 888 | 0.307 |
| 66 | 212 | 0.082 | 1223 | 0.194 |
| 67 | 116 | 0.045 | 2234 | 0.113 |
| 68 | 96 | 0.037 | 2700 | 0.068 |
| 69 | 48 | 0.019 | 5400 | 0.031 |
| 70 | 16 | 0.006 | 16200 | 0.012 |
| 71 | 16 | 0.006 | 16200 | 0.006 |
| 72 | 0 | 0.000 | 0 | 0.000 |
Show the full program
# Chapter 6. p30: Exact census of bone weights 47 to 72 qian.
# Same rule and tables as chapter 5: year (sixty-year cycle) + lunar month +
# lunar day (1-30) + double hour, in qian; all 60 x 12 x 30 x 12 = 259200
# combinations counted once. For each weight of this chapter: cases, share in
# percent, "one in" (cases per hit, rounded; 0 when the weight never occurs)
# and the cumulative share at or above that weight. Then the ceiling: the sum
# of the four largest table values, and how many ways reach it.
from collections import Counter
YEAR = [12, 9, 6, 7, 12, 5, 9, 8, 7, 8, 15, 9, 16, 8, 8, 19, 12, 6, 8, 7,
5, 15, 6, 16, 15, 7, 9, 12, 10, 7, 15, 6, 5, 14, 14, 9, 7, 7, 9, 12,
8, 7, 13, 5, 14, 5, 9, 17, 5, 7, 12, 8, 8, 6, 19, 6, 8, 16, 10, 6]
MONTH = [16, 9, 15, 18, 9, 15, 9, 15, 18, 8, 9, 5]
DAY = [5, 10, 8, 15, 16, 15, 8, 16, 8, 16, 9, 17, 8, 17, 10, 8, 9, 18, 5, 15,
10, 9, 8, 9, 15, 18, 7, 8, 16, 6]
HOUR = [16, 6, 7, 10, 9, 16, 10, 8, 8, 9, 6, 6]
TABLES = (YEAR, MONTH, DAY, HOUR)
def census():
c = Counter()
for y in YEAR:
for m in MONTH:
for d in DAY:
for h in HOUR:
c[y + m + d + h] += 1
return c
if __name__ == "__main__":
c = census()
n = sum(c.values())
print(" cases {} heaviest reachable {}".format(n, max(c)))
print(" weight cases share% one-in at-or-above%")
for w in range(47, 73):
above = sum(k for v, k in c.items() if v >= w)
print(" {:5d} {:8d} {:7.3f} {:7d} {:12.3f}".format(
w, c[w], 100 * c[w] / n, round(n / c[w]) if c[w] else 0, 100 * above / n))
top = [max(t) for t in TABLES]
ways = 1
for t, x in zip(TABLES, top):
ways *= t.count(x)
print(" ceiling = {} + {} + {} + {} = {} qian, reached by {} cases".format(*top, sum(top), ways))
for cut in (50, 60):
k = sum(v for w, v in c.items() if w >= cut)
print(" {} and above: {} cases ({:.2f}%)".format(cut, k, 100 * k / n))Single source and citation
Fan, Y. (2026). The Boundary-Hour Rectification, Twin-Chart and Bone-Weight Baseload Codex (Version 1.0.0), Chapter 6: Bone Weight, the Heavier Half: 4 Liang 7 Qian to 7 Liang 2 Qian. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-124 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026124,
author = {Fan, Yafu},
title = {The Boundary-Hour Rectification, Twin-Chart and Bone-Weight Baseload Codex},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: True Solar Time, Distance to a Boundary, Likelihood Ratios, Bone Weight and Nayin
- Chapter 2 · Five Night Boundaries: 11 p.m. to 5 a.m.
- Chapter 3 · Eight Daytime Boundaries: 7 a.m. to 9 p.m.
- Chapter 4 · Splitting Twin Charts: Eight Rules and What Twin Research Shows
- Chapter 5 · Bone Weight, the Lighter Half: 2 Liang 1 Qian to 4 Liang 6 Qian
- Chapter 7 · The Sixty Sound-Elements: Pressure Base and Wealth-Carrying Capacity of the Year Cell
- Chapter 8 · Practice: Rectifying, Weighing and Reading Sample Chart A, and a Pre-Registered Test