关于「物理隔离:服务端判分、信息流图与判分预言机的一比特」,《零泄题苏格拉底考官》给出的定量结论是什么?
结论:程序 p21 把四种架构画成信息流图,只有服务器端判分、模型只拿比特的架构 C 把每一条到达浏览器的路径都卡在一个比特上,而一个读取答案的提示生成器就能把它退回到 D。程序 p22 说明判分本身是一台预言机,每次最多透露一个比特,对四选一这样的小空间题几乎没有保护。程序 p23 说明尝试上限与平行题能压住预言机,但小空间题无法同时照顾防猜与防误伤。内容通道关上之后,考官还剩下一个问题:手里只有一串「对」和「错」,它凭什么判断学员已经掌握?下一章引入贝叶斯知识追踪。
数据口径:书中参数为示意;全部计算由书中程序生成,不调用任何模型接口,不含任何密钥或服务器地址,也不收录具体的套话提示词;本书是非个人化经营建议。 第一、二章量化叮嘱为何无效,在每题 3 次尝试、40 道题的示意课程里,p 等于 0.001 时一个 30 人的小班至少漏掉一道题的概率是 0.9727;再画出四种考官架构的信息流图,计算判分预言机的比特上限与尝试上限的代价。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
| answer space 1000 values = 9.9658 bits | |||||
| arch paths full bit bits/reply worst path | |||||
| A | 1 | 1 | 0 | 9.9658 | key>ctx>out>browser |
| B | 1 | 1 | 0 | 9.9658 | key>bundle>browser |
| C | 1 | 0 | 1 | <= 1 | key>grader>verdict>ctx>out>browser |
| D | 2 | 1 | 1 | 9.9658 | key>hinter>ctx>out>browser |
| only C keeps every path from key to browser behind a bit |
查看完整验算程序
# Chapter 2. p21: where can the answer flow? Reachability on a graph.
# Each architecture is a list of directed channels. A channel either
# carries text that can contain the answer ("full") or only a verdict
# bit, correct or not ("bit"). We ask whether the answer key can reach
# anything the student sees (the browser), and through what kind of
# channel. Node names are generic; no real system is described.
# A answer pasted into the model's prompt with "do not reveal it"
# B answers shipped to the page so the browser grades itself
# C server-side grader; the model gets only the verdict bit
# D like C, but a hint writer that reads the answer feeds the model
import math
ARCH = (
("A", (("key", "ctx", "full"), ("ctx", "out", "full"),
("out", "browser", "full"), ("student", "ctx", "full"))),
("B", (("key", "bundle", "full"), ("bundle", "browser", "full"),
("student", "browser", "full"))),
("C", (("key", "grader", "full"), ("student", "grader", "full"),
("grader", "verdict", "bit"), ("verdict", "ctx", "bit"),
("student", "ctx", "full"), ("ctx", "out", "full"),
("out", "browser", "full"))),
("D", (("key", "grader", "full"), ("grader", "verdict", "bit"),
("verdict", "ctx", "bit"), ("key", "hinter", "full"),
("hinter", "ctx", "full"), ("ctx", "out", "full"),
("out", "browser", "full"))),
)
def worst_paths(edges, src, dst):
# depth-first search over simple paths, in the listed edge order
found = []
def walk(node, path, kind):
if node == dst:
found.append((kind, path))
return
for a, b, k in edges:
if a == node and b not in path:
nk = "full" if kind == "full" and k == "full" else "bit"
walk(b, path + [b], nk)
walk(src, [src], "full")
return found
SPACE = 1000
print("answer space %d values = %.4f bits" % (SPACE, math.log2(SPACE)))
print("arch paths full bit bits/reply worst path")
for name, edges in ARCH:
ps = worst_paths(edges, "key", "browser")
n_full = len([1 for k, _ in ps if k == "full"])
n_bit = len(ps) - n_full
if n_full:
bits = "%.4f" % math.log2(SPACE)
elif n_bit:
bits = "<= 1"
else:
bits = "0"
full = [p for k, p in ps if k == "full"]
worst = full[0] if full else (ps[0][1] if ps else [])
shown = ">".join(worst) if worst else "none"
print("%-4s %-5d %-4d %-3d %-10s %s"
% (name, len(ps), n_full, n_bit, bits, shown))
print("only C keeps every path from key to browser behind a bit")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《零泄题苏格拉底闯关考官、服务端答案物理隔离与掌握度贝叶斯追问树母典》第 2 章「物理隔离:服务端判分、信息流图与判分预言机的一比特」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-262 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026262,
author = {Fan, Yafu},
title = {A Zero-Leak Socratic Examiner: Server-Side Isolation of Answers and Bayesian Mastery Probing Trees},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}