math-skill 3.1.0 → 3.2.0

package/README.en-US.md

@@ -2,9 +2,7 @@
   <a href="README.md">中文</a> | <a href="README.en-US.md">English</a>
 </p>
 
-# 📐 Math Skill — A Mathematical Research Operating System for AI Architecture Design
-
-> **The thinking system does not hand out theorems. The knowledge system does not improvise inspiration. The design layer does not fake profundity.**
+# 📐 Math Skill: A Mathematical Research Operating System for AI and Cryptography Innovation
 
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
 [![npm version](https://img.shields.io/npm/v/math-skill.svg)](https://www.npmjs.com/package/math-skill)
@@ -16,6 +14,14 @@
 
 ---
 
+## 📢 Community Announcements
+
+> **This skill is under rapid iteration — your feedback and suggestions are warmly welcome!** Your input is the core driver of our continuous evolution. Feel free to reach out via GitHub Issues or Discussions.
+
+> **v3.2.0 is live**: The cryptography track is officially integrated — 3 distilled classics of modern cryptography (Boneh-Shoup / Goldreich / Katz-Lindell) plus a Domain Router layer. AI and cryptography share mathematical foundations but each has exclusive specialty layers, with no cross-domain pollution. See the changelog for details.
+
+---
+
 ## Inspiration
 
 The story of Sophus Lie forging a "dragon-slaying blade" tells us this: the Lie group–Lie algebra machinery invented to solve differential equations ended up becoming the lingua franca for describing symmetry and robot state estimation — the value of a mathematical tool far outlives its original intent, which is exactly the prototype of "cross-domain activation." See [`references/inspiration.en.md`](references/inspiration.en.md).
@@ -58,9 +64,22 @@ Critic: Mathematically sound? Engineering-feasible?
 | **Design Translation** | Bridge math to AI modules/losses/operators | `design-patterns/*/*.md` | 22 |
 
 Supporting layers:
-- `references/books/*.md`: 7 book distillations for deep context
+- `references/books/*.md`: 10 book distillations (7 AI-direction + 3 cryptography-direction) for deep context
 - `references/gpu-friendly-math.en.md`: GPU 8-dimension acceptance gate
-- `agents/math-critic.en.md`: Math-engineering dual critic
+- `agents/math-critic.en.md`: Math-engineering dual critic (19 dimensions, including cryptographic security review)
+
+### Domain Router (new in v3.2.0)
+
+AI research and cryptography **share** mathematical foundations (probability/information/algebra/matrix/spectrum/optimization) but each has **exclusive** specialty layers. After intent diagnosis and before lens invocation, Domain Router determines the problem's domain and decides which anchors/books/design patterns to load, avoiding cross-domain pollution and token waste.
+
+| Domain | Loaded Content | Signal Keywords |
+|--------|----------------|------------------|
+| **AI Research** | `knowledge-base/` (7 domains, 31 anchors) + `design-patterns/` (5 types, 22 patterns) + 7 AI books | attention/loss/routing/representation/compression/MoE/transformer/KV-cache/LoRA/SSM/diffusion/RL |
+| **Cryptography** | 3 crypto books + shared math anchors (on demand) | encryption/signature/MAC/PRF/PRG/PRP/OWF/CCA/CPA/AE/ZK/reduction/DL/CDH/DDH/RSA/ECC/lattice |
+| **Pure Math** | `lenses/` + corresponding `knowledge-base/` anchors | probability/information/entropy/group/ring/field/matrix/spectrum/optimization/convexity/perturbation/complexity |
+| **AI×Crypto** | dual-domain load + intersection annotation | "PRF for watermarking," "adversarial example reduction," "verifiable inference" |
+
+> Rules: domain judgment precedes lens invocation; shared math is not redundantly loaded; no pollution across non-cross domains; gap-protocol temporary cards are domain-tagged.
 
 ### 15 Thinking Lenses
 
@@ -84,7 +103,7 @@ Supporting layers:
 
 ### Activation Anchors (by math domain)
 
-| Domain | Cards |
+| Domain | Anchors |
 |--------|-------|
 | Matrix Analysis | projection, spectral-decomposition, low-rank-approximation, positive-semidefinite, matrix-perturbation |
 | Optimization | lagrangian-duality, convex-optimization, constrained-optimization, riemannian-optimization, proximal-method |
@@ -127,9 +146,9 @@ git clone https://github.com/the-thinker0/math-skill.git
 | Scenario | Signal | Path |
 |----------|--------|------|
 | Problem Analysis | "Is this design sound?" | Lenses → Critic |
-| Mechanism Design | "Design a new attention" | Lenses → Knowledge → Design → Critic |
-| Knowledge Query | "What is tangent space and how does it relate to gradient optimization?" | Knowledge |
-| Verification | "Does this formula hold?" | Knowledge → Critic |
+| Mechanism Design | "Design a new attention" | Lenses → Anchors / Temporary Card → Design → Critic |
+| Knowledge Query | "What is tangent space and how does it relate to gradient optimization?" | Anchors; Knowledge Gap Protocol if insufficient |
+| Verification | "Does this formula hold?" | Anchors / Temporary Card → Critic |
 | Pure Engineering | debug, refactoring, tuning | **Not triggered** |
 
 **Manual trigger**:
@@ -158,10 +177,11 @@ Step 2  Lens Selection:
   2. Information-theoretic (preserve max mutual information states)
   3. Topological (preserve key connection points in sequence structure)
 
-Step 3  Knowledge Query:
-  → low-rank-approximation (matrix analysis)
-  → leverage-score-selection (matrix analysis)
-  → information-bottleneck (probability & information)
+Step 3  Activation Anchors:
+  → low-rank-approximation (Matrix Analysis anchor)
+  → leverage-score-selection (Design Pattern: compression)
+  → information-bottleneck (Probability & Information anchor)
+  If existing anchors are insufficient, enter Knowledge Gap Protocol to generate a temporary knowledge card.
 
 Step 4  Design Translation:
   Candidate A: Spectral KV Compression (low-rank + leverage score)
@@ -182,7 +202,7 @@ math-skill/
 ├── skills/
 │   └── math-research-activator/    # Orchestrator: intent diagnosis + routing
 ├── lenses/                         # 15 thinking lenses (reasoning methodology)
-├── knowledge-base/                 # Math knowledge (by domain)
+├── knowledge-base/                 # Activation anchors by math domain, not a closed encyclopedia
 │   ├── matrix-analysis/            # Matrix analysis (5 cards)
 │   ├── optimization/               # Optimization (5 cards)
 │   ├── differential-geometry/      # Differential geometry (6 cards)
@@ -197,11 +217,11 @@ math-skill/
 │   ├── representation/             # Representation (4 patterns)
 │   └── compression/                # Compression (4 patterns)
 ├── references/                     # Reference layer
-│   ├── books/                      # 7 book distillations
+│   ├── books/                      # 10 book distillations (7 AI + 3 crypto)
 │   ├── gpu-friendly-math.en.md     # GPU 8-dimension gate
 │   ├── agentic-workflow.en.md      # Collaboration style
 │   └── inspiration.en.md           # Inspiration
-├── agents/math-critic.en.md           # Math-engineering dual critic
+├── agents/math-critic.en.md           # Math-engineering dual critic (19 dims, with crypto security review)
 ├── commands/ask.en.md                 # /ask manual entry
 ├── math_book/                      # Local PDFs (not published)
 └── README.md / LICENSE
@@ -211,15 +231,27 @@ math-skill/
 
 ## Recommended Books
 
+### AI Direction (7 books)
+
+| # | Title | Author(s) | Publisher / Edition | Year | ISBN | Distillation |
+|---|-------|-----------|-------------------|------|------|-------------|
+| 1 | *Contemporary Abstract Algebra* | Joseph A. Gallian | Brooks/Cole, Cengage, 8th ed. | 2013 | 978-1-133-59971-5 | `abstract-algebra.en.md` |
+| 2 | *The Rising Sea: Foundations of Algebraic Geometry* | Ravi Vakil | Princeton University Press | 2025 | 978-0-691-26866-8 | `algebraic-geometry-rising-sea.en.md` |
+| 3 | *Manifolds and Differential Geometry* | Jeffrey M. Lee | AMS, Graduate Studies in Math Vol. 107 | 2009 | 978-0-8218-4815-9 | `differential-geometry.en.md` |
+| 4 | *Matrix Analysis* | Roger A. Horn, Charles R. Johnson | Cambridge University Press, 2nd ed. | 2013 | 978-0-521-83940-2 | `matrix-analysis.en.md` |
+| 5 | *A micro Lie theory for state estimation in robotics* | Joan Solà et al. | arXiv:1812.01537v9 | 2021 | — | `micro-lie-theory.en.md` |
+| 6 | *An Introduction to Optimization, With Applications to ML* | Chong, Lu, Żak | John Wiley & Sons, 5th ed. | 2024 | 978-1-119-87763-9 | `optimization-ml.en.md` |
+| 7 | *Introduction to Smooth Manifolds* | John M. Lee | Springer, GTM 218, 2nd ed. | 2013 | 978-1-4419-9981-8 | `smooth-manifolds.en.md` |
+
+### Cryptography Direction (3 books, new in v3.2.0)
+
 | # | Title | Author(s) | Publisher / Edition | Year | ISBN | Distillation |
 |---|-------|-----------|-------------------|------|------|-------------|
-| 1 | *Contemporary Abstract Algebra* | Joseph A. Gallian | Brooks/Cole, Cengage, 8th ed. | 2013 | 978-1-133-59971-5 | `abstract-algebra.md` |
-| 2 | *The Rising Sea: Foundations of Algebraic Geometry* | Ravi Vakil | Princeton University Press | 2025 | 978-0-691-26866-8 | `algebraic-geometry-rising-sea.md` |
-| 3 | *Manifolds and Differential Geometry* | Jeffrey M. Lee | AMS, Graduate Studies in Math Vol. 107 | 2009 | 978-0-8218-4815-9 | `differential-geometry.md` |
-| 4 | *Matrix Analysis* | Roger A. Horn, Charles R. Johnson | Cambridge University Press, 2nd ed. | 2013 | 978-0-521-83940-2 | `matrix-analysis.md` |
-| 5 | *A micro Lie theory for state estimation in robotics* | Joan Solà et al. | arXiv:1812.01537v9 | 2021 | — | `micro-lie-theory.md` |
-| 6 | *An Introduction to Optimization, With Applications to ML* | Chong, Lu, Żak | John Wiley & Sons, 5th ed. | 2024 | 978-1-119-87763-9 | `optimization-ml.md` |
-| 7 | *Introduction to Smooth Manifolds* | John M. Lee | Springer, GTM 218, 2nd ed. | 2013 | 978-1-4419-9981-8 | `smooth-manifolds.md` |
+| 8 | *A Graduate Course in Applied Cryptography* | Dan Boneh & Victor Shoup | v0.4 online | 2017 | — | `applied-cryptography.md` |
+| 9 | *Foundations of Cryptography, Volume 1: Basic Tools* | Oded Goldreich | Cambridge University Press | 2001 | 978-0-521-79235-9 | `foundations-of-cryptography.md` |
+| 10 | *Introduction to Modern Cryptography* | Jonathan Katz & Yehuda Lindell | CRC Press, 2nd ed. | 2015 | 978-1-4665-7026-1 | `introduction-to-modern-cryptography.md` |
+
+> Crypto book contents are already in English, so they use the `.md` suffix (no CN/EN split). They are loaded when Domain Router determines the problem is cryptography or AI×crypto intersection.
 
 Distillation files ship with the npm package. For full-fidelity lookups, place PDFs in the `math_book/` folder.
 
@@ -227,6 +259,34 @@ Distillation files ship with the npm package. For full-fidelity lookups, place P
 
 ## Changelog
 
+### v3.2.0 — Cryptography Track + Domain Router
+
+**Cryptography track officially landed**: reference layer expanded from 7 to 10 books, with 3 modern cryptography classics distilled into the same activation-index format as AI-direction books (~125-155 lines each, preserving core ideas and key bridging facts).
+
+- **3 new crypto books**:
+  - `references/books/applied-cryptography.md` (Boneh & Shoup): attack games / reduction proofs / constructions / protocols
+  - `references/books/foundations-of-cryptography.md` (Goldreich): computational indistinguishability / OWF-PRG-PRF equivalence chain / simulation paradigm / meta-theorems
+  - `references/books/introduction-to-modern-cryptography.md` (Katz & Lindell): formal definitions / CPA-CCA-AE / construction paradigms / implementation pitfalls
+- **Domain Router** (core innovation): after intent diagnosis and before lens invocation, judges problem domain (AI/Crypto/pure-math/intersection), loads domain-specific content, shared math not redundantly loaded, avoids cross-domain pollution and token waste
+- **SKILL.md / SKILL.en.md**: new Domain Router section + routing rules + decision flow diagram; main workflow integrates domain tags and domain-specific routing (AI uses design-patterns + GPU gate; crypto uses reduction templates + assumption/pitfall checks)
+- **math-critic upgraded to 19 dimensions**: new dim 19 "Cryptographic Security Review" (security definitions / reduction tightness / assumption dependency / composition pitfalls / anti-patterns / cross-domain transfer validity / Domain Router consistency)
+- **skill-index / overview**: added Domain Router overview table and crypto book activation-family tags; overview gained Domain Router loading note
+- **Token optimization**: crypto books compressed from 2084 to 404 lines (~80% reduction); Domain Router trims output by domain, avoiding full-load; output format emphasizes "after domain judgment, only expand the domain-specific subsection". Quantified estimate: pure AI problems skip the 3 crypto books entirely (saving ~400 lines/call), pure crypto problems skip all 22 AI design-patterns (saving ~2200-3300 lines/call); the crypto books' own compression saves another ~872 lines/call
+- **File cleanup**: removed duplicate `SKILL.md/SKILL.en.md/original-texts.md/original-texts.en.md` mistakenly placed in repo root by the contributor (canonical versions live in `skills/math-research-activator/`); fixed SKILL relative paths in `agents/math-critic.{en,}.md` and `knowledge-base/overview.en.md`
+- **AI/Cryptography isolation guarantee**: Domain Router rule 4 explicitly states "pure AI problems do not load crypto books; pure crypto problems do not load AI design patterns," preventing conceptual confusion at the loading layer
+
+### v3.1.1 — Terminology Consistency Cleanup
+
+- **skill-index alignment**: title, knowledge base section, and workflow example updated from "knowledge base / knowledge query" to "activation anchors"
+- **package.json description**: updated to new positioning
+- **README usage table**: mechanism design, knowledge query, and verification paths updated from "Knowledge" to "Anchors / Temporary Card"
+- **README workflow example**: Step 3 changed from "Knowledge Query" to "Activation Anchors"; `leverage-score-selection` label corrected from "matrix analysis" to "Design Pattern: compression"
+- **README directory structure**: `knowledge-base/` comment updated from "Math knowledge" to "Activation anchors"
+- **README activation anchors table**: column header changed from "Cards" to "Anchors"
+- **SKILL.md / SKILL.en.md**: three-layer architecture table and intent diagnosis table updated from "Math Knowledge" to "Activation Anchors"
+- **English README book links**: distillation files changed from `.md` to `.en.md`
+- **validate keywords**: checks updated from "Math Knowledge" to "Activation Anchors"
+
 ### v3.1.0 — Activation Anchors & Knowledge Gap Protocol
 
 **Repositioning**: from "math knowledge base" to "math activation system" — the knowledge base is not a closed encyclopedia but a collection of activation anchors.

package/README.md

@@ -2,9 +2,7 @@
   <a href="README.md">中文</a> | <a href="README.en-US.md">English</a>
 </p>
 
-# 📐 Math Skill — 面向 AI 架构创新的数学研究操作系统
-
-> **思想系统不负责给定理，知识系统不负责乱启发，设计层不负责装深刻。**
+# 📐 Math Skill: 面向 AI 与密码学创新的数学研究操作系统
 
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
 [![npm version](https://img.shields.io/npm/v/math-skill.svg)](https://www.npmjs.com/package/math-skill)
@@ -16,6 +14,14 @@
 
 ---
 
+## 📢 社区公告
+
+> **本 Skill 正在快速迭代中，欢迎各位使用者提出宝贵的使用感受和改进建议！** 你的反馈是我们持续进化的核心动力。欢迎通过 GitHub Issues 或 Discussions 与我们交流。
+
+> **v3.2.0 已上线**：密码学方向正式接入——3 本现代密码学经典（Boneh-Shoup / Goldreich / Katz-Lindell）精简蒸馏稿 + Domain Router 路由层，AI 与密码学共享数学根基、独有专业层，互不污染。详见变更日志。
+
+---
+
 ## 灵感来源
 
 Sophus Lie 打造"屠龙刀"的故事告诉我们：为解微分方程发明的李群-李代数，最终成为描述对称性、机器人状态估计的通用语言——数学工具的价值远超初衷，这正是「跨领域激活」的原型。详见 [`references/inspiration.md`](references/inspiration.md)。
@@ -58,9 +64,22 @@ Sophus Lie 打造"屠龙刀"的故事告诉我们：为解微分方程发明的
 | **设计翻译** | 把数学变成 AI 模块/loss/算子 | `design-patterns/*/*.md` | 22 |
 
 辅助层：
-- `references/books/*.md`：7 本书蒸馏稿，需要深入时的完整上下文
+- `references/books/*.md`：10 本书蒸馏稿（7 本 AI 方向 + 3 本密码学方向），需要深入时的完整上下文
 - `references/gpu-friendly-math.md`：GPU 八维验收门
-- `agents/math-critic.md`：数学-工程双重批判器
+- `agents/math-critic.md`：数学-工程双重批判器（19 维，含密码学安全审视）
+
+### Domain Router（v3.2.0 新增）
+
+AI 研究与密码学**共享**数学根基（概率/信息/代数/矩阵/谱/优化），但**独有**各自专业层。Domain Router 在意图诊断后、调用透镜前，先判定问题归属，决定加载哪些锚点/书稿/设计模式，避免跨域污染与 token 浪费。
+
+| Domain | 加载内容 | 信号词 |
+|--------|---------|--------|
+| **AI 研究** | `knowledge-base/`（7 领域 31 锚点）+ `design-patterns/`（5 类 22 模式）+ AI 方向 7 本书 | attention/loss/routing/representation/compression/MoE/transformer/KV-cache/LoRA/SSM/扩散/RL |
+| **密码学** | 3 本密码学书稿 + 共用数学锚点（按需） | 加密/签名/MAC/PRF/PRG/PRP/OWF/CCA/CPA/AE/零知识/归约/DL/CDH/DDH/RSA/ECC/格密码 |
+| **纯数学** | `lenses/` + `knowledge-base/` 对应锚点 | 概率/信息/熵/群/环/域/矩阵/谱/优化/凸性/扰动/复杂度 |
+| **AI×密码交叉** | 双 domain 加载 + 交叉点标注 | "PRF 做模型水印""对抗样本归约""可验证推理" |
+
+> 规则：domain 判定先于透镜调用；共用数学不重复加载；不跨域时不污染；缺口协议临时卡标注 domain。
 
 ### 15 个思想透镜
 
@@ -84,7 +103,7 @@ Sophus Lie 打造"屠龙刀"的故事告诉我们：为解微分方程发明的
 
 ### 激活锚点（按数学领域）
 
-| 领域 | 知识卡片 |
+| 领域 | 锚点 |
 |------|---------|
 | 矩阵分析 | projection, spectral-decomposition, low-rank-approximation, positive-semidefinite, matrix-perturbation |
 | 最优化 | lagrangian-duality, convex-optimization, constrained-optimization, riemannian-optimization, proximal-method |
@@ -127,9 +146,9 @@ git clone https://github.com/the-thinker0/math-skill.git
 | 场景 | 诊断信号 | 调用路径 |
 |------|---------|---------|
 | 问题分析 | "这个设计合理吗？" | 透镜 → critic |
-| 机制设计 | "设计新 attention" | 透镜 → 知识 → 设计 → critic |
-| 知识查询 | "切空间和梯度优化有什么关系？" | 知识 |
-| 验证审查 | "这个公式成立吗？" | 知识 → critic |
+| 机制设计 | "设计新 attention" | 透镜 → 激活锚点/临时知识卡 → 设计翻译 → critic |
+| 知识查询 | "切空间和梯度优化有什么关系？" | 激活锚点；不足则 Knowledge Gap Protocol |
+| 验证审查 | "这个公式成立吗？" | 激活锚点/临时知识卡 → critic |
 | 纯工程 | debug、重构、调参 | **不调用** |
 
 **手动触发**：
@@ -158,10 +177,11 @@ git clone https://github.com/the-thinker0/math-skill.git
   2. 信息论（保留最大互信息状态）
   3. 拓扑（保留序列结构关键连接点）
 
-第三步 知识查询：
-  → low-rank-approximation（矩阵分析）
-  → leverage-score-selection（矩阵分析）
-  → information-bottleneck（概率与信息）
+第三步 激活锚点：
+  → low-rank-approximation（矩阵分析锚点）
+  → leverage-score-selection（压缩设计模式）
+  → information-bottleneck（概率与信息锚点）
+  若现有锚点不足，进入 Knowledge Gap Protocol 生成临时知识卡。
 
 第四步 设计翻译：
   候选 A：Spectral KV Compression（低秩 + leverage score）
@@ -182,7 +202,7 @@ math-skill/
 ├── skills/
 │   └── math-research-activator/    # 总控：意图诊断 + 路由
 ├── lenses/                         # 15 个思想透镜（推理方法论）
-├── knowledge-base/                 # 数学知识库（按领域组织）
+├── knowledge-base/                 # 激活锚点（按数学领域组织，非封闭百科）
 │   ├── matrix-analysis/            # 矩阵分析（5 卡片）
 │   ├── optimization/               # 最优化（5 卡片）
 │   ├── differential-geometry/      # 微分几何（6 卡片）
@@ -197,11 +217,11 @@ math-skill/
 │   ├── representation/             # 表示（4 模式）
 │   └── compression/                # 压缩（4 模式）
 ├── references/                     # 参考层
-│   ├── books/                      # 7 本书蒸馏稿
+│   ├── books/                      # 10 本书蒸馏稿（7 AI + 3 密码学）
 │   ├── gpu-friendly-math.md        # GPU 八维验收门
 │   ├── agentic-workflow.md         # 协作方式
 │   └── inspiration.md              # 灵感来源
-├── agents/math-critic.md           # 数学-工程双重批判器
+├── agents/math-critic.md           # 数学-工程双重批判器（19 维，含密码学安全审视）
 ├── commands/ask.md                 # /ask 手动入口
 ├── math_book/                      # 本地 PDF（不发布）
 └── README.md / LICENSE
@@ -211,6 +231,8 @@ math-skill/
 
 ## 推荐书目
 
+### AI 方向（7 本）
+
 | # | 书名 | 作者 | 出版社 / 版次 | 年份 | ISBN | 蒸馏文件 |
 |---|------|------|-------------|------|------|---------|
 | 1 | *Contemporary Abstract Algebra* | Joseph A. Gallian | Brooks/Cole, Cengage, 8th ed. | 2013 | 978-1-133-59971-5 | `abstract-algebra.md` |
@@ -221,12 +243,50 @@ math-skill/
 | 6 | *An Introduction to Optimization, With Applications to ML* | Chong, Lu, Żak | John Wiley & Sons, 5th ed. | 2024 | 978-1-119-87763-9 | `optimization-ml.md` |
 | 7 | *Introduction to Smooth Manifolds* | John M. Lee | Springer, GTM 218, 2nd ed. | 2013 | 978-1-4419-9981-8 | `smooth-manifolds.md` |
 
+### 密码学方向（3 本，v3.2.0 新增）
+
+| # | 书名 | 作者 | 出版社 / 版次 | 年份 | ISBN | 蒸馏文件 |
+|---|------|------|-------------|------|------|---------|
+| 8 | *A Graduate Course in Applied Cryptography* | Dan Boneh & Victor Shoup | v0.4 在线版 | 2017 | — | `applied-cryptography.md` |
+| 9 | *Foundations of Cryptography, Volume 1: Basic Tools* | Oded Goldreich | Cambridge University Press | 2001 | 978-0-521-79235-9 | `foundations-of-cryptography.md` |
+| 10 | *Introduction to Modern Cryptography* | Jonathan Katz & Yehuda Lindell | CRC Press, 2nd ed. | 2015 | 978-1-4665-7026-1 | `introduction-to-modern-cryptography.md` |
+
+> 密码学书稿正文为英文，沿用 `.md` 后缀（不分中英）；Domain Router 判定为密码学或 AI×密码交叉时加载。
+
 蒸馏文件已随 npm 包发布。如需全保真原文，将 PDF 放入 `math_book/` 文件夹即可。
 
 ---
 
 ## 变更日志
 
+### v3.2.0 — 密码学方向接入 + Domain Router
+
+**密码学方向正式落地**：参考层从 7 本扩到 10 本，新增 3 本现代密码学经典蒸馏稿，精简为与 AI 方向书稿一致的激活索引格式（约 125-155 行/本，保留核心思想与关键桥接事实）。
+
+- **新增 3 本密码学书稿**：
+  - `references/books/applied-cryptography.md`（Boneh & Shoup）：攻击游戏/归约证明/构造/协议
+  - `references/books/foundations-of-cryptography.md`（Goldreich）：计算不可区分/OWF-PRG-PRF 等价链/模拟范式/元定理
+  - `references/books/introduction-to-modern-cryptography.md`（Katz & Lindell）：形式化定义/CPA-CCA-AE/构造范式/实现陷阱
+- **Domain Router 路由层**（核心创新）：在意图诊断后、透镜调用前判定问题 domain（AI/密码/纯数学/交叉），按 domain 加载专属内容，共用数学不重复加载，避免跨域污染与 token 浪费
+- **SKILL.md / SKILL.en.md**：新增 Domain Router 小节 + 路由规则 + 判定流程图；主流程整合 domain 标注与 domain-specific 路由（AI 走 design-patterns + GPU 门，密码走归约模板 + 假设/陷阱检查）
+- **math-critic 升级为 19 维**：新增第 19 维「密码学安全审视」（安全定义/归约紧度/假设依赖/合成陷阱/反模式/跨域迁移合理性/Domain Router 一致性）
+- **skill-index / overview**：补 Domain Router 总览表与密码学书稿激活家族标注；overview 增 Domain Router 加载提示
+- **Token 优化**：密码学书稿从 2084 行精简到 404 行（压缩 ~80%）；Domain Router 按 domain 裁剪输出，避免全量加载；输出格式强调"domain 判定后只展开该 domain 专属小节"。量化估算：纯 AI 问题完全不加载 3 本密码学书稿（省约 400 行/次），纯密码学问题完全不加载 22 个 AI design-patterns（省约 2200-3300 行/次）；密码学书稿本身的精简再省约 872 行/次
+- **文件清理**：删除朋友误放在根目录的重复 `SKILL.md/SKILL.en.md/original-texts.md/original-texts.en.md`（权威版本在 `skills/math-research-activator/`）；修正 `agents/math-critic.{en,}.md` 与 `knowledge-base/overview.en.md` 中的 SKILL 相对路径
+- **AI 与密码学隔离保证**：Domain Router 规则 4 明确"纯 AI 问题不加载密码学书稿；纯密码学问题不加载 AI 设计模式"，从加载层防止概念混淆
+
+### v3.1.1 — 术语闭环清洁
+
+- **skill-index 口径统一**：标题、知识库小节、工作流范例从"知识库/知识查询"改为"激活锚点"
+- **package.json description**：更新为新定位描述
+- **README 使用表**：机制设计、知识查询、验证审查路径从"知识"改为"激活锚点/临时知识卡"
+- **README 工作流范例**：第三步从"知识查询"改为"激活锚点"，`leverage-score-selection` 标签从"矩阵分析"改为"压缩设计模式"
+- **README 目录结构**：`knowledge-base/` 注释从"数学知识库"改为"激活锚点"
+- **README 激活锚点表头**：列名从"知识卡片"改为"锚点"
+- **SKILL.md / SKILL.en.md**：三层架构表和意图诊断表从"数学知识/Math Knowledge"改为"激活锚点/Activation Anchors"
+- **英文 README 书目链接**：蒸馏文件从 `.md` 改为 `.en.md`
+- **validate 关键词**：从检查"数学知识/Math Knowledge"改为"激活锚点/Activation Anchors"
+
 ### v3.1.0 — 激活锚点与知识缺口协议
 
 **定位升级**：从"数学知识库"转为"数学激活系统"——知识库不是封闭百科，而是激活锚点集合。

package/agents/math-critic.en.md

@@ -26,7 +26,7 @@ You should give equal weight to two categories of responsibility: on one hand, s
 
 ## Review Dimensions
 
-The first 15 dimensions cover the core review angles — assumptions, logic, models, computation — most of which correspond to the v3 thinking lenses in `../lenses/`; Dimensions 16–18 are cross-cutting: tool selection, GPU feasibility, and modern math activation. **Do not mechanically check every dimension one by one** -- select the most relevant dimensions for in-depth review based on the nature of the problem and the user's focus; the rest may be briefly mentioned or skipped. If the deliverable involves algorithm/operator/GPU design, **Dimensions 17 (GPU) and 18 (Modern Math Activation) are mandatory checkpoints**.
+The first 15 dimensions cover the core review angles — assumptions, logic, models, computation — most of which correspond to the v3 thinking lenses in `../lenses/`; Dimensions 16–19 are cross-cutting: tool selection, GPU feasibility, modern math activation, and cryptographic security. **Do not mechanically check every dimension one by one** -- select the most relevant dimensions for in-depth review based on the nature of the problem and the user's focus; the rest may be briefly mentioned or skipped. If the deliverable involves algorithm/operator/GPU design, **Dimensions 17 (GPU) and 18 (Modern Math Activation) are mandatory checkpoints**; if the deliverable involves cryptographic constructions / security proofs / protocols, **Dimension 19 (Cryptographic Security) is a mandatory checkpoint**.
 
 ### 1. Assumption Review -> axiomatization lens
 
@@ -151,13 +151,25 @@ The first 15 dimensions cover the core review angles — assumptions, logic, mod
 - Is the transfer a "cross-domain activation" (the structure already exists; only a cross-domain mapping is missing), or is it a forced transplant (borrowing terminology without borrowing structure)?
 - Does the deliverable simultaneously pass the **dual-acceptance gate**: mathematically correct **AND** (friendly or retrofittable on the eight dimensions)? Are candidates that fail either criterion eliminated?
 
+### 19. Cryptographic Security Review -> `../references/books/` (3 crypto books)
+
+> **Mandatory** when the deliverable involves cryptographic constructions / security proofs / protocol design (triggered when Domain Router determines the problem is cryptography or AI×crypto intersection). Corresponds to the cryptographic version of the "dual-acceptance gate": security definitions correct **AND** reduction tightness acceptable.
+
+- **Security definitions**: Is the security goal defined via a formal attack game? Does the threat-model tier (CPA/CCA/AE/EUF-CMA) match the requirement? Avoid "intuitively secure" hand-waving.
+- **Reduction tightness**: How large is Q in the reduction loss ε_scheme ≈ Q·ε_assumption? Are parameters compensated? Does the proof claim "loose reduction = secure"?
+- **Assumption dependency**: Which assumption does the scheme rely on (OWF/DL/CDH/DDH/RSA/LWE)? Is it minimized? Are black-box separation results relevant? Does it need upgrading under quantum threats (Shor/Grover)?
+- **Composition & implementation pitfalls**: Is EtM/MtE/EaM chosen correctly? Are keys independent? Are IVs/nonces unique? Is MAC comparison constant-time? Is context (identity/transcript) bound?
+- **Anti-pattern check**: Is ROM treated as an absolute guarantee? Is deterministic encryption treated as CPA-secure? Is Merkle-Damgård treated as ROM? Plain RSA signatures?
+- **Cross-domain transfer validity** (AI×crypto only): When transferring cryptographic concepts to ML (e.g., PRF for watermarking, reductions for robustness certificates), are security semantics preserved, or is only terminology borrowed? Are assumptions still achievable after transfer?
+- **Domain Router consistency**: Does a pure crypto problem avoid loading AI design-patterns? Does a pure AI problem avoid loading crypto books? Does an intersection problem load both and annotate intersection points?
+
 ## Workflow
 
 ### Review Phase
 
 1. **Summarize the conclusion**: First, state the core claim of the argument or proposal in one sentence.
 2. **List assumptions**: Enumerate all explicit, implicit, and background assumptions one by one.
-3. **Select dimensions**: Based on the nature of the problem, choose the 3-5 most relevant review dimensions from the eighteen for in-depth inspection; if algorithm/GPU design is involved, **Dimensions 17 and 18 are mandatory**. The remaining dimensions may be briefly mentioned or skipped.
+3. **Select dimensions**: Based on the nature of the problem, choose the 3-5 most relevant review dimensions from the nineteen for in-depth inspection; if algorithm/GPU design is involved, **Dimensions 17 and 18 are mandatory**; if cryptography is involved, **Dimension 19 is mandatory**. The remaining dimensions may be briefly mentioned or skipped.
 4. **Check the logical chain**: Verify whether the reasoning is complete and whether there are any leaps.
 5. **Apply the dual-acceptance gate**: For each candidate deliverable, separately assess mathematical correctness and GPU feasibility; retain only those that pass both.
 6. **Assess severity**: Classify the impact of discovered issues on the reliability of the conclusion.
@@ -181,7 +193,7 @@ The structure below is the full-report template, not the default response. For s
 ### Review Section
 
 #### Dimensions Focused on in This Review
-- [List the 3-5 dimensions selected for in-depth review and the rationale; if algorithm/GPU is involved, note that Dimensions 17/18 are included]
+- [List the 3-5 dimensions selected for in-depth review and the rationale; if algorithm/GPU is involved, note that Dimensions 17/18 are included; if cryptography is involved, note that Dimension 19 is included]
 
 #### Dual-Acceptance Gate Results
 - [Candidate 1]: Math correctness [pass/fail] | GPU eight-dimension [friendly / retrofittable / unfriendly] | Passed [yes/no]

package/agents/math-critic.md

@@ -26,7 +26,7 @@
 
 ## 审视维度
 
-前 15 个维度覆盖假设、逻辑、模型、计算等核心审视角度（多数对应 `../lenses/` 中的 v3 思想透镜），第 16–18 维为横切维度：工具选择、GPU 可行性、现代数学激活。**不需要机械地逐一检查所有维度**——应根据问题性质和用户关注点，选择最相关的维度深入审视，其余可简略提及或跳过。若产出涉及算法/算子/GPU 设计，**第 17（GPU）与第 18（现代数学激活）维为强制检查项**。
+前 15 个维度覆盖假设、逻辑、模型、计算等核心审视角度（多数对应 `../lenses/` 中的 v3 思想透镜），第 16–19 维为横切维度：工具选择、GPU 可行性、现代数学激活、密码学安全。**不需要机械地逐一检查所有维度**——应根据问题性质和用户关注点，选择最相关的维度深入审视，其余可简略提及或跳过。若产出涉及算法/算子/GPU 设计，**第 17（GPU）与第 18（现代数学激活）维为强制检查项**；若产出涉及密码学构造/安全证明/协议，**第 19（密码学安全）维为强制检查项**。
 
 ### 1. 假设审查 / Assumption Review -> axiomatization（公理化透镜）
 
@@ -151,13 +151,25 @@
 - 迁移是否是「跨领域激活」（结构本就在那里，只差一次跨域映射），还是生搬硬套（只借名词不借结构）？
 - 产出是否同时通过**双验收门**：数学正确 **AND**（八维友好或可改造）？未同时通过的候选是否被剔除？
 
+### 19. 密码学安全审视 / Cryptographic Security Review -> `../references/books/`（密码学 3 本）
+
+> 产出涉及密码学构造/安全证明/协议设计时为**强制项**（Domain Router 判定为密码学或 AI×密码交叉时触发）。对应「双验收门」的密码学版：安全定义正确 **AND** 归约紧度可接受。
+
+- **安全定义**：是否用形式化攻击游戏定义了安全目标？威胁模型层级（CPA/CCA/AE/EUF-CMA）是否匹配需求？避免"直觉上安全"的空话。
+- **归约紧度**：归约损失 ε_scheme ≈ Q·ε_assumption 中的 Q 多大？参数是否补偿？是否声称"松归约=安全"？
+- **假设依赖**：方案依赖哪条假设（OWF/DL/CDH/DDH/RSA/LWE）？是否最小化？是否有黑盒分离结果限制？量子威胁下是否需升级（Shor/Grover）？
+- **合成与实现陷阱**：EtM/MtE/EaM 选对了吗？密钥是否独立？IV/nonce 是否唯一？MAC 比较是否常数时间？上下文（身份/转录）是否绑定？
+- **反模式检查**：是否把 ROM 当绝对保证？确定性加密当 CPA 安全？Merkle-Damgård 当 ROM？plain RSA 签名？
+- **跨域迁移合理性**（仅 AI×密码交叉）：把密码学概念迁移到 ML（如 PRF 做水印、归约做鲁棒性证书）时，是否保留了安全语义，还是只借名词？迁移后假设是否仍可达成？
+- **Domain Router 一致性**：纯密码问题是否避免加载 AI design-patterns？纯 AI 问题是否避免加载密码学书稿？交叉问题是否双 domain 加载并标注交叉点？
+
 ## 工作流程
 
 ### 审视阶段
 
 1. **概括结论**：先一句话概述该论点或方案的核心主张。
 2. **列出假设**：显式、隐式和背景假设一一列出。
-3. **选择维度**：根据问题性质，从十八个审视维度中选择最相关的 3–5 个深入检查；若涉及算法/GPU 设计，**第 17、18 维必选**。其余可简略提及或跳过。
+3. **选择维度**：根据问题性质，从十九个审视维度中选择最相关的 3–5 个深入检查；若涉算法/GPU，**第 17、18 维必选**；若涉密码学，**第 19 维必选**。其余可简略提及或跳过。
 4. **检查逻辑链**：验证推理是否完整、是否存在跳跃。
 5. **过双验收门**：对每个候选产出，分别判数学正确性与 GPU 可行性，只保留同时通过的。
 6. **评估严重性**：根据发现的问题对结论可靠性的影响分级。
@@ -181,7 +193,7 @@
 ### 审视部分
 
 #### 本次重点审视维度
-- [列出本次选择深入审视的 3–5 个维度及原因；若涉算法/GPU，标注 17/18 已纳入]
+- [列出本次选择深入审视的 3–5 个维度及原因；若涉算法/GPU，标注 17/18 已纳入；若涉密码学，标注 19 已纳入]
 
 #### 双验收门结果
 - [候选1]: 数学正确[v/x] | GPU 八维[友好/可改造/不友好] | 通过[是/否]

package/knowledge-base/overview.en.md

@@ -36,6 +36,8 @@ The current 31 anchors cover the most commonly used mathematical structures in A
 2. Enter the **Knowledge Gap Protocol** defined in `../skills/math-research-activator/SKILL.en.md` to generate a temporary knowledge card
 3. Never respond with "knowledge base does not cover this" or force-fit the closest card
 
+> **Domain Router note** (v3.2.0): This knowledge base primarily serves the **AI Research Layer** and **Shared Math Layer**. If Domain Router determines the problem belongs to the **Cryptography Layer**, first consult the three crypto books listed in `../references/skill-index.en.md`; shared math anchors (e.g., `probability/entropy`, `matrix-analysis/spectral-decomposition`) are loaded on demand without redundancy. Crypto-specific concepts (OWF/PRF/CCA/reduction proofs etc.) are not among these 31 anchors; activate them via temporary knowledge cards or the crypto books.
+
 ## Domain Extension Index
 
 Each domain has an `*/index.en.md` that lists: domain trigger signals, core anchors, extended concepts, reference book directions, and temporary activation rules.

package/knowledge-base/overview.md

@@ -33,9 +33,11 @@
 现有 31 个锚点覆盖 AI 研究中最常用的数学结构。当问题需要的数学工具不在其中时：
 
 1. 查看对应领域的 `*/index.md`（如 `topology/index.md`），获取扩展概念和参考书方向
-2. 进入 SKILL.md 中定义的**知识缺口协议**，生成临时知识卡
+2. 进入 `../skills/math-research-activator/SKILL.md` 中定义的**知识缺口协议**，生成临时知识卡
 3. 不得回答"知识库未覆盖"或强行套用最相近卡片
 
+> **Domain Router 提示**（v3.2.0）：本知识库主要服务 **AI 研究层** 与 **共用数学层**。若 Domain Router 判定问题属**密码学层**，优先查阅 `../references/skill-index.md` 列出的 3 本密码学书稿；共用数学锚点（如 `probability/entropy`、`matrix-analysis/spectral-decomposition`）按需加载，不重复。密码学专属概念（OWF/PRF/CCA/归约证明等）不在此 31 锚点内，通过临时知识卡或密码学书稿激活。
+
 ## 领域扩展索引
 
 每个领域有一个 `*/index.md`，列出：领域触发信号、核心锚点、扩展概念、参考书方向、临时激活规则。

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "math-skill",
-  "version": "3.1.0",
-  "description": "面向 AI 架构创新的数学研究操作系统 v3：三层正交架构（思想透镜 / 数学知识库 / 设计翻译层），自动诊断用户意图并路由。Math Research OS for AI architecture design: thinking lenses + math knowledge base + design translation layer with auto intent diagnosis.",
+  "version": "3.2.0",
+  "description": "面向 AI 架构创新与密码学研究的数学研究操作系统 v3.2：思想透镜 / 激活锚点 / 设计翻译原型 + Domain Router（AI/密码/纯数学/交叉），支持知识缺口协议与临时知识卡。Math Research OS for AI architecture & cryptography research: thinking lenses + activation anchors + design translation prototypes + Domain Router with Knowledge Gap Protocol.",
   "keywords": [
     "math",
     "mathematics",
@@ -46,7 +46,13 @@
     "lenses",
     "knowledge-base",
     "design-patterns",
-    "math-research-os"
+    "math-research-os",
+    "cryptography",
+    "crypto",
+    "security",
+    "reduction-proof",
+    "attack-game",
+    "domain-router"
   ],
   "license": "MIT",
   "author": "the-thinker0",