关于「称骨:四张查表之和」,《多模态历法张量与谐波拨盘》给出的定量结论是什么?

结论:第一章把称骨写成四张查表之和:259,200 种出生只落在 51 种总重上,从 2.1 到 7.1 两,通行歌诀中的「七两二钱」无法达到;出生时辰差一格,0.8333 的总重改变。

数据口径:书中以标注框区分证据、16 段可运行的 Python 程序、原典与假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 2.1, 259200, 51, 7.1

   births (year x month x day x hour): 259,200
   reachable totals: 51 values, 2.1 to 7.1 liang
   most common total 3.9 liang, share 0.0537
   entropy 5.030 bits (of log2 51 = 5.672 if all equal)
   verse totals never reached: 7.2
   heaviest entries: year 1.9, month 1.8, day 1.8, hour 1.6 liang
   share of births at 2.5 liang or less, or 6.5 or more: 0.0146
Reading: the 60 x 12 x 30 x 12 births fall on only 51 totals,
bunched in the middle; the extremes the verses dwell on are
rare, and the last verse cannot be reached with these tables.
查看完整验算程序
# Chapter 1. [p01] Bone weight (chen gu) as a sum of four lookup tables.
# Weights in qian (10 qian = 1 liang). Year by sexagenary index
# (0 = jia-zi, e.g. 1984), lunar month 1..12, lunar day 1..30,
# double-hour zi..hai. Tables as commonly circulated. The total is a
# sum of four independent lookups; under uniform year, month, day and
# hour we count the reachable totals, their distribution, and the
# totals named in the verse list (2.1 .. 7.2 liang) that no birth hits.
import math
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, 7)
MONTH = (6, 7, 18, 9, 5, 16, 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)

def totals():
    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 = totals()
    n = sum(c.values())
    lo, hi = min(c), max(c)
    print("   births (year x month x day x hour): {:,d}".format(n))
    print("   reachable totals: {} values, {:.1f} to {:.1f} liang".format(
        len(c), lo / 10, hi / 10))
    mode = max(c, key=c.get)
    print("   most common total {:.1f} liang, share {:.4f}".format(
        mode / 10, c[mode] / n))
    h = -sum(v / n * math.log2(v / n) for v in c.values())
    print("   entropy {:.3f} bits (of log2 {} = {:.3f} if all equal)"
          .format(h, len(c), math.log2(len(c))))
    verse = range(21, 73)
    missing = [t for t in verse if t not in c]
    print("   verse totals never reached: " + ", ".join(
        "{:.1f}".format(t / 10) for t in missing))
    print("   heaviest entries: year {:.1f}, month {:.1f}, day {:.1f},"
          " hour {:.1f} liang".format(max(YEAR) / 10, max(MONTH) / 10,
                                      max(DAY) / 10, max(HOUR) / 10))
    edge = sum(v for t, v in c.items() if t <= 25 or t >= 65) / n
    print("   share of births at 2.5 liang or less, or 6.5 or more: {:.4f}"
          .format(edge))
    print("\nReading: the 60 x 12 x 30 x 12 births fall on only 51 totals,")
    print("bunched in the middle; the extremes the verses dwell on are")
    print("rare, and the last verse cannot be reached with these tables.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《多模态历法张量融合、模九十谐波拨盘与跨系统共振诊断》第 1 章「称骨:四张查表之和」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090189

DOI: 10.5281/zenodo.24090189 · 阅读本章所在专著 · 5DL-B-070 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026070,
  author    = {Fan, Yafu},
  title     = {Multimodal Calendrical Tensor Fusion, Modulo-90 Harmonic Dials and Cross-System Resonance Diagnostics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090189},
  url       = {https://doi.org/10.5281/zenodo.24090189}
}

本书其他章节结论