关于「年月日时是一个哈希:384 个槽位只命中一半」,《梅花易数的哈希与基率》给出的定量结论是什么?
结论:第一章证明,51,840 个年月日时组合只打到 384 个设计槽位中的 192 个,因为下卦与动爻由同一个总和分别除以 8 与 6 得出,奇偶被锁在一起;输出熵只有 7.499 比特,一天之内只有 12 种结果。
数据口径:书中的人群分布、注意率与记忆率均为示意;全部计算由书中程序生成;本书分析结构与概率,不做任何个人占断,也不构成商业、法律或理财建议。 第六章用似然比为「事后对上」定价,并模拟选择性记忆如何把一半对一半的运气变成 0.795 的回忆相符率。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 12, 192, 384, 51840, 7.499
| inputs (year, month, day, hour) | 51,840 |
| output slots, 64 hexagrams x 6 lines | 384 |
| slots ever reached (image size) | 192 |
| hexagrams reached, moving line ignored | 64 |
| inputs per reached slot: min 153, max 384, median 336 | |
| input entropy log2(inputs) 15.662 bits | |
| ceiling log2(384) 8.585 bits | |
| ceiling of the image log2(192) | 7.585 bits |
| output entropy, uniform inputs | 7.499 bits |
| distinct outputs inside one day | 12 |
| moving line has the parity of the lower trigram: True | |
查看完整验算程序
# Chapter 1. p11: date-time casting as a hash into 384 slots; its image.
# Rule as printed in the Meihua Yishu tradition: upper trigram = (year
# branch + lunar month + lunar day) mod 8, lower trigram = (that + hour
# branch) mod 8, moving line = (that total) mod 6, a remainder of 0 read
# as 8 or 6; trigrams numbered Qian 1 Dui 2 Li 3 Zhen 4 Xun 5 Kan 6
# Gen 7 Kun 8. Domain (illustrative): 12 year branches x 12 months x 30
# days x 12 double-hours, every month taken as 30 days. Exact count.
import math
from collections import Counter
def cast(y, m, d, h):
a = y + m + d
t = a + h
return (a % 8 or 8, t % 8 or 8, t % 6 or 6)
def main():
cnt = Counter()
for y in range(1, 13):
for m in range(1, 13):
for d in range(1, 31):
for h in range(1, 13):
cnt[cast(y, m, d, h)] += 1
n = 12 * 12 * 30 * 12
sizes = sorted(cnt.values())
h_out = -math.fsum(c / n * math.log2(c / n) for c in sizes)
print("inputs (year, month, day, hour) {:>8,}".format(n))
print("output slots, 64 hexagrams x 6 lines {:>8}".format(64 * 6))
print("slots ever reached (image size) {:>8}".format(len(cnt)))
print("hexagrams reached, moving line ignored{:>8}".format(
len({(u, lo) for u, lo, _ in cnt})))
print("inputs per reached slot: min {}, max {}, median {}".format(
sizes[0], sizes[-1], sizes[len(sizes) // 2]))
print("input entropy log2(inputs) {:>8.3f} bits".format(
math.log2(n)))
print("ceiling log2(384) {:>8.3f} bits".format(
math.log2(384)))
print("ceiling of the image log2(192) {:>8.3f} bits".format(
math.log2(len(cnt))))
print("output entropy, uniform inputs {:>8.3f} bits".format(
h_out))
one_day = {cast(5, 12, 17, h) for h in range(1, 13)}
print("distinct outputs inside one day {:>8}".format(
len(one_day)))
par = all((lo - mv) % 2 == 0 for _, lo, mv in cnt)
print("moving line has the parity of the lower trigram: {}".format(
par))
if __name__ == "__main__":
main()唯一数据源与引用
范雅福(Fan, Y.). (2026). 《梅花易数体用生克自动机、年月日时哈希碰撞与外应注意捕获基率》第 1 章「年月日时是一个哈希:384 个槽位只命中一半」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-156 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026156,
author = {Fan, Yafu},
title = {Plum-Blossom Numerology as a Body-Use Automaton, Hash Collisions in Date-Time Casting and Base Rates of Attention-Captured Omens},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}