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 259200heaviest reachable 71
weightcasesshare%one-inat-or-above%
47111944.3192330.528
48112164.3272326.209
4999073.8222621.882
5077352.9843418.060
5164902.5044015.076
5254662.1094712.572
5345181.7435710.463
5442321.633618.720
5540541.564647.087
5634761.341755.523
5726841.035974.182
5822620.8731153.147
5916500.6371572.274
6010640.4102441.637
618880.3432921.227
626600.2553930.884
634680.1815540.630
643680.1427040.449
652920.1138880.307
662120.08212230.194
671160.04522340.113
68960.03727000.068
69480.01954000.031
70160.006162000.012
71160.006162000.006
7200.00000.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