本页只译了一部分
本页 30 段里还有 2 段没译成简体中文，没译的段落显示英文原文。并行问题
机器翻译译自英文（docs.typesafe.ai）本页 30 段里 2 段还没译
文档索引
在以下地址获取完整的文档索引：https://docs.typesafe.ai/llms.txt 使用此文件可以在进一步探索之前发现所有可用页面。
并行问题
在 GDPR Wikipedia 条目上运行 13 个问题的监管简报，证明将每个问题批量打包到一次 TypeSafe 调用中，可使成本降低 12.2 倍，速度提升 10.0 倍，且答案保持不变。
你有一份文档和关于它的 N 个问题。你可以发送一个包含所有 N 个问题的请求，或发送 N 个各含一个问题的请求。使用 TypeSafe 时，两种方式得出的答案相同：每个问题均独立针对文档进行评分，因此其答案不取决于请求中的其他内容。
为验证此点，cookbook 以两种方式多次询问每个问题——在一个请求中包含所有 N 个问题，以及每个请求包含一个问题——并比较运行的标准差：答案在连续两次重复间的偏移量。无论问题存在何种噪声，在两种批量策略下均如此。批量处理并未增加噪声。绝大多数答案在两种方式下的 5 次重复中完全一致，每次调用的数值相同，标准差恰好为 0.0。
成本和速度确实会发生变化。文档在每个请求中占据主导地位。N 次单问题调用需要支付 N 次费用，并产生 N 次往返；而批量调用只需支付一次费用。文档越大，节省就越接近 Nx。
此处案例为一份监管简报。文档为维基百科上的 GDPR 条目（约 54,000 字符，属于文档负载主导型工作，文档占每次请求的大部分），合规团队希望检查 13 项内容：8 个 Noul 问题、2 个 Choice 问题和 3 个 Score 问题。
Setup
pip install ipython "typesafe-sdk>=0.5.7" cooksafe --extra-index-url https://pypi.typesafe.ai/然后设置 TYPESAFE_API_KEY。
import json
import os
import urllib.request
from pathlib import Path
from statistics import mean, stdev
from time import perf_counter
from cooksafe import JsonCache, make_playground_link
from IPython.display import Markdown, display
from typesafe_sdk import Choice, ChoiceAnswer, Noul, NoulAnswer, Score, TypeSafeClient
TYPESAFE_MODEL = "jev-1.12"
PRICE = (
0.042,
0.00,
) # $ per 1M tokens (input, output); TypeSafe jev-1.12 as of 2026-09, see README
RUNS = 5 # repeats per batching strategy, to estimate each answer's run-to-run std dev
client = TypeSafeClient(api_key=os.environ["TYPESAFE_API_KEY"], timeout=120.0)
json_cache = JsonCache(Path("json_cache.json"))文档：GDPR 的 Wikipedia 条目
以纯文本形式从此条目的固定版本获取，并缓存于 API 调用旁边的 json_cache.json 中，因此即使实时文章被编辑，文档及其数值仍保持不变。
WIKIPEDIA_REVISION = 1363040264 # "General Data Protection Regulation", as of 2026-07
@json_cache
def fetch_article(revision_id: int) -> str:
url = (
"https://en.wikipedia.org/w/api.php?action=query&format=json"
f"&prop=extracts&explaintext=1&revids={revision_id}"
)
request = urllib.request.Request(
url, headers={"User-Agent": "typesafe-cookbook/1.0"}
)
with urllib.request.urlopen(request) as response:
pages = json.loads(response.read())["query"]["pages"]
return next(iter(pages.values()))["extract"]
DOCUMENT = {
"source": f"https://en.wikipedia.org/?oldid={WIKIPEDIA_REVISION}",
"text": fetch_article(WIKIPEDIA_REVISION),
}
print(f"{len(DOCUMENT['text']):,} characters")
display(Markdown(f"📄 [Read the pinned Wikipedia revision]({DOCUMENT['source']})"))53,777 characters
问题：8 个 Noul + 2 个 Choice + 3 个评分
每个答案按类型跟踪一个数值：
Noul：“是”的概率。Choice：最大概率，即被选中标签的概率。criteria将每个标签映射到其含义。Score：归一化至 0-1 的分数，即分数除以最高等级。criteria列出了从 0 级开始的各级描述。
QUESTIONS = {
"breach_72h": Noul(
instructions="Must a personal data breach be reported to the supervisory authority within 72 hours?"
),
"applies_non_eu": Noul(
instructions="Does the regulation apply to organisations established outside the EU that offer goods or services to people in the EU?"
),
"dpo_all_orgs": Noul(
instructions="Must every organisation appoint a Data Protection Officer, regardless of what data it processes?"
),
"pre_ticked_consent": Noul(
instructions="Can valid consent be obtained through pre-ticked boxes or inactivity?"
),
"right_erasure": Noul(
instructions="Does the regulation grant individuals a right to erasure of their personal data?"
),
"data_portability": Noul(
instructions="Does the regulation include a right to data portability?"
),
"us_federal_law": Noul(instructions="Is the GDPR a United States federal law?"),
"criminal_penalties": Noul(
instructions="Does the GDPR itself impose criminal penalties such as imprisonment?"
),
"instrument_type": Choice(
instructions="What kind of EU legal instrument is the GDPR?",
criteria={
"Regulation": "Directly binding law in all member states, no national implementation needed.",
"Directive": "Sets goals that member states implement through national law.",
"Treaty": "An international treaty between states.",
"Recommendation": "Non-binding guidance.",
},
),
"max_fine": Choice(
instructions="What is the maximum administrative fine for the most serious infringements?",
criteria={
"TwentyM_or_4pct": "Up to EUR 20 million or 4% of annual worldwide turnover, whichever is greater.",
"TenM_or_2pct": "Up to EUR 10 million or 2% of annual worldwide turnover, whichever is greater.",
"FixedCap": "A fixed amount not tied to turnover.",
"NoFines": "The GDPR provides no administrative fines.",
},
),
"individual_rights": Score(
instructions="How strong are the rights the GDPR grants to individuals over their data?",
criteria=[
"None: individuals get no rights over their data.",
"Weak: a right to be informed, but little control.",
"Moderate: access and correction rights, but limited means to act on them.",
"Strong: access, erasure, portability, and objection rights, with enforcement behind them.",
],
),
"penalty_severity": Score(
instructions="How severe are the penalties the GDPR provides for non-compliance?",
criteria=[
"None: no penalties of any kind.",
"Symbolic: small fixed fines unlikely to change behavior.",
"Substantial: fines large enough to matter to most companies.",
"Severe: fines scaled to global revenue, material even to the largest companies.",
],
),
"compliance_burden": Score(
instructions="How heavy is the compliance burden the GDPR places on organisations?",
criteria=[
"Negligible: no meaningful obligations.",
"Light: a few notices and disclosures.",
"Moderate: documented processes and some dedicated roles for larger processors.",
"Heavy: records, impact assessments, officers, and breach procedures for many organisations.",
"Extreme: obligations so demanding that ordinary organisations cannot fully comply.",
],
),
}
N = len(QUESTIONS)
METRIC = { # question type -> the one number we track per answer
Noul: "p(yes)",
Choice: "max prob",
Score: "normalized score",
}以两种方式提问，各 5 次
ask() 将任意子集的问题连同文档一起发送出去，并将每个答案缩减为其唯一的跟踪数值。每次调用中的文档字节完全相同。
两种批量策略均运行 RUNS = 5 次，使每个问题在每种策略下获得 5 个答案，足以比较均值（两种策略是否一致？）和标准差（批量处理是否增加噪声？）。调用结果缓存至 cookbook 随附的 json_cache.json 中，因此重新渲染无需额外费用；删除该文件可重新运行实时请求。
@json_cache
def ask(keys: tuple[str, ...], run: int):
"""One TypeSafe call -> ({key: tracked metric}, input_tokens, output_tokens, latency_s);
``run`` only forces a distinct live call per repeat."""
started = perf_counter()
response = client.system_one(
state={"article": DOCUMENT},
questions={key: QUESTIONS[key] for key in keys},
model=TYPESAFE_MODEL,
)
values = {}
for key in keys:
answer = response.answers[key]
if isinstance(answer, NoulAnswer):
values[key] = answer.noul
elif isinstance(answer, ChoiceAnswer):
values[key] = max(answer.probabilities.values())
else:
values[key] = answer.score / (len(QUESTIONS[key].criteria) - 1)
return (
values,
response.usage.input_tokens,
response.usage.output_tokens,
perf_counter() - started,
)
def priced(result):
"""({key: metric}, in_tokens, out_tokens, latency) -> ({key: metric}, cost_usd, latency)."""
values, input_tokens, output_tokens, latency = result
return values, input_tokens / 1e6 * PRICE[0] + output_tokens / 1e6 * PRICE[1], latency
# Price after cache retrieval, so a price change needs no new calls.
batched = [
priced(ask(tuple(QUESTIONS), run)) for run in range(RUNS)
] # all N in one call, x RUNS
singles = [
{key: priced(ask((key,), run)) for key in QUESTIONS} for run in range(RUNS)
] # N x 1, x RUNS批量处理不会改变答案
每个问题：在每种批量策略下，其跟踪数值在 5 次运行中的均值和标准差。如果批量处理改变了答案，则批量列将与单列不同。均值偏移表示偏差。标准差增大表示噪声。
print(
f"{'question':<22}{'metric':<18}{'batched mean':>13}{'single mean':>12}"
f"{'batched std':>13}{'single std':>12}"
)
for key, question in QUESTIONS.items():
batched_values = [values[key] for values, _cost, _latency in batched]
single_values = [singles[run][key][0][key] for run in range(RUNS)]
print(
f"{key:<22}{METRIC[type(question)]:<18}{mean(batched_values):>13.3f}"
f"{mean(single_values):>12.3f}{stdev(batched_values):>13.4f}{stdev(single_values):>12.4f}"
)question metric batched mean single mean batched std single std
breach_72h p(yes) 0.804 0.814 0.0055 0.0055
applies_non_eu p(yes) 0.990 0.990 0.0000 0.0000
dpo_all_orgs p(yes) 0.030 0.030 0.0000 0.0000
pre_ticked_consent p(yes) 0.040 0.040 0.0000 0.0000
right_erasure p(yes) 0.990 0.990 0.0000 0.0000
data_portability p(yes) 0.990 0.990 0.0000 0.0000
us_federal_law p(yes) 0.010 0.010 0.0000 0.0000
criminal_penalties p(yes) 0.108 0.108 0.0045 0.0084
instrument_type max prob 1.000 1.000 0.0000 0.0000
max_fine max prob 1.000 1.000 0.0000 0.0000
individual_rights normalized score 1.000 1.000 0.0000 0.0000
penalty_severity normalized score 1.000 1.000 0.0000 0.0000
compliance_burden normalized score 0.750 0.750 0.0000 0.0000
按问题类型解读表格：
- 所有
Choice、评分题，以及 8 个Noul中的 6 个，在 5 次重复中返回完全一致的结果：两种批量策略下的标准差均为 0.0，每次批量调用和单次调用返回的数值相同。单次调用包含 N 个问题的效果与 N 次各含一个问题的调用效果完全一致。 breach_72h和criminal_penalties带有轻微的逐次采样噪声，且在两种批量策略下噪声大小相同，均值在该噪声范围内一致。噪声是问题本身的属性，而非批量方式所致：批量处理既不会偏移答案，也不会增加方差。
无论哪种方式，均无批量效应：任何问题的答案都不依赖于与其共享请求的其他 12 个问题。
唯一区别：成本与速度
答案相同，账单不同。由于每次请求都以约 54,000 字符的文章为主，因此：
- 成本：13 次单问题调用将文章重复发送 13 次，而批量调用仅发送一次。无论以何种方式触发调用，此节省效果均适用。
- 速度：图中的数值是 13 次单调用延迟的总和，因此假设它们是串行执行的。若能并发执行，差距会缩小，但 13 倍的 Token 成本不变。
Token 计数和延迟与答案一起缓存；成本在之后应用，两者均对 5 次运行进行平均。
batched_cost = mean(cost for _values, cost, _latency in batched)
batched_latency = mean(latency for _values, _cost, latency in batched)
singles_cost = mean(
sum(singles[run][key][1] for key in QUESTIONS) for run in range(RUNS)
)
singles_latency = mean(
sum(singles[run][key][2] for key in QUESTIONS) for run in range(RUNS)
)
print(f"{'batching':<24}{'calls':>6}{'cost':>12}{'total time':>12}")
print(
f"{f'one call, all {N}':<24}{1:>6}{'$' + format(batched_cost, '.6f'):>12}{format(batched_latency, '.2f') + 's':>12}"
)
print(
f"{f'{N} calls, one each':<24}{N:>6}{'$' + format(singles_cost, '.6f'):>12}{format(singles_latency, '.2f') + 's':>12}"
)
print(
f"\nbatching: {singles_cost / batched_cost:.1f}x cheaper, {singles_latency / batched_latency:.1f}x faster"
)batching calls cost total time
one call, all 13 1 $0.000497 0.27s
13 calls, one each 13 $0.006090 2.71s
batching: 12.2x cheaper, 10.0x faster
在 TypeSafe playground 中打开
同一篇文章和相同的 13 个问题，打包成一个分享链接。打开它以重新运行实时简报；返回的数值相同。
playground_link = make_playground_link(
{"article": DOCUMENT}, QUESTIONS, models=[TYPESAFE_MODEL]
)
display(
Markdown(
f"🔗 [Open this article + questions in the TypeSafe playground]({playground_link})"
)
)AI 翻译查看英文原文