关于「爆炸半径:最小权限之囚笼」,《单兵零信任母典》给出的定量结论是什么?

结论:第二章用可达图算爆炸半径:令牌收窄、去特权、只读根文件系统齐备以后,任意入口平均可达 2.50 个容器。

数据口径:全书只写防守,不写任何攻击、入侵、绕过或规避检测手法;书中主机、域名、令牌全为合成,参数为示意,全部计算由书中程序生成;本书为非个人化经营分析,不构成安全审计或法律意见,任何生产变更须经人工复核放行。 书中以标注框区分已发表之证据、可运行之 Python 计算(20 段程序)、原典与作者之假说。

English version

对照数据表

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

32 containers, total value 128
config web-entry any-entry
mean max mean value dbs
flat net, broad tokens, escapes32.00 32 32.00 128.00 8.00
segmented, broad tokens, escapes32.00 32 24.25 98.50 6.25
segmented, scoped tokens, escapes18.00 32 13.50 56.25 3.62
+ caps dropped, no engine socket4.00 4 2.75 14.00 1.00
+ read-only root and volumes4.00 4 2.50 13.25 1.00
查看完整验算程序
# Chapter 2. p21: blast radius by breadth-first search over 32 containers.
# Synthetic host-a runs 8 stacks, each with web, app, wrk (worker) and db.
# An edge u -> v means: whoever controls u can reach and take over v.
# Edge sources, all illustrative:
#   net    containers on one network reach each other's services;
#   token  a token stored in u grants rights on v;
#   escape a privileged container (or one holding the engine socket)
#          reaches the host, and the host controls every container;
#   volume app and wrk of a stack share a writable volume.
# Blast radius = containers reachable from the entry, entry included.
# Value weights: db 10, app 3, wrk 2, web 1 (illustrative).
# Segmented layout: one bridge per stack inside 10.0.0.0/8 (synthetic).
from collections import deque

STACKS = 8
ROLES = ("web", "app", "wrk", "db")
VALUE = {"web": 1, "app": 3, "wrk": 2, "db": 10}
NODES = ["{}{}".format(r, s) for s in range(STACKS) for r in ROLES]
PRIVILEGED = ["wrk0", "wrk3", "app5", "wrk6"]
HOST = "host"


def build(flat, broad_tokens, escapes, shared_rw):
    g = {n: set() for n in NODES + [HOST]}
    for s in range(STACKS):
        w, a, k, d = ("{}{}".format(r, s) for r in ROLES)
        g[w].add(a)
        g[a].update([d, k])
        g[k].add(d)
        if shared_rw:
            g[a].add(k)
            g[k].add(a)
        if broad_tokens:
            g[a].add(HOST)
    if flat:
        for u in NODES:
            g[u].update(v for v in NODES if v != u)
    if escapes:
        for u in PRIVILEGED:
            g[u].add(HOST)
    g[HOST].update(NODES)
    return g


def reach(g, start):
    seen, todo = {start}, deque([start])
    while todo:
        u = todo.popleft()
        for v in sorted(g[u]):
            if v not in seen:
                seen.add(v)
                todo.append(v)
    seen.discard(HOST)
    return seen


def stats(g, entries):
    n_size, n_val, n_db, biggest = 0, 0, 0, 0
    for e in entries:
        r = reach(g, e)
        n_size += len(r)
        biggest = max(biggest, len(r))
        for n in r:
            n_val += VALUE[n[:-1]]
            n_db += 1 if n.startswith("db") else 0
    k = len(entries)
    return n_size / k, biggest, n_val / k, n_db / k


if __name__ == "__main__":
    total_value = 0
    for n in NODES:
        total_value += VALUE[n[:-1]]
    print("32 containers, total value {}".format(total_value))
    configs = [("flat net, broad tokens, escapes", True, True, True, True),
               ("segmented, broad tokens, escapes", False, True, True, True),
               ("segmented, scoped tokens, escapes", False, False, True,
                True),
               ("+ caps dropped, no engine socket", False, False, False,
                True),
               ("+ read-only root and volumes", False, False, False, False)]
    webs = [n for n in NODES if n.startswith("web")]
    print("config                              web-entry   any-entry")
    print("                                    mean  max   mean  value dbs")
    for name, *flags in configs:
        g = build(*flags)
        m1, x1, _, _ = stats(g, webs)
        m2, _, v2, d2 = stats(g, NODES)
        print("{:<35} {:>5.2f} {:>3}  {:>5.2f} {:>6.2f} {:>4.2f}".format(
            name, m1, x1, m2, v2, d2))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《单兵硅基帝国零信任网安架构、源站隧道隐身与反爬虫防勒索母典》第 2 章「爆炸半径:最小权限之囚笼」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-336 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026336,
  author    = {Fan, Yafu},
  title     = {Zero-Trust Cybersecurity for a One-Commander Silicon Empire: Origin Cloaking, Secret Hygiene and Anti-Scraper Defense},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论