iter41-卡1：核心数据面结构收敛批：85键全清——三族拆域＋config_db归位容器＋存档拆件＋meta瘦身＋adventure拆段＋spawn束化；行为零变化，8新件在阈

game/core/action_economy.gd

@@ -30,10 +30,7 @@ var _rap := 0
 var rap: int:
 	get: return _rap
 var _last_round_end: Dictionary[String, String] = {}   # {path_tag, continuation_hint}——排雷玩法 组包 round_end 的合法数据源
-var last_round_end: Dictionary[Variant, Variant]:
-	get: return _last_round_end
 var _settlement_consumed := false            # AC-14 门：notify_settlement_done 消费后才受理 round_start
-var _next_round_mode := ""                   # 调试观测量（同板续轮 / 换新图）
 var _pending_ap_delta := 0                   # 下轮行动点修正排队（action 型 ±1 排队，轮开始兑现后清零）
 # 蓄力流运行态：转蓄力=round_end grant_ap(mode:transfer) 订阅（finish_round_stop 定夺）、
 # 深挖对价=dig_paid counter_spend 订阅（request_dig 施加面）；charge_layers=蓄力层账本
@@ -44,7 +41,6 @@ var charge_layers: int:
 var _fx: EffectEngine = null
 var _ctx: EffectContext = null
 var _last_stop_ap := 0   # 停手侧剩余 AP 记账（转存决策在 round_end 发射点——grant_ap(transfer) 订阅定夺）
-var _ap_exhausted_last := false   # 上轮 AP 耗尽封印（一滴不剩 round_start when 面）
 
 
 func set_fx(fx: EffectEngine, ctx: EffectContext) -> void:
@@ -204,9 +200,9 @@ func request_refresh() -> bool:
 	if _phase != Phase.ACTIVE:
 		_reject("phase")
 		return false
-	if _rap < db.action_economy.rap_refresh_cost:
+	if _rap < db.run.action_economy.rap_refresh_cost:
 		return false   # EC13 资源不足拒绝——合法相位内资源拒绝，非编排错误
-	_rap -= db.action_economy.rap_refresh_cost
+	_rap -= db.run.action_economy.rap_refresh_cost
 	return true
 
 
@@ -216,7 +212,6 @@ func notify_settlement_done(next_round_mode: String) -> bool:
 		_reject("phase")
 		return false
 	_settlement_consumed = true
-	_next_round_mode = next_round_mode
 	return true
 
 
@@ -249,7 +244,7 @@ func notify_round_start() -> bool:
 	else:
 		_reject("phase")
 		return false
-	_ap = maxi(0, db.action_economy.ap_per_round + _pending_ap_delta)   # 每轮基线 + 排队修正（下限 0）
+	_ap = maxi(0, db.run.action_economy.ap_per_round + _pending_ap_delta)   # 每轮基线 + 排队修正（下限 0）
 	_pending_ap_delta = 0
 	_phase = Phase.ACTIVE
 	_settlement_consumed = false
@@ -272,13 +267,19 @@ func _finish_round(path_tag: String, continuation_hint: String) -> void:
 	assert(path_tag != "ap_exhausted" or _ap == 0, "耗尽轮剩余行动点恒为 0（实现层断言兜底）")
 	assert(path_tag != "cleared" or _ap == 0, "清图轮剩余行动点当场清零（不进储备池）")
 	_last_round_end = {"path_tag": path_tag, "continuation_hint": continuation_hint}
-	_ap_exhausted_last = path_tag == "ap_exhausted"   # 一滴不剩 when 面（轮始发射读数）
 	_phase = Phase.WAITING
 
 
-# 上轮 AP 是否耗尽（round_start 发射 payload 读数面；轮始兑现后保持到本轮末）
+# 上轮组包读数（{path_tag, continuation_hint}——排雷玩法 组包 round_end 的合法数据源；
+# 属性→方法 K5 换形，消费方 minesweeper_rules 单点改址）
+func last_round_end() -> Dictionary[String, String]:
+	return _last_round_end
+
+
+# 上轮 AP 是否耗尽（round_start 发射 payload 读数面；轮始兑现后保持到本轮末）——
+# 派生读（同源同刻：_last_round_end 组包点即派生原点，K5 派生合并——存储成员退役）
 func ap_exhausted_last_round() -> bool:
-	return _ap_exhausted_last
+	return _last_round_end.get("path_tag", "") == "ap_exhausted"
 
 
 func _reject(source: String) -> void:

game/core/adventure_runner.gd

@@ -105,7 +105,7 @@ func start_adventure(seed_val: int, params: Dictionary = {}) -> bool:
 	_stats.armor_type = String(params.get("armor_type", ""))
 	summary = {}
 	_reset_curio_state()
-	levels_total = db.level_count()   # 表访问收口（关数读 level 表行数）
+	levels_total = db.run.level.level_count()   # 表访问收口（关数读 level 表行数）
 	level_index = 1
 	_pending_next_level = false
 	_shop_mode = "pool" if String(params.get("shop_mode", "legacy")) == "pool" else "legacy"   # 缺省 legacy（off 对照零扰动）
@@ -120,7 +120,7 @@ func start_adventure(seed_val: int, params: Dictionary = {}) -> bool:
 	# 刷新练习开局注入（refresh_stock_grant 装配即得一次性加仓：
 	# 装配集 kind 分发扫描；只入存量账、临时账不动=V8 契约；resume 不重注入〔存量随断点已在〕）
 	for iid_v2 in _attunement:
-		var rp_row: Dictionary[Variant, Variant] = db.treasure_item_row(String(iid_v2))
+		var rp_row: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(String(iid_v2))
 		if (rp_row.get("effect_kinds", []) as Array).has("refresh_stock_grant"):
 			_refresh_bank.add_refresh_stock(int(rp_row.get("magnitude", 0)))
 	# 特性开局注入（MC 成型画像载体：params.relics_seed 非空=开局持有集〔七流派
@@ -184,7 +184,7 @@ func _resume_ledger(bp: Dictionary, params: Dictionary) -> void:
 	_wallet.restore_fragment(bp, params)
 	_journal.restore_fragment(bp, params)
 	summary = {}
-	levels_total = db.level_count()   # 表访问收口（关数读 level 表行数）
+	levels_total = db.run.level.level_count()   # 表访问收口（关数读 level 表行数）
 	level_index = int(bp.get("level_index", 1))
 	_pending_next_level = false
 
@@ -223,7 +223,7 @@ func _resume_params(bp: Dictionary, params: Dictionary) -> void:
 	#（如调试浮窗调高期写出的值，实例：hero_hp=28 > 基础 26）——恢复后钳到生效上限，
 	# 否则首战 spawn「hero_hp 入参越界」拒收 → 「敌人系统 spawn 被拒」fatal。钳制式单点归
 	# 数值账 clamp_hp_to_resume_cap（保守口径不含加算区——与原钳制式逐字同）。
-	_stats.clamp_hp_to_resume_cap(int(db.hero.max_hp))
+	_stats.clamp_hp_to_resume_cap(int(db.combat.hero.max_hp))
 	_shop_mode = "pool" if String(params.get("shop_mode", "legacy")) == "pool" else "legacy"   # 续玩参数面同 start_adventure（缺省 legacy）
 	_treasure_unlocked = params.get("treasure_unlocked", {}) if params.get("treasure_unlocked", {}) is Dictionary else {}
 	_attunement = params.get("attunement", []) if params.get("attunement", []) is Array else []   # additive
@@ -330,7 +330,7 @@ func present_node_curio(candidates: Array) -> void:
 func _attune_refresh_x_total() -> int:
 	var total := 0
 	for iid_v in _attunement:
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(String(iid_v))
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(String(iid_v))
 		if (arow.get("effect_kinds", []) as Array).has("bonus_refresh"):
 			total += int(arow.get("magnitude", 0))
 	return total
@@ -369,8 +369,8 @@ func _loadout_on_level_inventory() -> void:
 func _boss_keystone_drop(li: int) -> void:
 	var first := true
 	if _save_manager != null:
-		first = not _save_manager.boss_first_kill_marked(li)
-	var row: Dictionary[Variant, Variant] = db.meta_boss_keystone_row(li)
+		first = not _save_manager.meta_state.career_state().boss_first_kill.has(str(li))
+	var row: Dictionary[Variant, Variant] = db.crossrun.meta.boss_keystone_row(li)
 	var amount: int = int(row.get("first_kill", 0)) if first else int(row.get("repeat_kill", 0))
 	_journal.record_keystone_drop({"level": li, "first": first, "amount": amount})   # 逐杀明细+累计单写原语
 

game/core/attune_loadout.gd

@@ -33,7 +33,7 @@ func item_ids() -> Array:
 func seed_for_adventure(inventory: TreasureItems) -> void:
 	for iid_v in _ids:
 		var iid := String(iid_v)
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(iid)
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(iid)
 		if String(arow.get("form", "")) != "active_charged":
 			continue
 		_ensure_rows(iid, maxi(0, int(arow.get("charges_per_adventure", 0))), inventory)
@@ -44,7 +44,7 @@ func seed_for_adventure(inventory: TreasureItems) -> void:
 func reset_cycle(cycle: String, inventory: TreasureItems) -> void:
 	for iid_v in _ids:
 		var iid := String(iid_v)
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(iid)
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(iid)
 		if String(arow.get("form", "")) != "active_charged":
 			continue
 		if String(arow.get("charge_reset", "adventure")) != cycle:
@@ -94,7 +94,7 @@ func breakpoint_fragment(inventory: TreasureItems) -> Dictionary[Variant, Varian
 	var charges: Dictionary[Variant, Variant] = {}
 	for iid_v in _ids:
 		var iid := String(iid_v)
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(iid)
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(iid)
 		if String(arow.get("form", "")) == "active_charged":
 			charges[iid] = charges_left(iid, inventory)
 	return {"attunement_charges": charges}

game/core/attunement.gd

@@ -12,6 +12,6 @@ static func slots(db: ConfigDb, save: Variant) -> int:
 		return 0
 	var n := 0
 	for i in range(1, 4):
-		if save.tree_level("att_socket%d" % i) >= 1:
+		if save.meta_state.tree_state().nodes.get("att_socket%d" % i, 0) >= 1:
 			n += 1
 	return n

game/core/battle_fx_host.gd

@@ -175,5 +175,5 @@ func _fx_fact(fact: String) -> Variant:
 # 基线 = enc 口径，-1（表值兜底态）时解析为表值后叠加，守恒口径与 begin_battle 注入一致）
 func _sync_hero_ac() -> void:
 	if int(ac.base) < 0:
-		ac.base = int(db.hero.armor_class)
+		ac.base = int(db.combat.hero.armor_class)
 	damage.set_hero_ac_override(int(ac.base) + int(ac.round) + int(ac.battle))

game/core/battle_orchestrator.gd

@@ -180,7 +180,7 @@ func attune_has(item_id: String) -> bool:
 func attune_param_sum(kind: String) -> int:
 	var total := 0
 	for iid_v in attunement:
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(String(iid_v))
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(String(iid_v))
 		if (arow.get("effect_kinds", []) as Array).has(kind):
 			total += int(arow.get("magnitude", 0))
 	return total
@@ -190,7 +190,7 @@ func attune_param_sum(kind: String) -> int:
 # 首行语义=装配集内至多一件积点制〔试炼镐〕）
 func _attune_charge_safe_row() -> Dictionary:
 	for iid_v in attunement:
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(String(iid_v))
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(String(iid_v))
 		if (arow.get("effect_kinds", []) as Array).has("ap_charge_safe"):
 			return arow
 	return {}
@@ -301,10 +301,8 @@ func _begin_battle_accept(enc: Dictionary) -> bool:
 		_fatal("敌人表 行集解析为空（%d,%d,%s）" % [int(enc.level_index), int(enc.node_depth), String(enc.get("node_type", "battle"))])
 		return false
 	# E4 收口：加成经 encounter 显式携带（hero_atk/hero_max_hp；缺省 = 表值——冒烟/工具直呼路径）
-	_hero_atk = int(enc.get("hero_atk", int(db.hero.atk)))
-	if not _enemy_system.spawn(int(enc.level_index), int(enc.node_depth), int(enc.hero_hp), dice[0],
-			_hero_atk, int(enc.get("hero_max_hp", -1)), dice[1],
-			String(enc.get("attack_type", "")), String(enc.get("armor_type", "")), String(enc.get("node_type", "battle"))):   # 两根类型轴（空串=锻造配置默认值回退，行为连续）＋行类维（battle/boss）
+	_hero_atk = int(enc.get("hero_atk", int(db.combat.hero.atk)))
+	if not _enemy_system.spawn({"level_index": int(enc.level_index), "node_depth": int(enc.node_depth), "hero_hp": int(enc.hero_hp), "unit_count_overrides": dice[0], "hero_atk_override": _hero_atk, "hero_max_hp_override": int(enc.get("hero_max_hp", -1)), "enemy_atk_overrides": dice[1], "hero_attack_type": String(enc.get("attack_type", "")), "hero_armor_type": String(enc.get("armor_type", "")), "row_kind": String(enc.get("node_type", "battle"))}):   # 两根类型轴（空串=锻造配置默认值回退，行为连续）＋行类维（battle/boss）
 		_fatal("敌人系统 spawn 被拒")
 		return false
 	return true
@@ -317,7 +315,7 @@ func _begin_battle_accept(enc: Dictionary) -> bool:
 # 返回 [count_overrides, atk_overrides]；行集为空 = 返回 []（fail 判据交受理段 _fatal）。
 func _begin_battle_dice(enc: Dictionary) -> Array:
 	# 行类维度：节点身份 battle/boss 决定行集键域（缺省 battle 只服务测试直呼面——生产路径恒传 node_type）
-	var erowset_pre: Array[Variant] = db.resolve_enemy_rowset(int(enc.level_index), int(enc.node_depth), String(enc.get("node_type", "battle")))
+	var erowset_pre: Array[Variant] = db.combat.enemy.resolve_rowset(int(enc.level_index), int(enc.node_depth), String(enc.get("node_type", "battle")))
 	if erowset_pre.is_empty():
 		return []
 	var needs_count := false
@@ -462,7 +460,7 @@ func _install_new_board(during_round := false) -> bool:
 func _resolve_global_variant(board: BoardData) -> void:
 	board.board_variants.clear()
 	_reward_economy.board_skew = 0
-	var row: Dictionary[Variant, Variant] = db.global_variant_row(int(encounter.level_index), String(board.board_type),
+	var row: Dictionary[Variant, Variant] = db.combat.variation.global_variant_row(int(encounter.level_index), String(board.board_type),
 			String(encounter.get("node_type", "")))
 	if row.is_empty():
 		return
@@ -482,7 +480,7 @@ func _resolve_global_variant(board: BoardData) -> void:
 func _place_variants(board: BoardData) -> void:
 	if not board.board_variants.is_empty():
 		return
-	var pool: Array[Variant] = db.variant_pool(int(encounter.level_index), String(board.board_type))
+	var pool: Array[Variant] = db.combat.variation.variant_pool(int(encounter.level_index), String(board.board_type))
 	if pool.is_empty():
 		return
 	var r0 := {}
@@ -496,8 +494,8 @@ func _place_variants(board: BoardData) -> void:
 		return
 	var stream: RandomNumberGenerator = rng.open_stream("variant_place")   # 一板恰一 scope（换图/刷新图各取号一次）
 	var vrow: Dictionary[Variant, Variant] = pool[stream.randi_range(0, pool.size() - 1)]
-	var total: int = int(round(float(candidates.size()) * float(db.variation.percent_of_cells) / 100.0)) \
-		+ (int(encounter.level_index) - 1) * int(db.variation.per_level_bonus)
+	var total: int = int(round(float(candidates.size()) * float(db.combat.variation.percent_of_cells) / 100.0)) \
+		+ (int(encounter.level_index) - 1) * int(db.combat.variation.per_level_bonus)
 	total = mini(total, candidates.size())
 	_place_variants_apply(board, candidates, stream, vrow, total)
 
@@ -506,7 +504,7 @@ func _place_variants(board: BoardData) -> void:
 func _place_variants_apply(board: BoardData, candidates: Array[Vector2i], stream: RandomNumberGenerator, vrow: Dictionary, total: int) -> void:
 	var placed := {}
 	while placed.size() < total:
-		var pack_size: int = mini(total - placed.size(), stream.randi_range(2, int(db.variation.pack_max)))
+		var pack_size: int = mini(total - placed.size(), stream.randi_range(2, int(db.combat.variation.pack_max)))
 		var free: Array[Vector2i] = []
 		for c in candidates:
 			# 新片种子/生长格禁与其他已布片 8 邻贴接——否则两片粘连成一个超 pack_max 的连通分量
@@ -638,7 +636,7 @@ func _harmful_variants(vids: Array) -> Array:
 	var out: Array[Variant] = []
 	for vid_v in vids:
 		var vid := String(vid_v)
-		var vrow: Dictionary[Variant, Variant] = db.variation.row_by_id(vid)
+		var vrow: Dictionary[Variant, Variant] = db.combat.variation.row_by_id(vid)
 		if String(vrow.get("effect", "")) == "flat_damage":
 			out.append(vid)
 	return out
@@ -677,7 +675,7 @@ func set_treasure_unlocked(ids: Dictionary) -> void:
 # 统一流：behavior_roll 无子流派生向量（位置交错，单点定位由事件日志承载）。
 # 摇定后、兑现前死亡 → 本拍技能作废。
 func _roll_round_actions() -> void:
-	var pity_m: int = int(db.skill.pity_threshold)
+	var pity_m: int = int(db.combat.skill.pity_threshold)
 	# facts 组包（开轮摇号前一次成型——last_round_end 空字典首轮映射 none 唯一落点；hero 事实不进 facts，
 	# 容器内直读主角行）
 	var facts := {
@@ -692,7 +690,7 @@ func _roll_round_actions() -> void:
 		# 技能名提示〔轻量 toast 非演出——D8 呈现面〕。门=确定性谓词，机制面零随机，摇号随机
 		# 消费仍在 behavior_roll 既有流——同种子逐位复现不破坏）
 		for sid in _enemy_system.check_trigger_unlocks(u, facts):
-			var srow_u: Dictionary[Variant, Variant] = db.skill_row(sid)
+			var srow_u: Dictionary[Variant, Variant] = db.combat.skill.row_by_id(sid)
 			_emit_row({"type": "highlight", "source_class": "enemy_action", "origin_cell": Vector2i(-1, -1), "highlight": "skill_unlock"},
 				round_index, "%s 解锁了 %s" % [String(u.display_name), String(srow_u.get("display_name", sid))],
 				0, {"skill_id": sid})
@@ -733,7 +731,7 @@ func _defender_ac(unit: Dictionary) -> int:
 
 func _pool_effective(effect_id: String) -> int:
 	var side := "hero"
-	var row: Dictionary[Variant, Variant] = db.status_effect_row(effect_id)
+	var row: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(effect_id)
 	if not row.is_empty():
 		side = String(row.target_side)
 	for eff in _status_effects.query_active(side):
@@ -818,9 +816,9 @@ func _exit_distribution() -> void:
 # 呈现层查询面（HUD 刷新按钮可用性）——挖掘期唯一通道
 func can_refresh() -> bool:
 	return battle_result == "" \
-		and _refresh_used_this_round < int(db.action_economy.refresh_cap_per_round) \
+		and _refresh_used_this_round < int(db.run.action_economy.refresh_cap_per_round) \
 		and action_economy.phase == action_economy.PHASE_ACTIVE \
-		and action_economy.rap >= int(db.action_economy.rap_refresh_cost)
+		and action_economy.rap >= int(db.run.action_economy.rap_refresh_cost)
 
 
 # 玩家经 HUD框架发起、战斗结算 代理调用（禁止 RAP 满自动刷）。
@@ -870,14 +868,14 @@ func _battle_over(result: String) -> void:
 # + level_gp_bonus(level_index) + escrow。掷定行缺位 = 数据面缺行（fail 报错按 0 兑付——不哑掉）。
 func _roll_gp_drop() -> int:
 	var tier := "boss" if String(encounter.get("node_type", "")) == "boss" else "normal"
-	var drops: Dictionary[Variant, Variant] = db.shop_gp_drop_row(tier)
+	var drops: Dictionary[Variant, Variant] = db.run.shop.gp_drop_row(tier)
 	var roll := 0
 	if drops.is_empty():
 		push_error("[战斗结算] gp_drops 缺行 tier=%s——掉落掷定按 0 兑付" % tier)
 	else:
 		var stream: RandomNumberGenerator = rng.open_stream("gp_drop")
 		roll = stream.randi_range(int(drops.get("roll_min", 0)), int(drops.get("roll_max", 0)))
-	var drop := roll + db.shop_level_gp_bonus(int(encounter.get("level_index", 0)))
+	var drop := roll + db.run.shop.level_gp_bonus_at(int(encounter.get("level_index", 0)))
 	# 财富之道·聚（战斗掉落 GP 乘算·入账前：只乘战斗掉落两成分〔掷定+关卡加成〕，
 	# 店内 escrow 不乘〔范围=仅战斗掉落渠道〕；本函数返回值=结算框「GP 增量」行
 	# 显示源，落在入账前=显示即实得；乘数 provisional 150%）
@@ -899,14 +897,14 @@ func presentation_snapshot() -> Dictionary:
 	# 敌方增益投影（side-wide 状态——蓄力/硬化/削弱/暴走 percent 行 + 警觉 ac 行）
 	var enemy_effects: Array[Dictionary] = []
 	for eff in _status_effects.query_active("enemy"):
-		var erow: Dictionary[Variant, Variant] = db.status_effect_row(eff.effect_id)
+		var erow: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(eff.effect_id)
 		if not erow.is_empty() and String(erow.unit) in ["percent", "ac"]:
 			enemy_effects.append({"effect_id": eff.effect_id, "display_name": String(eff.display_name), "layers": int(eff.layers)})
 	for i in all.size():
 		var u: Dictionary[Variant, Variant] = all[i]
 		var alive: bool = bool(u.get("alive", false))
 		var pending: String = String(u.get("pending_skill", "")) if alive else ""
-		var pending_row: Dictionary[Variant, Variant] = db.skill_row(pending)
+		var pending_row: Dictionary[Variant, Variant] = db.combat.skill.row_by_id(pending)
 		enemies.append({
 			"order": i + 1,
 			"display_name": String(u.display_name),

game/core/board_generator.gd

@@ -22,12 +22,19 @@ static func target_mine_count(params: Dictionary) -> int:
 # rng_stream = 一次 open_stream("board_gen") 实例（一张图的全部取数；重试共用——attempt 边界非 scope 事件）。
 # db 参数不标具体类型原因：冒烟工具注入 FakeDB 桩（experiment_density.gd 等）——typed 形参会拒收桩表
 func generate(L: int, D: int, rng_stream: RandomNumberGenerator, db) -> BoardData:  # type-hint: ignore（测量面 _BoardRowStub 冒烟夹具鸭子型注入——typed 参拒 stub）
-	var row: Dictionary[Variant, Variant] = db.resolve_board_gen(L, D)
+	var row: Dictionary[Variant, Variant] = db.combat.board_gen.resolve_row(L, D)
 	if row.is_empty():
 		_fatal("BoardGen 行缺失 (%d,%d)" % [L, D])
 		return null
-	# 生成期表值单次读取快照（防热重载撕裂 attempt 语义）
-	var params := {
+	var params := _board_params(row, L, D)
+	var outcome := _attempt_loop(params, rng_stream, db)
+	_finalize(outcome["board"], params, outcome["attempts"], outcome["mode"], outcome["r0_rej"])
+	return outcome["board"]
+
+
+## 生成期表值单次读取快照（防热重载撕裂 attempt 语义；零 RNG）
+func _board_params(row: Dictionary, L: int, D: int) -> Dictionary:
+	return {
 		"L": L, "D": D,
 		"w": int(row.board_width), "h": int(row.board_height),
 		"density": float(row.mine_density),
@@ -41,10 +48,11 @@ func generate(L: int, D: int, rng_stream: RandomNumberGenerator, db) -> BoardDat
 		"shave_r": int(row.get("shave_ring_radius", 1)),
 		"r0_cap": int(row.get("r0_max_cap", 0)),
 	}
-	var best_legal: BoardData = null
-	var best_legal_score := -1.0
-	var best_bad: BoardData = null
-	var best_badness := [999999, 999999, 999999]
+
+
+## 重试主循环：逐尝试评分择优，产出三分出口结果（board/mode/attempts/r0_rej）
+func _attempt_loop(params: Dictionary, rng_stream: RandomNumberGenerator, db) -> Dictionary:  # type-hint: ignore（同 generate——测量面 stub 注入）
+	var best := {"legal": null, "legal_score": -1.0, "bad": null, "badness": [999999, 999999, 999999]}
 	var attempts_used := 0
 	var accepted: BoardData = null
 	var accept_mode := ""
@@ -53,35 +61,37 @@ func generate(L: int, D: int, rng_stream: RandomNumberGenerator, db) -> BoardDat
 		attempts_used = k
 		var b := _attempt(params, rng_stream, db)
 		var badness := _badness(b, params)
-		if best_bad == null or _lex_less(badness, best_badness):
-			best_bad = b
-			best_badness = badness
+		if best["bad"] == null or _lex_less(badness, best["badness"]):
+			best["bad"] = b
+			best["badness"] = badness
 		# R₀≤cap 重掷闸触发计数（迭代14① T3——尝试事实，与合法性判定独立记录；占比=T5 闸触发率读数）
 		if int(params.r0_cap) > 0 and b.compute_r0().size() > int(params.r0_cap):
 			r0_cap_rejected += 1
 		if legality(b, params):
-			var m: Dictionary[Variant, Variant] = measure_inferability(b)   # 求解器每合法板恰一次（O3 收口——此前重复调用两次）
-			var inf: float = m["inferability"]
-			if best_legal == null or inf > best_legal_score:
-				best_legal = b
-				best_legal_score = inf
+			var inf: float = measure_inferability(b)["inferability"]   # 求解器每合法板恰一次（O3 收口——此前重复调用两次）
+			if best["legal"] == null or inf > best["legal_score"]:
+				best["legal"] = b
+				best["legal_score"] = inf
 			if inf >= params.target:   # 单一判据（棋盘生成：现行规则已回归"可推理率 ≥ 及格线"）
 				accepted = b
 				accept_mode = "first_pass"
 				break
 	if accepted == null:
-		if best_legal != null:
-			accepted = best_legal
-			accept_mode = "accept_best"
-			accepted.degraded_product = true   # 降级标记（独立于 illegal_product——三分出口表要求标记随产物上抛）
-			push_warning("[棋盘生成] 重试耗尽无达标——接受最优出图（强告警埋点，target=%.2f best=%.3f）" % [params.target, best_legal_score])
-		else:
-			accepted = best_bad
-			accept_mode = "accept_worst"
-			accepted.illegal_product = true
-			push_error("[棋盘生成] attempts 耗尽零合法——接受最不坏出图 + 非法产物标记（玩家永不卡死）")
-	_finalize(accepted, params, attempts_used, accept_mode, db, r0_cap_rejected)
-	return accepted
+		var fallback := _accept_fallback(params, best["legal"], best["legal_score"], best["bad"])
+		accepted = fallback[0]
+		accept_mode = fallback[1]
+	return {"board": accepted, "mode": accept_mode, "attempts": attempts_used, "r0_rej": r0_cap_rejected}
+
+
+## 三分出口（重试耗尽）：接受最优（降级标记）或接受最不坏（非法产物标记——玩家永不卡死）
+func _accept_fallback(params: Dictionary, best_legal: BoardData, best_legal_score: float, best_bad: BoardData) -> Array:
+	if best_legal != null:
+		best_legal.degraded_product = true   # 降级标记（独立于 illegal_product——三分出口表要求标记随产物上抛）
+		push_warning("[棋盘生成] 重试耗尽无达标——接受最优出图（强告警埋点，target=%.2f best=%.3f）" % [params.target, best_legal_score])
+		return [best_legal, "accept_best"]
+	best_bad.illegal_product = true
+	push_error("[棋盘生成] attempts 耗尽零合法——接受最不坏出图 + 非法产物标记（玩家永不卡死）")
+	return [best_bad, "accept_worst"]
 
 
 # ==================== 五阶段：单次尝试 ====================
@@ -94,8 +104,20 @@ func _attempt(params: Dictionary, rng_stream: RandomNumberGenerator, db) -> Boar
 	b.board_type = str(params.board_type)
 	b.level_index = params.L
 	b.node_depth = params.D
-	# ② 布雷：N = round(d×(W×H−9)) 先定数；域 = 全格 − 出生 3×3；均匀布雷后"先布后删"
-	# （−9 = 出生区格数，常量单点 BoardData.SPAWN_AREA_CELLS）
+	# ② 布雷：N = round(d×(W×H−9)) 先定数；域 = 全格 − 出生 3×3；均匀布雷后"先布后删"（_populate_mines 承载——Fisher-Yates 取号段整体随迁）
+	var removed := _populate_mines(b, params, rng_stream)
+	# ③ 变异布置（地形变异 框架面）：布置约束与算法随首批变异类型定稿（生成期布置接口结构位），
+	# 定稿前零布置——清单为空是合法态（P0），静默产出无变异图。
+	b.metrics = {
+		"metric_version": METRIC_VERSION,
+		"ring_removed": removed,
+	}
+	return b
+
+
+## 布雷与剃雷域：域 = 全格 − 出生 3×3；均匀布雷（部分 Fisher-Yates，确定性，消费 board_gen 流）
+## 后剃出生环雷，返回 ring_removed（指标语义不变——现值变小=收窄批预期）
+func _populate_mines(b: BoardData, params: Dictionary, rng_stream: RandomNumberGenerator) -> int:
 	var spawn := {}
 	for c in b.spawn_cells():
 		spawn[c] = true
@@ -104,7 +126,7 @@ func _attempt(params: Dictionary, rng_stream: RandomNumberGenerator, db) -> Boar
 		if not spawn.has(c):
 			domain.append(c)
 	var n_mines: int = target_mine_count(params)
-	# 部分 Fisher-Yates（确定性，消费 board_gen 流）
+	# 部分 Fisher-Yates（确定性，消费 board_gen 流）——取号序冻结（契约：同种子逐位一致）
 	for i in range(0, mini(n_mines, domain.size())):
 		var j := rng_stream.randi_range(i, domain.size() - 1)
 		var tmp = domain[i]
@@ -116,9 +138,14 @@ func _attempt(params: Dictionary, rng_stream: RandomNumberGenerator, db) -> Boar
 	# 先布后删：剃雷域 = 距 spawn_center 切比雪夫距离 ≤1+r 的格（迭代14①收窄批 T2——原「R₀ flood 域∪
 	# 外扩 1 环」全域剃雷=开局开阔地巨大根因〔10×10 板 R₀ 均值 68.6=板面 68.6%〕；收窄后开阔地=
 	# 出生邻域外的自然 flood。r 读表 shave_ring_radius（r=1 → 5×5=25 格；r=0 即只剃出生 3×3）。
-	# 只减不增、无迭代语义不变；ring_removed 指标语义不变（现值变小=预期）；零 RNG 消费变化——
-	# 同种子布雷序列逐位一致，仅移除域收窄。
-	var shave_r: int = int(params.get("shave_r", 1))
+	# 只减不增、无迭代语义不变；零 RNG 消费变化。
+	var removed := _shave_ring(b, int(params.get("shave_r", 1)))
+	_compute_digits(b)
+	return removed
+
+
+## 剃雷环域（零 RNG）：距出生心切比雪夫 ≤1+r 的环内剃雷，返回剃除数
+func _shave_ring(b: BoardData, shave_r: int) -> int:
 	var ring := {}
 	for c in b.all_cells():
 		if maxi(absi(c.x - b.spawn_center.x), absi(c.y - b.spawn_center.y)) <= 1 + shave_r:
@@ -128,14 +155,7 @@ func _attempt(params: Dictionary, rng_stream: RandomNumberGenerator, db) -> Boar
 		if b.mines.has(c):
 			b.mines.erase(c)
 			removed += 1
-	_compute_digits(b)
-	# ③ 变异布置（地形变异 框架面）：布置约束与算法随首批变异类型定稿（生成期布置接口结构位），
-	# 定稿前零布置——清单为空是合法态（P0），静默产出无变异图。
-	b.metrics = {
-		"metric_version": METRIC_VERSION,
-		"ring_removed": removed,
-	}
-	return b
+	return removed
 
 
 func _compute_digits(b: BoardData) -> void:
@@ -164,49 +184,12 @@ func measure_inferability(b: BoardData) -> Dictionary:
 	while changed:
 		changed = false
 		# 算子① 连锁：0 格的 8 邻安全格全入 R
-		var frontier: Array[Variant] = r.keys()
-		for x in frontier:
-			if safe_set.has(x) and b.digit_of(x) == 0:
-				for n in b.neighbors8(x):
-					if safe_set.has(n) and not r.has(n):
-						r[n] = true
-						changed = true
+		changed = _apply_chain_rule(b, r, safe_set) or changed
 		# 信息源：数字约束 single + subset（solver_rules=single_subset 冻结域）
 		var constraints := _build_constraints(b, r, known_mines, safe_set)
-		# single 规则
-		for con in constraints:
-			if con.mines == 0:
-				for c in con.unknown:
-					if not r.has(c):
-						r[c] = true
-						changed = true
-			elif con.mines == con.unknown.size():
-				for c in con.unknown:
-					if not known_mines.has(c):
-						known_mines[c] = true
-						changed = true
-		# subset 规则：U1 ⊂ U2 ⇒ (d2−d1, U2∖U1)
-		var derived := []
-		for i in constraints.size():
-			for j in range(i + 1, constraints.size()):
-				var a: Dictionary[Variant, Variant] = constraints[i]
-				var bb: Dictionary[Variant, Variant] = constraints[j]
-				var sub := _subset_of(a.unknown, bb.unknown)
-				if sub == 1:
-					derived.append(_diff_constraint(a, bb))
-				elif sub == 2:
-					derived.append(_diff_constraint(bb, a))
-		for con in derived:
-			if con.mines == 0:
-				for c in con.unknown:
-					if not r.has(c):   # 同 no-peek 口径：推导结论不再用 safe_set 复核（约束本身可靠）
-						r[c] = true
-						changed = true
-			elif con.mines == con.unknown.size():
-				for c in con.unknown:
-					if not known_mines.has(c):
-						known_mines[c] = true
-						changed = true
+		changed = _apply_single_rules(constraints, r, known_mines) or changed
+		var derived := _derived_constraints(constraints)
+		changed = _apply_derived_rules(derived, r, known_mines) or changed
 	var r_inf := r.keys()
 	var s_count := safe_set.size()
 	var inferability: float = float(r_inf.size()) / float(maxi(1, s_count))
@@ -217,6 +200,68 @@ func measure_inferability(b: BoardData) -> Dictionary:
 	}
 
 
+## 算子① 连锁域：0 格的 8 邻安全格全入 R（返回本轮是否有新增）
+func _apply_chain_rule(b: BoardData, r: Dictionary, safe_set: Dictionary) -> bool:
+	var changed := false
+	var frontier: Array[Variant] = r.keys()
+	for x in frontier:
+		if safe_set.has(x) and b.digit_of(x) == 0:
+			for n in b.neighbors8(x):
+				if safe_set.has(n) and not r.has(n):
+					r[n] = true
+					changed = true
+	return changed
+
+
+## single 规则域：零雷约束开格／满雷约束标雷（返回本轮是否有新增）
+func _apply_single_rules(constraints: Array, r: Dictionary, known_mines: Dictionary) -> bool:
+	var changed := false
+	for con in constraints:
+		if con.mines == 0:
+			for c in con.unknown:
+				if not r.has(c):
+					r[c] = true
+					changed = true
+		elif con.mines == con.unknown.size():
+			for c in con.unknown:
+				if not known_mines.has(c):
+					known_mines[c] = true
+					changed = true
+	return changed
+
+
+## subset 派生域：U1 ⊂ U2 ⇒ (d2−d1, U2∖U1)（对约束对做包含判定，产出派生约束集）
+func _derived_constraints(constraints: Array) -> Array:
+	var derived := []
+	for i in constraints.size():
+		for j in range(i + 1, constraints.size()):
+			var a: Dictionary[Variant, Variant] = constraints[i]
+			var bb: Dictionary[Variant, Variant] = constraints[j]
+			var sub := _subset_of(a.unknown, bb.unknown)
+			if sub == 1:
+				derived.append(_diff_constraint(a, bb))
+			elif sub == 2:
+				derived.append(_diff_constraint(bb, a))
+	return derived
+
+
+## 派生规则域：派生约束的零雷开格／满雷标雷（同 no-peek 口径：推导结论不再用 safe_set 复核——约束本身可靠）
+func _apply_derived_rules(derived: Array, r: Dictionary, known_mines: Dictionary) -> bool:
+	var changed := false
+	for con in derived:
+		if con.mines == 0:
+			for c in con.unknown:
+				if not r.has(c):
+					r[c] = true
+					changed = true
+		elif con.mines == con.unknown.size():
+			for c in con.unknown:
+				if not known_mines.has(c):
+					known_mines[c] = true
+					changed = true
+	return changed
+
+
 func _build_constraints(b: BoardData, r: Dictionary, known_mines: Dictionary, safe_set: Dictionary) -> Array:
 	var out: Array[Dictionary] = []
 	for c in r.keys():
@@ -337,7 +382,7 @@ func _neighbor_mine_count(b: BoardData, c: Vector2i) -> int:
 
 # ==================== 产出上报（生成期指标集） ====================
 
-func _finalize(b: BoardData, params: Dictionary, attempts_used: int, accept_mode: String, _db, r0_cap_rejected: int = 0) -> void:  # type-hint: ignore（同 generate——测量面 stub 注入）
+func _finalize(b: BoardData, params: Dictionary, attempts_used: int, accept_mode: String, r0_cap_rejected: int = 0) -> void:
 	var m := measure_inferability(b)
 	# 产物断言（棋盘生成 出生区安全与反退化布雷）：实际雷数 ≤ 目标雷数 N——先布后删只减不增，失败即致命
 	var n_target: int = target_mine_count(params)

game/core/config_db.gd

@@ -1,6 +1,8 @@
 ## VERTICAL SLICE - NOT FOR PRODUCTION
-## 数值表单点访问入口：全部 .tres 表的加载、校验诊断与类型化访问器（垂直切片验证：改表即改玩法，数值零硬编码）。
-## 玩法代码禁止绕过本单点自建 load()；消费面一律走访问器，禁直读行集。
+## 数值表单点访问入口：全部 .tres 表的加载、校验诊断与门面（垂直切片验证：改表即改玩法，数值零硬编码）。
+## 玩法代码禁止绕过本单点自建 load()；行查询归各表类（表管自己的行——2026-10-27 全清设计定稿），
+## 表持有按域收进三容器（combat 战斗编排域／run 冒险 runner 域／crossrun 跨局元进度域），
+## 消费面经 db.<容器>.<表> 直连。「经 ConfigDB 单点读取」＝经其持有的容器与表对象（架构 :88）。
 ## headless --script 模式无 autoload——冒烟脚本显式实例化本类；加载失败 is_ready=false 加 fatal 封印，调用方须查。
 class_name ConfigDb
 extends Node
@@ -29,39 +31,23 @@ const TABLE_MANIFEST := {
 	"forge": "forge.tres",   # ForgeTable——两根类型轴默认值+六路线行族；攻防所有权切分唯一数据面
 }
 
-var action_economy: ActionEconomyTable
-var variation: VariationTable
-var status_effects: StatusEffectTable
-var board_gen: BoardGenTable
-var enemy: EnemyTable
-var skill: SkillTable
-var hero: HeroTable
-var reward: RewardTable
-var settlement: SettlementTable
-var level: LevelTable
-var difficulty: DifficultyTable
-var level_gen_params: LevelGenParams   # 参数档类型化持用（生成器只吃参数档、不认关卡号——卡① 契约 6）
-# ShopTable 类型化持用（schema class_name 已已入库；
-# 消费面一律走下方 shop_* 访问器，禁直读行集）
-var shop: ShopTable = null
-# MetaTable 类型化持用（schema 与表同源已入库）
-var meta: MetaTable
-var meta_tree: MetaTreeTable   # 类型化持用（消费面走 tree_node 访问器）
-var treasure_items: TreasureItemTable   # 类型化持用（消费面走 treasure_* 访问器）
-var adventure: AdventureTable
-var feats: FeatTable   # 类型化持用（消费面走 feat_* 访问器）
-var forge: ForgeTable   # 锻造工坊配置（默认两轴+六路线行族——消费面走 forge_* 访问器）
+var combat: ConfigDomainCombat      # 战斗编排域七表（board_gen/variation/status_effects/enemy/skill/hero/settlement）
+var run: ConfigDomainRun            # 冒险 runner 域七表（level/difficulty/level_gen_params/reward/adventure/action_economy/shop）
+var crossrun: ConfigDomainCrossrun  # 跨局元进度域五表（meta/meta_tree/treasure_items/feats/forge）
 
 var is_ready := false
 var _diagnostics: Array[Dictionary] = []     # {severity, category, message}
-var _resolver: ConfigDbResolver              # R1 难度行解析协作类（门面公有签名不变）
+var _resolver: ConfigDbResolver              # R1 难度行解析协作类（门面公有签名不变；load_tables 装配段注入三表）
 var _validator := ConfigDbCrossValidator.new()   # 跨表校验协作类（无状态——声明期即建）
 var _reload_gate := false                    # 数据配置 EC8——战斗结算 唯一调用方
 
 
 func _init() -> void:
+	combat = ConfigDomainCombat.new()
+	run = ConfigDomainRun.new()
+	crossrun = ConfigDomainCrossrun.new()
 	_resolver = ConfigDbResolver.new(push_diag,
-		func() -> Variant: return board_gen.rows, func() -> Variant: return enemy.rows, func() -> Variant: return difficulty)   # 协作类持门面引用（诊断/致命通道回呼）
+		func() -> Variant: return combat.board_gen.rows, func() -> Variant: return combat.enemy.rows, func() -> Variant: return run.difficulty)   # 协作类持门面引用（诊断/致命通道回呼）
 
 
 func push_diag(severity: String, category: String, message: String) -> void:
@@ -132,312 +118,46 @@ func load_tables(root: String, collect_only: bool) -> bool:
 	if has_errors and not collect_only:
 		# 游戏通道：致命（Rule 6）——is_ready 恒 false，调用方（主场景）中止构建
 		return false
-	action_economy = loaded.get("action_economy")
-	variation = loaded.get("variation")
-	status_effects = loaded.get("status_effects")
-	board_gen = loaded.get("board_gen")
-	enemy = loaded.get("enemy")
-	skill = loaded.get("skill")
-	hero = loaded.get("hero")
-	reward = loaded.get("reward")
-	settlement = loaded.get("settlement")
-	level = loaded.get("level")
-	difficulty = loaded.get("difficulty")
-	level_gen_params = loaded.get("level_gen_params")
-	shop = loaded.get("shop")
-	meta = loaded.get("meta")
-	treasure_items = loaded.get("treasure_items")
-	adventure = loaded.get("adventure")
-	feats = loaded.get("feats")
-	forge = loaded.get("forge")
-	meta_tree = loaded.get("meta_tree")
+	# 容器装配（19 表成员按域收进三容器——2026-10-27 全清设计定稿）
+	combat.board_gen = loaded.get("board_gen")
+	combat.variation = loaded.get("variation")
+	combat.status_effects = loaded.get("status_effects")
+	combat.enemy = loaded.get("enemy")
+	combat.skill = loaded.get("skill")
+	combat.hero = loaded.get("hero")
+	combat.settlement = loaded.get("settlement")
+	run.level = loaded.get("level")
+	run.difficulty = loaded.get("difficulty")
+	run.level_gen_params = loaded.get("level_gen_params")
+	run.reward = loaded.get("reward")
+	run.adventure = loaded.get("adventure")
+	run.action_economy = loaded.get("action_economy")
+	run.shop = loaded.get("shop")
+	crossrun.meta = loaded.get("meta")
+	crossrun.meta_tree = loaded.get("meta_tree")
+	crossrun.treasure_items = loaded.get("treasure_items")
+	crossrun.feats = loaded.get("feats")
+	crossrun.forge = loaded.get("forge")
+	# resolver 协作件注入三表（resolve 委托承载——resolver 文件与键零搬移）
+	combat.board_gen._resolver = _resolver
+	combat.enemy._resolver = _resolver
+	run.difficulty._resolver = _resolver
 	is_ready = not has_errors
 	return not has_errors
 
 
-# ---- relic 访问器（消费面一律走本组，禁直读行集）----
-
-func feat_row(feat_id: String) -> Dictionary:
-	return feats.row_by_id(feat_id) if feats != null else {}
-
-
-# 规则改写型特性带令牌构建源（池接线——CurioDeck.build 消费；行 rarity→投放档映射）
-func feat_rows() -> Array:
-	return feats.rows if feats != null else []
-
-
-# 天赋树节点行（MetaProgression 树段/营地树 UI 取数口）
-func tree_node(node_id: String) -> Dictionary:
-	return meta_tree.row_by_id(node_id) if meta_tree != null else {}
-
-
-func tree_rows() -> Array:
-	return meta_tree.rows if meta_tree != null else []
-
-
 # 跨表校验（悬空引用 / 池护栏——全部加载期致命）本体：
 # ConfigDbCrossValidator（core/config_db_cross_validator.gd）承载，门面公有签名不变。
 func _cross_validate(loaded: Dictionary) -> void:
 	_validator.cross_validate(loaded, push_diag)
 
 
-# 池模板 × 技能行跨表校验（冒烟直验独立入口——签名与消费面零变化，实现归协作类）
-func validate_skill_pool_links(skill_table: SkillTable, enemy_table: EnemyTable, status_table: StatusEffectTable = null) -> Array:
+# 池模板 × 技能行跨表校验（冒烟直验独立入口——签名与消费面零变化，实现归协作类；门面私有——
+# 消费面经门面者改 _ 前缀直调，cross_validator 直验入口公开面不变）
+func _validate_skill_pool_links(skill_table: SkillTable, enemy_table: EnemyTable, status_table: StatusEffectTable = null) -> Array:
 	return _validator.validate_skill_pool_links(skill_table, enemy_table, status_table)
 
 
-# ---- R1 难度行解析（ceil 向上取整保证偏难；域越界与内容缺口 Fatal 退出）----
-# 解析本体：ConfigDbResolver（core/config_db_resolver.gd）承载——
-# 含 _resolve_progress/_ceil_key 与 R1 告警去重注册表；门面同名方法委托，越域 Fatal 语义一致。
-func resolve_board_gen(L: int, D: int) -> Dictionary:
-	return _resolver.resolve_board_gen(L, D)
-
-
-func resolve_enemy_rowset(L: int, D: int, row_kind: String) -> Array[Dictionary]:
-	return _resolver.resolve_enemy_rowset(L, D, row_kind)   # 行集数组形态（非单行 Dictionary；D 维带寻址）
-
-
-# 难度曲线与Boss DifficultyTable 消费面（敌人系统.spawn 调用）：(L,D) 精确匹配修饰乘数，越域值 clamp（GDD Edge Case——组合事故非配置事故）
-func resolve_difficulty_modifiers(L: int, D: int) -> Dictionary:
-	return _resolver.resolve_difficulty_modifiers(L, D)
-
-
-# ---- 地形变异 variant_pool_gate：候选池门控（∅ board_types = 通配；字段名对齐
-# board_type 词表，无 biome_tags）----
-# 门控第三维 = 节点身份（全局作用域变异）：scope=global 行仅 boss/elite 节点入池，
-# 其余节点（battle 等）静默跳过——门控兜底 P0 口径（零报错零警告）；elite 系前向词位（首发零表行）。
-# node_type 缺省 "" = 旧双参调用口径（global 行跳过）——既有测试/冒烟调用零扰动。
-
-func variant_pool(level_index: int, board_type: String, node_type: String = "") -> Array:
-	var pool: Array[Dictionary] = []
-	for row in variation.rows:
-		if String(row.get("scope", "region")) == "global" \
-				and node_type != "boss" and node_type != "elite":
-			continue
-		if int(row.get("unlock_level", 999)) > level_index:
-			continue
-		var tags: Array[Variant] = row.get("board_types", [])
-		if tags.is_empty():
-			pool.append(row)
-			continue
-		if tags.has(board_type):
-			pool.append(row)
-	return pool
-
-
-# 全局型单行决议（战斗编排装板期消费——访问器纪律：消费面禁直扫表）：
-# boss/elite 节点取候选池内首个 scope=global 行（首发批全局池恒恰一行；多行为配置越界态，
-# 按表序取首行确定性兜底）；空 = 无全局型（调用方回落 region 布置——兜底回落合法态）
-func global_variant_row(level_index: int, board_type: String, node_type: String) -> Dictionary:
-	if node_type != "boss" and node_type != "elite":
-		return {}
-	for row in variant_pool(level_index, board_type, node_type):
-		if String(row.get("scope", "region")) == "global":
-			return row
-	return {}
-
-
-func status_effect_row(effect_id: String) -> Dictionary:
-	return status_effects.row_by_id(effect_id)
-
-
-# ---- 关卡行集访问器（表访问收口——level_runner/meta_progression/adventure_runner
-# 不直扫 db.level.rows；消费面一律走本访问器，行集解析单点归 LevelTable）----
-
-# 关卡行单点读取（键 = level_index，缺行返回空字典——消费方按既有空行防御路径处理）
-func level_row(level_index: int) -> Dictionary:
-	return level.row_by_level_index(level_index) if level != null else {}
-
-
-# 参数档单点读取（节点图生成器核心批 卡①——键 = level_index，缺行返回空字典；调用方据此产图，生成器本体不读关卡号）
-func level_gen_params_row(level_index: int) -> Dictionary:
-	return level_gen_params.row_by_level_index(level_index) if level_gen_params != null else {}
-
-
-# 序列总关数（AdventureRunner levels_total / MetaProgression 关卡完成累加域的取数口径）
-func level_count() -> int:
-	return level.rows.size() if level != null else 0
-
-
-# ---- ShopTable 消费面（行集解析单点——runner/战斗编排禁自扫表）----
-# ── 秘宝访问器（消费面一律走访问器，禁直读行集）──
-# 活行集（非 retired 非 deferred）——投放校验/奖励节点池/呈现可用性的唯一取数口径
-func treasure_item_row(item_id: String) -> Dictionary:
-	return treasure_items.row_by_id(item_id) if treasure_items != null else {}
-
-
-# 过渡渠道活行（form 空 = 切片期过渡形态）——掉落投放/停点池/工坊解锁取数口径；同调行（form 非空）
-# 永不入过渡渠道
-func treasure_transitional_rows() -> Array:
-	return treasure_items.transitional_rows() if treasure_items != null else []
-
-
-# 同调行集（form 非空——装配覆盖层/效果接线的取数口径）
-func treasure_attunement_rows() -> Array:
-	return treasure_items.attunement_rows() if treasure_items != null else []
-
-
-# 活行词表（掉落投放 effect_id 白名单——过渡渠道口径）
-# ── 同调槽位数=树同调位节点点亮数，判定源=Attunement.slots（无 attunement_growth 谓词表访问器）；
-# boss_kill_count/clear_count 计数域保留——非槽位硬消费在册 ──
-
-
-# 行族四轴（数据契约，行集归 shop.tres）：gp_drops {tier, mean, roll_min, roll_max} ·
-# level_gp_bonus {level_index, bonus} · products {product_id, display_name, attr, flat_value,
-# base_price, price_increment} · price_level_bonus {level_index, bonus}。
-# 行族经 ShopTable 同名数组属性读取（.get 容缺——表已入库前查询恒空，掉落按 0 兑付的兜底在调用方）。
-
-func shop_gp_drop_row(tier: String) -> Dictionary:
-	for row in _shop_rows("gp_drops"):
-		if String(row.get("tier", "")) == tier:
-			return row
-	return {}
-
-
-func shop_level_gp_bonus(level_index: int) -> int:
-	for row in _shop_rows("level_gp_bonus"):
-		if int(row.get("level_index", -1)) == level_index:
-			return int(row.get("bonus", 0))
-	return 0
-
-
-func shop_price_level_bonus(level_index: int) -> int:
-	for row in _shop_rows("price_level_bonus"):
-		if int(row.get("level_index", -1)) == level_index:
-			return int(row.get("bonus", 0))
-	return 0
-
-
-func shop_products() -> Array:
-	return _shop_rows("products")
-
-
-func shop_product_row(product_id: String) -> Dictionary:
-	for row in _shop_rows("products"):
-		if String(row.get("product_id", "")) == product_id:
-			return row
-	return {}
-
-
-# ── 共享池货架访问器（M-4——消费面一律走访问器，禁直读行集）──
-
-# 货架行族（{kind_id, display_name, base_price}——行序即抽签/呈现稳定序）
-func shop_pool_rows() -> Array:
-	return _shop_rows("pool_shelf")
-
-
-func shop_pool_row(kind_id: String) -> Dictionary:
-	for row in _shop_rows("pool_shelf"):
-		if String(row.get("kind_id", "")) == kind_id:
-			return row
-	return {}
-
-
-# 乘法价格因子（provisional 投值——0 = 表未投值，消费方按 fail-fast 域校验拦截）
-func shop_price_a() -> float:
-	return float(shop.price_a) if shop != null else 0.0
-
-
-func shop_price_b() -> float:
-	return float(shop.price_b) if shop != null else 0.0
-
-
-# 行族数组读取（ShopTable 属性名 = 行族名；表未已入库/属性缺失 = 空集非错误态）
-func _shop_rows(family: String) -> Array:
-	if shop == null:
-		return []
-	var arr = shop.get(family)
-	return arr if arr is Array else []
-
-
-# ---- MetaTable 消费面（行集解析单点——MetaProgression/呈现层禁自扫表）----
-# 行族四轴（数据契约，行集归 meta.tres，数值全 provisional）：
-# forge_products {attr, display_name, flat_value, base_price, price_ratio_pct} ·
-# boss_keystone {level_index, first_kill, repeat_kill} ·
-# workshop_items {item_id, display_name, clear_threshold} ·
-# conversion {attr, per_level_shift_pct}。
-
-func meta_boss_keystone_row(level_index: int) -> Dictionary:
-	for row in _meta_rows("boss_keystone"):
-		if int(row.get("level_index", -1)) == level_index:
-			return row
-	return {}
-
-
-# 秘宝解锁混合制挂 treasure_items 行内（无 meta_workshop_items 访问器）；
-# 秘宝解锁投影面=MetaProgression.treasure_shop_status
-
-
-func meta_conversion_row(attr: String) -> Dictionary:
-	for row in _meta_rows("conversion"):
-		if String(row.get("attr", "")) == attr:
-			return row
-	return {}
-
-
-# Y 刷新升级行单点读取（键 = 等级，缺行返回空字典=未购/已满级合法态）
-func meta_attune_refresh_row(level: int) -> Dictionary:
-	for row in _meta_rows("attune_refresh_upgrade"):
-		if int(row.get("level", -1)) == level:
-			return row
-	return {}
-
-
-# 行族数组读取（MetaTable 属性名 = 行族名；表缺失/属性缺失 = 空集非错误态）
-func _meta_rows(family: String) -> Array:
-	if meta == null:
-		return []
-	var arr = meta.get(family)
-	return arr if arr is Array else []
-
-
-# ---- 锻造工坊（ForgeTable 消费面：两根类型轴默认值+六路线行族；禁自扫行集）----
-# 设计权威 design/gdd/systems/跨局循环/锻造工坊.md v0.6：默认值归本表常驻持有（hero.tres 两轴已删——
-# 契约 2）；路线行族=攻防数值成长唯一数据面（契约 1）。数值全 provisional 归 M4。
-
-# 两根类型轴默认值（表未已入库=裸体态兜底 normal/light——与 ForgeTable 缺省值同口径）
-func forge_default_attack_type() -> String:
-	return String(forge.default_attack_type) if forge != null else "normal"
-
-
-func forge_default_armor_type() -> String:
-	return String(forge.default_armor_type) if forge != null else "light"
-
-
-# 六路线行族（副本——调用方禁改）
-func forge_routes() -> Array:
-	return forge.routes.duplicate() if forge != null else []
-
-
-# 路线行单点（键 route_id；缺行=空字典）
-func forge_route(route_id: String) -> Dictionary:
-	for row in forge_routes():
-		if String(row.get("route_id", "")) == route_id:
-			return row
-	return {}
-
-
-# 按类型轴反查武器路线（attack_type → 路线行；甲路线 id=甲型同值的显式化入口，避免消费侧依赖该巧合）
-func forge_weapon_route_by_type(attack_type: String) -> Dictionary:
-	for row in forge_routes():
-		if String(row.get("kind", "")) == "weapon" and String(row.get("type_axis", "")) == attack_type:
-			return row
-	return {}
-
-
-# 按类型轴反查护甲路线（armor_type → 路线行——入战 AC 三层之「甲型基础 AC」取数口）
-func forge_armor_route_by_type(armor_type: String) -> Dictionary:
-	for row in forge_routes():
-		if String(row.get("kind", "")) == "armor" and String(row.get("type_axis", "")) == armor_type:
-			return row
-	return {}
-
-
-# 技能行单点读取（敌人技能池批——单位容器执行上报 / 战斗结算兑现的消费面）
-func skill_row(skill_id: String) -> Dictionary:
-	return skill.row_by_id(skill_id)
-
-
 # ---- 数据配置 EC8：debug 热重载门（战斗结算 唯一调用方；切片实现 = 门标志 + 拒绝语义）----
 
 func set_reload_gate(gated: bool) -> void:

game/core/config_db_cross_validator.gd

@@ -11,21 +11,43 @@ func cross_validate(loaded: Dictionary, push_diag: Callable) -> void:
 	var st_tab: SettlementTable = loaded.get("settlement")
 	if st == null or rt == null or st_tab == null:
 		return  # 单表校验已报错，不连锁
+	# ①c F2 投放维度覆盖校验不启用：挖格不掉道具，秘宝
+	# 唯一来路=三选一共享池〔节点/关卡完成〕；共享池为「抽到道具位再动态掷定具体道具」，维度覆盖不可
+	# 静态校验。
+	var effect_ids := _effect_ids_of(st)
+	_cv_reward_dangling(rt, effect_ids, push_diag)          # ① 增益词表悬空
+	_cv_reward_treasure(loaded, rt, push_diag)              # ①b aux 投放行双表
+	_cv_poolmap(st_tab, effect_ids, push_diag)              # ② 池映射悬空
+	_cv_source_labels(st_tab, push_diag)                    # ③ 来源标签键集
+	_cv_skill_pool(loaded, push_diag)                       # ⑤ 技能池引用完整性
+	_cv_shelf_pool(loaded, push_diag)                       # ⑥ 商店货架 × 冒险共享池
+	_cv_counter_closure(loaded, push_diag)                  # ⑦ 计数器引用闭合
+
+
+## 增益状态词表全集（effect_id → true）
+func _effect_ids_of(st: StatusEffectTable) -> Dictionary:
 	var effect_ids := {}
 	for row in st.rows:
 		effect_ids[row.get("effect_id", "")] = true
-	# ① RewardTable effect_id 悬空（percent 行引用 StatusEffectTable——悬空加载致命）。
-	# 例外：gp_gain/gp_loss = GP 战斗内缓冲（escrow）通道的路由键
-	# （战斗结算 _apply_gp_row 兑付——不入增益状态容器），词表封闭按字面豁免悬空引用校验。
+	return effect_ids
+
+
+## ① RewardTable effect_id 悬空（percent 行引用 StatusEffectTable——悬空加载致命）。
+## 例外：gp_gain/gp_loss = GP 战斗内缓冲（escrow）通道的路由键
+## （战斗结算 _apply_gp_row 兑付——不入增益状态容器），词表封闭按字面豁免悬空引用校验。
+func _cv_reward_dangling(rt: RewardTable, effect_ids: Dictionary, push_diag: Callable) -> void:
 	for row in rt.rows:
 		if String(row.get("cell_type", "")) == RewardTable.TREASURE_ITEM_TYPE:
 			continue   # aux 行 effect_id=item_id——归 ①b 双表校验（reward_dangling_treasure），不入增益词表面
 		var eff: String = row.get("effect_id", "")
 		if eff != "" and eff != "gp_gain" and eff != "gp_loss" and not effect_ids.has(eff):
 			push_diag.call("error", "dangling_effect", "RewardTable %s 引用不存在的 effect_id: %s" % [row.get("reward_id"), eff])
-	# ①b RewardTable aux 投放行双表校验（reward_dangling_treasure）：aux 行 effect_id = item_id，
-	# 须命中 TreasureItemTable 活行（非 retired 非 deferred——罗盘退役/失义件不投放）。retired 行被引用=退役
-	# 后仍投放（连带错误），同拦。
+
+
+## ①b RewardTable aux 投放行双表校验（reward_dangling_treasure）：aux 行 effect_id = item_id，
+## 须命中 TreasureItemTable 活行（非 retired 非 deferred——罗盘退役/失义件不投放）。retired 行被引用=退役
+## 后仍投放（连带错误），同拦。
+func _cv_reward_treasure(loaded: Dictionary, rt: RewardTable, push_diag: Callable) -> void:
 	var treasure_live := {}
 	var treasure_tab = loaded.get("treasure_items")
 	if treasure_tab != null:
@@ -39,27 +61,36 @@ func cross_validate(loaded: Dictionary, push_diag: Callable) -> void:
 				continue
 			if not treasure_live.has(treasure_eff):
 				push_diag.call("error", "reward_dangling_treasure", "RewardTable %s aux 行引用无效道具 %s（retired/deferred/不存在）: %s" % [row.get("reward_id"), treasure_eff, "双表校验"])
-	# ①c F2 投放维度覆盖校验不启用：挖格不掉道具，秘宝
-	# 唯一来路=三选一共享池〔节点/关卡完成〕；共享池为「抽到道具位再动态掷定具体道具」，维度覆盖不可
-	# 静态校验。
-	# ② SettlementTable.effect_pool_map 悬空
+
+
+## ② SettlementTable.effect_pool_map 悬空
+func _cv_poolmap(st_tab: SettlementTable, effect_ids: Dictionary, push_diag: Callable) -> void:
 	for eff in st_tab.core.effect_pool_map.keys():
 		if not effect_ids.has(eff):
 			push_diag.call("error", "poolmap_dangling", "SettlementTable.effect_pool_map 悬空 effect_id: %s" % eff)
-	# ③ source_label_map 键集封闭性（键 = 增益状态 source_class ∪ {enemy_action, hero_attack, seal_miss}）
+
+
+## ③ source_label_map 键集封闭性（键 = 增益状态 source_class ∪ {enemy_action, hero_attack, seal_miss}）
+func _cv_source_labels(st_tab: SettlementTable, push_diag: Callable) -> void:
 	var required_sources := ["safe_cell", "seal_hit", "mine_hit", "clear_reward", "hero_attack", "enemy_action", "seal_miss"]
 	for s in required_sources:
 		if not st_tab.core.source_label_map.has(s):
 			push_diag.call("error", "segorder_violation", "source_label_map 缺必需键: %s" % s)
-	# ⑤ 技能池引用完整性（敌人技能池批——敌人表池 × 技能表；独立入口 validate_skill_pool_links 供冒烟直验）
+
+
+## ⑤ 技能池引用完整性（敌人技能池批——敌人表池 × 技能表；独立入口 validate_skill_pool_links 供冒烟直验）
+func _cv_skill_pool(loaded: Dictionary, push_diag: Callable) -> void:
 	var en: EnemyTable = loaded.get("enemy")
 	var skt = loaded.get("skill")
 	if skt != null and en != null:
 		for e in validate_skill_pool_links(skt, en, loaded.get("status_effects")):
 			push_diag.call("error", e.category, e.message)
-	# ⑥ 商店货架 × 冒险共享池跨表校验（M-4——次数上限域）：
-	# pool_shelf kind 须命中 adventure.CURIO_KINDS 且为有限库存种（cap ∈ [1,99]——gp 无上限种/牌库外种
-	# 入货架 = 库存账本无锚，加载致命；gp 袋负交易切边/规则改写型特性三轴切边由 ShopTable 词表封闭另拦）
+
+
+## ⑥ 商店货架 × 冒险共享池跨表校验（M-4——次数上限域）：
+## pool_shelf kind 须命中 adventure.CURIO_KINDS 且为有限库存种（cap ∈ [1,99]——gp 无上限种/牌库外种
+## 入货架 = 库存账本无锚，加载致命；gp 袋负交易切边/规则改写型特性三轴切边由 ShopTable 词表封闭另拦）
+func _cv_shelf_pool(loaded: Dictionary, push_diag: Callable) -> void:
 	var adv = loaded.get("adventure")
 	var shp = loaded.get("shop")
 	if adv != null and shp != null:
@@ -78,34 +109,42 @@ func cross_validate(loaded: Dictionary, push_diag: Callable) -> void:
 			if quota < 1:
 				push_diag.call("error", "shelf_zero_quota", "ShopTable.pool_shelf kind %s 令牌配额为 0（牌库空种入货架 = 库存无锚）" % kind)
 
-	# ⑦ 计数器引用闭合（卡② V9——读点 id 必命中同名写入行，否则加载致命）：
-	# 声明集 = feats + treasure 各行 triggers 内 kind=counter_add 的 do.counter_id；
-	# 读点 = when fact=counter 的 id、do.value_counter、kind=counter_spend 的 counter_id。
-	var feats_tab = loaded.get("feats")
+
+## ⑦ 计数器引用闭合（卡② V9——读点 id 必命中同名写入行，否则加载致命）：
+## 声明集 = feats + treasure 各行 triggers 内 kind=counter_add 的 do.counter_id；
+## 读点 = when fact=counter 的 id、do.value_counter、kind=counter_spend 的 counter_id。
+func _cv_counter_closure(loaded: Dictionary, push_diag: Callable) -> void:
 	var trig_rows: Array[Variant] = []
+	var feats_tab = loaded.get("feats")
 	if feats_tab != null:
 		for r in feats_tab.rows:
 			trig_rows.append(r)
+	var treasure_tab = loaded.get("treasure_items")
 	if treasure_tab != null:
 		for r in treasure_tab.rows:
 			trig_rows.append(r)
+	var counter_decls := _counter_decls_of(trig_rows)
+	_cv_counter_reads(trig_rows, counter_decls, push_diag)
+
+
+## 计数器声明集收集：任一 do.counter_id 行（counter_add 直写、forgive_seal_miss 经 _apply_counter_hit 写——皆写入行）
+func _counter_decls_of(trig_rows: Array) -> Dictionary:
 	var counter_decls := {}
 	for row in trig_rows:
 		for tr_v in (row.get("triggers", []) as Array):
 			var dd: Dictionary[Variant, Variant] = (tr_v as Dictionary).get("do", {}) as Dictionary[Variant, Variant]
-			# 声明集＝任一 do.counter_id 行（counter_add 直写、forgive_seal_miss 经 _apply_counter_hit 写——皆写入行）
 			if dd.has("counter_id"):
 				counter_decls[String(dd.counter_id)] = true
+	return counter_decls
+
+
+## 计数器读点校验：when counter id／do.value_counter／counter_spend 的 counter_id 必命中声明集
+func _cv_counter_reads(trig_rows: Array, counter_decls: Dictionary, push_diag: Callable) -> void:
 	for row in trig_rows:
 		var rid := String(row.get("feat_id", row.get("item_id", "")))
 		for tr_v in (row.get("triggers", []) as Array):
 			var tr: Dictionary[Variant, Variant] = tr_v as Dictionary[Variant, Variant]
-			for c_v in (tr.get("when", []) as Array):
-				var c: Dictionary[Variant, Variant] = c_v as Dictionary[Variant, Variant]
-				if String(c.get("fact", "")) == "counter" and c.has("id"):
-					var rd := String(c.id)
-					if not counter_decls.has(rd):
-						push_diag.call("error", "counter_dangling_ref", "%s when counter 读点无同名写入行: %s（引用闭合）" % [rid, rd])
+			_check_counter_when(rid, tr, counter_decls, push_diag)
 			var do2: Dictionary[Variant, Variant] = tr.get("do", {}) as Dictionary[Variant, Variant]
 			if do2.has("value_counter") and not counter_decls.has(String(do2.value_counter)):
 				push_diag.call("error", "counter_dangling_ref", "%s value_counter 读点无同名写入行: %s" % [rid, String(do2.value_counter)])
@@ -113,6 +152,16 @@ func cross_validate(loaded: Dictionary, push_diag: Callable) -> void:
 				push_diag.call("error", "counter_dangling_ref", "%s counter_spend 无同名写入行: %s" % [rid, String(do2.counter_id)])
 
 
+## when counter 读点校验（fact=counter 条件的 id 必命中声明集）
+func _check_counter_when(rid: String, tr: Dictionary, counter_decls: Dictionary, push_diag: Callable) -> void:
+	for c_v in (tr.get("when", []) as Array):
+		var c: Dictionary[Variant, Variant] = c_v as Dictionary[Variant, Variant]
+		if String(c.get("fact", "")) == "counter" and c.has("id"):
+			var rd := String(c.id)
+			if not counter_decls.has(rd):
+				push_diag.call("error", "counter_dangling_ref", "%s when counter 读点无同名写入行: %s（引用闭合）" % [rid, rd])
+
+
 # 池模板 × 技能行跨表校验（加载期致命；返回错误列表——ConfigDB 诊断通道与冒烟直验共用）：
 # skill_id 悬空致命 + 池构成纪律（每池恰一行普攻、增益技 ≤1、妨害技 ≤1——proposal §2.1 结构保证 +
 # proposal-status-vocabulary §1.2）+ 施放类 side 守卫（增益引用 enemy 侧 / 妨害引用 hero 侧状态行）。
@@ -141,33 +190,25 @@ func validate_skill_pool_links(skill_table: SkillTable, enemy_table: EnemyTable,
 	errs.append_array(_pool_cast_side_errs(skill_table, status_table))   # 施放类 side 守卫（buff→敌方侧/debuff→主角侧，防反向挂接——全表恰一次）
 	for row in enemy_table.rows:
 		var eid: String = String(row.get("enemy_id", ""))
-		var basic_n := 0
-		var buff_n := 0
-		var debuff_n := 0
-		var uncond_special_n := 0
+		var pool_n := {"basic": 0, "buff": 0, "debuff": 0, "uncond_special": 0}
 		for entry in row.get("pool", []):
 			var sid: String = String(entry.get("skill_id", ""))
 			if not skill_types.has(sid):
 				errs.append({"category": "dangling_skill", "message": "EnemyTable %s 池引用不存在的 skill_id: %s（悬空致命）" % [eid, sid]})
 				continue
-			match skill_types[sid]:
-				"basic":
-					basic_n += 1
-				"buff":
-					buff_n += 1
-				"debuff":
-					debuff_n += 1
+			if pool_n.has(skill_types[sid]):
+				pool_n[skill_types[sid]] += 1
 			# 无条件特殊技计数（普攻不计；trigger 缺省行计数——触发条件批 2026-10-26 池构成纪律）
-			if skill_types[sid] != "basic" and not (skill_table.row_by_id(sid) if skill_table.has_method("row_by_id") else {}).is_empty():
+			if skill_types[sid] != "basic":
 				var srow_c: Dictionary[Variant, Variant] = skill_table.row_by_id(sid) if skill_table.has_method("row_by_id") else {}
-				if not srow_c.has("trigger"):
-					uncond_special_n += 1
-		if basic_n != 1:
-			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池普攻行数 ≠ 1 (%d)——普攻冷却恒 0 = 空池不可能的结构前提" % [eid, basic_n]})
-		if buff_n > 1:
-			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池增益技 > 1 (%d)——每池增益 ≤1 纪律（纠偏三）" % [eid, buff_n]})
-		if debuff_n > 1:
-			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池妨害技 > 1 (%d)——每池妨害 ≤1 纪律（新效应词汇批 2026-09-19）" % [eid, debuff_n]})
-		if uncond_special_n < 1:
+				if not srow_c.is_empty() and not srow_c.has("trigger"):
+					pool_n["uncond_special"] += 1
+		if pool_n["basic"] != 1:
+			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池普攻行数 ≠ 1 (%d)——普攻冷却恒 0 = 空池不可能的结构前提" % [eid, pool_n["basic"]]})
+		if pool_n["buff"] > 1:
+			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池增益技 > 1 (%d)——每池增益 ≤1 纪律（纠偏三）" % [eid, pool_n["buff"]]})
+		if pool_n["debuff"] > 1:
+			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池妨害技 > 1 (%d)——每池妨害 ≤1 纪律（新效应词汇批 2026-09-19）" % [eid, pool_n["debuff"]]})
+		if pool_n["uncond_special"] < 1:
 			errs.append({"category": "pool_composition", "message": "EnemyTable %s 池无条件特殊技行数 = 0——每池至少一行无条件特殊技纪律（触发条件批 2026-10-26）" % [eid]})
 	return errs

game/core/config_db_resolver.gd

@@ -43,11 +43,7 @@ func resolve_enemy_rowset(L: int, D: int, row_kind: String) -> Array[Dictionary]
 		return []
 	var rows: Array[Dictionary] = []
 	rows.assign(_enemy_rows_get.call())
-	var level_keys: Array[int] = []
-	for row in rows:
-		var lv := int(row.get("level_index", 0))
-		if not level_keys.has(lv):
-			level_keys.append(lv)
+	var level_keys: Array[int] = _level_keys_of(rows)
 	if level_keys.is_empty():
 		_diag.call("fatal", "structural", "enemy 行集为空——锚行校验应已拦截")
 		return []
@@ -58,12 +54,7 @@ func resolve_enemy_rowset(L: int, D: int, row_kind: String) -> Array[Dictionary]
 		_warn_resolve("enemy", "resolve_level_clamp", "enemy 请求 (%d,%d) clamp 解析（超出最大关卡取最大值）→ 关卡 %d" % [L, D, l_star], l_star, D)
 	elif l_star != L:
 		_warn_resolve("enemy", "resolve_level_ceil", "enemy 请求 (%d,%d) ceil 解析（向上取整保证偏难）→ 关卡 %d" % [L, D, l_star], l_star, D)
-	var band_keys: Array[int] = []
-	for row in rows:
-		if int(row.get("level_index", 0)) == l_star and String(row.get("row_kind", "")) == row_kind:
-			var bv := int(row.get("depth_band", -1))
-			if not band_keys.has(bv):
-				band_keys.append(bv)
+	var band_keys: Array[int] = _band_keys_of(rows, l_star, row_kind)
 	if band_keys.is_empty():
 		return []
 	band_keys.sort()
@@ -73,6 +64,32 @@ func resolve_enemy_rowset(L: int, D: int, row_kind: String) -> Array[Dictionary]
 		_warn_resolve("enemy", "resolve_depth_clamp", "enemy 请求 (%d,%d) clamp 解析（超出顶带取顶带）→ (%d,band %d)" % [L, D, l_star, d_star], l_star, d_star)
 	elif d_star != D:
 		_warn_resolve("enemy", "resolve_depth_ceil", "enemy 请求 (%d,%d) ceil 解析（向上取整保证偏难）→ (%d,band %d)" % [L, D, l_star, d_star], l_star, d_star)
+	return _band_rows(rows, l_star, row_kind, d_star)
+
+
+## 行集关卡键收集（纯行扫描——告警发射序不变）
+func _level_keys_of(rows: Array) -> Array[int]:
+	var level_keys: Array[int] = []
+	for row in rows:
+		var lv := int(row.get("level_index", 0))
+		if not level_keys.has(lv):
+			level_keys.append(lv)
+	return level_keys
+
+
+## 带键收集（纯行扫描——l_star × row_kind 的 depth_band 去重集）
+func _band_keys_of(rows: Array, l_star: int, row_kind: String) -> Array[int]:
+	var band_keys: Array[int] = []
+	for row in rows:
+		if int(row.get("level_index", 0)) == l_star and String(row.get("row_kind", "")) == row_kind:
+			var bv := int(row.get("depth_band", -1))
+			if not band_keys.has(bv):
+				band_keys.append(bv)
+	return band_keys
+
+
+## 带行收集（纯行扫描——命中带全部行、按表文件行序）
+func _band_rows(rows: Array, l_star: int, row_kind: String, d_star: int) -> Array[Dictionary]:
 	var all_out: Array[Dictionary] = []
 	for row in rows:
 		if int(row.get("level_index", 0)) == l_star and String(row.get("row_kind", "")) == row_kind \
@@ -108,11 +125,7 @@ func _resolve_progress(rows: Array, L: int, D: int, table_id: String) -> Variant
 	if L < 1 or D < 0:
 		_diag.call("fatal", "request_oob", "%s 请求越域 (%d,%d)——进度坐标低于合法域（关卡序号≥1、节点深度≥0）" % [table_id, L, D])
 		return {}
-	var level_keys: Array[int] = []
-	for row in rows:
-		var lv := int(row.get("level_index", 0))
-		if not level_keys.has(lv):
-			level_keys.append(lv)
+	var level_keys: Array[int] = _level_keys_of(rows)
 	if level_keys.is_empty():
 		_diag.call("fatal", "structural", "%s 行集为空——锚行校验应已拦截" % table_id)
 		return {}
@@ -121,40 +134,59 @@ func _resolve_progress(rows: Array, L: int, D: int, table_id: String) -> Variant
 	var l_clamped := l_star < 0
 	if l_clamped:
 		l_star = int(level_keys[-1])   # 超出最大行 → 取最大行封顶（可取范围内向上取整，超出用最大值）
+	var depth_keys: Array[int] = _depth_keys_of(rows, l_star)
+	depth_keys.sort()
+	var d_star := _ceil_key(depth_keys, D)
+	var d_clamped := d_star < 0
+	if d_clamped:
+		d_star = int(depth_keys[-1])
+	var missing := _missing_label(l_clamped, d_clamped, l_star != L, d_star != D)
+	if missing != "":
+		_emit_missing_warning(table_id, missing, [l_star, d_star], [L, D])
+	for row in rows:
+		if int(row.get("level_index", 0)) == l_star and int(row.get("node_depth", 0)) == d_star:
+			return row
+	return {}
+
+
+## 层键收集（纯行扫描——l_star 行的 node_depth 去重集）
+func _depth_keys_of(rows: Array, l_star: int) -> Array[int]:
 	var depth_keys: Array[int] = []
 	for row in rows:
 		if int(row.get("level_index", 0)) == l_star:
 			var dv := int(row.get("node_depth", 0))
 			if not depth_keys.has(dv):
 				depth_keys.append(dv)
-	depth_keys.sort()
-	var d_star := _ceil_key(depth_keys, D)
-	var d_clamped := d_star < 0
-	if d_clamped:
-		d_star = int(depth_keys[-1])
-	var missing := ""
+	return depth_keys
+
+
+## 解析偏移形态标签（clamp/ceil × level/depth/both 六形态——空串 = 精确命中；
+## l_ceil/d_ceil = 解析值 ≠ 请求值）
+func _missing_label(l_clamped: bool, d_clamped: bool, l_ceil: bool, d_ceil: bool) -> String:
+	var label := ""
 	if l_clamped and d_clamped:
-		missing = "both_clamp"
+		label = "both_clamp"
 	elif l_clamped:
-		missing = "level_clamp"
+		label = "level_clamp"
 	elif d_clamped:
-		missing = "depth_clamp"
-	elif l_star != L and d_star != D:
-		missing = "both_ceil"
-	elif l_star != L:
-		missing = "level_ceil"
-	elif d_star != D:
-		missing = "depth_ceil"
-	if missing != "":
-		var dedup_key := "%s|%s|%d|%d" % [table_id, missing, l_star, d_star]
-		if not _warn_dedup.has(dedup_key):
-			_warn_dedup[dedup_key] = true
-			var verb := "clamp 解析（超出最大行取最大值）" if missing.contains("clamp") else "ceil 解析（向上取整保证偏难）"
-			_diag.call("warning", "resolve_" + missing, "%s 请求 (%d,%d) %s → (%d,%d) [%s]——2026-09-18 拍板" % [table_id, L, D, verb, l_star, d_star, missing])
-	for row in rows:
-		if int(row.get("level_index", 0)) == l_star and int(row.get("node_depth", 0)) == d_star:
-			return row
-	return {}
+		label = "depth_clamp"
+	elif l_ceil and d_ceil:
+		label = "both_ceil"
+	elif l_ceil:
+		label = "level_ceil"
+	elif d_ceil:
+		label = "depth_ceil"
+	return label
+
+
+## 偏移告警发射（四元组去重注册表语义逐字——R1 既有去重；
+## req/resolved = [L, D]/[l_star, d_star] 进度坐标对）
+func _emit_missing_warning(table_id: String, missing: String, resolved: Array, req: Array) -> void:
+	var dedup_key := "%s|%s|%d|%d" % [table_id, missing, resolved[0], resolved[1]]
+	if not _warn_dedup.has(dedup_key):
+		_warn_dedup[dedup_key] = true
+		var verb := "clamp 解析（超出最大行取最大值）" if missing.contains("clamp") else "ceil 解析（向上取整保证偏难）"
+		_diag.call("warning", "resolve_" + missing, "%s 请求 (%d,%d) %s → (%d,%d) [%s]——2026-09-18 拍板" % [table_id, req[0], req[1], verb, resolved[0], resolved[1], missing])
 
 
 # 取 sorted_keys 中第一个 >= request 的键；无（请求高于最大行）返回 -1 → 调用方 Fatal

game/core/config_domain_combat.gd

@@ -0,0 +1,12 @@
+## 战斗域容器（D2 域容器——config_db 表持有按域收敛，2026-10-27 全清设计定稿）：战斗编排域七表类型化持有。
+## 零方法零行为——纯持有结构；「经 ConfigDB 单点读取」＝经其持有的容器与表对象（架构 :88 定稿注记）。
+class_name ConfigDomainCombat
+extends Resource
+
+var board_gen: BoardGenTable
+var variation: VariationTable
+var status_effects: StatusEffectTable
+var enemy: EnemyTable
+var skill: SkillTable
+var hero: HeroTable
+var settlement: SettlementTable

game/core/config_domain_crossrun.gd

@@ -0,0 +1,11 @@
+## 跨局域容器（D2 域容器——config_db 表持有按域收敛，2026-10-27 全清设计定稿）：跨局元进度域五表类型化持有
+## （跨局循环＝单局之外的长线进度域）。零方法零行为——纯持有结构；
+## 「经 ConfigDB 单点读取」＝经其持有的容器与表对象（架构 :88 定稿注记）。
+class_name ConfigDomainCrossrun
+extends Resource
+
+var meta: MetaTable
+var meta_tree: MetaTreeTable
+var treasure_items: TreasureItemTable
+var feats: FeatTable
+var forge: ForgeTable

game/core/config_domain_run.gd

@@ -0,0 +1,12 @@
+## 冒险域容器（D2 域容器——config_db 表持有按域收敛，2026-10-27 全清设计定稿）：冒险 runner 域七表类型化持有。
+## 零方法零行为——纯持有结构；「经 ConfigDB 单点读取」＝经其持有的容器与表对象（架构 :88 定稿注记）。
+class_name ConfigDomainRun
+extends Resource
+
+var level: LevelTable
+var difficulty: DifficultyTable
+var level_gen_params: LevelGenParams
+var reward: RewardTable
+var adventure: AdventureTable
+var action_economy: ActionEconomyTable
+var shop: ShopTable

game/core/curio_deck.gd

@@ -29,13 +29,13 @@ func reset() -> void:
 # relic 令牌档 = 行 rarity 直映射，词表外 transitional 值回退映射 rarest→rare/其余→excellent）
 func build() -> Array:
 	var out: Array[Variant] = []
-	for kind in db.adventure.CURIO_KINDS:
-		for tier in db.adventure.TIERS:
-			for i in int(db.adventure.curio_quota(String(kind), String(tier))):
+	for kind in db.run.adventure.CURIO_KINDS:
+		for tier in db.run.adventure.TIERS:
+			for i in int(db.run.adventure.curio_quota(String(kind), String(tier))):
 				out.append({"kind": String(kind), "tier": String(tier)})
-	for row in db.feat_rows():
+	for row in db.crossrun.feats.rows:
 		var rraw := String(row.get("rarity", ""))
-		var rtier := rraw if db.adventure.TIERS.has(rraw) else ("rare" if rraw == "rarest" else "excellent")
+		var rtier := rraw if db.run.adventure.TIERS.has(rraw) else ("rare" if rraw == "rarest" else "excellent")
 		out.append({"kind": "relic", "tier": rtier, "feat_id": String(row.get("feat_id", ""))})
 	return out
 
@@ -73,7 +73,7 @@ func pool_stock(kind: String) -> int:
 # 读数面 = 商店买走 vs 奖励领走 vs 枯竭）
 func stock_snapshot() -> Dictionary:
 	var out := {}
-	for row in db.shop_pool_rows():
+	for row in db.run.shop.pool_rows():
 		var kind := String(row.get("kind_id", ""))
 		out[kind] = pool_stock(kind)
 	return out
@@ -97,23 +97,23 @@ func consume_deck_token(kind: String, tier: String, feat_id: String = "") -> boo
 func cap_ok(kind: String, feat_id: String = "") -> bool:
 	var cap := 99
 	if kind == "relic":
-		var row: Dictionary[Variant, Variant] = db.feat_row(feat_id)
+		var row: Dictionary[Variant, Variant] = db.crossrun.feats.row_by_id(feat_id)
 		cap = int(row.get("cap", 1)) if not row.is_empty() else 1
 		return taken.get("relic:" + feat_id, 0) < cap
-	if not db.adventure.CURIO_KINDS.has(kind):
+	if not db.run.adventure.CURIO_KINDS.has(kind):
 		return true
-	cap = int(db.adventure.curio_cap(kind))
+	cap = int(db.run.adventure.curio_cap(kind))
 	return int(taken.get(kind, 0)) < cap
 
 
 # 专长凭证展示判定（四口径：一局限购一次/稀有只在概率不在价格/计步保底/触发清零。
 # 调用即一次展示判定与记账——展示次数计 pity、配额与限购双闸）
 func feat_ticket_consider(rg: RandomNumberGenerator) -> bool:
-	if ticket_sold >= int(db.adventure.feat_ticket_limit):
+	if ticket_sold >= int(db.run.adventure.feat_ticket_limit):
 		return false   # 限购满——不再触发（保底冻结）
-	if ticket_appeared >= int(db.adventure.feat_ticket_quota):
+	if ticket_appeared >= int(db.run.adventure.feat_ticket_quota):
 		return false   # 配额满——本局不再出现
-	var offer: bool = ticket_pity >= int(db.adventure.feat_ticket_pity_step) or rg.randi_range(1, 100) <= int(db.adventure.feat_ticket_chance)
+	var offer: bool = ticket_pity >= int(db.run.adventure.feat_ticket_pity_step) or rg.randi_range(1, 100) <= int(db.run.adventure.feat_ticket_chance)
 	if offer:
 		ticket_pity = 0
 		ticket_appeared += 1
@@ -160,7 +160,7 @@ func _candidate_pool(channel: String) -> Array[Variant]:
 func _draw_weighted(pool: Array[Variant], rg: RandomNumberGenerator) -> Array:
 	var out: Array[Variant] = []
 	var seen: Array[Variant] = []
-	var want := int(db.adventure.curio_candidate_count)
+	var want := int(db.run.adventure.curio_candidate_count)
 	while out.size() < want and not pool.is_empty():
 		var total := _pool_weight(pool)
 		if total <= 0:
@@ -180,13 +180,13 @@ func _draw_weighted(pool: Array[Variant], rg: RandomNumberGenerator) -> Array:
 func _pool_weight(pool: Array[Variant]) -> int:
 	var total := 0
 	for tok in pool:
-		total += db.adventure.boss_feat_weight(String((tok as Dictionary).get("tier", "")))
+		total += db.run.adventure.boss_feat_weight(String((tok as Dictionary).get("tier", "")))
 	return total
 
 
 func _weighted_index(pool: Array[Variant], roll: int) -> int:
 	for i in pool.size():
-		roll -= db.adventure.boss_feat_weight(String((pool[i] as Dictionary).get("tier", "")))
+		roll -= db.run.adventure.boss_feat_weight(String((pool[i] as Dictionary).get("tier", "")))
 		if roll <= 0:
 			return i
 	return 0
@@ -198,12 +198,12 @@ func _draw_exposure(pool: Array[Variant], rg: RandomNumberGenerator) -> Array:
 	_shuffle(pool, rg)
 	var sub: Array[Variant] = []
 	for tok in pool:
-		if db.adventure.tier_rank(String((tok as Dictionary).get("tier", ""))) >= db.adventure.tier_rank(db.adventure.TIER_EXCELLENT):
+		if db.run.adventure.tier_rank(String((tok as Dictionary).get("tier", ""))) >= db.run.adventure.tier_rank(db.run.adventure.TIER_EXCELLENT):
 			sub.append(tok)
 	_shuffle(sub, rg)
 	var out: Array[Variant] = []
 	var seen: Array[Variant] = []
-	var want := int(db.adventure.curio_candidate_count)
+	var want := int(db.run.adventure.curio_candidate_count)
 	var n_full := maxi(1, want - 1) if want >= 2 else want
 	while out.size() < want:
 		var src: Array[Variant] = sub if out.size() >= n_full and not sub.is_empty() else pool

game/core/curio_stop.gd

@@ -56,7 +56,7 @@ func rebind_level_runner(runner: LevelRunner, level_index: int) -> void:
 func open_level_clear(payload_base: Dictionary) -> void:
 	var hp_before := _stats.hero_hp
 	var max_eff := _stats.effective_max_hp()   # 回血封顶口径含调试浮窗 pct（同战斗内上限）
-	var heal := mini(int(floor(float(max_eff) * float(int(db.adventure.clear_heal_pct)) / 100.0)), max_eff - hp_before)
+	var heal := mini(int(floor(float(max_eff) * float(int(db.run.adventure.clear_heal_pct)) / 100.0)), max_eff - hp_before)
 	_stats.hero_hp = hp_before + heal
 	_bank.reset_x()   # 碰三选一重置 X 余量（不结转）
 	_bank.reset_paid()   # 付费刷计数随停点清零（对齐商店进店清零）
@@ -109,7 +109,7 @@ func pick_curio(kind: String, tier: String = "", feat_id: String = "") -> bool:
 		return false
 	if kind == "feat_ticket":
 		return _redeem_feat_ticket()   # T5 拿到即开——停点候选替换为专长三选一（零摘牌/不进持有集）
-	var value: int = int(db.adventure.curio_value(kind, tier))
+	var value: int = int(db.run.adventure.curio_value(kind, tier))
 	var hp_before := _stats.hero_hp
 	if not _apply_curio_pick(kind, tier, value, feat_id):
 		push_error("[停点件] pick_curio 拒绝——未知件: %s|%s|%s" % [kind, tier, feat_id])
@@ -122,7 +122,7 @@ func pick_curio(kind: String, tier: String = "", feat_id: String = "") -> bool:
 func _feat_payload_keys(feat_id: String) -> Dictionary:
 	if feat_id == "":
 		return {}
-	var row: Dictionary[Variant, Variant] = db.feat_row(feat_id)
+	var row: Dictionary[Variant, Variant] = db.crossrun.feats.row_by_id(feat_id)
 	return {"feat_id": feat_id, "feat_name": String(row.get("display_name", "")), "feat_archetype": String(row.get("archetype", ""))}
 
 
@@ -133,7 +133,7 @@ func _feat_payload_keys(feat_id: String) -> Dictionary:
 # 按挂点消费，档位质变由 FeatsEngine 求值）。兑付即从牌库摘除该令牌（选中踢池；
 # 未选候选从未摘牌=自动回池）。道具件不入此体——未知件返回 false 由调用方按渠道名报错。
 func _apply_curio_pick(kind: String, tier: String, value: int, feat_id: String = "") -> bool:
-	if kind == "relic" and db.feat_row(feat_id).is_empty():
+	if kind == "relic" and db.crossrun.feats.row_by_id(feat_id).is_empty():
 		push_error("[停点件] relic 兑付失败——表无此件: %s" % feat_id)
 		return false   # 先校验后摘牌（令牌零丢失）
 	if not _deck.consume_deck_token(kind, tier, feat_id):
@@ -172,7 +172,7 @@ func _apply_resource_pick(kind: String, value: int, feat_id: String) -> bool:
 # 路由加算段（match 收敛进效果类型：属性值提升四类走 adventure_table.CURIO_APPLY_ROUTES 声明
 # 路由（bonus 落点键），加新加算类令牌零代码）
 func _apply_route_pick(kind: String, value: int) -> bool:
-	var sink := db.adventure.curio_apply_route(kind)
+	var sink := db.run.adventure.curio_apply_route(kind)
 	if sink == "":
 		return false
 	_journal.gain_bonus(sink, value, "curio_pick", kind)   # 加算区单写原语（获得日记明细+汇总同拍）
@@ -229,7 +229,7 @@ func apply_node_curio(kind: String, tier: String = "", feat_id: String = "") ->
 	if _deck.find_token(candidates, kind, tier, feat_id).is_empty():
 		push_error("[停点件] apply_node_curio 拒绝——令牌不在候选: %s|%s|%s" % [kind, tier, feat_id])
 		return false
-	var value: int = int(db.adventure.curio_value(kind, tier))
+	var value: int = int(db.run.adventure.curio_value(kind, tier))
 	if not _apply_curio_pick(kind, tier, value, feat_id):
 		push_error("[停点件] apply_node_curio 拒绝——未知件: %s|%s|%s" % [kind, tier, feat_id])
 		return false
@@ -348,10 +348,10 @@ func _finish_node_bonus(picked: String, value: int, tier: String = "", feat_id:
 func consume_pool_purchase(kind: String, tier: String) -> bool:
 	if kind == "feat_ticket":
 		return _redeem_feat_ticket()
-	if not db.adventure.CURIO_KINDS.has(kind):
+	if not db.run.adventure.CURIO_KINDS.has(kind):
 		push_error("[停点件] 商店购买消费拒绝——件不在池词表: %s" % kind)
 		return false
-	return _apply_curio_pick(kind, tier, int(db.adventure.curio_value(kind, tier)))
+	return _apply_curio_pick(kind, tier, int(db.run.adventure.curio_value(kind, tier)))
 
 
 # ---- 冒险级复位（宿主 _reset_curio_state 调用——停点半：池归 deck.reset、停点三态与刷新账清零）----
@@ -376,7 +376,7 @@ func restore_pending(bp_pending: Dictionary) -> void:
 				mig["feat_id"] = String((c as Dictionary).get("feat_id", ""))
 			migrated.append(mig)
 		else:
-			migrated.append({"kind": String(c), "tier": db.adventure.TIER_COMMON})
+			migrated.append({"kind": String(c), "tier": db.run.adventure.TIER_COMMON})
 	_pending = {"candidates": migrated}
 	var payload: Dictionary[Variant, Variant] = (bp_pending.get("payload", {}) as Dictionary).duplicate(true)
 	curio_choice_presented.emit(payload)

game/core/damage_controller.gd

@@ -294,7 +294,7 @@ func _hero_attack_ctx(t: Dictionary) -> Dictionary:
 func _ctx_rewrites(t: Dictionary, target: Dictionary, armor: String, matchup: String) -> Dictionary:
 	var ac_hits: Array[Variant] = (t.context.get("fx_attack_hits", []) as Array)
 	var roll_read: Dictionary[Variant, Variant] = _armor_roll()
-	var threshold: int = defender_ac(target) + int(db.settlement.damage_roll.attack_bonus)
+	var threshold: int = defender_ac(target) + int(db.combat.settlement.damage_roll.attack_bonus)
 	# armor_roll 发射点（敌护甲掷骰判定；免掷恒折扣订阅面）
 	var ar_hits := _fx_hits("armor_roll", {"target_ac": threshold, "roll": int(roll_read.roll)})
 	var trade_hit := 0
@@ -383,7 +383,7 @@ func _hero_attack_redeem(t: Dictionary, ctx: Dictionary, base_value: float) -> D
 	var ac_hits: Array[Variant] = ctx["ac_hits"]
 	var roll_read: Dictionary[Variant, Variant] = ctx["roll_read"]
 	var atk_type: String = ctx["atk_type"]
-	var rolled: int = DamageMath.rolled_component(base_value, int(ctx["discount"]), bool(ctx["crit"]), int(db.settlement.damage_roll.crit_multiplier), int(ctx["cdelta"]))
+	var rolled: int = DamageMath.rolled_component(base_value, int(ctx["discount"]), bool(ctx["crit"]), int(db.combat.settlement.damage_roll.crit_multiplier), int(ctx["cdelta"]))
 	var payload: Dictionary[Variant, Variant] = {"target": String(target.display_name), "target_id": String(target.get("enemy_id", ""))}
 	payload[atk_type] = rolled   # 分量键 = 实际攻击类型（归因字段，单分量模型）
 	payload["roll"] = int(roll_read.roll)
@@ -392,7 +392,7 @@ func _hero_attack_redeem(t: Dictionary, ctx: Dictionary, base_value: float) -> D
 	if bool(ctx["crit"]):
 		payload["crit"] = true
 	var pooled: int = DamageMath.pool_damage(rolled, clamped_pool("hero_offense"), clamped_pool("enemy_defense"))
-	var landed: int = maxi(int(db.settlement.damage_roll.damage_floor), pooled)
+	var landed: int = maxi(int(db.combat.settlement.damage_roll.damage_floor), pooled)
 	# 加法族：英雄侧 rider（enemy_skill rider 对称位补齐口径）——后置必中附加，独立于掷点与乘区
 	# （奥术余烬「普攻命中后恒定结算」语义）；猎巢人巢控光环（per nest_count）/矿工的执拗开格加成
 	# （per dig_streak、cap 封顶）同通道合计；档一质变 rider+1 / 档二（crit 时）rider 乘暴击倍率。
@@ -406,7 +406,7 @@ func _hero_attack_redeem(t: Dictionary, ctx: Dictionary, base_value: float) -> D
 			hero_rider += contrib
 	if hero_rider > 0:
 		if bool(ctx["crit"]) and bool(inject["rider_tier_crit"]):
-			hero_rider = int(round(float(hero_rider) * float(db.settlement.damage_roll.crit_multiplier)))
+			hero_rider = int(round(float(hero_rider) * float(db.combat.settlement.damage_roll.crit_multiplier)))
 		landed += hero_rider
 		payload["hero_rider"] = hero_rider
 	units.apply_damage(target, landed)
@@ -432,7 +432,7 @@ func _kill_overflow(t: Dictionary, target: Dictionary, landed: int) -> void:
 			# source_class 用中性名（fx_overflow 泛用通道，不挂件名）
 			var of_t := open_ticket(DamageController.KIND_BOARD_TYPED, "fx_overflow", "贯穿弹射",
 				{"channel": "board",
-				"base_value": maxi(int(db.settlement.damage_roll.damage_floor), int(landed * int(h.get("value", 50)) / 100)),
+				"base_value": maxi(int(db.combat.settlement.damage_roll.damage_floor), int(landed * int(h.get("value", 50)) / 100)),
 				"target_rule": DamageController.TARGET_FRONT_ALIVE, "ri": int(t.round_index),
 				"origin_cell": t.origin_cell, "attack_type": "pierce"})
 			if policy == POLICY_SEGMENT:
@@ -492,13 +492,13 @@ func _resolve_enemy_skill(t: Dictionary) -> void:
 func _enemy_roll(t: Dictionary) -> Dictionary:
 	var hero: Dictionary[Variant, Variant] = units.hero_unit()
 	var roll_read: Dictionary[Variant, Variant] = _armor_roll()
-	var threshold: int = defender_ac(hero) + int(db.settlement.damage_roll.attack_bonus)
+	var threshold: int = defender_ac(hero) + int(db.combat.settlement.damage_roll.attack_bonus)
 	var crit: bool = bool(roll_read.crit)
 	var discount: int = _roll_discount(int(roll_read.roll), threshold)
 	var cdelta: int = _counter_delta(String(t.attack_type), String(hero.get("armor_type", "light")))
-	var rolled: int = DamageMath.rolled_component(float(t.base_value), discount, crit, int(db.settlement.damage_roll.crit_multiplier), cdelta)
+	var rolled: int = DamageMath.rolled_component(float(t.base_value), discount, crit, int(db.combat.settlement.damage_roll.crit_multiplier), cdelta)
 	var pooled: int = DamageMath.pool_damage(rolled, clamped_pool("hero_defense"), clamped_pool("enemy_output"))
-	var total: int = maxi(int(db.settlement.damage_roll.damage_floor), pooled) + int(t.rider)   # rider 后置于伤害下限——独立必中加项，不进乘区
+	var total: int = maxi(int(db.combat.settlement.damage_roll.damage_floor), pooled) + int(t.rider)   # rider 后置于伤害下限——独立必中加项，不进乘区
 	return {"roll": int(roll_read.roll), "threshold": threshold, "crit": crit, "discount": discount, "total": total}
 
 
@@ -520,7 +520,7 @@ func _enemy_shield_apply(hits: Array, total: int) -> Dictionary:
 				var set_v = h.get("set", null)
 				EffectEngine.counter_add(_ctx, String(h.get("counter_id", "")), int(h.get("value", 0)) if set_v == null else int(set_v), set_v != null)
 	if shield > 0:
-		total = maxi(int(db.settlement.damage_roll.damage_floor), total - shield)
+		total = maxi(int(db.combat.settlement.damage_roll.damage_floor), total - shield)
 	return {"total": total, "shield": shield}
 
 
@@ -541,7 +541,7 @@ func _resolve_board_typed(t: Dictionary) -> void:
 			# 无模式 delta 才入棋盘窗（mode 路由：clamp_bonus=主角攻击面专享、discount_shift=折扣档面）
 			if String(h.get("kind", "")) == "modify_ticket" and h.has("delta") and String(h.get("mode", "")) == "":
 				cdelta += int(h.delta)
-	var dealt: int = DamageMath.counter_component(int(t.base_value), cdelta, int(db.settlement.damage_roll.damage_floor))
+	var dealt: int = DamageMath.counter_component(int(t.base_value), cdelta, int(db.combat.settlement.damage_roll.damage_floor))
 	units.apply_damage(target, dealt)
 	emit_row_cb.call({"type": "damage", "source_class": String(t.source_class), "origin_cell": t.origin_cell, "highlight": String(t.highlight)}, int(t.round_index),
 		"%s → %s" % [String(t.display), String(target.display_name)], dealt,
@@ -556,7 +556,7 @@ func _resolve_board_blast(t: Dictionary) -> void:
 		_ineffective_row(t, "无存活敌人")
 		_outcomes[int(t.ticket_id)] = "zero"
 		return
-	var blast_dmg: int = maxi(int(db.settlement.damage_roll.damage_floor), int(t.base_value))   # 伤害下限全来源
+	var blast_dmg: int = maxi(int(db.combat.settlement.damage_roll.damage_floor), int(t.base_value))   # 伤害下限全来源
 	for u in alive:
 		units.apply_damage(u, blast_dmg)   # 恒定表值（下限保底），逐个；受击即死——死亡即不动手
 	emit_row_cb.call({"type": "damage", "source_class": String(t.source_class), "origin_cell": t.origin_cell, "highlight": String(t.highlight)}, int(t.round_index),
@@ -567,7 +567,7 @@ func _resolve_board_blast(t: Dictionary) -> void:
 
 # 棋盘主角直伤（反噬/治疗包负向/地形变异）：无类型必中，下限保底；context 键并入行载荷
 func _resolve_board_flat_hero(t: Dictionary) -> void:
-	var dealt: int = maxi(int(db.settlement.damage_roll.damage_floor), int(t.base_value))   # 伤害下限全来源
+	var dealt: int = maxi(int(db.combat.settlement.damage_roll.damage_floor), int(t.base_value))   # 伤害下限全来源
 	units.apply_damage(units.hero_unit(), dealt)
 	var extra: Dictionary[Variant, Variant] = {"target": "hero"}
 	for k in t.context.keys():
@@ -580,16 +580,16 @@ func _resolve_board_flat_hero(t: Dictionary) -> void:
 
 # 护甲等级掷点（armor_roll 封闭流——逐次掷逐次取号、逐位可回放）：返回 {roll, crit}
 func _armor_roll() -> Dictionary:
-	var stream: RandomNumberGenerator = rng.open_stream(String(db.settlement.damage_roll.armor_roll_stream))
-	var roll: int = stream.randi_range(1, int(db.settlement.damage_roll.roll_faces))
-	return {"roll": roll, "crit": roll == int(db.settlement.damage_roll.crit_roll)}
+	var stream: RandomNumberGenerator = rng.open_stream(String(db.combat.settlement.damage_roll.armor_roll_stream))
+	var roll: int = stream.randi_range(1, int(db.combat.settlement.damage_roll.roll_faces))
+	return {"roll": roll, "crit": roll == int(db.combat.settlement.damage_roll.crit_roll)}
 
 
 # 掷点折扣读数：nat 最大面恒全额（暴击分支前置），其余查档（缺口 = 阈值 − 掷点）
 func _roll_discount(roll: int, threshold: int) -> int:
-	if roll == int(db.settlement.damage_roll.crit_roll):
+	if roll == int(db.combat.settlement.damage_roll.crit_roll):
 		return 100
-	return DamageMath.roll_discount_percent(roll, threshold, db.settlement.damage_roll.roll_tier_bounds, db.settlement.damage_roll.roll_tier_discounts)
+	return DamageMath.roll_discount_percent(roll, threshold, db.combat.settlement.damage_roll.roll_tier_bounds, db.combat.settlement.damage_roll.roll_tier_discounts)
 
 
 # 防守方护甲等级读数（数值轴——与 armor_type 克制属性轴严格分离）：敌人 = spawn 期行值快照；
@@ -599,15 +599,15 @@ func defender_ac(unit: Dictionary) -> int:
 	if bool(unit.get("is_hero", false)):
 		var total: int = _hero_ac_override
 		if total < 0:
-			total = int(db.hero.armor_class)
+			total = int(db.combat.hero.armor_class)
 		for eff in effects.query_active("hero"):
-			var row: Dictionary[Variant, Variant] = db.status_effect_row(eff.effect_id)
+			var row: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(eff.effect_id)
 			if not row.is_empty() and String(row.unit) == "ac":
 				total += int(eff.effective_value)
 		return total
 	var total_e: int = int(unit.get("armor_class", 0))
 	for eff_e in effects.query_active("enemy"):
-		var erow_ac: Dictionary[Variant, Variant] = db.status_effect_row(eff_e.effect_id)
+		var erow_ac: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(eff_e.effect_id)
 		if not erow_ac.is_empty() and String(erow_ac.unit) == "ac":
 			total_e += int(eff_e.effective_value)
 	return total_e
@@ -618,14 +618,14 @@ func defender_ac(unit: Dictionary) -> int:
 func _counter_delta(attack_type: String, armor: String) -> int:
 	if attack_type == "":
 		return 0
-	var tbl: Dictionary[Variant, Variant] = db.settlement.damage_roll.armor_effectiveness
+	var tbl: Dictionary[Variant, Variant] = db.combat.settlement.damage_roll.armor_effectiveness
 	var row: Dictionary[Variant, Variant] = tbl.get(attack_type, {})
 	return int(row.get(armor, 0))
 
 
 # 折扣档改善（猎弱本能——折扣表向全额方向移 value 档；查不到当前档 = 不动防御口径）
 func _discount_shift_up(discount: int, shift: int) -> int:
-	var tbl: Array[Variant] = db.settlement.damage_roll.roll_tier_discounts
+	var tbl: Array[Variant] = db.combat.settlement.damage_roll.roll_tier_discounts
 	var idx := tbl.find(discount)
 	if idx < 0:
 		return discount
@@ -636,12 +636,12 @@ func _discount_shift_up(discount: int, shift: int) -> int:
 func clamped_pool(pool: String) -> int:
 	var total := 0
 	for eff in effects.query_active("hero") + effects.query_active("enemy"):
-		var row: Dictionary[Variant, Variant] = db.status_effect_row(eff.effect_id)
+		var row: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(eff.effect_id)
 		if row.is_empty():
 			continue
-		if String(db.settlement.core.effect_pool_map.get(eff.effect_id, "")) == pool and String(row.unit) == "percent":
+		if String(db.combat.settlement.core.effect_pool_map.get(eff.effect_id, "")) == pool and String(row.unit) == "percent":
 			total += eff.effective_value   # 池内加算（L×m 原样——越域不 clamp 由本处收口）
-	return clampi(total, int(db.settlement.core.pool_clamp_lo), int(db.settlement.core.pool_clamp_hi))
+	return clampi(total, int(db.combat.settlement.core.pool_clamp_lo), int(db.combat.settlement.core.pool_clamp_hi))
 
 
 # 攻击行显示名（掷点档位随行文本可读；重档折扣 = "被压制"）

game/core/effect_engine.gd

@@ -94,58 +94,76 @@ func _init(db_ref: ConfigDb = null) -> void:
 ## 在 dispatch 的 round_start 特判内整桶 clear，adventure 桶随宿主字典引用跨战持久——无副本搬运）。
 func rebuild(feat_ids: Array, item_ids: Array, tree_rules: Array = []) -> void:
 	_triggers.clear()
+	_load_feat_triggers(feat_ids)
+	_load_attune_triggers(item_ids)
+	_push_tree_rules(tree_rules)
+
+
+## 特性订阅装载域（feats 表序→按持有集过滤→行内数组序——装载声明序第一段）
+func _load_feat_triggers(feat_ids: Array) -> void:
 	if db != null and db.feats != null:
-		for row in db.feats.rows:
+		for row in db.crossrun.feats.rows:
 			var fid := String(row.get("feat_id", ""))
 			if not feat_ids.has(fid):
 				continue
 			for tr in (row.get("triggers", []) as Array):
 				_push_trigger("feat", fid, tr, row)
+
+
+## 同调秘宝订阅装载域（treasure 同调行序→按装备集过滤→行内数组序——装载声明序第二段）
+func _load_attune_triggers(item_ids: Array) -> void:
 	if db != null:
-		for row in db.treasure_attunement_rows():
+		for row in db.crossrun.treasure_items.attunement_rows():
 			var iid := String(row.get("item_id", ""))
 			if not item_ids.has(iid):
 				continue
 			for tr in (row.get("triggers", []) as Array):
 				_push_trigger("attune", iid, tr, row)
-	# 树规则合成订阅（六键按 v0.8 三组双态）：posture 两键=「每关首轮窗」语义
-	# 〔battle_index==1 且 round_index==1；battle_index=关卡域战斗序由 enc 携带〕；
-	# sense 两组=每关限次〔level 桶计数器 lt 上限闸 + 命中即 counter_add 记账双行——同事件双行同
-	# 预评估态见闸同记，序=装载序确定；寿命随 LevelRunner.level_counters 每关 new 天然按关清零〕；
-	# economy 两组零订阅行——消费点=GP 掉落乘算与商品计价折价的 tree_rules 成员判定。数值全 provisional 归 M4。
+
+
+## 树规则合成订阅域（六键按 v0.8 三组双态——装载声明序第三段）：posture 两键=「每关首轮窗」语义
+## 〔battle_index==1 且 round_index==1；battle_index=关卡域战斗序由 enc 携带〕；
+## sense 两组=每关限次〔level 桶计数器 lt 上限闸 + 命中即 counter_add 记账双行——同事件双行同
+## 预评估态见闸同记，序=装载序确定；寿命随 LevelRunner.level_counters 每关 new 天然按关清零〕；
+## economy 两组零订阅行——消费点=GP 掉落乘算与商品计价折价的 tree_rules 成员判定。数值全 provisional 归 M4。
+func _push_tree_rules(tree_rules: Array) -> void:
 	for key_v in tree_rules:
-		var rk := String(key_v)
-		match rk:
-			"posture_first_strike":
-				_push_trigger("tree", rk, {"on": "round_start",
-					"when": [{"fact": "battle_index", "op": "eq", "value": 1},
-						{"fact": "round_index", "op": "eq", "value": 1}],
-					"do": {"kind": "grant_ap", "mode": "queue", "value": 1}}, {})
-			"posture_bulwark":
-				_push_trigger("tree", rk, {"on": "damage_taken",
-					"when": [{"fact": "battle_index", "op": "eq", "value": 1},
-						{"fact": "round_index", "op": "eq", "value": 1}],
-					"do": {"kind": "shield", "value": 1}}, {})
-			"sense_sharp":
-				# 锋=踩中危险格伤害减半·每关限次——mine_hit 挂点现成（damage_mult 收集→halve_pct，
-				# 与惊巢反制同路径；伤害在结算战斗段末兑付，探索阶段零改动）
-				_push_trigger("tree", rk, {"on": "mine_hit",
-					"when": [{"fact": "counter", "id": "lvl_tree_sense_sharp_used", "op": "lt", "value": 2}],
-					"do": {"kind": "damage_mult", "value": 50}}, {})
-				_push_trigger("tree", rk, {"on": "mine_hit",
-					"when": [{"fact": "counter", "id": "lvl_tree_sense_sharp_used", "op": "lt", "value": 2}],
-					"do": {"kind": "counter_add", "counter_id": "lvl_tree_sense_sharp_used",
-						"value": 1}}, {})
-			"sense_guard":
-				# 守=标错返还行动点·每关限次（契约 12 失误补偿——seal_missed 由 _judge_seal 去重闸后
-				# 发射；queue=下一轮开轮兑现，末轮判出无下一轮=合法作废自动成立）
-				_push_trigger("tree", rk, {"on": "seal_missed",
-					"when": [{"fact": "counter", "id": "lvl_tree_sense_guard_used", "op": "lt", "value": 2}],
-					"do": {"kind": "grant_ap", "mode": "queue", "value": 1}}, {})
-				_push_trigger("tree", rk, {"on": "seal_missed",
-					"when": [{"fact": "counter", "id": "lvl_tree_sense_guard_used", "op": "lt", "value": 2}],
-					"do": {"kind": "counter_add", "counter_id": "lvl_tree_sense_guard_used",
-						"value": 1}}, {})
+		_push_tree_rule(String(key_v))
+
+
+## 单树规则合成行 push（六键 match 分派——词表封闭，未知键零订阅零扰动）
+func _push_tree_rule(rk: String) -> void:
+	match rk:
+		"posture_first_strike":
+			_push_trigger("tree", rk, {"on": "round_start",
+				"when": [{"fact": "battle_index", "op": "eq", "value": 1},
+					{"fact": "round_index", "op": "eq", "value": 1}],
+				"do": {"kind": "grant_ap", "mode": "queue", "value": 1}}, {})
+		"posture_bulwark":
+			_push_trigger("tree", rk, {"on": "damage_taken",
+				"when": [{"fact": "battle_index", "op": "eq", "value": 1},
+					{"fact": "round_index", "op": "eq", "value": 1}],
+				"do": {"kind": "shield", "value": 1}}, {})
+		"sense_sharp":
+			# 锋=踩中危险格伤害减半·每关限次——mine_hit 挂点现成（damage_mult 收集→halve_pct，
+			# 与惊巢反制同路径；伤害在结算战斗段末兑付，探索阶段零改动）
+			_push_trigger("tree", rk, {"on": "mine_hit",
+				"when": [{"fact": "counter", "id": "lvl_tree_sense_sharp_used", "op": "lt", "value": 2}],
+				"do": {"kind": "damage_mult", "value": 50}}, {})
+			_push_trigger("tree", rk, {"on": "mine_hit",
+				"when": [{"fact": "counter", "id": "lvl_tree_sense_sharp_used", "op": "lt", "value": 2}],
+				"do": {"kind": "counter_add", "counter_id": "lvl_tree_sense_sharp_used",
+					"value": 1}}, {})
+		"sense_guard":
+			# 守=标错返还行动点·每关限次（契约 12 失误补偿——seal_missed 由 _judge_seal 去重闸后
+			# 发射；queue=下一轮开轮兑现，末轮判出无下一轮=合法作废自动成立）
+			_push_trigger("tree", rk, {"on": "seal_missed",
+				"when": [{"fact": "counter", "id": "lvl_tree_sense_guard_used", "op": "lt", "value": 2}],
+				"do": {"kind": "grant_ap", "mode": "queue", "value": 1}}, {})
+			_push_trigger("tree", rk, {"on": "seal_missed",
+				"when": [{"fact": "counter", "id": "lvl_tree_sense_guard_used", "op": "lt", "value": 2}],
+				"do": {"kind": "counter_add", "counter_id": "lvl_tree_sense_guard_used",
+					"value": 1}}, {})
 
 
 func _push_trigger(source: String, id: String, tr: Dictionary, row: Dictionary) -> void:
@@ -203,13 +221,14 @@ func dispatch(ctx: EffectContext, event: String, payload: Dictionary, facts: Cal
 	return hits
 
 
-## 计数器归属桶解析（前缀规则唯一出处——round_/lvl_/adv_ 显式桶，其余落 battle 缺省桶）。
+## 计数器归属桶解析（前缀规则唯一出处——round_/lvl_/adv_ 显式桶，其余落 battle 缺省桶；
+## 前缀判定序 round→lvl→adv→battle 缺省逐字）
 static func bucket_of(ctx: EffectContext, counter_id: String) -> Dictionary[Variant, Variant]:
 	if counter_id.begins_with("round_"):
 		return ctx.round_bucket
-	elif counter_id.begins_with("lvl_"):
+	if counter_id.begins_with("lvl_"):
 		return ctx.level_bucket
-	elif counter_id.begins_with("adv_"):
+	if counter_id.begins_with("adv_"):
 		return ctx.adventure_bucket
 	return ctx.battle_bucket
 
@@ -262,41 +281,68 @@ func _cond_ok(ctx: EffectContext, c: Dictionary, payload: Dictionary, facts: Cal
 	var val = c.get("value", null)
 	var actual = _fact_value(ctx, fact, c, payload, facts)
 	match op:
-		"eq":
-			return str(actual) == str(val)
-		"neq":
-			return str(actual) != str(val)
-		"gt":
-			return int(actual) > int(val)
-		"gte":
-			return int(actual) >= int(val)
-		"lt":
-			return int(actual) < int(val)
-		"lte":
-			return int(actual) <= int(val)
+		"eq", "neq", "gt", "gte", "lt", "lte":
+			return _cmp_ok(op, actual, val)
 		"ends_with":
-			if val is Array:
-				for v in (val as Array):
-					if String(actual).ends_with(String(v)):
-						return true
-				return false
-			return String(actual).ends_with(String(val))
+			return _ends_with_ok(actual, val)
 		"has":
-			# 在场判定（fact 查询面落法——白名单覆盖）：value 缺省=非空判定
-			# （terrain_kind fact：伤害型变异集非空=挖开伤害型地形格/邻格有伤害型地形/地形伤种类在场）；
-			# value 给定=数组包含判定（保留泛用面）。
-			if c.has("value"):
-				if actual is Array:
-					return (actual as Array).has(val)
-				return false
-			if actual is Array:
-				return not (actual as Array).is_empty()
-			return actual != null and String(actual) != ""   # null 安全（敌技伤害载荷无 terrain_kind 时事实面回落 null，判「不在场」而非抛错）
+			return _has_ok(c, actual)
+		"mod_zero", "mod_eq", "advantageous", "gte_ref", "lt_ref":
+			return _counter_op_ok(ctx, c, op, actual)
+	assert(false, "[效果引擎] when 算子出域: %s" % op)
+	return false
+
+
+## 比较算子域（eq/neq/gt/gte/lt/lte 六比较——str 逐字与 int 投影语义逐字）
+func _cmp_ok(op: String, actual: Variant, val: Variant) -> bool:
+	var out := false
+	match op:
+		"eq":
+			out = str(actual) == str(val)
+		"neq":
+			out = str(actual) != str(val)
+		"gt":
+			out = int(actual) > int(val)
+		"gte":
+			out = int(actual) >= int(val)
+		"lt":
+			out = int(actual) < int(val)
+		"lte":
+			out = int(actual) <= int(val)
+	return out
+
+
+## 后缀匹配域（ends_with——值数组任一命中即真）
+func _ends_with_ok(actual: Variant, val: Variant) -> bool:
+	if val is Array:
+		for v in (val as Array):
+			if String(actual).ends_with(String(v)):
+				return true
+		return false
+	return String(actual).ends_with(String(val))
+
+
+## 在场判定域（has——fact 查询面落法，白名单覆盖）：value 缺省=非空判定
+## （terrain_kind fact：伤害型变异集非空=挖开伤害型地形格/邻格有伤害型地形/地形伤种类在场）；
+## value 给定=数组包含判定（保留泛用面）
+func _has_ok(c: Dictionary, actual: Variant) -> bool:
+	if c.has("value"):
+		if actual is Array:
+			return (actual as Array).has(c.get("value"))
+		return false
+	if actual is Array:
+		return not (actual as Array).is_empty()
+	return actual != null and String(actual) != ""   # null 安全（敌技伤害载荷无 terrain_kind 时事实面回落 null，判「不在场」而非抛错）
+
+
+## 计数器与矩阵算子域（mod_zero/mod_eq 取模、advantageous 克制矩阵、gte_ref/lt_ref 计数器比较——读经 ctx）
+func _counter_op_ok(ctx: EffectContext, c: Dictionary, op: String, actual: Variant) -> bool:
+	match op:
 		"mod_zero":
-			var m := int(val)
+			var m := int(c.get("value", null))
 			return m > 0 and int(actual) % m == 0
 		"mod_eq":
-			var me_m := int(val)
+			var me_m := int(c.get("value", null))
 			return me_m > 0 and int(actual) % me_m == int(c.get("ref", 0))
 		"advantageous":
 			# 克制矩阵正面判定（matchup = "{attack_type}_vs_{armor}"——矩阵值 > 0 = 克制成立）
@@ -305,7 +351,6 @@ func _cond_ok(ctx: EffectContext, c: Dictionary, payload: Dictionary, facts: Cal
 			return int(actual) >= counter(ctx, String(c.get("ref", "")))
 		"lt_ref":
 			return int(actual) < counter(ctx, String(c.get("ref", "")))
-	assert(false, "[效果引擎] when 算子出域: %s" % op)
 	return false
 
 
@@ -329,7 +374,7 @@ func _counter_delta_of(matchup: String) -> int:
 	var parts := matchup.split("_vs_")
 	if parts.size() != 2:
 		return 0
-	var tbl: Dictionary[Variant, Variant] = db.settlement.damage_roll.armor_effectiveness
+	var tbl: Dictionary[Variant, Variant] = db.combat.settlement.damage_roll.armor_effectiveness
 	var row: Dictionary[Variant, Variant] = tbl.get(String(parts[0]), {})
 	return int(row.get(String(parts[1]), 0))
 
@@ -350,44 +395,59 @@ static func validate_trigger_row(rid: String, row: Dictionary, triggers: Array,
 			errs.append({"category": "enum", "message": "%s 订阅事件出域（事件词汇封闭）: %s" % [rid, on]})
 		elif MINE_EVENTS.has(on):
 			mine_covered = true
-		for c_v in (tr.get("when", []) as Array):
-			var c: Dictionary[Variant, Variant] = c_v as Dictionary
-			for k in c.keys():
-				if not WHEN_KEYS.has(String(k)):
-					errs.append({"category": "zero_flat", "message": "%s when 键出白名单: %s" % [rid, String(k)]})
-			var fact := String(c.get("fact", ""))
-			if not FACTS.has(fact):
-				errs.append({"category": "enum", "message": "%s fact 出域（事实词汇封闭 %d 项）: %s" % [rid, FACTS.size(), fact]})
-			if not OPS.has(String(c.get("op", "eq"))):
-				errs.append({"category": "enum", "message": "%s when 算子出域: %s" % [rid, String(c.get("op", ""))]})
-		var do_d: Dictionary[Variant, Variant] = tr.get("do", {}) as Dictionary
-		for k in do_d.keys():
-			if not DO_KEYS.has(String(k)):
-				errs.append({"category": "zero_flat", "message": "%s do 键出白名单: %s（机制轴禁无条件属性加项）" % [rid, String(k)]})
-		var kind := String(do_d.get("kind", ""))
-		if not EFFECT_KINDS.has(kind):
-			errs.append({"category": "enum", "message": "%s 效果类型出域（解释器闭集）: %s" % [rid, kind]})
-		# 计数器前缀归属合法性（.tres 行路径——写错前缀加载致命；判据单点 counter_id_legal，与 _push_trigger 同源）
-		if do_d.has("counter_id"):
-			var cid := String(do_d.counter_id)
-			if not counter_id_legal(cid):
-				errs.append({"category": "enum", "message": "%s counter_id 前缀非法（meta_ 出域/引擎不接存档级）: %s" % [rid, cid]})
-		# value_from/delta_from/mult_from/cap_from 引用面：行字段存在性（悬空=加载致命）——
-		# do 与 when 两侧同面（when value_from=dawn_order effective_rounds 先例）
-		for vf_k in ["value_from", "delta_from", "mult_from", "cap_from"]:
-			if do_d.has(vf_k):
-				var fld := String(do_d.get(vf_k, ""))
-				if fld != "" and not row.has(fld):
-					errs.append({"category": "dangling", "message": "%s do.%s 悬空（行无字段 %s）" % [rid, vf_k, fld]})
-		for c_v in (tr.get("when", []) as Array):
-			var c_w: Dictionary[Variant, Variant] = c_v as Dictionary
-			if c_w.has("value_from"):
-				var wfld := String(c_w.get("value_from", ""))
-				if wfld != "" and not row.has(wfld):
-					errs.append({"category": "dangling", "message": "%s when.value_from 悬空（行无字段 %s）" % [rid, wfld]})
+		_vtr_when_keys(rid, tr, errs)
+		_vtr_do_keys(rid, tr, row, errs)
 	return mine_covered
 
 
+## when 键域校验：键白名单／fact 词表／算子词表（追加序承原位——when 键→fact→op）
+static func _vtr_when_keys(rid: String, tr: Dictionary, errs: Array) -> void:
+	for c_v in (tr.get("when", []) as Array):
+		var c: Dictionary[Variant, Variant] = c_v as Dictionary
+		for k in c.keys():
+			if not WHEN_KEYS.has(String(k)):
+				errs.append({"category": "zero_flat", "message": "%s when 键出白名单: %s" % [rid, String(k)]})
+		var fact := String(c.get("fact", ""))
+		if not FACTS.has(fact):
+			errs.append({"category": "enum", "message": "%s fact 出域（事实词汇封闭 %d 项）: %s" % [rid, FACTS.size(), fact]})
+		if not OPS.has(String(c.get("op", "eq"))):
+			errs.append({"category": "enum", "message": "%s when 算子出域: %s" % [rid, String(c.get("op", ""))]})
+
+
+## do 键域校验：键白名单（零裸 flat 护栏）／效果类型闭集／计数器前缀合法性＋value_from 引用悬空域
+static func _vtr_do_keys(rid: String, tr: Dictionary, row: Dictionary, errs: Array) -> void:
+	var do_d: Dictionary[Variant, Variant] = tr.get("do", {}) as Dictionary
+	for k in do_d.keys():
+		if not DO_KEYS.has(String(k)):
+			errs.append({"category": "zero_flat", "message": "%s do 键出白名单: %s（机制轴禁无条件属性加项）" % [rid, String(k)]})
+	var kind := String(do_d.get("kind", ""))
+	if not EFFECT_KINDS.has(kind):
+		errs.append({"category": "enum", "message": "%s 效果类型出域（解释器闭集）: %s" % [rid, kind]})
+	# 计数器前缀归属合法性（.tres 行路径——写错前缀加载致命；判据单点 counter_id_legal，与 _push_trigger 同源）
+	if do_d.has("counter_id"):
+		var cid := String(do_d.counter_id)
+		if not counter_id_legal(cid):
+			errs.append({"category": "enum", "message": "%s counter_id 前缀非法（meta_ 出域/引擎不接存档级）: %s" % [rid, cid]})
+	_vtr_from_refs(rid, tr, row, errs)
+
+
+## value_from/delta_from/mult_from/cap_from 引用面：行字段存在性（悬空=加载致命）——
+## do 与 when 两侧同面（when value_from=dawn_order effective_rounds 先例）
+static func _vtr_from_refs(rid: String, tr: Dictionary, row: Dictionary, errs: Array) -> void:
+	var do_d: Dictionary[Variant, Variant] = tr.get("do", {}) as Dictionary
+	for vf_k in ["value_from", "delta_from", "mult_from", "cap_from"]:
+		if do_d.has(vf_k):
+			var fld := String(do_d.get(vf_k, ""))
+			if fld != "" and not row.has(fld):
+				errs.append({"category": "dangling", "message": "%s do.%s 悬空（行无字段 %s）" % [rid, vf_k, fld]})
+	for c_v in (tr.get("when", []) as Array):
+		var c_w: Dictionary[Variant, Variant] = c_v as Dictionary
+		if c_w.has("value_from"):
+			var wfld := String(c_w.get("value_from", ""))
+			if wfld != "" and not row.has(wfld):
+				errs.append({"category": "dangling", "message": "%s when.value_from 悬空（行无字段 %s）" % [rid, wfld]})
+
+
 ## 组合规则（需求卡片 §3.4 六族——效果类型的必填属性，发射点施加面引用）
 
 ## 加法族（数值相加，可交换）：add_ticket_rider、attack_bonus、grant_material、grant_ap(非 transfer)、

game/core/hero_stats.gd

@@ -52,12 +52,12 @@ func _normalize_override(raw: Dictionary) -> Dictionary[Variant, Variant]:
 # 调试浮窗百分比后乘；pct=0 时乘法恒等——MC 锚零漂移）----
 
 func effective_max_hp() -> int:
-	var base: int = int(db.hero.max_hp) + int(_base_override.get("max_hp", 0)) + journal.bonus_total("max_hp")
+	var base: int = int(db.combat.hero.max_hp) + int(_base_override.get("max_hp", 0)) + journal.bonus_total("max_hp")
 	return maxi(1, int(round(float(base) * (100.0 + float(_override[1])) / 100.0)))
 
 
 func effective_atk() -> int:
-	var base: int = int(db.hero.atk) + int(_base_override.get("atk", 0)) + journal.bonus_total("atk")
+	var base: int = int(db.combat.hero.atk) + int(_base_override.get("atk", 0)) + journal.bonus_total("atk")
 	return maxi(1, int(round(float(base) * (100.0 + float(_override[0])) / 100.0)))
 
 
@@ -70,10 +70,10 @@ func effective_ac() -> int:
 # 甲型基础 AC（三层之第一层——选中甲路线行 base_ac；未注入/缺行=锻造配置默认值路线，
 # 与 hero 表两轴删除前 armor_class=10 行为连续）
 func _armor_base_ac() -> int:
-	var at: String = armor_type if armor_type != "" else db.forge_default_armor_type()
-	var row: Dictionary[Variant, Variant] = db.forge_armor_route_by_type(at)
+	var at: String = armor_type if armor_type != "" else db.crossrun.forge.default_armor_type
+	var row: Dictionary[Variant, Variant] = db.crossrun.forge.armor_route_by_type(at)
 	if row.is_empty():
-		return int(db.hero.armor_class)   # 表缺失防御兜底（现役基准）
+		return int(db.combat.hero.armor_class)   # 表缺失防御兜底（现役基准）
 	return int(row.get("base_ac", 0))
 
 

game/core/level_runner.gd

@@ -318,7 +318,7 @@ func restore_fragment(resume_state: Dictionary) -> Dictionary:
 
 
 func _find_level_row(level_index: int) -> Dictionary:
-	return db.level_row(level_index)   # 表访问收口（行集直扫归 LevelTable/ConfigDB 访问器）
+	return db.run.level.row_by_level_index(level_index)   # 表访问收口（行集直扫归 LevelTable/ConfigDB 访问器）
 
 
 # ---- 图源装配（关卡节点图生成 v1.1——图 = f(参数档, 种子) 纯函数；无模板池、无兜底图）----
@@ -327,7 +327,7 @@ func _find_level_row(level_index: int) -> Dictionary:
 # LevelTable.validate_graph（与产出侧自证同源规格、分工不重叠）；违规＝起关拒绝，不降级不回退。
 func _assign_generated_graph(row: Dictionary, seed_val: int) -> bool:
 	var level_index: int = int(row.get("level_index", 0))
-	var params: Dictionary[Variant, Variant] = db.level_gen_params_row(level_index)
+	var params: Dictionary[Variant, Variant] = db.run.level_gen_params.row_by_level_index(level_index)
 	if params.is_empty():
 		push_error("[关卡节点地图] level %d 无参数档行（level_gen_params 缺行——配置错误）" % level_index)
 		return false
@@ -433,7 +433,7 @@ func visited_ids() -> Array:
 
 # ---- 类型可见性读面（信息迷雾 v2.1：近处见类型，远处起雾）----
 # 可见集 = Boss/终点（type=="boss"）∪ 当前候选（下一跳恒可见——生成承诺）∪
-# {id : |层(id) − 锚层| ≤ N}；N = db.level.info_visible_layers（禁硬编码）；
+# {id : |层(id) − 锚层| ≤ N}；N = db.run.level.info_visible_layers（禁硬编码）；
 # 锚层 = 当前节点层，入口停点（无当前节点）= 0；层 = 入口 BFS 深度（与呈现层分层同源口径）。
 # 纯函数零状态：已过节点不豁免（单圈语义，零累积记忆）；断点快照零新增字段。
 func type_visible_ids() -> Array[int]:
@@ -443,7 +443,7 @@ func type_visible_ids() -> Array[int]:
 	var cur := current_node()
 	if not cur.is_empty():
 		anchor = int(layers.get(_node_id(cur), 0))
-	var n: int = int(db.level.info_visible_layers)
+	var n: int = int(db.run.level.info_visible_layers)
 	for node in nodes():
 		var nid := _node_id(node)
 		if String(node.get("type", "")) == "boss" \

game/core/meta_progression.gd

@@ -7,6 +7,7 @@ extends Node
 
 var db: ConfigDb
 var save: SaveManagerCore
+var meta_state: MetaStateStore   # 存档内元进度数据读写唯一层（K3′ 装配成员——架构 :90 直连）
 
 
 # MetaProgression 是 autoload（仿 RngService 先例：类名加 Core 后缀、
@@ -16,6 +17,8 @@ var save: SaveManagerCore
 func _init(db_ref: ConfigDb = null, save_ref: SaveManagerCore = null) -> void:
 	db = db_ref
 	save = save_ref
+	if save != null:
+		meta_state = save.meta_state
 
 
 func _ready() -> void:
@@ -23,31 +26,23 @@ func _ready() -> void:
 		db = get_node("/root/ConfigDB")
 	if save == null:
 		save = get_node("/root/SaveManager")
-
-
-func keystone_balance() -> int:
-	return save.keystone_balance()
+	meta_state = save.meta_state
 
 
 # ---- 秘宝解锁服务（解锁混合制，契约 6）----
 # 解锁条件单一事实源=treasure_items.tres 行内 unlock_keystone_cost/unlock_requires 谓词
-# （C1 逐件分配锁定表）。
-
-# 道具解锁读数访问器（组合根/呈现层解锁门控查询面——禁再穿透 meta.save 直读 save_manager）
-func is_item_unlocked(item_id: String) -> bool:
-	return save.item_unlocked(item_id)
-
+# （C1 逐件分配锁定表）。钥石余额/道具解锁读数消费方直连 meta.meta_state（纯转发读已随件退役）。
 
 # 解锁条件计数读数单点（谓词 key → 生涯计数——封闭枚举=TreasureItemTable.UNLOCK_COUNTER_KEYS；
 # 词表加键 = 此处增一 match 分支，阈值比较与解锁写档零改动）
 func _treasure_unlock_progress(key: String) -> int:
 	match key:
 		"adventure_cleared":
-			return save.adventure_cleared()
+			return meta_state.career_state().adventure_cleared
 		"boss_kill_count":
-			return save.boss_kill_count()
+			return meta_state.career_state().boss_kill_count
 		"vision_used":
-			return save.vision_used()
+			return meta_state.career_state().vision_used
 		_:
 			return 0   # 未知计数键恒 0 = 永不解锁（fail-safe 非致命——schema 词表校验兜底，不静默误解锁）
 
@@ -55,15 +50,15 @@ func _treasure_unlock_progress(key: String) -> int:
 # 钥石购买解锁（营地秘宝匣唯一购买写口）：仅购买件（行带 unlock_keystone_cost）可购；
 # 已解锁/余额不足/条件件误购 = 拒绝且零副作用（spend_keystone 内嵌余额闸，失败不扣币）。
 func buy_treasure_unlock(item_id: String) -> bool:
-	var arow: Dictionary[Variant, Variant] = db.treasure_item_row(item_id)
+	var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(item_id)
 	var price := int(arow.get("unlock_keystone_cost", 0))
 	if arow.is_empty() or price < 1 or (arow.get("unlock_requires", []) as Array).size() > 0:
 		return false   # 非购买件（条件件/无价行）拒绝
-	if save.item_unlocked(item_id):
+	if meta_state.item_unlocked(item_id):
 		return false   # 已解锁重复购买拒绝
-	if not save.spend_keystone(price):
+	if not meta_state.spend_keystone(price):
 		return false   # 余额不足（零副作用）
-	save.unlock_item(item_id)
+	meta_state.unlock_item(item_id)
 	return save.write_to_disk()
 
 
@@ -71,9 +66,9 @@ func buy_treasure_unlock(item_id: String) -> bool:
 # 全部谓词达标才解锁（多谓词=AND——天眼双条件）；幂等：已解锁跳过，重复刷新零重复入账。
 func refresh_treasure_unlocks() -> Array:
 	var new_unlocks: Array[String] = []
-	for row in db.treasure_attunement_rows():
+	for row in db.crossrun.treasure_items.attunement_rows():
 		var iid := String(row.get("item_id", ""))
-		if save.item_unlocked(iid):
+		if meta_state.item_unlocked(iid):
 			continue
 		var ureqs: Array[Variant] = row.get("unlock_requires", []) as Array
 		if ureqs.is_empty():
@@ -85,7 +80,7 @@ func refresh_treasure_unlocks() -> Array:
 				met = false
 				break
 		if met:
-			save.unlock_item(iid)
+			meta_state.unlock_item(iid)
 			new_unlocks.append(iid)
 	if not new_unlocks.is_empty():
 		save.write_to_disk()
@@ -96,9 +91,9 @@ func refresh_treasure_unlocks() -> Array:
 # {item_id, display_name, desc, tier, unlocked, mode(keystone|condition|owned), price, reqs:[{key,threshold,progress}]}
 func treasure_shop_status() -> Array:
 	var out: Array[Dictionary] = []
-	for row in db.treasure_attunement_rows():
+	for row in db.crossrun.treasure_items.attunement_rows():
 		var iid := String(row.get("item_id", ""))
-		var unlocked := save.item_unlocked(iid)
+		var unlocked := meta_state.item_unlocked(iid)
 		var ureqs: Array[Variant] = row.get("unlock_requires", []) as Array
 		var req_view: Array[Variant] = []
 		for req_v in ureqs:
@@ -128,18 +123,18 @@ func treasure_shop_status() -> Array:
 # 等级语义：未解锁/未锻造=0 加值（裸体态）；锻造第一级=「获得装备」=首个 +1；逐级递进。
 
 # 路线解锁态派生（不落档——初始持有∨直购∨练满前一档；派生单点只此一处）
-func forge_route_unlocked(route_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.forge_route(route_id)
+func _forge_route_unlocked(route_id: String) -> bool:
+	var row: Dictionary[Variant, Variant] = db.crossrun.forge.route(route_id)
 	if row.is_empty():
 		return false
 	if bool(row.get("initial_owned", false)):
 		return true
-	if save.forge_unlocked_purchases().has(route_id):
+	if meta_state.forge_state().unlocked.has(route_id):
 		return true
 	var prereq := String(row.get("prereq_route", ""))
 	if prereq != "":
-		var prow: Dictionary[Variant, Variant] = db.forge_route(prereq)
-		if not prow.is_empty() and save.forge_route_level(prereq) >= int(prow.get("cap", 0)):
+		var prow: Dictionary[Variant, Variant] = db.crossrun.forge.route(prereq)
+		if not prow.is_empty() and meta_state.forge_state().levels.get(prereq, 0) >= int(prow.get("cap", 0)):
 			return true
 	return false
 
@@ -147,86 +142,60 @@ func forge_route_unlocked(route_id: String) -> bool:
 # 路线购买（几何价=基础价×150%^已购级数——锚表 20/30/45/67/101；等级+1 即时写盘）。
 # 未解锁/已满级/余额不足/未知路线 = 拒绝且零副作用（spend_keystone 内嵌余额闸，失败不扣币不写盘）。
 func forge_buy_level(route_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.forge_route(route_id)
-	if row.is_empty() or not forge_route_unlocked(route_id):
+	var row: Dictionary[Variant, Variant] = db.crossrun.forge.route(route_id)
+	if row.is_empty() or not _forge_route_unlocked(route_id):
 		return false
-	var lvl := save.forge_route_level(route_id)
+	var lvl := meta_state.forge_state().levels.get(route_id, 0)
 	if lvl >= int(row.get("cap", 0)):
 		return false
 	var price := ForgeTable.level_price(row, lvl)
-	if not save.spend_keystone(price):
+	if not meta_state.spend_keystone(price):
 		return false
-	save.set_forge_route_level(route_id, lvl + 1)
+	meta_state.set_forge_route_level(route_id, lvl + 1)
 	return save.write_to_disk()
 
 
 # 一次性解锁价直购（并联双通道②）。已解锁（含练满前一档派生）= 拒绝零收费——两通道互不影响：
 # 未练满也可直购；直购后练满不重复收（练满通道本就是派生、零收费）。初始持有行无解锁面。
 func forge_buy_unlock(route_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.forge_route(route_id)
+	var row: Dictionary[Variant, Variant] = db.crossrun.forge.route(route_id)
 	if row.is_empty() or bool(row.get("initial_owned", false)):
 		return false
-	if forge_route_unlocked(route_id):
+	if _forge_route_unlocked(route_id):
 		return false
 	var price := int(row.get("unlock_price", 0))
-	if price < 1 or not save.spend_keystone(price):
+	if price < 1 or not meta_state.spend_keystone(price):
 		return false
-	save.add_forge_unlock(route_id)
+	meta_state.add_forge_unlock(route_id)
 	return save.write_to_disk()
 
 
 # 当前武器/甲选中切换（免费——只受理已解锁路线；写存档域+即时写盘。冒险开始锁死归参数面快照，
-# 契约 8；冒险中无切换入口=UI 面无路径可达本口）
-func forge_select_weapon(route_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.forge_route(route_id)
-	if row.is_empty() or String(row.get("kind", "")) != "weapon" or not forge_route_unlocked(route_id):
+# 契约 8；冒险中无切换入口=UI 面无路径可达本口）。并组入口：kind ∈ {weapon, armor}。
+func forge_select(kind: String, route_id: String) -> bool:
+	var row: Dictionary[Variant, Variant] = db.crossrun.forge.route(route_id)
+	if row.is_empty() or String(row.get("kind", "")) != kind or not _forge_route_unlocked(route_id):
 		return false
-	save.set_forge_weapon(route_id)
+	if kind == "weapon":
+		meta_state.set_forge_weapon(route_id)
+	else:
+		meta_state.set_forge_armor(route_id)
 	return save.write_to_disk()
 
 
-func forge_select_armor(route_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.forge_route(route_id)
-	if row.is_empty() or String(row.get("kind", "")) != "armor" or not forge_route_unlocked(route_id):
-		return false
-	save.set_forge_armor(route_id)
-	return save.write_to_disk()
-
-
-# 当前选中武器攻击加值 / 当前甲 AC 加值（路线等级×每级增量——0=裸体态/未锻造合法态）。
-# 选中态异常（未解锁/表缺行）防御回退 0——注入面只认合法态，禁把脏选中带进冒险。
-func forge_weapon_atk_bonus() -> int:
-	var rid := save.forge_weapon()
-	var row: Dictionary[Variant, Variant] = db.forge_route(rid)
-	if row.is_empty() or String(row.get("kind", "")) != "weapon" or not forge_route_unlocked(rid):
-		return 0
-	return save.forge_route_level(rid) * int(row.get("per_level_gain", 0))
-
-
-func forge_armor_ac_bonus() -> int:
-	var rid := save.forge_armor()
-	var row: Dictionary[Variant, Variant] = db.forge_route(rid)
-	if row.is_empty() or String(row.get("kind", "")) != "armor" or not forge_route_unlocked(rid):
-		return 0
-	return save.forge_route_level(rid) * int(row.get("per_level_gain", 0))
-
-
-# 两根类型轴当前生效值（选中路线类型轴；选中态异常/未解锁=锻造配置默认值——契约 2 回退面）。
+# 两根类型轴当前生效值（{attack, armor} 并组承载；选中态异常/未解锁=锻造配置默认值——契约 2 回退面）。
 # 默认值与柜台解锁状态解耦：树钥匙未点亮时本函数照常返回默认值（配置常驻可读）。
-func hero_attack_type() -> String:
-	var rid := save.forge_weapon()
-	var row: Dictionary[Variant, Variant] = db.forge_route(rid)
-	if row.is_empty() or String(row.get("kind", "")) != "weapon" or not forge_route_unlocked(rid):
-		return db.forge_default_attack_type()
-	return String(row.get("type_axis", ""))
-
-
-func hero_armor_type() -> String:
-	var rid := save.forge_armor()
-	var row: Dictionary[Variant, Variant] = db.forge_route(rid)
-	if row.is_empty() or String(row.get("kind", "")) != "armor" or not forge_route_unlocked(rid):
-		return db.forge_default_armor_type()
-	return String(row.get("type_axis", ""))
+func hero_type_axes() -> Dictionary:
+	var fs := meta_state.forge_state()
+	var wrow: Dictionary[Variant, Variant] = db.crossrun.forge.route(String(fs["weapon"]))
+	var attack := db.crossrun.forge.default_attack_type
+	if not wrow.is_empty() and String(wrow.get("kind", "")) == "weapon" and _forge_route_unlocked(String(fs["weapon"])):
+		attack = String(wrow.get("type_axis", ""))
+	var arow: Dictionary[Variant, Variant] = db.crossrun.forge.route(String(fs["armor"]))
+	var armor := db.crossrun.forge.default_armor_type
+	if not arow.is_empty() and String(arow.get("kind", "")) == "armor" and _forge_route_unlocked(String(fs["armor"])):
+		armor = String(arow.get("type_axis", ""))
+	return {"attack": attack, "armor": armor}
 
 
 # ---- 锻造工坊柜台只读投影（呈现层数据源：两区六路线行板；余额联动禁用归视图）----
@@ -235,16 +204,16 @@ func hero_armor_type() -> String:
 # prereq_level, prereq_cap, prereq_maxed}——纯结构面，禁嵌余额判断（视图按 balance 禁用，同秘宝匣先例）。
 func forge_shop_status() -> Array:
 	var out: Array[Dictionary] = []
-	for row in db.forge_routes():
+	for row in db.crossrun.forge.route_rows():
 		var rid := String(row.get("route_id", ""))
-		var lvl := save.forge_route_level(rid)
+		var lvl := meta_state.forge_state().levels.get(rid, 0)
 		var cap_v := int(row.get("cap", 0))
-		var unlocked := forge_route_unlocked(rid)
+		var unlocked := _forge_route_unlocked(rid)
 		var prereq := String(row.get("prereq_route", ""))
-		var plvl := save.forge_route_level(prereq) if prereq != "" else 0
-		var pcap := int(db.forge_route(prereq).get("cap", 0)) if prereq != "" else 0
-		var selected := (String(row.get("kind", "")) == "weapon" and save.forge_weapon() == rid) \
-			or (String(row.get("kind", "")) == "armor" and save.forge_armor() == rid)
+		var plvl := meta_state.forge_state().levels.get(prereq, 0) if prereq != "" else 0
+		var pcap := int(db.crossrun.forge.route(prereq).get("cap", 0)) if prereq != "" else 0
+		var selected := (String(row.get("kind", "")) == "weapon" and meta_state.forge_state().weapon == rid) \
+			or (String(row.get("kind", "")) == "armor" and meta_state.forge_state().armor == rid)
 		out.append({
 			"route_id": rid,
 			"display_name": String(row.get("display_name", "")),
@@ -258,7 +227,7 @@ func forge_shop_status() -> Array:
 			"next_price": ForgeTable.level_price(row, lvl) if (unlocked and lvl < cap_v) else 0,
 			"unlock_price": int(row.get("unlock_price", 0)),
 			"prereq_route": prereq,
-			"prereq_name": String(db.forge_route(prereq).get("display_name", "")) if prereq != "" else "",
+			"prereq_name": String(db.crossrun.forge.route(prereq).get("display_name", "")) if prereq != "" else "",
 			"prereq_level": plvl,
 			"prereq_cap": pcap,
 			"prereq_maxed": prereq != "" and plvl >= pcap,
@@ -274,10 +243,10 @@ func forge_shop_status() -> Array:
 # apply_adventure_summary 逐关卡完成关次置位）。本函数只做标记+入账+归档。
 func settle_adventure(summary: Dictionary) -> Dictionary:
 	# 首次冒险布尔位置位（关卡节点图生成 v0.4——完成/失败/放弃三结局同经本收束挂点，写入只在收束）
-	save.mark_first_adventure_done()
+	meta_state.mark_first_adventure_done()
 	var drops: Array[Variant] = (summary.get("keystone_drops", []) as Array).duplicate(true)
-	save.apply_adventure_summary(summary, drops)
-	save.add_vision_used(int(summary.get("vision_used_delta", 0)))   # 真视使用计数收束聚合入档（信标网络行为条件）
+	meta_state.apply_adventure_summary(summary, drops)
+	meta_state.add_vision_used(int(summary.get("vision_used_delta", 0)))   # 真视使用计数收束聚合入档（信标网络行为条件）
 	var new_unlocks := refresh_treasure_unlocks()   # 条件解锁刷新
 	save.write_to_disk()
 	var total := int(summary.get("keystone_total", 0))
@@ -299,51 +268,75 @@ func settle_adventure(summary: Dictionary) -> Dictionary:
 # 全零 = 白板合法态（无解锁不得改变任何局内规则）；override 禁写表（表运行期只读）。
 
 func hero_override() -> Dictionary:
+	# 锻造路线加值内联（原 forge_weapon_atk_bonus/forge_armor_ac_bonus 单调用点收编——输出逐字：
+	# 路线等级×每级增量，选中态异常/未解锁防御回退 0）
+	var fs := meta_state.forge_state()
+	var atk_bonus := _forge_axis_bonus(fs, "weapon", "weapon")
+	var ac_bonus := _forge_axis_bonus(fs, "armor", "armor")
+	# 树淬炼 flat 内联（原 tree_stat_flat 单调用点收编——四线 flat 汇总同轮扫描，三轴输出逐字等价）
+	var tree_atk := 0
+	var tree_hp := 0
+	var tree_ac := 0
+	var nodes: Dictionary[Variant, Variant] = meta_state.tree_state()["nodes"]
+	for row in db.crossrun.meta_tree.rows:
+		var lvl := int(nodes.get(String(row.get("node_id", "")), 0))
+		if lvl <= 0:
+			continue
+		var fx: Dictionary[Variant, Variant] = row.get("effects", {}) as Dictionary
+		tree_atk += int(fx.get("atk", 0)) * lvl
+		tree_hp += int(fx.get("max_hp", 0)) * lvl
+		tree_ac += int(fx.get("armor_class", 0)) * lvl
 	return {
-		"atk": forge_weapon_atk_bonus() + tree_stat_flat("atk"),
-		"max_hp": tree_stat_flat("max_hp"),
-		"armor_class": forge_armor_ac_bonus() + tree_stat_flat("armor_class"),
+		"atk": atk_bonus + tree_atk,
+		"max_hp": tree_hp,
+		"armor_class": ac_bonus + tree_ac,
 	}
 
 
+# 锻造轴加值原语（选中路线等级×每级增量；选中态异常（未解锁/表缺行）防御回退 0——注入面只认合法态）
+func _forge_axis_bonus(fs: Dictionary, sel_key: String, kind: String) -> int:
+	var rid := String(fs[sel_key])
+	var row: Dictionary[Variant, Variant] = db.crossrun.forge.route(rid)
+	if row.is_empty() or String(row.get("kind", "")) != kind or not _forge_route_unlocked(rid):
+		return 0
+	return int(fs["levels"].get(rid, 0)) * int(row.get("per_level_gain", 0))
+
+
 # ---- 天赋树段（设计权威 整合定稿 §1.4 一树双币三脉一脊）----
 
 # 全树已购总等级（row-gating 输入——「投入点数累计解锁新行」）
-func tree_spent_total() -> int:
+func _tree_spent_total() -> int:
 	var total := 0
-	for lvl in (save.tree_nodes() as Dictionary).values():
+	for lvl in (meta_state.tree_state().nodes as Dictionary).values():
 		total += int(lvl)
 	return total
 
 
 # 节点可购校验（行门槛 + 显式前置 + 币 + cap；free 节点=钥匙不经购买，彩蛋=觉醒不经购买）
 func tree_can_buy(node_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.tree_node(node_id)
-	if row.is_empty():
-		return false
+	var row: Dictionary[Variant, Variant] = db.crossrun.meta_tree.row_by_id(node_id)
 	# 彩蛋不经购买（觉醒唯一入口=_check_easter_egg 特化判定——V8 反例：手动购亮=红）
-	if String(row.get("kind", "")) == "easter":
-		return false
-	var lvl := save.tree_level(node_id)
-	if lvl >= int(row.get("cap", 1)):
+	if row.is_empty() or String(row.get("kind", "")) == "easter":
 		return false
+	var nodes: Dictionary[Variant, Variant] = meta_state.tree_state()["nodes"]
+	var lvl := int(nodes.get(node_id, 0))
+	var blocked := lvl >= int(row.get("cap", 1))
 	# 刷新升级节点：cap 主语=Y 账本（单一事实源——树上入口与装配段同 cap 同价，防双账漂移）
-	if node_id == "ks_refresh" and db.meta_attune_refresh_row(save.attune_refresh_level() + 1).is_empty():
-		return false
+	if node_id == "ks_refresh" and db.crossrun.meta.attune_refresh_row(meta_state.attune_state().refresh_level + 1).is_empty():
+		blocked = true
 	# 行门槛（一线一节点：脊柱节点第 N 级需全树总投入 ≥4×(N−1)）
-	if String(row.get("vein", "")) == "spine" and String(row.get("kind", "")) == "stat":
-		if tree_spent_total() < db.meta_tree.level_gate(lvl + 1):
-			return false
+	if String(row.get("vein", "")) == "spine" and String(row.get("kind", "")) == "stat" 			and _tree_spent_total() < db.crossrun.meta_tree.level_gate(lvl + 1):
+		blocked = true
 	for req in (row.get("requires", []) as Array):
-		if save.tree_level(String(req)) < 1:
-			return false
+		if int(nodes.get(String(req), 0)) < 1:
+			blocked = true
 	# 等级阈值前置（requires_level {node_id: n}：前置节点等级 ≥ n 才可购；
 	# 现役表零配置=空转零行为影响）
 	var req_lv: Dictionary[Variant, Variant] = row.get("requires_level", {}) as Dictionary
 	for req_id in req_lv.keys():
-		if save.tree_level(String(req_id)) < int(req_lv[req_id]):
-			return false
-	return true
+		if int(nodes.get(String(req_id), 0)) < int(req_lv[req_id]):
+			blocked = true
+	return not blocked
 
 
 # 节点购买（营地树 UI 唯一写口）：树全钥石单币。free=工作间钥匙零币点亮
@@ -353,13 +346,13 @@ func tree_can_buy(node_id: String) -> bool:
 func tree_buy(node_id: String) -> bool:
 	if node_id == "ks_refresh":
 		return buy_attune_refresh()
-	var row: Dictionary[Variant, Variant] = db.tree_node(node_id)
+	var row: Dictionary[Variant, Variant] = db.crossrun.meta_tree.row_by_id(node_id)
 	if row.is_empty() or not tree_can_buy(node_id):
 		return false
 	var price := int(row.get("price", 0))
-	if not save.spend_keystone(price):
+	if not meta_state.spend_keystone(price):
 		return false
-	save.set_tree_level(node_id, save.tree_level(node_id) + 1)
+	meta_state.set_tree_level(node_id, meta_state.tree_state().nodes.get(node_id, 0) + 1)
 	_check_easter_egg()
 	return save.write_to_disk()
 
@@ -367,45 +360,35 @@ func tree_buy(node_id: String) -> bool:
 # Fork 切换（营地树 UI——一节点双态：购买解锁组默认 A 态，换态走本口零币；同态重复=零操作；
 # 未解锁组切换=拒绝——解锁唯一入口=购买面 tree_buy_fork）
 func tree_toggle_fork(group: String, side: String) -> bool:
-	if not db.meta_tree.FORK_GROUPS.has(group) or not (side == "a" or side == "b"):
+	if not db.crossrun.meta_tree.FORK_GROUPS.has(group) or not (side == "a" or side == "b"):
 		return false
-	var cur := save.fork_side(group)
+	var cur := meta_state.tree_state().fork_sides.get(group, "")
 	if cur == "" or cur == side:
 		return false   # 未解锁走购买面；同态零操作
-	save.set_fork_side(group, side)
+	meta_state.set_fork_side(group, side)
 	return save.write_to_disk()
 
 
 # Fork 节点购买入口（一节点双态——购=解锁开关并置默认 A 态；重复购买由 cap 经 can_buy 拦截）
 func tree_buy_fork(node_id: String) -> bool:
-	var row: Dictionary[Variant, Variant] = db.tree_node(node_id)
+	var row: Dictionary[Variant, Variant] = db.crossrun.meta_tree.row_by_id(node_id)
 	if row.is_empty() or String(row.get("kind", "")) != "fork":
 		return tree_buy(node_id)
 	if not tree_can_buy(node_id):
 		return false
 	var price := int(row.get("price", 0))
-	if not save.spend_keystone(price):
+	if not meta_state.spend_keystone(price):
 		return false
-	save.set_tree_level(node_id, 1)
-	save.set_fork_side(String(row.get("fork_group", "")), "a")   # 解锁默认 A 态
+	meta_state.set_tree_level(node_id, 1)
+	meta_state.set_fork_side(String(row.get("fork_group", "")), "a")   # 解锁默认 A 态
 	return save.write_to_disk()
 
 
-# 树效果投影：四线 flat 汇总 + rule 键集（激活 Fork 侧 effects 并入）
-func tree_stat_flat(key: String) -> int:
-	var total := 0
-	for row in db.tree_rows():
-		var lvl := save.tree_level(String(row.get("node_id", "")))
-		if lvl <= 0:
-			continue
-		total += int((row.get("effects", {}) as Dictionary).get(key, 0)) * lvl
-	return total
-
-
+# 树规则键投影（激活 Fork 侧 effects 并入）
 func tree_rule_keys() -> Array:
 	var out: Array[Variant] = []
-	var sides: Dictionary[Variant, Variant] = save.fork_sides()
-	for row in db.tree_rows():
+	var sides: Dictionary[Variant, Variant] = meta_state.tree_state().fork_sides
+	for row in db.crossrun.meta_tree.rows:
 		if String(row.get("kind", "")) != "fork":
 			continue
 		var active := String(sides.get(String(row.get("fork_group", "")), ""))
@@ -418,10 +401,15 @@ func tree_rule_keys() -> Array:
 	return out
 
 
-# 营地树面投影（CampOverlay _rebuild_tree 数据源——行板只读；账面归本类、拼句归视图同款分工）
-func tree_camp_rows() -> Array:
+# 营地树面投影（并组入口——{rows, fork_groups}；CampOverlay _rebuild_tree 数据源——行板只读；账面归本类、拼句归视图同款分工）
+func tree_camp_status() -> Dictionary:
+	return {"rows": _tree_camp_rows(), "fork_groups": _tree_fork_groups()}
+
+
+## 树行板投影段（原 tree_camp_rows）
+func _tree_camp_rows() -> Array:
 	var out: Array[Variant] = []
-	for row in db.tree_rows():
+	for row in db.crossrun.meta_tree.rows:
 		if String(row.get("kind", "")) == "fork":
 			continue   # Fork 行由 fork_groups 段承载
 		out.append({
@@ -430,32 +418,33 @@ func tree_camp_rows() -> Array:
 			"vein": String(row.get("vein", "")),
 			"kind": String(row.get("kind", "")),
 			"cap": int(row.get("cap", 1)),
-			"level": save.attune_refresh_level() if String(row.get("node_id", "")) == "ks_refresh" else save.tree_level(String(row.get("node_id", ""))),   # 刷新升级行主语=Y 账本（同账路由 V15）
+			"level": meta_state.attune_state().refresh_level if String(row.get("node_id", "")) == "ks_refresh" else meta_state.tree_state().nodes.get(String(row.get("node_id", "")), 0),   # 刷新升级行主语=Y 账本（同账路由 V15）
 			"price": int(row.get("price", 0)),
 			"currency": String(row.get("currency", "keystone")),
 			"can_buy": tree_can_buy(String(row.get("node_id", ""))),
-			"gate_text": tree_gate_text(String(row.get("node_id", ""))),
+			"gate_text": _tree_gate_text(String(row.get("node_id", ""))),
 		})
 	return out
 
 
 # 行板门槛文案（R1 机制位呈现——requires_level 未达标项拼「需 {前置名} Lv{n}」；达标/未配置=空串。
 # 只呈现未达标项：达标后锁标消失，不做全量前置罗列）
-func tree_gate_text(node_id: String) -> String:
-	var row: Dictionary[Variant, Variant] = db.tree_node(node_id)
+func _tree_gate_text(node_id: String) -> String:
+	var row: Dictionary[Variant, Variant] = db.crossrun.meta_tree.row_by_id(node_id)
 	var rl: Dictionary[Variant, Variant] = row.get("requires_level", {}) as Dictionary
 	var parts: Array[String] = []
 	for req_id in rl.keys():
-		if save.tree_level(String(req_id)) < int(rl[req_id]):
-			var req_row: Dictionary[Variant, Variant] = db.tree_node(String(req_id))
+		if meta_state.tree_state().nodes.get(String(req_id), 0) < int(rl[req_id]):
+			var req_row: Dictionary[Variant, Variant] = db.crossrun.meta_tree.row_by_id(String(req_id))
 			parts.append("需 %s Lv%d" % [String(req_row.get("display_name", req_id)), int(rl[req_id])])
 	return "、".join(parts)
 
 
-func tree_fork_groups() -> Array:
+## Fork 行板投影段（原 tree_fork_groups）
+func _tree_fork_groups() -> Array:
 	var out: Array[Variant] = []
-	var sides: Dictionary[Variant, Variant] = save.fork_sides()
-	for row in db.tree_rows():
+	var sides: Dictionary[Variant, Variant] = meta_state.tree_state().fork_sides
+	for row in db.crossrun.meta_tree.rows:
 		if String(row.get("kind", "")) != "fork":
 			continue
 		var fg := String(row.get("fork_group", ""))
@@ -464,7 +453,7 @@ func tree_fork_groups() -> Array:
 			"node_id": String(row.get("node_id", "")),
 			"display_name": String(row.get("display_name", "")),
 			"active_side": String(sides.get(fg, "")),
-			"owned": save.tree_level(String(row.get("node_id", ""))) > 0,
+			"owned": meta_state.tree_state().nodes.get(String(row.get("node_id", "")), 0) > 0,
 			"can_buy": tree_can_buy(String(row.get("node_id", ""))),
 			"price": int(row.get("price", 0)),
 			"sides": [
@@ -478,16 +467,16 @@ func tree_fork_groups() -> Array:
 # 彩蛋觉醒检查（特化判定——生命/命中两线拉满 且 同调位 1/2/3 全解锁 → easter_ley 免费点亮；
 # 不依赖 requires/requires_level 前置形态）
 func _check_easter_egg() -> void:
-	if save.tree_level("easter_ley") > 0:
+	if meta_state.tree_state().nodes.get("easter_ley", 0) > 0:
 		return
 	for nid in ["sp_hp", "sp_hit"]:
-		var row: Dictionary[Variant, Variant] = db.tree_node(nid)
-		if row.is_empty() or save.tree_level(nid) < int(row.get("cap", 1)):
+		var row: Dictionary[Variant, Variant] = db.crossrun.meta_tree.row_by_id(nid)
+		if row.is_empty() or meta_state.tree_state().nodes.get(nid, 0) < int(row.get("cap", 1)):
 			return
 	for i in range(1, 4):
-		if save.tree_level("att_socket%d" % i) < 1:
+		if meta_state.tree_state().nodes.get("att_socket%d" % i, 0) < 1:
 			return
-	save.set_tree_level("easter_ley", 1)
+	meta_state.set_tree_level("easter_ley", 1)
 
 
 # ---- 同调位账本（装配关系/同调位求值/Y 刷新升级；设计权威 proposal §2）----
@@ -498,30 +487,30 @@ func _check_easter_egg() -> void:
 # 格 1=普通格/格 2=优秀格/格 3=稀有格递增向下兼容；槽位来源=树同调位节点点亮数，树接口接缝现役）。
 # 装配关系写存档持久。
 func toggle_attunement(item_id: String) -> bool:
-	var equipped: Array[Variant] = save.attunement_equipped()
+	var equipped: Array[Variant] = meta_state.attune_state().equipped
 	if not equipped.has(item_id):
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(item_id)
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(item_id)
 		if arow.is_empty() or String(arow.get("form", "")) == "":
 			return false   # 非同调行（过渡/退役行）禁装配
-		if not save.item_unlocked(item_id):
+		if not meta_state.item_unlocked(item_id):
 			return false   # 未解锁禁装配（解锁混合制契约 6——装配以解锁为前置）
 		if equipped.size() >= Attunement.slots(db, save):
 			return false   # 满位禁选
-		var rank: int = int(db.treasure_items.TIER_RANK.get(String(arow.get("tier", "")), 99))
+		var rank: int = int(db.crossrun.treasure_items.TIER_RANK.get(String(arow.get("tier", "")), 99))
 		if rank > equipped.size() + 1:
 			return false   # 件档高于将占格档（第 k 格档=k——普通/优秀/稀有递增）
 		equipped.append(item_id)
 	else:
 		equipped.erase(item_id)
-	save.set_attunement_equipped(equipped)
+	meta_state.set_attunement_equipped(equipped)
 	return save.write_to_disk()
 
 
 # 营地装配面投影（账面归本类、拼句归 CampOverlay——_camp_data 同款分工）
 func attune_camp_status() -> Dictionary:
-	var equipped: Array[Variant] = save.attunement_equipped()
+	var equipped: Array[Variant] = meta_state.attune_state().equipped
 	var items: Array[Dictionary] = []
-	for row in db.treasure_attunement_rows():
+	for row in db.crossrun.treasure_items.attunement_rows():
 		var iid := String(row.get("item_id", ""))
 		items.append({
 			"item_id": iid,
@@ -530,10 +519,10 @@ func attune_camp_status() -> Dictionary:
 			"tier": String(row.get("tier", "")),
 			"form": String(row.get("form", "")),
 			"equipped": equipped.has(iid),
-			"unlocked": save.item_unlocked(iid),
+			"unlocked": meta_state.item_unlocked(iid),
 		})
-	var lvl := save.attune_refresh_level()
-	var next_row: Dictionary[Variant, Variant] = db.meta_attune_refresh_row(lvl + 1)
+	var lvl := meta_state.attune_state().refresh_level
+	var next_row: Dictionary[Variant, Variant] = db.crossrun.meta.attune_refresh_row(lvl + 1)
 	return {
 		"slots": Attunement.slots(db, save),
 		"equipped": equipped,
@@ -549,15 +538,15 @@ func attune_camp_status() -> Dictionary:
 
 # 每冒险开局刷新次数 Y（当前等级行表值；0 级 = 0 次即无刷新能力——P1 甲初始 0 同构）
 func attune_refresh_charges() -> int:
-	return int(db.meta_attune_refresh_row(save.attune_refresh_level()).get("refresh_charges", 0))
+	return int(db.crossrun.meta.attune_refresh_row(meta_state.attune_state().refresh_level).get("refresh_charges", 0))
 
 
 # Y 升级购买（直购价 = 下一级行表值 keystone_cost；已满级/余额不足 false 零副作用——buy_forge 同款）
 func buy_attune_refresh() -> bool:
-	var next_row: Dictionary[Variant, Variant] = db.meta_attune_refresh_row(save.attune_refresh_level() + 1)
+	var next_row: Dictionary[Variant, Variant] = db.crossrun.meta.attune_refresh_row(meta_state.attune_state().refresh_level + 1)
 	if next_row.is_empty():
 		return false
-	if not save.spend_keystone(int(next_row.get("keystone_cost", 0))):
+	if not meta_state.spend_keystone(int(next_row.get("keystone_cost", 0))):
 		return false
-	save.set_attune_refresh_level(save.attune_refresh_level() + 1)
+	meta_state.set_attune_refresh_level(meta_state.attune_state().refresh_level + 1)
 	return save.write_to_disk()

game/core/meta_state_store.gd

@@ -0,0 +1,176 @@
+## 存档内元进度数据件（D3 拆件——自 save_manager 收编元进度族）：存档内元进度数据的读写唯一层。
+## 数据读写原语族（写口 13）＋只读投影（读 6——tree/forge/attune/career 四域值拷贝出户）；
+## 业务规则与写口编排归 MetaProgression，本件只承载键域读写（照单承载，零业务判定）。
+## 零 _data 副本零缓存——全部读写经注入 save 的内存数据模型单点。
+class_name MetaStateStore
+extends RefCounted
+
+var _save                       # SaveManagerCore 注入引用（_data 唯一取数点）
+
+
+func _init(save_ref) -> void:
+	_save = save_ref
+
+
+# ---- 写口原语族（13）----
+
+# 钥石消费唯一口：余额不足拒绝且零副作用（钥石只增不减——消费除外，元进度验收判据）
+func spend_keystone(n: int) -> bool:
+	if keystone_balance() < n:
+		return false
+	_save._data["meta"]["keystone_balance"] = keystone_balance() - n
+	return true
+
+
+func unlock_item(item_id: String) -> void:
+	_save._data["meta"]["item_unlocks"][item_id] = true
+
+
+func set_tree_level(node_id: String, level: int) -> void:
+	var tn: Dictionary[Variant, Variant] = _save._data["meta"].get("tree_nodes", {}) as Dictionary
+	tn[node_id] = maxi(0, level)
+	_save._data["meta"]["tree_nodes"] = tn
+
+
+func set_fork_side(group: String, side: String) -> void:
+	var fs: Dictionary[Variant, Variant] = _save._data["meta"].get("fork_sides", {}) as Dictionary
+	fs[group] = side
+	_save._data["meta"]["fork_sides"] = fs
+
+
+func set_forge_route_level(route_id: String, level: int) -> void:
+	var dom: Dictionary[Variant, Variant] = _forge_domain()
+	var lv: Dictionary[Variant, Variant] = dom.get("levels", {}) as Dictionary
+	lv[route_id] = maxi(0, level)
+	dom["levels"] = lv
+	_save._data["meta"]["forge_routes"] = dom
+
+
+func add_forge_unlock(route_id: String) -> void:
+	var dom: Dictionary[Variant, Variant] = _forge_domain()
+	var un: Array[Variant] = dom.get("unlocked", []) as Array
+	if not un.has(route_id):
+		un.append(route_id)
+	dom["unlocked"] = un
+	_save._data["meta"]["forge_routes"] = dom
+
+
+func set_forge_weapon(route_id: String) -> void:
+	var dom: Dictionary[Variant, Variant] = _forge_domain()
+	dom["weapon"] = route_id
+	_save._data["meta"]["forge_routes"] = dom
+
+
+func set_forge_armor(route_id: String) -> void:
+	var dom: Dictionary[Variant, Variant] = _forge_domain()
+	dom["armor"] = route_id
+	_save._data["meta"]["forge_routes"] = dom
+
+
+func set_attunement_equipped(item_ids: Array) -> void:
+	var out: Array[Variant] = []
+	for v in item_ids:
+		out.append(String(v))
+	_save._data["meta"]["attunement_equipped"] = out
+
+
+func set_attune_refresh_level(n: int) -> void:
+	_save._data["meta"]["attune_refresh_level"] = maxi(0, n)
+
+
+# 真视类工具累计使用入账（写入唯一经本口冒险收束聚合，受理计数点=battle 层经冒险层聚合）
+func add_vision_used(n: int) -> void:
+	_save._data["meta"]["vision_used"] = maxi(0, career_state()["vision_used"] + maxi(0, n))
+
+
+# 域更新原语（正式冒险收束唯一入账口——组合根经本函数入账，禁直改内部结构）：
+# 钥石入账（summary.keystone_total——逐杀掉落已在冒险内计入，boss_drops 参数为
+# 摘要归档副本不重复入账）+ 逐关卡完成关次 clear_count +1 与 Boss 首杀标记 + Boss 击杀总数累计
+# （同调位里程碑计数源）+ 摘要头部插入（cap 10，最新在前，元素附
+# keystone_drops 副本——复盘可归因）+ 生涯终身计数自增（总局数开局即计：
+# 三结局同经本口恰计一次；冒险成功局数按 summary.cleared 判定三关全通才计 1。终身计数写入
+# 单口=本函数，禁第二写入点）。
+func apply_adventure_summary(summary: Dictionary, boss_drops: Array = []) -> void:
+	_save._data["meta"]["adventure_total"] = career_state()["adventure_total"] + 1
+	if bool(summary.get("cleared", false)):
+		_save._data["meta"]["adventure_cleared"] = career_state()["adventure_cleared"] + 1
+	_add_keystone(int(summary.get("keystone_total", 0)))
+	var cleared := int(summary.get("levels_cleared", 0))
+	for li in range(1, cleared + 1):
+		var key := str(li)
+		_save._data["meta"]["level_clear_counts"][key] = int(_save._data["meta"]["level_clear_counts"].get(key, 0)) + 1
+		_save._data["meta"]["boss_first_kill"][key] = true
+	_save._data["meta"]["boss_kill_count"] = career_state()["boss_kill_count"] + cleared   # Boss 恒唯一终点：levels_cleared 即本次冒险 Boss 击杀数（含重复）
+	var entry: Dictionary[Variant, Variant] = summary.duplicate(true)
+	entry["boss_drops"] = boss_drops.duplicate(true)
+	var arr: Array[Variant] = _save._data["meta"]["recent_summaries"]
+	arr.push_front(entry)
+	while arr.size() > _save.SUMMARY_CAP:
+		arr.pop_back()
+
+
+func mark_first_adventure_done() -> void:
+	_save._data["meta"]["first_adventure_done"] = true
+
+
+# 钥石入账原语（生产消费零——apply_adventure_summary 专用；测量面经 _ 前缀直调）
+func _add_keystone(n: int) -> void:
+	_save._data["meta"]["keystone_balance"] = keystone_balance() + n
+
+
+# ---- 只读投影族（6——值拷贝出户，禁碰内部结构契约同款）----
+
+func keystone_balance() -> int:
+	return int(_save._data["meta"]["keystone_balance"])
+
+
+func item_unlocked(item_id: String) -> bool:
+	return _save._data["meta"]["item_unlocks"].has(item_id)
+
+
+## 天赋树域只读投影：{nodes: node_id→已购等级, fork_sides: fork_group→"a"|"b"}
+func tree_state() -> Dictionary:
+	return {
+		"nodes": (_save._data["meta"].get("tree_nodes", {}) as Dictionary).duplicate(),
+		"fork_sides": (_save._data["meta"].get("fork_sides", {}) as Dictionary).duplicate(),
+	}
+
+
+## 锻造域只读投影：{levels: 六路线等级, unlocked: 直购清单, weapon/armor: 当前选中}
+## （解锁态不落档——派生判定单点在 MetaProgression.forge_route_unlocked）
+func forge_state() -> Dictionary:
+	var dom: Dictionary[Variant, Variant] = _forge_domain()
+	return {
+		"levels": (dom.get("levels", {}) as Dictionary).duplicate(),
+		"unlocked": (dom.get("unlocked", []) as Array).duplicate(),
+		"weapon": String(dom.get("weapon", "sword")),
+		"armor": String(dom.get("armor", "light")),
+	}
+
+
+## 同调域只读投影：{equipped: 装配 item_id 有序数组（装配序即呈现序）, refresh_level: Y 升级等级}
+func attune_state() -> Dictionary:
+	return {
+		"equipped": (_save._data["meta"].get("attunement_equipped", []) as Array).duplicate(),
+		"refresh_level": int(_save._data["meta"].get("attune_refresh_level", 0)),
+	}
+
+
+## 生涯域只读投影：{clear_counts, boss_first_kill, boss_kill_count, adventure_total,
+## adventure_cleared, vision_used, recent_summaries, first_adventure_done}
+func career_state() -> Dictionary:
+	return {
+		"clear_counts": (_save._data["meta"]["level_clear_counts"] as Dictionary).duplicate(),
+		"boss_first_kill": (_save._data["meta"]["boss_first_kill"] as Dictionary).duplicate(),
+		"boss_kill_count": int(_save._data["meta"].get("boss_kill_count", 0)),
+		"adventure_total": int(_save._data["meta"].get("adventure_total", 0)),
+		"adventure_cleared": int(_save._data["meta"].get("adventure_cleared", 0)),
+		"vision_used": int(_save._data["meta"].get("vision_used", 0)),
+		"recent_summaries": (_save._data["meta"]["recent_summaries"] as Array).duplicate(true),
+		"first_adventure_done": bool(_save._data["meta"].get("first_adventure_done", true)),
+	}
+
+
+# 锻造域取数（本件内部单点）
+func _forge_domain() -> Dictionary:
+	return _save._data["meta"].get("forge_routes", {}) as Dictionary

game/core/minesweeper_rules.gd

@@ -304,15 +304,22 @@ func _do_dig(c: Vector2i) -> Dictionary:
 	if was_sealed:
 		_seals.erase(c)
 	var reveal_order: Array[Variant] = _chain_reveal_order(c, eff_seals)
+	_reveal_chain(c, reveal_order, was_sealed)
+	if action_economy.phase != action_economy.PHASE_ACTIVE:
+		_emit_round_end_seals_and_payload()
+	return _outcome(true, "executed", "", "")
+
+
+## 连锁揭示域：首格+连锁新格揭示（BFS 规范序——cell_revealed 发射序即链序，整体随段搬迁）。
+## 格面资源资格：chain/dig 恒 true——安全格与危险格一视同仁（危险格亦携带，
+## 负向兑付归 战斗结算 极性路由）；initial（封锁格）恒 false。资源本体与极性不在本系统。
+## dug_under_seal = 首格带封印直挖标记（战斗结算 情况④兑付改判消费；连锁格恒 false——连锁不越封印）
+func _reveal_chain(c: Vector2i, reveal_order: Array, was_sealed: bool) -> void:
 	for rc in reveal_order:
 		if _revealed.has(rc):
 			continue   # 闭包可穿过已开区——已开格零事件（cell_revealed × |O′ ∖ O|）
-		var is_mine := _board.is_mine(rc)
 		var channel := "dig" if rc == c else "chain"
-		# 格面资源资格：chain/dig 恒 true——安全格与危险格一视同仁（危险格亦携带，
-		# 负向兑付归 战斗结算 极性路由）；initial（封锁格）恒 false。资源本体与极性不在本系统。
-		# dug_under_seal = 首格带封印直挖标记（战斗结算 情况④兑付改判消费；连锁格恒 false——连锁不越封印）
-		if is_mine:
+		if _board.is_mine(rc):
 			_revealed[rc] = {"kind": "mine", "digit": -1}
 			cell_revealed.emit({
 				"cell": rc, "kind": "mine", "digit": -1,
@@ -326,9 +333,6 @@ func _do_dig(c: Vector2i) -> Dictionary:
 				"variant_ids": _board.variant_ids(rc), "channel": channel, "resource": true,
 				"dug_under_seal": was_sealed and rc == c,
 			})
-	if action_economy.phase != action_economy.PHASE_ACTIVE:
-		_emit_round_end_seals_and_payload()
-	return _outcome(true, "executed", "", "")
 
 
 func _board_face_dig(c: Vector2i) -> String:
@@ -492,7 +496,7 @@ func _emit_seals_batch() -> void:
 
 func _emit_round_end_seals_and_payload() -> void:
 	_emit_seals_batch()
-	var payload: Dictionary[Variant, Variant] = action_economy.last_round_end   # 逐字段取自 行动经济（读取权 = 接口契约）
+	var payload: Dictionary[Variant, Variant] = action_economy.last_round_end()   # 逐字段取自 行动经济（读取权 = 接口契约；属性→方法 K5）
 	round_end_board.emit({"path_tag": payload.get("path_tag", ""), "continuation_hint": payload.get("continuation_hint", "")})
 
 

game/core/node_map_generator.gd

@@ -66,6 +66,14 @@ func _setup_and_build(params: Dictionary, seed_val: int) -> Dictionary:
 
 ## 参数档可行性判定（执行边界③：参数无解＝配置错误）——域校验外加深度预算与战斗保底可放性。
 static func check_params(params: Dictionary) -> Array:
+	var errs: Array[Dictionary] = _cp_domain(params)
+	if not errs.is_empty():
+		return errs
+	return _cp_structural(params)
+
+
+## 域校验段：五旋钮值域／岔口去路数锁值／配比四类合计 1
+static func _cp_domain(params: Dictionary) -> Array[Dictionary]:
 	var errs: Array[Dictionary] = []
 	var L := int(params.get("layers", 0))
 	var e := int(params.get("exit_count", 0))
@@ -89,8 +97,16 @@ static func check_params(params: Dictionary) -> Array:
 		sum += float(params.get(rk, -1.0))
 	if not is_equal_approx(sum, 1.0):
 		errs.append({"category": "domain", "message": "配比四类合计 %f ≠ 1" % sum})
-	if not errs.is_empty():
-		return errs
+	return errs
+
+
+## 结构可行性段：主链段容量与战斗保底可放性（多出口按区域签名累加可放槽）
+static func _cp_structural(params: Dictionary) -> Array[Dictionary]:
+	var errs: Array[Dictionary] = []
+	var L := int(params.get("layers", 0))
+	var e := int(params.get("exit_count", 0))
+	var en := int(params.get("entry_count", 0))
+	var bf := int(params.get("battle_floor", -1))
 	var t := 0 if e == 1 else _trunk_len(L, e)
 	if e > 1 and t < 1:
 		errs.append({"category": "structural", "message": "层深 %d 与出口数 %d 无解（主链段放不下归属区域）" % [L, e]})
@@ -116,11 +132,33 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 		return errs
 	var by_id := {}
 	var indeg := {}
+	if not _vo_node_fields(nodes, errs, by_id, indeg):
+		return errs
+	if not _vo_edges(nodes, by_id, indeg, errs):
+		return errs
+	var flow := _vo_flow_facts(nodes, indeg, errs)
+	if not flow["ok"]:
+		return errs
+	if not _vo_depth_reach(nodes, by_id, flow["entries"], flow["terminals"], errs):
+		return errs
+	_vo_shop_counts(nodes, flow["terminals"], errs)
+	_vo_terminal_shops(nodes, flow["terminals"], errs)
+	if not _all_paths_one_shop(by_id, flow["entries"], flow["terminals"]):
+		errs.append({"category": "structural", "message": "存在入口→终点路径穿店数 ≠ 1（必经恰一店破）"})
+	_check_fork_rules(nodes, by_id, errs)
+	_vo_terminal_depths(flow["terminals"], by_id, errs)
+	_vo_width_rules(nodes, errs)
+	_vo_params_check(params, nodes, by_id, [flow["entries"], flow["terminals"]], errs)
+	return errs
+
+
+## 阶段一·节点字段域：字段齐备/句柄唯一/类型词表/深度非负（by_id/indeg 引用填充）
+func _vo_node_fields(nodes: Array, errs: Array, by_id: Dictionary, indeg: Dictionary) -> bool:
 	for n in nodes:
 		for k in ["id", "type", "depth", "next"]:
 			if not (n as Dictionary).has(k):
 				errs.append({"category": "structural", "message": "节点字段缺失: %s" % k})
-				return errs
+				return false
 		var id: int = int(n["id"])
 		if by_id.has(id):
 			errs.append({"category": "dup_key", "message": "节点句柄重复: %d" % id})
@@ -130,8 +168,11 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 		if int(n["depth"]) < 0:
 			errs.append({"category": "domain", "message": "节点深度为负: %d" % n["depth"]})
 		indeg[id] = 0
-	if not errs.is_empty():
-		return errs
+	return errs.is_empty()
+
+
+## 阶段二·边域：出边悬空与环/回边判据（indeg 引用累计）
+func _vo_edges(nodes: Array, by_id: Dictionary, indeg: Dictionary, errs: Array) -> bool:
 	for n in nodes:
 		for oid in (n["next"] as Array):
 			if not by_id.has(int(oid)):
@@ -141,9 +182,11 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 				errs.append({"category": "structural", "message": "连线未朝前进方向（目标深度 %d 不严格大于源 %d）——环/回边" % [
 					int(by_id[int(oid)]["depth"]), int(n["depth"])]})
 			indeg[int(oid)] = int(indeg[int(oid)]) + 1
-	if not errs.is_empty():
-		return errs
+	return errs.is_empty()
 
+
+## 阶段三·流事实域：入口集（入度 0）／终点集（无出边）与 Boss 终点判据、去路数形态
+func _vo_flow_facts(nodes: Array, indeg: Dictionary, errs: Array) -> Dictionary:
 	var entries := []
 	var terminals := []
 	for n in nodes:
@@ -159,11 +202,12 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 			errs.append({"category": "structural", "message": "Boss 节点带出边: %d" % id0})
 		elif outs.size() != 1 and not (outs.size() >= 2 and outs.size() <= 3):
 			errs.append({"category": "domain", "message": "节点 %d 去路数 %d 非〔恰一条或岔口 2–3〕" % [id0, outs.size()]})
-	if not errs.is_empty():
-		return errs
+	return {"entries": entries, "terminals": terminals, "ok": errs.is_empty()}
 
-	# 深度＝自入口最长路径步数（契约 2 赋值语义——出边严格前进的无环判据成立的前提）
-	var longest := _longest_paths(nodes, by_id, entries, indeg)
+
+## 阶段四·深度与可达域：深度＝自入口最长路径步数（契约 2）＋全节点可达某终点
+func _vo_depth_reach(nodes: Array, by_id: Dictionary, entries: Array, terminals: Array, errs: Array) -> bool:
+	var longest := _longest_paths(nodes, by_id, entries)
 	for n in nodes:
 		var id1: int = int(n["id"])
 		if int(n["depth"]) != int(longest.get(id1, -1)):
@@ -175,16 +219,21 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 	for n in nodes:
 		if not reaches.has(int(n["id"])):
 			errs.append({"category": "structural", "message": "节点 %d 不可达任何终点（断头/孤儿）" % n["id"]})
-	if not errs.is_empty():
-		return errs
+	return errs.is_empty()
 
-	# 摆放约束①：每终点前一位恰一店、商店总数＝终点数、终点前一层去路集合恰含一个终点
+
+## 摆放约束①前半·商店总数：商店总数＝终点数（商店数＝出口数已锁）
+func _vo_shop_counts(nodes: Array, terminals: Array, errs: Array) -> void:
 	var shop_count := 0
 	for n in nodes:
 		if String(n["type"]) == "shop":
 			shop_count += 1
 	if shop_count != terminals.size():
 		errs.append({"category": "structural", "message": "商店总数 %d ≠ 终点数 %d（商店数＝出口数已锁）" % [shop_count, terminals.size()]})
+
+
+## 摆放约束①后半·终点前驱：每终点前一位恰一店且为唯一前驱、终点前一层去路集合恰含一个终点
+func _vo_terminal_shops(nodes: Array, terminals: Array, errs: Array) -> void:
 	for tid in terminals:
 		var preds := []
 		for n in nodes:
@@ -204,16 +253,19 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 		if t_hits != 1:
 			errs.append({"category": "structural", "message": "终点 %d 前一层去路集合含终点 %d 个（归属锁定破）" % [tid, t_hits]})
 
-	if not _all_paths_one_shop(by_id, entries, terminals):
-		errs.append({"category": "structural", "message": "存在入口→终点路径穿店数 ≠ 1（必经恰一店破）"})
-	_check_fork_rules(nodes, by_id, errs)
 
+## 计数规则①·多终点深度互异（推论条款 A——定位信息只有两样）
+func _vo_terminal_depths(terminals: Array, by_id: Dictionary, errs: Array) -> void:
 	var tdepths := {}
 	for tid in terminals:
 		var dd: int = int(by_id[tid]["depth"])
 		if tdepths.has(dd):
 			errs.append({"category": "structural", "message": "多终点同深度 %d（推论条款 A 破——定位信息只有两样）" % dd})
 		tdepths[dd] = true
+
+
+## 计数规则②·宽度上限：同深度节点数 ≤ 分叉生长上限 4（禁平行层摆放）
+func _vo_width_rules(nodes: Array, errs: Array) -> void:
 	var per_depth := {}
 	for n in nodes:
 		var d2: int = int(n["depth"])
@@ -222,23 +274,28 @@ func validate_output(graph: Dictionary, params: Dictionary = {}) -> Array:
 		if int(per_depth[d3]) > MAX_WIDTH:
 			errs.append({"category": "structural", "message": "深度 %d 节点数 %d 超分叉生长上限 4（平行层摆放）" % [d3, per_depth[d3]]})
 
+
+## 计数规则③·参数档对照：战斗保底／入口数／终点数／层高（params 为空时跳过）
+func _vo_params_check(params: Dictionary, nodes: Array, by_id: Dictionary, flow_ends: Array, errs: Array) -> void:
+	var entries: Array = flow_ends[0]
+	var terminals: Array = flow_ends[1]
 	var battles := 0
 	for n in nodes:
 		if String(n["type"]) == "battle":
 			battles += 1
-	if not params.is_empty():
-		if battles < int(params.get("battle_floor", 0)):
-			errs.append({"category": "domain", "message": "战斗节点数 %d 低于保底 %d" % [battles, params.get("battle_floor", 0)]})
-		if entries.size() != int(params.get("entry_count", entries.size())):
-			errs.append({"category": "structural", "message": "入口数 %d ≠ 参数档 entry_count %d" % [entries.size(), params.get("entry_count", 0)]})
-		if terminals.size() != int(params.get("exit_count", terminals.size())):
-			errs.append({"category": "structural", "message": "终点数 %d ≠ 参数档 exit_count %d" % [terminals.size(), params.get("exit_count", 0)]})
-		var maxd := 0
-		for tid in terminals:
-			maxd = maxi(maxd, int(by_id[tid]["depth"]))
-		if maxd != int(params.get("layers", maxd)):
-			errs.append({"category": "domain", "message": "层高（最长路径步数）%d ≠ 参数档 layers %d" % [maxd, params.get("layers", 0)]})
-	return errs
+	if params.is_empty():
+		return
+	if battles < int(params.get("battle_floor", 0)):
+		errs.append({"category": "domain", "message": "战斗节点数 %d 低于保底 %d" % [battles, params.get("battle_floor", 0)]})
+	if entries.size() != int(params.get("entry_count", entries.size())):
+		errs.append({"category": "structural", "message": "入口数 %d ≠ 参数档 entry_count %d" % [entries.size(), params.get("entry_count", 0)]})
+	if terminals.size() != int(params.get("exit_count", terminals.size())):
+		errs.append({"category": "structural", "message": "终点数 %d ≠ 参数档 exit_count %d" % [terminals.size(), params.get("exit_count", 0)]})
+	var maxd := 0
+	for tid in terminals:
+		maxd = maxi(maxd, int(by_id[tid]["depth"]))
+	if maxd != int(params.get("layers", maxd)):
+		errs.append({"category": "domain", "message": "层高（最长路径步数）%d ≠ 参数档 layers %d" % [maxd, params.get("layers", 0)]})
 
 
 # ---- 构型（长图算法 HOW 归实现——D1:28；合法性由 validate_output 强制）----
@@ -252,28 +309,11 @@ func _build(rg: RandomNumberGenerator) -> Dictionary:
 	var entries: Array[int] = []
 	for i in range(en):
 		entries.append(_mk("battle", 0))
-	var prevs: Array[int] = entries.duplicate()
-	for d in range(1, t + 1):
-		var nid := _mk("battle", d)
-		for p in prevs:
-			(_by_id[p]["next"] as Array).append(nid)
-		prevs = [nid]
+	var prevs: Array = _build_trunk(t, entries.duplicate())
 
 	var terminals: Array[int] = []
 	for r in range(e):
-		var bdepth := L - r
-		var bid := _mk("boss", bdepth)
-		var sid := _mk("shop", bdepth - 1)
-		(_by_id[sid]["next"] as Array).append(bid)
-		var cur := sid
-		var sig := String(REGION_SIGNATURES[r]) if e > 1 else "battle"
-		for d in range(bdepth - 2, t, -1):
-			var fid := _mk(sig, d)
-			(_by_id[fid]["next"] as Array).append(cur)
-			cur = fid
-		terminals.append(bid)
-		for p in prevs:
-			(_by_id[p]["next"] as Array).append(cur)
+		_build_region(r, e, L, prevs, terminals)
 	# e>1 时 prevs 收束为主链段末节点一处 ⇒ 该节点即归属大岔口（各区域互不连达）；
 	# e==1 时 prevs 为入口数组，直接接单区域头（无大岔口——L1 出口恒 1）。
 
@@ -281,41 +321,61 @@ func _build(rg: RandomNumberGenerator) -> Dictionary:
 	_assign_types(rg, e)
 
 	var nodes: Array[Dictionary] = []
-	for n in _pool:
-		nodes.append(n)
+	nodes.assign(_pool)
 	return {"nodes": nodes, "entries": entries, "terminals": terminals}
 
 
+## 主链段（深度 1..t 逐层单链，主链段零 RNG）：返回链末节点集（e>1 时收束为一处即归属大岔口）
+func _build_trunk(t: int, prevs: Array) -> Array:
+	for d in range(1, t + 1):
+		var nid := _mk("battle", d)
+		for p in prevs:
+			(_by_id[p]["next"] as Array).append(nid)
+		prevs = [nid]
+	return prevs
+
+
+## 归属区域段（每出口一条支路：Boss 终点＋店＋签名填充链；区域段零 RNG）：
+## Boss 深度 = L−r、店在其前一位、签名链自店向主链段方向回铺，支路头接入 prevs（归属大岔口）
+func _build_region(r: int, e: int, L: int, prevs: Array, terminals: Array) -> void:
+	var t := 0 if e == 1 else _trunk_len(L, e)
+	var bdepth := L - r
+	var bid := _mk("boss", bdepth)
+	var sid := _mk("shop", bdepth - 1)
+	(_by_id[sid]["next"] as Array).append(bid)
+	var cur := sid
+	var sig := String(REGION_SIGNATURES[r]) if e > 1 else "battle"
+	for d in range(bdepth - 2, t, -1):
+		var fid := _mk(sig, d)
+		(_by_id[fid]["next"] as Array).append(cur)
+		cur = fid
+	terminals.append(bid)
+	for p in prevs:
+		(_by_id[p]["next"] as Array).append(cur)
+
+
 ## 岔口布置：主链段（深度 ≤ t-2）或单出口图链上（深度 ≤ L-3）的节点扩为 2–3 去路岔口；
 ## 侧支节点与主去路同深（保持「深度＝自入口最长路径步数」不变量），两支各自汇入主去路的后继，
 ## 于是支路互斥段＝{主去路节点} 与 {侧支节点}——两支类型互异即同时满足「下一跳互异」与「各有独有类型」。
 func _add_forks(rg: RandomNumberGenerator, L: int, t: int, e: int) -> void:
 	var wanted := clampi(int(round(float(_params["branch_density"]) * float(L))), 1, 24)
-	var anchors := []
-	for n in _pool:
-		if int(n["depth"]) > (t - 2 if e > 1 else L - 3):
-			continue
-		if (n["next"] as Array).size() != 1:
-			continue
-		anchors.append(n)
+	var anchors := _collect_fork_anchors(L, t, e)
 	anchors = _shuffle(rg, anchors)
 	var selected := {}      # 已扩岔节点 id
 	var succ_selected := {}   # 已扩岔节点的主去路 id（禁再作锚点）
 	for a in anchors:
 		if wanted <= 0:
 			break
-		var node = a
-		var nid := int(node["id"])
-		if (node["next"] as Array).size() != 1:
+		var nid := int(a["id"])
+		if (a["next"] as Array).size() != 1:
 			continue   # 同一节点不重复扩岔（去路数上限 3）
-		var v = _by_id[int((node["next"] as Array)[0])]
+		var v = _by_id[int((a["next"] as Array)[0])]
 		var vid := int(v["id"])
 		# 相邻两层不得同时扩岔：若主去路 v 也是岔口，v 的侧支会落进本岔口主支路的互斥段，
 		# 使侧支自己的类型不再独有（契约 5③）——两个方向都要拦。
 		if selected.has(vid) or succ_selected.has(nid):
 			continue
-		var v_outs = v["next"]
-		if v_outs.is_empty():
+		if (v["next"] as Array).is_empty():
 			continue   # 主去路无后继（无可汇入点）——该锚点弃用
 		var extra := 2 if (int(_params["fork_ways_max"]) >= 3 and rg.randf() < 0.35) else 1
 		var made := 0
@@ -323,8 +383,8 @@ func _add_forks(rg: RandomNumberGenerator, L: int, t: int, e: int) -> void:
 			if _depth_count(int(v["depth"])) >= MAX_WIDTH:
 				break
 			var wid := _mk("battle", int(v["depth"]))
-			(node["next"] as Array).append(wid)
-			(_by_id[wid]["next"] as Array).append(int(v_outs[0]))
+			(a["next"] as Array).append(wid)
+			(_by_id[wid]["next"] as Array).append(int((v["next"] as Array)[0]))
 			_detour_heads.append(_by_id[wid])
 			_detour_ids[wid] = true
 			made += 1
@@ -334,6 +394,18 @@ func _add_forks(rg: RandomNumberGenerator, L: int, t: int, e: int) -> void:
 			wanted -= 1
 
 
+## 锚收集段（零 RNG）：主链段（深度 ≤ t-2）或单出口图链上（深度 ≤ L-3）的去路恰一节点
+func _collect_fork_anchors(L: int, t: int, e: int) -> Array:
+	var anchors := []
+	for n in _pool:
+		if int(n["depth"]) > (t - 2 if e > 1 else L - 3):
+			continue
+		if (n["next"] as Array).size() != 1:
+			continue
+		anchors.append(n)
+	return anchors
+
+
 # 确定性洗牌（Fisher-Yates，取数只经注入的纯流 RNG——Array.shuffle() 走引擎全局随机、
 # 破「同（种子,参数档）⇒ 同图」的纯函数复现前提，禁用于生成器）
 func _shuffle(rg: RandomNumberGenerator, arr: Array) -> Array:
@@ -358,31 +430,42 @@ func _depth_count(d: int) -> int:
 ## 单出口图的配比填余（摆放优先、配比填余、战斗保底兜底——§8.1 次序），再统一修岔口下一跳互异。
 func _assign_types(rg: RandomNumberGenerator, e: int) -> void:
 	if e == 1:
-		var free: Array[Dictionary] = []
-		var chain_battles := 0
-		for n in _pool:
-			if String(n["type"]) == "shop" or String(n["type"]) == "boss":
-				continue
-			if _detour_ids.has(int(n["id"])):
-				continue   # 侧链节点类型由岔口互异修型决定，不占配比填余面
-			if int(n["depth"]) == 1:
-				continue   # 区域首节点留战斗——配比填余不破坏岔口下一跳互异的基准形
-			if String(n["type"]) == "battle":
-				chain_battles += 1
-			free.append(n)
-		free = _shuffle(rg, free)
-		var want := int(round(float(_pool.size()) * (float(_params["reward_ratio"]) + float(_params["rest_ratio"]))))
-		var floor_n := int(_params["battle_floor"])
-		var rest_first := rg.randf() < 0.5
-		for i in range(want):
-			if i >= free.size():
-				break
-			# 战斗保底优先：链上战斗数降到保底下限即停（侧链修型可能再让出战斗位，故保底只看链上）
-			if chain_battles - 1 < floor_n:
-				break
-			var node = free[i]
-			node["type"] = "rest" if ((i % 2 == 0) == rest_first) else "reward"
-			chain_battles -= 1
+		_fill_ratios(rg)
+	_fix_detour_heads()
+
+
+## 配比填余段（单出口图；shuffle+randf 取号序整体搬迁——战斗保底优先、侧链不占填余面）：
+## 摆放优先、配比填余、战斗保底兜底——§8.1 次序
+func _fill_ratios(rg: RandomNumberGenerator) -> void:
+	var free: Array[Dictionary] = []
+	var chain_battles := 0
+	for n in _pool:
+		if String(n["type"]) == "shop" or String(n["type"]) == "boss":
+			continue
+		if _detour_ids.has(int(n["id"])):
+			continue   # 侧链节点类型由岔口互异修型决定，不占配比填余面
+		if int(n["depth"]) == 1:
+			continue   # 区域首节点留战斗——配比填余不破坏岔口下一跳互异的基准形
+		if String(n["type"]) == "battle":
+			chain_battles += 1
+		free.append(n)
+	free = _shuffle(rg, free)
+	var want := int(round(float(_pool.size()) * (float(_params["reward_ratio"]) + float(_params["rest_ratio"]))))
+	var floor_n := int(_params["battle_floor"])
+	var rest_first := rg.randf() < 0.5
+	for i in range(want):
+		if i >= free.size():
+			break
+		# 战斗保底优先：链上战斗数降到保底下限即停（侧链修型可能再让出战斗位，故保底只看链上）
+		if chain_battles - 1 < floor_n:
+			break
+		var node = free[i]
+		node["type"] = "rest" if ((i % 2 == 0) == rest_first) else "reward"
+		chain_battles -= 1
+
+
+## 岔口修型段（零 RNG）：侧链首节点类型取岔口各去路下一节点类型的补集首件——下一跳互异承面
+func _fix_detour_heads() -> void:
 	for head in _detour_heads:
 		var h = head
 		var fork = null
@@ -416,12 +499,15 @@ static func _trunk_len(L: int, e: int) -> int:
 
 # ---- 自证辅助 ----
 
-func _longest_paths(nodes: Array, by_id: Dictionary, entries: Array, indeg: Dictionary) -> Dictionary:
+func _longest_paths(nodes: Array, by_id: Dictionary, entries: Array) -> Dictionary:
 	var out := {}
 	var din := {}
 	var q := []
-	for id in indeg:
-		din[int(id)] = int(indeg[int(id)])
+	for n in nodes:
+		din[int(n["id"])] = 0
+	for n in nodes:
+		for oid in (n["next"] as Array):
+			din[int(oid)] = int(din[int(oid)]) + 1
 	for eid in entries:
 		out[int(eid)] = 0
 		q.append(int(eid))
@@ -476,44 +562,53 @@ func _check_fork_rules(nodes: Array, by_id: Dictionary, errs: Array) -> void:
 			if head_types.has(ty):
 				errs.append({"category": "structural", "message": "岔口 %d 各去路下一节点类型重复: %s" % [n["id"], ty]})
 			head_types[ty] = true
-		var reach_sets := []
-		for oid in outs:
-			reach_sets.append(_descendants(int(oid), by_id))
-		var comps := []
-		for i in range(reach_sets.size()):
-			var excl := {}
-			for rid in reach_sets[i]:
-				var shared := false
-				for j in range(reach_sets.size()):
-					if j != i and reach_sets[j].has(rid):
-						shared = true
-						break
-				if not shared:
-					excl[int(rid)] = String(by_id[int(rid)]["type"])
-			var arr := []
-			for v in excl.values():
-				arr.append(v)
-			arr.sort()
-			comps.append(arr)
+		var comps := _fork_signatures(outs, by_id)
 		for i in range(comps.size()):
 			for j in range(i + 1, comps.size()):
 				if comps[i] == comps[j]:
 					errs.append({"category": "structural", "message": "岔口 %d 支路 %d/%d 类型构成相同" % [n["id"], i, j]})
 		for i in range(comps.size()):
-			var uniq := false
-			for ty in comps[i]:
-				var in_other := false
-				for j in range(comps.size()):
-					if j != i and (comps[j] as Array).has(ty):
-						in_other = true
-						break
-				if not in_other:
-					uniq = true
-					break
-			if not uniq:
+			if not _fork_has_unique(comps, i):
 				errs.append({"category": "structural", "message": "岔口 %d 支路 %d 无独有类型" % [n["id"], i]})
 
 
+## 支路签名构造：各去路的独占后代类型集（他人不可达的后代类型，排序数组——支路互斥段签名）
+func _fork_signatures(outs: Array, by_id: Dictionary) -> Array:
+	var reach_sets := []
+	for oid in outs:
+		reach_sets.append(_descendants(int(oid), by_id))
+	var comps := []
+	for i in range(reach_sets.size()):
+		var excl := {}
+		for rid in reach_sets[i]:
+			var shared := false
+			for j in range(reach_sets.size()):
+				if j != i and reach_sets[j].has(rid):
+					shared = true
+					break
+			if not shared:
+				excl[int(rid)] = String(by_id[int(rid)]["type"])
+		var arr := []
+		for v in excl.values():
+			arr.append(v)
+		arr.sort()
+		comps.append(arr)
+	return comps
+
+
+## 独有类型判定：支路 i 的签名中存在他支路不含的类型
+func _fork_has_unique(comps: Array, i: int) -> bool:
+	for ty in comps[i]:
+		var in_other := false
+		for j in range(comps.size()):
+			if j != i and (comps[j] as Array).has(ty):
+				in_other = true
+				break
+		if not in_other:
+			return true
+	return false
+
+
 func _descendants(start: int, by_id: Dictionary) -> Dictionary:
 	var out := {start: true}
 	var q := [start]

game/core/refresh_bank.gd

@@ -81,8 +81,8 @@ func reset_paid() -> void:
 
 # 本次 GP 付费刷新价（与商店货架刷新同源：ceil(基价 × 曲线^本次停点已付费刷)）
 func gp_cost() -> int:
-	return int(ceil(float(db.adventure.shop_refresh_cost_base)
-		* pow(db.adventure.shop_refresh_cost_curve, float(_paid_refreshes))))
+	return int(ceil(float(db.run.adventure.shop_refresh_cost_base)
+		* pow(db.run.adventure.shop_refresh_cost_curve, float(_paid_refreshes))))
 
 
 # 冒险级复位（宿主 reset_adventure_state 调用——刷新三源与付费计数全零）

game/core/reward_economy.gd

@@ -40,18 +40,8 @@ func roll_board(eligible: Array) -> bool:
 	if eligible.is_empty():
 		_fatal("roll_board 空资格清单（E1 兜底 fail-fast——排雷玩法 不变式④前置）")
 		return false
-	# 行主序规范化 + 去重（排序责任不外推给 战斗结算；排序键单点 BoardData.row_major_key）
-	var seen := {}
-	var list: Array[Dictionary] = []
-	for e in eligible:
-		var c: Vector2i = e.cell
-		if seen.has(c):
-			push_warning("[地图战斗资源] 资格清单重复格已去重: %s" % str(c))
-			continue
-		seen[c] = true
-		list.append({"cell": c})
-	list.sort_custom(func(a, b): return BoardData.row_major_key(a.cell) < BoardData.row_major_key(b.cell))
-	_eligible = list
+	_eligible = _normalize_eligible(eligible)
+	var list: Array[Dictionary] = _eligible
 	_granted.clear()          # 新批重置映射受理面（旧图快照消亡）
 	_power_roll.clear()
 	_clear_power = -1
@@ -85,6 +75,21 @@ func roll_board(eligible: Array) -> bool:
 	return true
 
 
+## 资格清单规范化域（开流前——零 RNG）：行主序 + 去重（排序责任不外推给 战斗结算；排序键单点 BoardData.row_major_key）
+func _normalize_eligible(eligible: Array) -> Array[Dictionary]:
+	var seen := {}
+	var list: Array[Dictionary] = []
+	for e in eligible:
+		var c: Vector2i = e.cell
+		if seen.has(c):
+			push_warning("[地图战斗资源] 资格清单重复格已去重: %s" % str(c))
+			continue
+		seen[c] = true
+		list.append({"cell": c})
+	list.sort_custom(func(a, b): return BoardData.row_major_key(a.cell) < BoardData.row_major_key(b.cell))
+	return list
+
+
 # ---- 查询面（Ready 只读；未开格恒可查——秘宝 桥接结构前提）----
 
 # 相位只读出口（诊断观测面——unrolled/ready/retired；消费方禁直读 _phase 下划线字段）
@@ -167,7 +172,7 @@ func retire_mapping() -> bool:
 # ---- 极性路由字典面（战斗结算 授予段消费）：（类型, 极性）→ 格面池字典行（拷贝出口）----
 
 func polarity_row(cell_type: String, polarity: String) -> Dictionary:
-	for row in db.reward.rows:
+	for row in db.run.reward.rows:
 		if String(row.get("pool_tag", "")) == "cell" \
 				and String(row.get("cell_type", "")) == cell_type \
 				and String(row.get("polarity", "")) == polarity:
@@ -217,6 +222,20 @@ func _skewed_cell_rows() -> Array:
 	if board_skew <= 0:
 		return _rollable_rows()
 	var base: Array[Variant] = _rollable_rows()
+	var families := _skew_families(base)
+	if families["down"].is_empty() or families["up"].is_empty():
+		return base   # 结构缺族 = 无偏斜作用面（保守直通——池结构变更须走表加载校验另批）
+	# 下调总量 = round_half_up(Σ生存×v/100)；逐行精确份额 w×v/100 最大余数取整（行序平局）
+	var drops := _largest_remainder_split(families["down"], board_skew, 100, (2 * _pool_weight(families["down"]) * board_skew + 100) / 200)
+	# 上浮总量 = 下调总量（守恒），逐行精确份额 drop×w/Σ进攻 最大余数取整
+	var gains := _largest_remainder_split(families["up"], drops_total(drops), _pool_weight(families["up"]), drops_total(drops))
+	var out := _apply_skew(base, families["down"], families["up"], drops, gains)
+	assert(_pool_weight(out) == _pool_weight(base), "图级偏斜守恒破（偏斜后合计须等于原池）")
+	return out
+
+
+## 分族域：生存下调族与进攻上浮族行集拆分（池结构不变式零触碰）
+func _skew_families(base: Array) -> Dictionary:
 	var down: Array[Variant] = []
 	var up: Array[Variant] = []
 	for row in base:
@@ -225,13 +244,11 @@ func _skewed_cell_rows() -> Array:
 			down.append(row)
 		elif SKEW_UP_KINDS.has(k):
 			up.append(row)
-	if down.is_empty() or up.is_empty():
-		return base   # 结构缺族 = 无偏斜作用面（保守直通——池结构变更须走表加载校验另批）
-	var v := board_skew
-	# 下调总量 = round_half_up(Σ生存×v/100)；逐行精确份额 w×v/100 最大余数取整（行序平局）
-	var drops := _largest_remainder_split(down, v, 100, (2 * _pool_weight(down) * v + 100) / 200)
-	# 上浮总量 = 下调总量（守恒），逐行精确份额 drop×w/Σ进攻 最大余数取整
-	var gains := _largest_remainder_split(up, drops_total(drops), _pool_weight(up), drops_total(drops))
+	return {"down": down, "up": up}
+
+
+## 权重装配域：逐行精确份额增减（下调族扣 drops、上浮族加 gains——守恒 assert 随段迁移）
+func _apply_skew(base: Array, down: Array, up: Array, drops: Array, gains: Array) -> Array:
 	var di := 0
 	var ui := 0
 	var out: Array[Variant] = []
@@ -248,7 +265,6 @@ func _skewed_cell_rows() -> Array:
 		var skewed: Dictionary[Variant, Variant] = row.duplicate()
 		skewed["weight"] = w
 		out.append(skewed)
-	assert(_pool_weight(out) == _pool_weight(base), "图级偏斜守恒破（偏斜后合计须等于原池）")
 	return out
 
 
@@ -309,7 +325,7 @@ func set_treasure_unlocked(ids: Dictionary) -> void:
 func _rollable_rows() -> Array:
 	# 摇号池 = cell 池正向行 weight>0（负向行纯字典不消费权重；封锁格不在本函数职责域——清单由调用方裁剪）
 	var out: Array[Dictionary] = []
-	for row in db.reward.rows:
+	for row in db.run.reward.rows:
 		if String(row.get("cell_type", "")) == RewardTable.TREASURE_ITEM_TYPE:
 			var iid := String(row.get("effect_id", ""))
 			if iid == "" or not _treasure_unlocked.has(iid):
@@ -321,7 +337,7 @@ func _rollable_rows() -> Array:
 
 func _pool_rows(pool_tag: String) -> Array:
 	var out: Array[Dictionary] = []
-	for row in db.reward.rows:
+	for row in db.run.reward.rows:
 		if row.pool_tag == pool_tag and int(row.weight) > 0:
 			out.append(row)
 	return out
@@ -335,7 +351,7 @@ func _pool_weight(rows: Array) -> int:
 
 
 func _row_by_id(rid: String) -> Dictionary:
-	for row in db.reward.rows:
+	for row in db.run.reward.rows:
 		if row.reward_id == rid:
 			return row
 	return {}

game/core/reward_grant.gd

@@ -120,7 +120,7 @@ func _charge_gate(v: Dictionary, target: Vector2i) -> Dictionary:
 	for h in tu_hits:
 		if String(h.get("kind", "")) == "counter_spend":
 			if not EffectEngine.counter_spend(fx_host.counters_ctx, String(h.get("counter_id", "")), int(h.get("value", 1))):
-				var vrow: Dictionary[Variant, Variant] = db.treasure_item_row(String(v.item_id))
+				var vrow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(String(v.item_id))
 				var cn_info: int = int(vrow.get("charge_n", 0))   # 读受理行自身
 				var seen := int(attune_safe_seen_cb.call())
 				return {"ok": false, "reason": "%s：安全格积点未达（%d/%d）" % [String(vrow.get("display_name", "")), seen % cn_info if cn_info > 0 else 0, cn_info]}
@@ -199,8 +199,8 @@ func grant_routed(snap: Dictionary, polarity: String, att: Dictionary) -> bool:
 		# premium_pct 贯穿 _apply_percent_row 应用与呈现同乘）——标空/挖格/清图不乘，雷安同池冻结不动。
 		# 取整=四舍五入（与伤害管线 round_direction=floor 分域——registry clause3_inequality 登记；
 		# 1 点量纲行 ac_up/action 取整后不变=整数粒度地板）。
-		if source_class == "seal_hit" and int(db.settlement.core.seal_hit_premium) != 100:
-			var prem_pct: int = int(db.settlement.core.seal_hit_premium)
+		if source_class == "seal_hit" and int(db.combat.settlement.core.seal_hit_premium) != 100:
+			var prem_pct: int = int(db.combat.settlement.core.seal_hit_premium)
 			row = row.duplicate()
 			row["power"] = int(round(int(row.power) * prem_pct / 100.0))
 			row["premium_pct"] = prem_pct
@@ -229,7 +229,7 @@ func _apply_percent_row(row: Dictionary, att: Dictionary) -> bool:
 	var eff := String(row.effect_id)
 	if eff == "gp_gain" or eff == "gp_loss":
 		return _apply_gp_row(row, att)
-	var srow: Dictionary[Variant, Variant] = db.status_effect_row(eff)
+	var srow: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(eff)
 	# 封印溢价贯穿（仅封印命中正向行携带 premium_pct；其余授予路径缺省 100 零扰动）：
 	# 应用幅度与呈现行值同乘，容器经 magnitude_override 拿同一快照（抗表重载口径保持）。
 	var prem_pct: int = int(row.get("premium_pct", 100))

game/core/save_manager.gd

@@ -4,6 +4,8 @@
 ## 禁 preload/import 任何玩法脚本、禁碰 ConfigDB/RngService——须可独立实例化独立验证。
 ## 新增存档键先在序列化函数登记并升版本号；键域内容口径归各 GDD 文档，本类照单承载。
 ## 存档键清单的事实源=本类序列化/读回代码，不在任何文档维护第二份键清单。
+## 拆件形态（D3 存档域）：槽位文件域归 SlotStore（slots）、存档内元进度数据读写归 MetaStateStore
+## （meta_state）——本类留磁盘 IO＋版本迁移链＋断点域＋门面装配，消费方经 save.slots / save.meta_state 直连。
 class_name SaveManagerCore
 extends Node
 
@@ -18,18 +20,18 @@ const SLOT_PATH_TEMPLATE := "user://save_slot_%d.json"   # 槽文件名唯一派
 const LEGACY_SAVE_PATH := "user://save.json"             # 旧隐式单档路径（Q1 甲：首次启动一次性字节迁入槽 1，此后无任何隐式读写）
 const LEGACY_MIGRATED_SUFFIX := ".migrated.bak"          # 迁移后旧档改名留痕后缀（字节级留盘不删——处置留痕）
 
-var _path: String                 # 当前写盘目标=激活槽文件（或 attach_path 注入路径）；""=无激活态——一切写盘路径拒绝
-var _active_slot := 0             # 激活槽号 1..SLOT_COUNT；0=无激活态（注入非槽派生名路径时亦 0——写盘判定以 _path 非空为准）
 var _read_only := false           # 高版本拒读置位——write_to_disk 一律拒绝（契约 4 禁写）
 var _data: Dictionary[String, Variant] = {}        # 内存数据模型（_init 即内置默认；load 后为档案内容）
 var _migrations: Dictionary[int, Callable] = {}    # from_version → Callable(data)->data（升一版；v1→v6 生产迁移链现行——_init 自注册）
-var _slot_template := SLOT_PATH_TEMPLATE           # 槽文件名模板（生产=常量；测试经 attach_slot_template 注入隔离命名空间，禁在呈现层/探针各自拼槽名）
+var slots: SlotStore              # 槽位文件域件（槽位挂载与模板/激活与建删/摘要窥视——架构 :89）
+var meta_state: MetaStateStore    # 存档内元进度数据读写唯一层（写口原语＋只读投影——架构 :90）
+var _migration_fail_reason := ""  # 迁移循环失败原因带出（_peek_migrated 返 null 时 load 侧落 corrupt 兜底文案单点）
 
 
 func _init(path: String = "") -> void:
-	_path = path
-	_active_slot = _slot_index_of(path)
 	_data = _default_data()
+	slots = SlotStore.new(self, path)
+	meta_state = MetaStateStore.new(self)
 	# 生产迁移链自注册（v2 起——测试钩 register_migration 仍可叠挂更早版本步骤）
 	register_migration(1, _migrate_v1_v2)
 	register_migration(2, _migrate_v2_v3)
@@ -43,176 +45,103 @@ func _init(path: String = "") -> void:
 # 类名加 Core 后缀、autoload 占净名）。独立 .new() 实例（单测/工具）不入树零 _ready，
 # 读盘仍由调用方显式触发。
 # 启动态钉死（卡① sv2）：autoload 启动不读任何槽——内存=默认合法空态（_init 置好）、
-# 无激活态（_path=""，一切写盘路径拒绝并返回 false）；玩家侧经选档界面显式进档/新档后才可写。
+# 无激活态（注入路径空，一切写盘路径拒绝并返回 false）；玩家侧经选档界面显式进档/新档后才可写。
 # 旧隐式单档一次性迁入槽 1（Q1 甲，sv12）在本口执行。
 func _ready() -> void:
-	_migrate_legacy_save(LEGACY_SAVE_PATH, slot_path(1), LEGACY_SAVE_PATH + LEGACY_MIGRATED_SUFFIX)
+	slots._migrate_legacy_save(LEGACY_SAVE_PATH, slots.slot_path(1), LEGACY_SAVE_PATH + LEGACY_MIGRATED_SUFFIX)
 
 
-# 原地重置（探针隔离面，仿 RngService.set_master_seed 单例原地重置：
-# 换路径+回默认数据+重读盘；对象引用恒定，MetaProgression 持有的 save 引用零失效）。
-# 三槽化后单路径语义（契约 7）＝注入路径即激活槽文件（写盘落该路径、无激活态时注入即激活）；
-# 注入槽派生名时激活号同步记账，注入任意隔离路径时激活号 0（写盘仍合法——隔离面行为零变化）。
-func attach_path(path: String) -> void:
-	_path = path
+# 迁移注册口：from_version → from_version+1 的升级函数（读档时链式调用）。fn 契约：
+# Dictionary → Dictionary，须写回 version = from_version + 1。生产迁移链现行（v1→v6，_init 自注册），
+# 冒烟经本口验证链式升级。
+func register_migration(from_version: int, fn: Callable) -> void:
+	_migrations[from_version] = fn
+
+
+# ---- 读盘（进档/注入时调用；启动态不读——_ready 已钉死不隐式激活）----
+# 返回 true = 已就绪可用（含新档/损坏兜底/迁移成功）；false = 高版本拒读（默认数据运行、禁写盘）。
+# 损坏兜底：原文件改名 <path>.corrupt.bak（已存在则覆盖）+ push_warning + 默认数据继续——不静默丢档。
+func load_from_disk() -> bool:
 	_read_only = false
-	_active_slot = _slot_index_of(path)
-	_data = _default_data()
-	load_from_disk()
-
-
-# 测试隔离注入口（契约 7 同源——槽文件名模板整体换注，探针/单测经此隔离到自命名空间，
-# 禁各自拼槽文件名；换注后回无激活态，槽原语全部落注入命名空间）
-func attach_slot_template(template: String) -> void:
-	_slot_template = template
-	_path = ""
-	_active_slot = 0
-	_read_only = false
-	_data = _default_data()
-
-
-# ---- 三存档位承载（卡①：隐式单档 → 3 存档位；位数与文件名口径=SLOT_COUNT/SLOT_PATH_TEMPLATE）----
-
-# 槽文件路径唯一派生口（模板单点——禁第二处拼名）
-func slot_path(slot: int) -> String:
-	return _slot_template % slot
-
-
-# 激活槽号查询（0 = 无激活态——启动态钉死后 boot 需经选档显式进档/新档，卡③ Q1 甲）
-func active_slot() -> int:
-	return _active_slot
-
-
-# 写盘目标在位与否（激活槽或注入路径任一；无激活态一切写盘路径拒绝——sv3 判定口）
-func has_write_target() -> bool:
-	return _path != ""
-
-
-# 进档原语（sv5，契约 6/8）：激活槽 N＋读盘，复用 load_from_disk 迁移/兜底链按槽成立。
-# 高版本拒读槽：激活不成立、恢复切换前三态（路径/激活号/禁写位/数据）——防误写他槽；
-# 损坏槽：兜底链接管（.corrupt.bak 改名＋空态继续，激活成立）。
-func activate_slot(slot: int) -> bool:
-	if slot < 1 or slot > SLOT_COUNT:
-		return false
-	var prev_path := _path
-	var prev_slot := _active_slot
-	var prev_ro := _read_only
-	var prev_data := _data
-	_path = slot_path(slot)
-	_active_slot = slot
-	_read_only = false
-	_data = _default_data()
-	if not load_from_disk():
-		_path = prev_path
-		_active_slot = prev_slot
-		_read_only = prev_ro
-		_data = prev_data
-		return false
-	return true
-
-
-# 新档原语（sv4）：空槽创建=合法白板态（_default_data 全零可玩纪律），创建即激活并落盘。
-# 生产路径只在空槽调用（有档槽开新局=先删档回空再新档，卡③ 契约 4）；写盘失败回退切换前三态。
-func create_slot(slot: int) -> bool:
-	if slot < 1 or slot > SLOT_COUNT:
-		return false
-	var prev_path := _path
-	var prev_slot := _active_slot
-	var prev_ro := _read_only
-	var prev_data := _data
-	_path = slot_path(slot)
-	_active_slot = slot
-	_read_only = false
-	_data = _default_data()
-	if not write_to_disk():
-		_path = prev_path
-		_active_slot = prev_slot
-		_read_only = prev_ro
-		_data = prev_data
-		return false
-	return true
-
-
-# 删档原语（sv6，契约 8）：该槽文件删除＋盘面即时生效（卡内工程规定，挪用现役断点覆盖流语义）
-# ＋无 .tmp 残留；删激活槽时激活指针连清除（内存回默认空态，该槽不再可写——激活态生命周期终点）。
-# .corrupt.bak 损坏备份不追删（用户数据留盘可考；同槽再损坏时兜底流按槽覆盖同名备份）。
-# 删不存在文件的空槽=幂等成功；越界槽号拒绝。
-func delete_slot(slot: int) -> bool:
-	if slot < 1 or slot > SLOT_COUNT:
-		return false
-	var p := slot_path(slot)
-	if FileAccess.file_exists(p) and not _remove_file(p):
-		push_error("[存档序列化] 删档失败（文件删除被拒）：%s" % p)
-		return false
-	var tmp := p + ".tmp"
-	if FileAccess.file_exists(tmp):
-		_remove_file(tmp)   # 残留清偿尽力而为（主文件已删即达成空槽语义）
-	if _active_slot == slot:
-		_path = ""
-		_active_slot = 0
-		_data = _default_data()
-	return true
-
-
-# 摘要三项按槽窥视读器（sv7/sv8，契约 5/9）：钥石余额/冒险成功局数/冒险总局数。
-# 只读零副作用：不激活、不写盘、不触发 _corrupt_fallback 改名（.corrupt.bak 只在正式进档路径产生）。
-# 返回 {"readable", "has_file", "keystone", "cleared", "total"}——readable=true=可读槽（空槽=零值合法态，
-# .tmp 残留按空槽——主文件不在即空）；readable=false=不可读槽（损坏/高版本/缺版本字段/打开失败，
-# 三值无意义——卡③ Q2 裁甲：UI 按空槽呈现，进档时走正式 load 兜底/拒读链）；
-# has_file=主文件在盘与否（空/有档操作集二分判定来处——卡③ T0 对齐结论；非摘要第四项，零 UI 语义）。
-# 迁移链在此只读推演（生产迁移 Callable 为纯函数，零盘面副作用）。
-func peek_slot_summary(slot: int) -> Dictionary:
-	if slot < 1 or slot > SLOT_COUNT:
-		return {"readable": false, "has_file": false, "keystone": 0, "cleared": 0, "total": 0}   # 越界=非槽位，非空槽
-	return _peek_summary_at(slot_path(slot))
-
-
-# 窥视注入口（契约 7 隔离面同款——测试/探针经路径注入隔离，禁各自拼槽文件名）
-func peek_summary_at(path: String) -> Dictionary:
-	return _peek_summary_at(path)
-
-
-func _peek_summary_at(path: String) -> Dictionary:
-	var out := {"readable": false, "has_file": false, "keystone": 0, "cleared": 0, "total": 0}
-	if not FileAccess.file_exists(path):
-		out["readable"] = true   # 空槽=可读零值合法态
-		return out
-	out["has_file"] = true   # 主文件在盘（可读性与占档判定分离——白板档与空槽自此可区分）
-	var f := FileAccess.open(path, FileAccess.READ)
+	if not FileAccess.file_exists(slots._path):
+		_data = _default_data()   # 新档合法态
+		return true
+	var f := FileAccess.open(slots._path, FileAccess.READ)
 	if f == null:
-		return out
+		return _corrupt_fallback("读打开失败（%s）" % error_string(FileAccess.get_open_error()))
+	return _load_parsed(f)
+
+
+## 读盘解析域（load_from_disk 主体段提取——解析/版本/迁移/规整；corrupt_fallback 调用点随段迁移，副作用序逐字）
+func _load_parsed(f: FileAccess) -> bool:
 	var text := f.get_as_text()
 	f.close()
 	var parsed = JSON.parse_string(text)
-	if typeof(parsed) != TYPE_DICTIONARY or not parsed.has("version"):
-		return out
+	if typeof(parsed) != TYPE_DICTIONARY:
+		return _corrupt_fallback("JSON 解析失败或顶层结构出域（非对象）")
+	if not parsed.has("version"):
+		return _corrupt_fallback("缺版本字段")
 	var v := int(parsed["version"])
 	if v > SAVE_FORMAT_VERSION:
-		return out
-	while v < SAVE_FORMAT_VERSION:
-		if not _migrations.has(v):
-			return out
-		var stepped = _migrations[v].call(parsed)
-		if typeof(stepped) != TYPE_DICTIONARY:
-			return out
-		parsed = stepped
-		v = int(parsed.get("version", v + 1))
-	var norm := _normalize(parsed)
-	out["readable"] = true
-	out["keystone"] = int(norm["meta"].get("keystone_balance", 0))
-	out["cleared"] = int(norm["meta"].get("adventure_cleared", 0))
-	out["total"] = int(norm["meta"].get("adventure_total", 0))
-	return out
+		_read_only = true
+		_data = _default_data()
+		push_error("[存档序列化] 档案版本 %d 高于当前 %d——拒读禁写（保护未来档不被覆写，内存默认新档运行）" % [v, SAVE_FORMAT_VERSION])
+		return false
+	var fail := []
+	var migrated = _peek_migrated(parsed, fail)
+	if migrated == null:
+		return _corrupt_fallback(fail[0])
+	_data = _normalize(migrated)
+	# 老档迁移（关卡节点图生成 v0.4 布尔位——缺字段 = 已有游玩史，不重放教学脚本）
+	if not _data["meta"].has("first_adventure_done"):
+		_data["meta"]["first_adventure_done"] = true
+	return true
 
 
-# 注入路径的槽号反查（命中槽派生名返回槽号，否则 0——激活号记账用，写盘判定以 _path 非空为准）
-func _slot_index_of(path: String) -> int:
-	for i in range(1, SLOT_COUNT + 1):
-		if path == slot_path(i):
-			return i
-	return 0
+# ---- 写盘（tmp + rename 原子写——写一半断电不留烂档）----
+# 无激活态一律拒绝并返回 false（sv3：启动态不隐式激活，盘面零触碰）；
+# 高版本拒读态一律拒绝（契约 4 禁写）；写失败返回 false。
+func write_to_disk() -> bool:
+	if slots._path == "":
+		push_error("[存档序列化] 写盘拒绝——无激活存档位（启动态不隐式激活；经选档进档/新档后落盘）")
+		return false
+	if _read_only:
+		push_error("[存档序列化] 写盘拒绝——档案版本高于当前（拒读禁写态）")
+		return false
+	var tmp := slots._path + ".tmp"
+	var f := FileAccess.open(tmp, FileAccess.WRITE)
+	if f == null:
+		push_error("[存档序列化] 临时文件打开失败：%s（%s）" % [tmp, error_string(FileAccess.get_open_error())])
+		return false
+	f.store_string(JSON.stringify(_data, "\t", true))
+	f.close()
+	if not _rename_overwrite(tmp, slots._path):
+		push_error("[存档序列化] 原子改名失败（tmp 保留待查）：%s → %s" % [tmp, slots._path])
+		return false
+	return true
 
 
+# ---- 冒险断点域（停点粒度续玩快照；内容装配归 AdventureRunner，本类照单承载）----
+# 空字典 = 无断点合法态。值拷贝进出（禁碰内部结构契约同款）——快照写入后调用方再改不渗入存档态。
+
+func set_breakpoint(bp: Dictionary) -> void:
+	_data["breakpoint"] = bp.duplicate(true)
+
+
+func clear_breakpoint() -> void:
+	_data["breakpoint"] = {}
+
+
+func has_breakpoint() -> bool:
+	return not (_data.get("breakpoint", {}) as Dictionary).is_empty()
+
+
+func breakpoint_snapshot() -> Dictionary:
+	return (_data.get("breakpoint", {}) as Dictionary).duplicate(true)
+
+
+# ---- 私有：迁移链 / 损坏兜底 / 规整 / 文件原语 ----
+
 # v1→v2：断点域出生（旧档无断点 = 合法空态——「继续上局」隐藏，非损坏非债务）
 func _migrate_v1_v2(data: Dictionary) -> Dictionary:
 	if not data.has("breakpoint"):
@@ -266,6 +195,53 @@ func _migrate_v6_v7(data: Dictionary) -> Dictionary:
 	return data
 
 
+# 迁移循环提取（load/peek 两调用方同构共享）：成功=迁移完成 Dictionary；失败=null
+# （原因经 fail 数组带出——load 侧落 corrupt 兜底文案、peek 侧保持「返回未填充 out」逐字）
+func _peek_migrated(parsed: Variant, fail: Array) -> Variant:
+	var v := int(parsed["version"])
+	while v < SAVE_FORMAT_VERSION:
+		if not _migrations.has(v):
+			fail.append("迁移链缺步骤 %d→%d" % [v, v + 1])
+			return null
+		var stepped = _migrations[v].call(parsed)
+		if typeof(stepped) != TYPE_DICTIONARY:
+			fail.append("迁移步骤 %d→%d 执行失败" % [v, v + 1])
+			return null
+		parsed = stepped
+		v = int(parsed.get("version", v + 1))
+	return parsed
+
+
+## 摘要窥视内核（只读推演单点——SlotStore 两 peek 方法经槽路径派生委托至此；
+## 迁移链在此只读推演——生产迁移 Callable 为纯函数，零盘面副作用）
+func _peek_summary_at(path: String) -> Dictionary:
+	var out := {"readable": false, "has_file": false, "keystone": 0, "cleared": 0, "total": 0}
+	if not FileAccess.file_exists(path):
+		out["readable"] = true   # 空槽=可读零值合法态
+		return out
+	out["has_file"] = true   # 主文件在盘（可读性与占档判定分离——白板档与空槽自此可区分）
+	var f := FileAccess.open(path, FileAccess.READ)
+	if f == null:
+		return out
+	var text := f.get_as_text()
+	f.close()
+	var parsed = JSON.parse_string(text)
+	if typeof(parsed) != TYPE_DICTIONARY or not parsed.has("version"):
+		return out
+	if int(parsed["version"]) > SAVE_FORMAT_VERSION:
+		return out
+	var fail := []
+	var migrated = _peek_migrated(parsed, fail)
+	if migrated == null:
+		return out
+	var norm := _normalize(migrated)
+	out["readable"] = true
+	out["keystone"] = int(norm["meta"].get("keystone_balance", 0))
+	out["cleared"] = int(norm["meta"].get("adventure_cleared", 0))
+	out["total"] = int(norm["meta"].get("adventure_total", 0))
+	return out
+
+
 # ---- 默认数据模型（新档合法态——全零；白板存档 = 完整可玩〔元进度 单局循环零依赖〕）----
 
 func _default_data() -> Dictionary[String, Variant]:
@@ -299,368 +275,15 @@ func _default_data() -> Dictionary[String, Variant]:
 	}
 
 
-# ---- 首次冒险布尔位（关卡节点图生成 v1.1 确定性承载）----
-# false = 本档尚无游玩史 → 首局走固定种子 42 ＋ 参数档生成图（教学与存档复现的固定图由此承载，无兜底模板）；
-# 置位只在冒险收束挂点（MetaProgression.settle_adventure）。
-# 老档迁移：缺字段 = 该档已有游玩史 → true（不重放首局固定图）。
+# 原地重置默认态（SlotStore 槽位原语的协作口——激活/建删/换注回默认数据）
+func _reset_to_default() -> void:
+	_data = _default_data()
 
-func is_first_adventure_done() -> bool:
-	return bool(_data["meta"].get("first_adventure_done", true))
-
-
-func mark_first_adventure_done() -> void:
-	_data["meta"]["first_adventure_done"] = true
-
-
-# ---- 读盘（进档/注入时调用；启动态不读——_ready 已钉死不隐式激活）----
-# 返回 true = 已就绪可用（含新档/损坏兜底/迁移成功）；false = 高版本拒读（默认数据运行、禁写盘）。
-# 损坏兜底：原文件改名 <path>.corrupt.bak（已存在则覆盖）+ push_warning + 默认数据继续——不静默丢档。
-func load_from_disk() -> bool:
-	_read_only = false
-	if not FileAccess.file_exists(_path):
-		_data = _default_data()   # 新档合法态
-		return true
-	var f := FileAccess.open(_path, FileAccess.READ)
-	if f == null:
-		return _corrupt_fallback("读打开失败（%s）" % error_string(FileAccess.get_open_error()))
-	var text := f.get_as_text()
-	f.close()
-	var parsed = JSON.parse_string(text)
-	if typeof(parsed) != TYPE_DICTIONARY:
-		return _corrupt_fallback("JSON 解析失败或顶层结构出域（非对象）")
-	if not parsed.has("version"):
-		return _corrupt_fallback("缺版本字段")
-	var v := int(parsed["version"])
-	if v > SAVE_FORMAT_VERSION:
-		_read_only = true
-		_data = _default_data()
-		push_error("[存档序列化] 档案版本 %d 高于当前 %d——拒读禁写（保护未来档不被覆写，内存默认新档运行）" % [v, SAVE_FORMAT_VERSION])
-		return false
-	while v < SAVE_FORMAT_VERSION:
-		if not _migrations.has(v):
-			return _corrupt_fallback("迁移链缺步骤 %d→%d" % [v, v + 1])
-		var stepped = _migrations[v].call(parsed)
-		if typeof(stepped) != TYPE_DICTIONARY:
-			return _corrupt_fallback("迁移步骤 %d→%d 执行失败" % [v, v + 1])
-		parsed = stepped
-		v = int(parsed.get("version", v + 1))
-	_data = _normalize(parsed)
-	# 老档迁移（关卡节点图生成 v0.4 布尔位——缺字段 = 已有游玩史，不重放教学脚本）
-	if not _data["meta"].has("first_adventure_done"):
-		_data["meta"]["first_adventure_done"] = true
-	return true
-
-
-# ---- 写盘（tmp + rename 原子写——写一半断电不留烂档）----
-# 无激活态一律拒绝并返回 false（sv3：启动态不隐式激活，盘面零触碰）；
-# 高版本拒读态一律拒绝（契约 4 禁写）；写失败返回 false。
-func write_to_disk() -> bool:
-	if _path == "":
-		push_error("[存档序列化] 写盘拒绝——无激活存档位（启动态不隐式激活；经选档进档/新档后落盘）")
-		return false
-	if _read_only:
-		push_error("[存档序列化] 写盘拒绝——档案版本高于当前（拒读禁写态）")
-		return false
-	var tmp := _path + ".tmp"
-	var f := FileAccess.open(tmp, FileAccess.WRITE)
-	if f == null:
-		push_error("[存档序列化] 临时文件打开失败：%s（%s）" % [tmp, error_string(FileAccess.get_open_error())])
-		return false
-	f.store_string(JSON.stringify(_data, "\t", true))
-	f.close()
-	if not _rename_overwrite(tmp, _path):
-		push_error("[存档序列化] 原子改名失败（tmp 保留待查）：%s → %s" % [tmp, _path])
-		return false
-	return true
-
-
-# 迁移注册口：from_version → from_version+1 的升级函数（读档时链式调用）。fn 契约：
-# Dictionary → Dictionary，须写回 version = from_version + 1。生产迁移链现行（v1→v6，_init 自注册），
-# 冒烟经本口验证链式升级。
-func register_migration(from_version: int, fn: Callable) -> void:
-	_migrations[from_version] = fn
-
-
-# ---- 类型化域访问器（消费面——只经访问器操作，禁碰内部结构）----
-
-func keystone_balance() -> int:
-	return int(_data["meta"]["keystone_balance"])
-
-
-func add_keystone(n: int) -> void:
-	_data["meta"]["keystone_balance"] = keystone_balance() + n
-
-
-# 钥石消费唯一口：余额不足拒绝且零副作用（钥石只增不减——消费除外，元进度验收判据）
-func spend_keystone(n: int) -> bool:
-	if keystone_balance() < n:
-		return false
-	_data["meta"]["keystone_balance"] = keystone_balance() - n
-	return true
-
-
-func item_unlocked(item_id: String) -> bool:
-	return _data["meta"]["item_unlocks"].has(item_id)
-
-
-func unlock_item(item_id: String) -> void:
-	_data["meta"]["item_unlocks"][item_id] = true
-
-
-func clear_count(level_index: int) -> int:
-	return int(_data["meta"]["level_clear_counts"].get(str(level_index), 0))
-
-
-func boss_first_kill_marked(level_index: int) -> bool:
-	return _data["meta"]["boss_first_kill"].has(str(level_index))
-
-
-# ---- 同调位账本域（里程碑谓词表计数源 + 装配关系 + Y 升级态）----
-
-# Boss 击杀总数（含重复——底稿裁决 4 计数源；收束入账 = apply_adventure_summary 逐关卡完成关次 +1，
-# Boss 恒唯一终点故 levels_cleared 即本次冒险 Boss 击杀数）
-func boss_kill_count() -> int:
-	return int(_data["meta"].get("boss_kill_count", 0))
-
-
-# ---- 生涯终身计数域（跨局汇总页数据源；只读面经访问器，
-#      写入唯一经 apply_adventure_summary 收束口，禁第二写入点）----
-
-# 冒险总局数（口径=开局即计：三结局 completed/failed/abandoned 同经收束恰计一次，含放弃与失败）
-func adventure_total() -> int:
-	return int(_data["meta"].get("adventure_total", 0))
-
-
-# 冒险成功局数（口径=三关全通才计 1——判定字段 summary.cleared，adventure_runner「completed」
-# 唯一出口=末关的关卡完成）
-func adventure_cleared() -> int:
-	return int(_data["meta"].get("adventure_cleared", 0))
-
-
-# 真视类工具累计使用次数（信标网络解锁行为条件；写入唯一经 add_vision_used
-# 冒险收束聚合入账，受理计数点=battle 层经冒险层聚合）
-func vision_used() -> int:
-	return int(_data["meta"].get("vision_used", 0))
-
-
-func add_vision_used(n: int) -> void:
-	_data["meta"]["vision_used"] = maxi(0, vision_used() + maxi(0, n))
-
-
-# ---- 天赋树域（MetaProgression 树段读写面）----
-
-func tree_nodes() -> Dictionary:
-	return (_data["meta"].get("tree_nodes", {}) as Dictionary).duplicate()
-
-
-func tree_level(node_id: String) -> int:
-	return int((_data["meta"].get("tree_nodes", {}) as Dictionary).get(node_id, 0))
-
-
-func set_tree_level(node_id: String, level: int) -> void:
-	var tn: Dictionary[Variant, Variant] = _data["meta"].get("tree_nodes", {}) as Dictionary
-	tn[node_id] = maxi(0, level)
-	_data["meta"]["tree_nodes"] = tn
-
-
-func fork_sides() -> Dictionary:
-	return (_data["meta"].get("fork_sides", {}) as Dictionary).duplicate()
-
-
-func fork_side(group: String) -> String:
-	return String((_data["meta"].get("fork_sides", {}) as Dictionary).get(group, ""))
-
-
-func set_fork_side(group: String, side: String) -> void:
-	var fs: Dictionary[Variant, Variant] = _data["meta"].get("fork_sides", {}) as Dictionary
-	fs[group] = side
-	_data["meta"]["fork_sides"] = fs
-
-
-# ---- 锻造工坊域 forge_routes（MetaProgression 锻造写口读写面；无特效域）----
-# 解锁态不落档（派生）：初始持有=表 initial_owned、练满前一档=levels[prereq]≥cap——判定单点在
-# MetaProgression.forge_route_unlocked（读表+读档）；本类只承载直购清单 unlocked 与选中标记。
-# 域结构：{levels:{六路线 id→等级}, unlocked:[直购路线 id], weapon:当前武器路线 id, armor:当前甲路线 id}
-
-func _forge_domain() -> Dictionary:
-	return _data["meta"].get("forge_routes", {}) as Dictionary
-
-
-func forge_routes_snapshot() -> Dictionary:
-	return _forge_domain().duplicate(true)   # 值拷贝出户（本类契约「禁碰内部结构」——消费方直改不得渗入存档内存态）
-
-
-func forge_route_level(route_id: String) -> int:
-	var lv: Dictionary[Variant, Variant] = _forge_domain().get("levels", {}) as Dictionary
-	return int(lv.get(route_id, 0))
-
-
-func set_forge_route_level(route_id: String, level: int) -> void:
-	var dom: Dictionary[Variant, Variant] = _forge_domain()
-	var lv: Dictionary[Variant, Variant] = dom.get("levels", {}) as Dictionary
-	lv[route_id] = maxi(0, level)
-	dom["levels"] = lv
-	_data["meta"]["forge_routes"] = dom
-
-
-func forge_unlocked_purchases() -> Array:
-	return (_forge_domain().get("unlocked", []) as Array).duplicate()
-
-
-func add_forge_unlock(route_id: String) -> void:
-	var dom: Dictionary[Variant, Variant] = _forge_domain()
-	var un: Array[Variant] = dom.get("unlocked", []) as Array
-	if not un.has(route_id):
-		un.append(route_id)
-	dom["unlocked"] = un
-	_data["meta"]["forge_routes"] = dom
-
-
-func forge_weapon() -> String:
-	return String(_forge_domain().get("weapon", "sword"))
-
-
-func set_forge_weapon(route_id: String) -> void:
-	var dom: Dictionary[Variant, Variant] = _forge_domain()
-	dom["weapon"] = route_id
-	_data["meta"]["forge_routes"] = dom
-
-
-func forge_armor() -> String:
-	return String(_forge_domain().get("armor", "light"))
-
-
-func set_forge_armor(route_id: String) -> void:
-	var dom: Dictionary[Variant, Variant] = _forge_domain()
-	dom["armor"] = route_id
-	_data["meta"]["forge_routes"] = dom
-
-
-# 装配关系（同调目录 item_id 有序数组——装配序即呈现序；跨冒险持久，冒险中途不可换装〔底稿 §8.5〕）。
-# 局外进度事实（元进度域同族），非契约 2 反面清单的「局内道具库存」——口径见 存档序列化.md 契约 2。
-func attunement_equipped() -> Array:
-	return (_data["meta"].get("attunement_equipped", []) as Array).duplicate()
-
-
-func set_attunement_equipped(item_ids: Array) -> void:
-	var out: Array[Variant] = []
-	for v in item_ids:
-		out.append(String(v))
-	_data["meta"]["attunement_equipped"] = out
-
-
-# Y 刷新升级购买等级（0 = 未购 → 每冒险刷新次数 0；等级行值归营地升级行族）
-func attune_refresh_level() -> int:
-	return int(_data["meta"].get("attune_refresh_level", 0))
-
-
-func set_attune_refresh_level(n: int) -> void:
-	_data["meta"]["attune_refresh_level"] = maxi(0, n)
-
-
-# 同调位计数源组装（Attunement 服务取数口——clear_count = 逐关完成次数合计〔含重复关，底稿 §2.1 口径〕；
-# clear_count(level_index) 逐关访问器零改动复用）
-func recent_summaries() -> Array:
-	return _data["meta"]["recent_summaries"].duplicate(true)   # 值拷贝出户（本类契约「禁碰内部结构」——消费方直改不得渗入存档内存态）
-
-
-# 域更新原语（正式冒险收束唯一入账口——组合根经本函数入账，禁直改内部结构）：
-# 钥石入账（summary.keystone_total——逐杀掉落已在冒险内计入，boss_drops 参数为
-# 摘要归档副本不重复入账）+ 逐关卡完成关次 clear_count +1 与 Boss 首杀标记 + Boss 击杀总数累计
-# （同调位里程碑计数源）+ 摘要头部插入（cap 10，最新在前，元素附
-# keystone_drops 副本——复盘可归因）+ 生涯终身计数自增（总局数开局即计：
-# 三结局同经本口恰计一次；冒险成功局数按 summary.cleared 判定三关全通才计 1。终身计数写入
-# 单口=本函数，禁第二写入点）。
-func apply_adventure_summary(summary: Dictionary, boss_drops: Array = []) -> void:
-	_data["meta"]["adventure_total"] = adventure_total() + 1
-	if bool(summary.get("cleared", false)):
-		_data["meta"]["adventure_cleared"] = adventure_cleared() + 1
-	add_keystone(int(summary.get("keystone_total", 0)))
-	var cleared := int(summary.get("levels_cleared", 0))
-	for li in range(1, cleared + 1):
-		var key := str(li)
-		_data["meta"]["level_clear_counts"][key] = int(_data["meta"]["level_clear_counts"].get(key, 0)) + 1
-		_data["meta"]["boss_first_kill"][key] = true
-	_data["meta"]["boss_kill_count"] = boss_kill_count() + cleared   # Boss 恒唯一终点：levels_cleared 即本次冒险 Boss 击杀数（含重复）
-	var entry: Dictionary[Variant, Variant] = summary.duplicate(true)
-	entry["boss_drops"] = boss_drops.duplicate(true)
-	var arr: Array[Variant] = _data["meta"]["recent_summaries"]
-	arr.push_front(entry)
-	while arr.size() > SUMMARY_CAP:
-		arr.pop_back()
-
-
-# ---- 冒险断点域（停点粒度续玩快照；内容装配归 AdventureRunner，本类照单承载）----
-# 空字典 = 无断点合法态。值拷贝进出（禁碰内部结构契约同款）——快照写入后调用方再改不渗入存档态。
-
-func set_breakpoint(bp: Dictionary) -> void:
-	_data["breakpoint"] = bp.duplicate(true)
-
-
-func clear_breakpoint() -> void:
-	_data["breakpoint"] = {}
-
-
-func has_breakpoint() -> bool:
-	return not (_data.get("breakpoint", {}) as Dictionary).is_empty()
-
-
-func breakpoint_snapshot() -> Dictionary:
-	return (_data.get("breakpoint", {}) as Dictionary).duplicate(true)
-
-
-# ---- 私有：损坏兜底与文件原语 ----
-
-# 旧隐式单档一次性迁移（Q1 甲，sv12）：src 字节级原样搬运到 dst（零解析零改造——损坏/高版本
-# 旧档字节原样落槽 1，读取时由正式进档路径的兜底/拒读链接管，不静默丢数据）；
-# dst 已存在不重迁（幂等判据——判别锚④：去判据则重复迁移覆盖槽 1）；迁移成功后 src 改名
-# bak 留痕（不删——处置字节留痕，防再次隐式读写）。任一步失败：源保留原地，下次启动重试。
-# tmp+rename 原子形态与 write_to_disk 同纪律。生产调用=src/dst/bak 为 旧单档/槽 1/留痕名。
-func _migrate_legacy_save(src: String, dst: String, bak: String) -> void:
-	if not FileAccess.file_exists(src):
-		return   # 执行前置：旧档不存在=无操作
-	if FileAccess.file_exists(dst):
-		return   # 幂等判据：槽 1 已存在不重迁
-	var tmp := dst + ".tmp"
-	if not _copy_file(src, tmp):
-		push_warning("[存档序列化] 旧单档迁移失败（源保留，下次启动重试）：%s → %s" % [src, tmp])
-		return
-	if not _rename_overwrite(tmp, dst):
-		push_warning("[存档序列化] 旧单档迁移改名失败（tmp 保留待查，源保留重试）：%s → %s" % [tmp, dst])
-		return
-	_rename_overwrite(src, bak)
-	push_warning("[存档序列化] 旧单档已迁入 %s，原件留痕于 %s" % [dst, bak])
-
-
-# 字节级文件拷贝（迁移专用——buffer 直拷，零解析零改造）
-func _copy_file(from: String, to: String) -> bool:
-	var src := FileAccess.open(from, FileAccess.READ)
-	if src == null:
-		return false
-	var dst := FileAccess.open(to, FileAccess.WRITE)
-	if dst == null:
-		src.close()
-		return false
-	while not src.eof_reached():
-		var chunk := src.get_buffer(65536)
-		if chunk.size() > 0:
-			dst.store_buffer(chunk)
-	src.close()
-	dst.close()
-	return true
-
-
-# 文件删除（删档原语专用——呈现层禁 DirAccess 直删，承载面单点）
-func _remove_file(p: String) -> bool:
-	var dir := DirAccess.open(p.get_base_dir())
-	if dir == null:
-		return false
-	return dir.remove(p.get_file()) == OK
 
 # 损坏兜底：坏档改名 .corrupt.bak（已存在则覆盖）→ 默认数据继续。不静默丢档（警告留痕）、不 crash。
 func _corrupt_fallback(reason: String) -> bool:
-	var bak := _path + ".corrupt.bak"
-	if not _rename_overwrite(_path, bak):
+	var bak := slots._path + ".corrupt.bak"
+	if not _rename_overwrite(slots._path, bak):
 		push_warning("[存档序列化] 坏档备份改名失败（原文件保留原地）：%s——%s" % [bak, reason])
 	else:
 		push_warning("[存档序列化] 检测到损坏档案，已备份为 %s——%s（用默认新档继续）" % [bak, reason])
@@ -689,7 +312,8 @@ func _normalize(data: Dictionary) -> Dictionary[String, Variant]:
 	return merged
 
 
-# 覆盖式改名（Windows 原生 rename 目标已存在时会失败——先删后改，显式覆盖语义）
+# 覆盖式改名（Windows 原生 rename 目标已存在时会失败——先删后改，显式覆盖语义；IO 原语单点——
+# SlotStore 迁移流经本件调用）
 func _rename_overwrite(from: String, to: String) -> bool:
 	var dir := DirAccess.open(from.get_base_dir())
 	if dir == null:

game/core/settlement/combat_segment.gd

@@ -78,7 +78,7 @@ func _enemy_actions(ri: int) -> void:
 		if int(oc._enemy_system.hero_unit().hp) <= 0:
 			break   # hero hp=0 立即短路（死尸挨打行是归因噪音——用户拍板）
 		var skill_id := oc._enemy_system.pending_action(u)
-		var srow: Dictionary[Variant, Variant] = oc.db.skill_row(skill_id)
+		var srow: Dictionary[Variant, Variant] = oc.db.combat.skill.row_by_id(skill_id)
 		if srow.is_empty():
 			oc._fatal("敌实例待发动作悬空: %s" % skill_id)
 			continue
@@ -97,7 +97,7 @@ func _enemy_actions(ri: int) -> void:
 		var baseline: int = int(round(float(u.atk) * float(srow.get("damage_mult", 1.0))))
 		var rider := 0
 		if srow.has("rider_mult"):
-			rider = maxi(int(oc.db.settlement.damage_roll.damage_floor), int(floor(float(u.atk) * float(srow.rider_mult))))
+			rider = maxi(int(oc.db.combat.settlement.damage_roll.damage_floor), int(floor(float(u.atk) * float(srow.rider_mult))))
 		var et := oc._damage.open_ticket(DamageController.KIND_ENEMY_SKILL, "enemy_action",
 			"%s %s" % [u.display_name, String(srow.display_name)],
 			{"channel": "combat", "base_value": baseline, "target_rule": DamageController.TARGET_HERO,

game/core/settlement/grant_segment.gd

@@ -147,7 +147,7 @@ func _reveal_mine_apply(mh_hits: Array, snap: Dictionary, cell: Vector2i, ri: in
 				if fx_host._fx_bonus_delta.has(axis):
 					fx_host._fx_bonus_delta[axis] += int(h.get("delta", 0))
 			"blast_scaled":
-				var blast_v := maxi(int(oc.db.settlement.damage_roll.damage_floor), int(float(int(snap.get("power", 0))) * float(h.get("mult", 1))))
+				var blast_v := maxi(int(oc.db.combat.settlement.damage_roll.damage_floor), int(float(int(snap.get("power", 0))) * float(h.get("mult", 1))))
 				var bs_t := oc._damage.open_ticket(DamageController.KIND_BOARD_BLAST, "feat_blast_scaled", "陷阱爆发",
 					{"channel": "board", "base_value": blast_v, "target_rule": DamageController.TARGET_ALL_ALIVE,
 					"ri": ri, "origin_cell": cell})
@@ -163,7 +163,7 @@ func _terrain_batch(ri: int) -> void:
 	for evt in oc._facts_reveals:
 		var vids: Array[Variant] = evt.get("variant_ids", [])
 		for vid in vids:
-			var vrow: Dictionary[Variant, Variant] = oc.db.variation.row_by_id(String(vid))
+			var vrow: Dictionary[Variant, Variant] = oc.db.combat.variation.row_by_id(String(vid))
 			if String(vrow.get("effect", "")) != "flat_damage":
 				continue   # 触发词表按 effect 路由：flat_damage=on_open 兑现；hide_number/on_open 外组合 = 数据行新词表未接线（显式忽略面）
 			# 地形变异伤害单据——无类型必中，下限保底在控制器管线内

game/core/shop_session.gd

@@ -34,7 +34,7 @@ func bind(refs: Dictionary, hooks: Dictionary) -> void:
 # 商店覆盖层数据源（只读投影——现价/已购档数在此现算，呈现层禁复算定价公式）
 func shop_products() -> Array:
 	var out: Array[Dictionary] = []
-	for prow in db.shop_products():
+	for prow in db.run.shop.product_rows():
 		out.append({
 			"product_id": String(prow.get("product_id", "")),
 			"display_name": String(prow.get("display_name", "")),
@@ -49,7 +49,7 @@ func shop_products() -> Array:
 # 现价 = base_price + price_level_bonus(level_index) + price_increment × 该商品已购档数
 # （散折价：economy_spend 激活时商品标价 ×80%——见 _spend_discounted）
 func current_price(prow: Dictionary) -> int:
-	return _spend_discounted(int(prow.get("base_price", 0)) + db.shop_price_level_bonus(_level_index()) \
+	return _spend_discounted(int(prow.get("base_price", 0)) + db.run.shop.price_level_bonus_at(_level_index()) \
 		+ int(prow.get("price_increment", 0)) * purchased_tier(String(prow.get("product_id", ""))))
 
 
@@ -58,7 +58,7 @@ func current_price(prow: Dictionary) -> int:
 # + 池货架面 pool_price 同折〕——商店刷新价 shop_refresh_cost 与三选一付费刷新不折）
 func _spend_discounted(price: int) -> int:
 	if _rules().has("economy_spend"):
-		return maxi(1, int(floor(float(price) * float(db.shop.spend_discount))))
+		return maxi(1, int(floor(float(price) * float(db.run.shop.spend_discount))))
 	return price
 
 
@@ -69,7 +69,7 @@ func purchased_tier(product_id: String) -> int:
 # 购买（未知商品/属性键出域/余额不足拒绝——返回 false 零副作用）：
 # 出账 → 加算区 += flat_value → 购血同步当前生命（封顶新上限）→ 已购档数 +1
 func buy_product(product_id: String) -> bool:
-	var prow: Dictionary[Variant, Variant] = db.shop_product_row(product_id)
+	var prow: Dictionary[Variant, Variant] = db.run.shop.product_row(product_id)
 	if prow.is_empty():
 		push_error("[关卡节点地图] 商店房未知商品: %s" % product_id)
 		return false
@@ -133,7 +133,7 @@ func leave() -> void:
 func _draw_shelf() -> void:
 	shelf = []
 	var sellable: Array[Variant] = []
-	for row in db.shop_pool_rows():
+	for row in db.run.shop.pool_rows():
 		var shelf_kind := String(row.get("kind_id", ""))
 		if _pool_cap.is_valid() and not bool(_pool_cap.call(shelf_kind, "")):
 			continue   # cap 满剔除（货架候选视图剔除；牌库本体不动）
@@ -184,14 +184,14 @@ func pool_stock(kind: String) -> int:
 # A/b 表 knob provisional；核心现算，呈现层禁复算——契约 5）。relic 卡（保底占位——shop 词表外）
 # 基价 provisional 15（表 knob relic_base_price——shop.tres 词表扩列归数值批）。
 func pool_price(kind: String) -> int:
-	var row: Dictionary[Variant, Variant] = db.shop_pool_row(kind)
+	var row: Dictionary[Variant, Variant] = db.run.shop.pool_row(kind)
 	if row.is_empty():
 		if kind == "relic":
-			return _spend_discounted(int(ceil(float(db.shop.relic_base_price) * pow(db.shop_price_b(), float(maxi(0, _level_index() - 1))) * pow(db.shop_price_a(), float(visit_buys)))))
+			return _spend_discounted(int(ceil(float(db.run.shop.relic_base_price) * pow(db.run.shop.price_b, float(maxi(0, _level_index() - 1))) * pow(db.run.shop.price_a, float(visit_buys)))))
 		return 999999
 	var base := float(maxi(1, int(row.get("base_price", 1))))
-	var price_f: float = base * pow(db.shop_price_b(), float(maxi(0, _level_index() - 1))) \
-		* pow(db.shop_price_a(), float(visit_buys))
+	var price_f: float = base * pow(db.run.shop.price_b, float(maxi(0, _level_index() - 1))) \
+		* pow(db.run.shop.price_a, float(visit_buys))
 	return _spend_discounted(int(ceil(price_f)))
 
 
@@ -202,11 +202,11 @@ func shop_shelf() -> Array:
 	for tok in shelf:
 		var kind := String((tok as Dictionary).get("kind", ""))
 		var tier := String((tok as Dictionary).get("tier", ""))
-		var row: Dictionary[Variant, Variant] = db.shop_pool_row(kind)
+		var row: Dictionary[Variant, Variant] = db.run.shop.pool_row(kind)
 		var display := String(row.get("display_name", kind))
-		var value := int(db.adventure.curio_value(kind, tier))
+		var value := int(db.run.adventure.curio_value(kind, tier))
 		if row.is_empty() and kind == "relic":
-			var rrow: Dictionary[Variant, Variant] = db.feat_row(String(tok.get("feat_id", "")))
+			var rrow: Dictionary[Variant, Variant] = db.crossrun.feats.row_by_id(String(tok.get("feat_id", "")))
 			display = String(rrow.get("display_name", "特性"))
 			value = 0
 		out.append({
@@ -227,22 +227,22 @@ func shop_shelf() -> Array:
 func shop_refresh_free_left() -> int:
 	# 刷新执照 shop_refresh_bonus 装配合计叠加（进店入账语义=读数即本店可用，
 	# 与基础 knob 同生命周期；未装配=基值）
-	return maxi(0, int(db.adventure.shop_refresh_free) + _attune_shop_refresh_bonus())
+	return maxi(0, int(db.run.adventure.shop_refresh_free) + _attune_shop_refresh_bonus())
 
 
 # 刷新执照装配合计（装配集 kind 分发扫描；零装配=0）
 func _attune_shop_refresh_bonus() -> int:
 	var total := 0
 	for iid_v in _attunement():
-		var arow: Dictionary[Variant, Variant] = db.treasure_item_row(String(iid_v))
+		var arow: Dictionary[Variant, Variant] = db.crossrun.treasure_items.row_by_id(String(iid_v))
 		if (arow.get("effect_kinds", []) as Array).has("shop_refresh_bonus"):
 			total += int(arow.get("magnitude", 0))
 	return total
 
 
 func shop_refresh_cost() -> int:
-	return int(ceil(float(db.adventure.shop_refresh_cost_base)
-		* pow(db.adventure.shop_refresh_cost_curve, float(paid_refreshes))))
+	return int(ceil(float(db.run.adventure.shop_refresh_cost_base)
+		* pow(db.run.adventure.shop_refresh_cost_curve, float(paid_refreshes))))
 
 
 func shop_refresh() -> bool:

game/core/slot_store.gd

@@ -0,0 +1,189 @@
+## 存档槽位文件域件（D3 拆件——自 save_manager 收编槽位族）：槽位挂载与模板、激活与建删、
+## 摘要窥视（peek 族）的唯一所有者。槽位态（路径/激活号/模板）随件承载；数据重置与读写盘
+## 经注入的 save 内部协作家族（_reset_to_default/_load_parsed/_rename_overwrite）完成——
+## 本件零 _data 副本零缓存（load 整体换新不陈旧）。
+class_name SlotStore
+extends RefCounted
+
+var _save                       # SaveManagerCore 注入引用（IO 与数据域协作单点）
+var _path: String = ""          # 当前写盘目标=激活槽文件（或 attach_path 注入路径）；""=无激活态——一切写盘路径拒绝
+var _active_slot := 0           # 激活槽号 1..SLOT_COUNT；0=无激活态（注入非槽派生名路径时亦 0——写盘判定以 _path 非空为准）
+var _slot_template: String      # 槽文件名模板（生产=常量；测试经 attach_slot_template 注入隔离命名空间，禁在呈现层/探针各自拼槽名）
+
+
+func _init(save_ref, path: String = "") -> void:
+	_save = save_ref
+	_slot_template = _save.SLOT_PATH_TEMPLATE
+	_path = path
+	_active_slot = _slot_index_of(path)
+
+
+## 进档注入口：换路径＋回默认数据＋重读盘（对象引用恒定，MetaProgression 持有的 save 引用零失效）。
+## 三槽化后单路径语义（契约 7）＝注入路径即激活槽文件（写盘落该路径、无激活态时注入即激活）；
+## 注入槽派生名时激活号同步记账，注入任意隔离路径时激活号 0（写盘仍合法——隔离面行为零变化）。
+func attach_path(path: String) -> void:
+	_path = path
+	_save._read_only = false
+	_active_slot = _slot_index_of(path)
+	_save._reset_to_default()
+	_save.load_from_disk()
+
+
+## 测试隔离注入口（契约 7 同源——槽文件名模板整体换注，探针/单测经此隔离到自命名空间，
+## 禁各自拼槽文件名；换注后回无激活态，槽原语全部落注入命名空间）
+func attach_slot_template(template: String) -> void:
+	_slot_template = template
+	_path = ""
+	_active_slot = 0
+	_save._read_only = false
+	_save._reset_to_default()
+
+
+# 槽文件路径唯一派生口（模板单点——禁第二处拼名）
+func slot_path(slot: int) -> String:
+	return _slot_template % slot
+
+
+# 激活槽号查询（0 = 无激活态——启动态钉死后 boot 需经选档显式进档/新档）
+func active_slot() -> int:
+	return _active_slot
+
+
+# 写盘目标在位与否（激活槽或注入路径任一；无激活态一切写盘路径拒绝——sv3 判定口）
+func has_write_target() -> bool:
+	return _path != ""
+
+
+# 进档原语（sv5，契约 6/8）：激活槽 N＋读盘，复用 load_from_disk 迁移/兜底链按槽成立。
+# 高版本拒读槽：激活不成立、恢复切换前三态（路径/激活号/禁写位/数据）——防误写他槽；
+# 损坏槽：兜底链接管（.corrupt.bak 改名＋空态继续，激活成立）。
+func activate_slot(slot: int) -> bool:
+	if slot < 1 or slot > _save.SLOT_COUNT:
+		return false
+	var prev_path := _path
+	var prev_slot := _active_slot
+	var prev_ro: bool = _save._read_only
+	var prev_data = _save._data
+	_path = slot_path(slot)
+	_active_slot = slot
+	_save._read_only = false
+	_save._reset_to_default()
+	if not _save.load_from_disk():
+		_path = prev_path
+		_active_slot = prev_slot
+		_save._read_only = prev_ro
+		_save._data = prev_data
+		return false
+	return true
+
+
+# 新档原语（sv4）：空槽创建=合法白板态（_default_data 全零可玩纪律），创建即激活并落盘。
+# 生产路径只在空槽调用（有档槽开新局=先删档回空再新档）；写盘失败回退切换前三态。
+func create_slot(slot: int) -> bool:
+	if slot < 1 or slot > _save.SLOT_COUNT:
+		return false
+	var prev_path := _path
+	var prev_slot := _active_slot
+	var prev_ro: bool = _save._read_only
+	var prev_data = _save._data
+	_path = slot_path(slot)
+	_active_slot = slot
+	_save._read_only = false
+	_save._reset_to_default()
+	if not _save.write_to_disk():
+		_path = prev_path
+		_active_slot = prev_slot
+		_save._read_only = prev_ro
+		_save._data = prev_data
+		return false
+	return true
+
+
+# 删档原语（sv6，契约 8）：该槽文件删除＋盘面即时生效＋无 .tmp 残留；删激活槽时激活指针连清除
+# （内存回默认空态，该槽不再可写——激活态生命周期终点）。
+# .corrupt.bak 损坏备份不追删（用户数据留盘可考；同槽再损坏时兜底流按槽覆盖同名备份）。
+# 删不存在文件的空槽=幂等成功；越界槽号拒绝。
+func delete_slot(slot: int) -> bool:
+	if slot < 1 or slot > _save.SLOT_COUNT:
+		return false
+	var p := slot_path(slot)
+	if FileAccess.file_exists(p) and not _remove_file(p):
+		push_error("[存档序列化] 删档失败（文件删除被拒）：%s" % p)
+		return false
+	var tmp := p + ".tmp"
+	if FileAccess.file_exists(tmp):
+		_remove_file(tmp)   # 残留清偿尽力而为（主文件已删即达成空槽语义）
+	if _active_slot == slot:
+		_path = ""
+		_active_slot = 0
+		_save._reset_to_default()
+	return true
+
+
+# 摘要三项按槽窥视读器（sv7/sv8，契约 5/9）：钥石余额/冒险成功局数/冒险总局数。
+# 只读零副作用：不激活、不写盘、不触发 _corrupt_fallback 改名（.corrupt.bak 只在正式进档路径产生）。
+# 迁移链在此只读推演（内核 _peek_summary_at 归 save IO 域——本方法经槽路径派生委托）。
+func peek_slot_summary(slot: int) -> Dictionary:
+	if slot < 1 or slot > _save.SLOT_COUNT:
+		return {"readable": false, "has_file": false, "keystone": 0, "cleared": 0, "total": 0}   # 越界=非槽位，非空槽
+	return _save._peek_summary_at(slot_path(slot))
+
+
+# 窥视注入口（契约 7 隔离面同款——测试/探针经路径注入隔离，禁各自拼槽文件名）
+func peek_summary_at(path: String) -> Dictionary:
+	return _save._peek_summary_at(path)
+
+
+# 注入路径的槽号反查（命中槽派生名返回槽号，否则 0——激活号记账用，写盘判定以 _path 非空为准）
+func _slot_index_of(path: String) -> int:
+	for i in range(1, _save.SLOT_COUNT + 1):
+		if path == slot_path(i):
+			return i
+	return 0
+
+
+# 旧隐式单档一次性迁移（Q1 甲，sv12）：src 字节级原样搬运到 dst（零解析零改造——损坏/高版本
+# 旧档字节原样落槽 1，读取时由正式进档路径的兜底/拒读链接管，不静默丢数据）；
+# dst 已存在不重迁（幂等判据——判别锚④：去判据则重复迁移覆盖槽 1）；迁移成功后 src 改名
+# bak 留痕（不删——处置字节留痕，防再次隐式读写）。任一步失败：源保留原地，下次启动重试。
+# tmp+rename 原子形态与 write_to_disk 同纪律（改名原语 _rename_overwrite 归 save IO 域单点）。生产调用=src/dst/bak 为 旧单档/槽 1/留痕名。
+func _migrate_legacy_save(src: String, dst: String, bak: String) -> void:
+	if not FileAccess.file_exists(src):
+		return   # 执行前置：旧档不存在=无操作
+	if FileAccess.file_exists(dst):
+		return   # 幂等判据：槽 1 已存在不重迁
+	var tmp := dst + ".tmp"
+	if not _copy_file(src, tmp):
+		push_warning("[存档序列化] 旧单档迁移失败（源保留，下次启动重试）：%s → %s" % [src, tmp])
+		return
+	if not _save._rename_overwrite(tmp, dst):
+		push_warning("[存档序列化] 旧单档迁移改名失败（tmp 保留待查，源保留重试）：%s → %s" % [tmp, dst])
+		return
+	_save._rename_overwrite(src, bak)
+	push_warning("[存档序列化] 旧单档已迁入 %s，原件留痕于 %s" % [dst, bak])
+
+
+# 字节级文件拷贝（迁移专用——buffer 直拷，零解析零改造）
+func _copy_file(from: String, to: String) -> bool:
+	var src := FileAccess.open(from, FileAccess.READ)
+	if src == null:
+		return false
+	var dst := FileAccess.open(to, FileAccess.WRITE)
+	if dst == null:
+		src.close()
+		return false
+	while not src.eof_reached():
+		var chunk := src.get_buffer(65536)
+		if chunk.size() > 0:
+			dst.store_buffer(chunk)
+	src.close()
+	dst.close()
+	return true
+
+
+# 文件删除（删档原语专用——呈现层禁 DirAccess 直删，承载面单点）
+func _remove_file(p: String) -> bool:
+	var dir := DirAccess.open(p.get_base_dir())
+	if dir == null:
+		return false
+	return dir.remove(p.get_file()) == OK

game/core/status_container.gd

@@ -29,44 +29,58 @@ func apply_effect(effect_id: String, source: Dictionary, duration_override: int
 	if not _open:
 		push_warning("[增益状态] 域闭授予（EC1）")
 		return false
-	var row: Dictionary[Variant, Variant] = db.status_effect_row(effect_id)
+	var row: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(effect_id)
 	if row.is_empty():
 		push_warning("[增益状态] 未知 effect_id（EC2）: %s" % effect_id)
 		return false
 	var policy: String = row.stack_policy
 	var dur: int = int(row.duration_settlements) if duration_override < 1 else duration_override
 	var max_stack: int = int(row.max_stack)
-	# 授予时快照（抗表重载——EC9）
-	var snap_m: int = int(row.magnitude)
-	if source.has("magnitude_override"):
-		snap_m = int(source["magnitude_override"])   # 封印溢价贯穿（迭代14② T4——封印命中 percent 形态同乘快照；缺省路径零扰动）
-	var snap_unit: String = String(row.unit)
-	var snap_display: String = String(row.display_name)
+	var snap := _grant_snapshot(row, source)
 	match policy:
 		"independent":
-			_instances.append(_new_instance(effect_id, 1, dur, source, snap_m, snap_unit, snap_display))
+			_instances.append(_new_instance(effect_id, 1, dur, source, snap))
 			return true
 		"refresh":
-			for inst in _instances:
-				if inst.effect_id == effect_id:
-					inst.remaining = dur   # R ← D（取实例快照 D——同表值）；L 不变；空刷新恒 true
-					return true
-			_instances.append(_new_instance(effect_id, 1, dur, source, snap_m, snap_unit, snap_display))
-			return true
+			return _apply_refresh(effect_id, dur, snap, source)
 		"stack":
-			for inst in _instances:
-				if inst.effect_id == effect_id:
-					if int(inst.layers) >= max_stack:
-						return false   # 满层拒绝原子——容器零写入（拒收由战斗结算记"奖励未生效"行）
-					inst.layers = int(inst.layers) + 1   # stack 授予不触碰 R（spec 决议）
-					return true
-			_instances.append(_new_instance(effect_id, 1, dur, source, snap_m, snap_unit, snap_display))
-			return true
+			return _apply_stack(effect_id, dur, snap, source, max_stack)
 	push_warning("[增益状态] 未知 stack_policy")
 	return false
 
 
-func _new_instance(effect_id: String, layers: int, dur: int, source: Dictionary, m: int, unit: String, display: String) -> Dictionary:
+## 授予时快照域（抗表重载——EC9；封印溢价贯穿——迭代14② T4 percent 形态同乘快照、缺省路径零扰动）
+func _grant_snapshot(row: Dictionary, source: Dictionary) -> Dictionary:
+	var snap_m: int = int(row.magnitude)
+	if source.has("magnitude_override"):
+		snap_m = int(source["magnitude_override"])
+	return {"m": snap_m, "unit": String(row.unit), "display": String(row.display_name)}
+
+
+## refresh 臂：命中改 R 未命中追加（R ← D 取实例快照 D——同表值；L 不变；空刷新恒 true）
+func _apply_refresh(effect_id: String, dur: int, snap: Dictionary, source: Dictionary) -> bool:
+	for inst in _instances:
+		if inst.effect_id == effect_id:
+			inst.remaining = dur
+			return true
+	_instances.append(_new_instance(effect_id, 1, dur, source, snap))
+	return true
+
+
+## stack 臂：满层拒零写入·未满加层·未命中追加（stack 授予不触碰 R——spec 决议；
+## 满层拒绝原子——容器零写入，拒收由战斗结算记"奖励未生效"行）
+func _apply_stack(effect_id: String, dur: int, snap: Dictionary, source: Dictionary, max_stack: int) -> bool:
+	for inst in _instances:
+		if inst.effect_id == effect_id:
+			if int(inst.layers) >= max_stack:
+				return false
+			inst.layers = int(inst.layers) + 1
+			return true
+	_instances.append(_new_instance(effect_id, 1, dur, source, snap))
+	return true
+
+
+func _new_instance(effect_id: String, layers: int, dur: int, source: Dictionary, snap: Dictionary) -> Dictionary:
 	return {
 		"effect_id": effect_id,
 		"layers": layers,
@@ -74,9 +88,9 @@ func _new_instance(effect_id: String, layers: int, dur: int, source: Dictionary,
 		"source_class": String(source.get("source_class", "")),
 		"origin_cell": source.get("origin_cell", Vector2i(-1, -1)),
 		"round_index": int(source.get("round_index", 0)),
-		"snap_m": m,
-		"snap_unit": unit,
-		"snap_display": display,
+		"snap_m": snap["m"],
+		"snap_unit": snap["unit"],
+		"snap_display": snap["display"],
 	}
 
 
@@ -84,7 +98,7 @@ func _new_instance(effect_id: String, layers: int, dur: int, source: Dictionary,
 func query_active(side: String) -> Array:
 	var out: Array[Dictionary] = []
 	for inst in _instances:
-		var row: Dictionary[Variant, Variant] = db.status_effect_row(inst.effect_id)
+		var row: Dictionary[Variant, Variant] = db.combat.status_effects.row_by_id(inst.effect_id)
 		if row.is_empty():
 			continue
 		if String(row.target_side) != side:

game/core/treasure_items.gd

@@ -68,9 +68,10 @@ func _usable_now(item_id: String, board_has_preview_info: Callable) -> bool:
 func _item_row(item_id: String) -> Dictionary:
 	if _db == null:
 		return {}
-	if _db.has_method("treasure_item_row"):
-		return _db.treasure_item_row(item_id)   # 表访问收口（正式面走 ConfigDB 访问器）
-	return _db.treasure_items.row_by_id(item_id)   # 桩表面（单测 StubDB 无访问器——直读保留，随测试面演进退役）
+	var db_crossrun = _db.get("crossrun")
+	if db_crossrun != null:
+		return db_crossrun.treasure_items.row_by_id(item_id)   # 表访问收口（正式面走 ConfigDB 容器直连）
+	return _db.treasure_items.row_by_id(item_id)   # 桩表面（单测 StubDB 无容器——直读保留，随测试面演进退役）
 
 # 不标具体类型原因：单元测试注入 StubDB 桩表（treasure_items_test.gd）——typed 赋值会运行期拒收，保守保持 null 注
 var _db = null   # ConfigDB（行定义读取——_init 注入；测试可注入桩表）
@@ -97,31 +98,16 @@ func validate_use(handle: int, target: Vector2i, board_size: Vector2i, cell_unre
 	var kinds: Array[Variant] = row.get("effect_kinds", [])
 	var resolved: Array[Variant] = []
 	if kinds.has("mine_reveal") or kinds.has("reward_preview") or kinds.has("reveal_tiles") or kinds.has("safe_dig"):
-		# 空间效果（真视 reveal_tiles/天眼复合 safe_dig 入空间解析；
-		# 真视窄域护栏 REVEAL_KINDS 同守）：
-		if target.x < 0 or target.y < 0 or target.x >= int(board_size.x) or target.y >= int(board_size.y):
-			return _reject("目标越板")
-		if String(row.get("target", "")) == "cell":
-			# 单格档（线香真视单格；≤3×3 窄域契约内的点目标）
-			resolved.append(target)
-		else:
-			# 3×3 窗口 ∩ 板内格（边缘受理——护栏只缩不扩）
-			for dy in range(-1, 2):
-				for dx in range(-1, 2):
-					var c := target + Vector2i(dx, dy)
-					if c.x >= 0 and c.y >= 0 and c.x < int(board_size.x) and c.y < int(board_size.y):
-						resolved.append(c)
+		# 空间效果（真视 reveal_tiles/天眼复合 safe_dig 入空间解析；真视窄域护栏 REVEAL_KINDS 同守）
+		var spatial := _spatial_reject_reason(row, target, board_size)
+		if spatial != "":
+			return _reject(spatial)
+		resolved = _window_cells(row, target, board_size)
 		# 点击级零信息：纯预读行窗口全已开 = 没东西可看（拒绝零消耗）；
 		# 真视恒可用（零雷窗口=「这 9 格没雷」信息非空——GDD 裁定）
-		if kinds.has("reward_preview") and not kinds.has("mine_reveal"):
-			var any_unrevealed := false
-			if cell_unrevealed_cb.is_valid():
-				for c in resolved:
-					if bool(cell_unrevealed_cb.call(c)):
-						any_unrevealed = true
-						break
-			if not any_unrevealed:
-				return _reject("窗口内无可预读的未开格")
+		if kinds.has("reward_preview") and not kinds.has("mine_reveal") \
+				and _preview_window_dead(resolved, cell_unrevealed_cb):
+			return _reject("窗口内无可预读的未开格")
 	return {
 		"ok": true,
 		"reason": "",
@@ -132,6 +118,38 @@ func validate_use(handle: int, target: Vector2i, board_size: Vector2i, cell_unre
 	}
 
 
+## 空间解析域：目标越板拒（cell/3×3 两档共用板界）——返回拒绝原因，空串=通过
+func _spatial_reject_reason(row: Dictionary, target: Vector2i, board_size: Vector2i) -> String:
+	if target.x < 0 or target.y < 0 or target.x >= int(board_size.x) or target.y >= int(board_size.y):
+		return "目标越板"
+	return ""
+
+
+## 预读窗口域：单格档=点目标（线香真视单格；≤3×3 窄域契约内）；其余=3×3 窗口 ∩ 板内格（边缘受理——护栏只缩不扩）
+func _window_cells(row: Dictionary, target: Vector2i, board_size: Vector2i) -> Array:
+	var resolved: Array[Variant] = []
+	if String(row.get("target", "")) == "cell":
+		resolved.append(target)
+	else:
+		for dy in range(-1, 2):
+			for dx in range(-1, 2):
+				var c := target + Vector2i(dx, dy)
+				if c.x >= 0 and c.y >= 0 and c.x < int(board_size.x) and c.y < int(board_size.y):
+					resolved.append(c)
+	return resolved
+
+
+## 预读死窗判定：纯预读行窗口全已开 = 没东西可看（cell_unrevealed_cb = 排雷玩法 只读面）
+func _preview_window_dead(resolved: Array, cell_unrevealed_cb: Callable) -> bool:
+	var any_unrevealed := false
+	if cell_unrevealed_cb.is_valid():
+		for c in resolved:
+			if bool(cell_unrevealed_cb.call(c)):
+				any_unrevealed = true
+				break
+	return not any_unrevealed
+
+
 # ---- 叠加层（战斗结算逐 kind 应用——空间先、ap 后的序在编排侧钉死）----
 
 func apply_overlay(kind: String, cells: Array) -> void:

game/core/unit_container.gd

@@ -33,42 +33,58 @@ func _init(db_ref: ConfigDb) -> void:
 # （下标=行集行序，长度短于行集时缺省 -1 = 该行行值路径；空数组 = 全行定值）。
 # 逐行实例化、生成序 = 文件行序（行序即契约，敌人系统 v0.15）；行集实例总数（各行传入数量求和）
 # ≤ ENEMY_ROWSET_INSTANCE_MAX 守卫 fail-fast。
-func spawn(level_index: int, node_depth: int, hero_hp: int, unit_count_overrides: Array = [],
-		atk_override: int = -1, max_hp_override: int = -1, enemy_atk_overrides: Array = [],
-		hero_attack_type: String = "", hero_armor_type: String = "", row_kind: String = "battle") -> bool:
+# spawn 引用束（K6′ 签名束化——10 形参收单 Dictionary 束）：束键封闭词表——
+# 必载 level_index/node_depth/hero_hp；可选 unit_count_overrides=[]/enemy_atk_overrides=[]/
+# hero_atk_override=-1/hero_max_hp_override=-1/hero_attack_type=""/hero_armor_type=""/
+# row_kind="battle"（缺省语义与现行形参缺省逐字同值）。
+# enemy_atk_override：遭遇骰同流的 spawn 期整战持久 roll 结果
+# （-1 = 表值定值路径；≥0 = 行值替换后再乘关卡 atk_mult）。敌人系统 零随机纪律保持。
+# 行集受理：unit_count_overrides / enemy_atk_overrides 为**逐行数组**
+# （下标=行集行序，长度短于行集时缺省 -1 = 该行行值路径；空数组 = 全行定值）。
+# 逐行实例化、生成序 = 文件行序（行序即契约，敌人系统 v0.15）；行集实例总数（各行传入数量求和）
+# ≤ ENEMY_ROWSET_INSTANCE_MAX 守卫 fail-fast。
+func spawn(req: Dictionary) -> bool:
 	if _spawned:
 		push_warning("[敌人系统] Alive 相位重复 spawn（相位守卫）")
 		return false
 	# 行集数组口径（resolver 按 (L,band) 带寻址返回全部行、文件序）
-	var rowset: Array[Variant] = db.resolve_enemy_rowset(level_index, node_depth, row_kind)
+	var rowset: Array[Variant] = db.combat.enemy.resolve_rowset(int(req.level_index), int(req.node_depth), String(req.get("row_kind", "battle")))
 	if rowset.is_empty():
-		push_error("[敌人系统] 遭遇行解析失败/越域 (%d,%d,%s)" % [level_index, node_depth, row_kind])
+		push_error("[敌人系统] 遭遇行解析失败/越域 (%s,%s,%s)" % [str(req.get("level_index")), str(req.get("node_depth")), String(req.get("row_kind", "battle"))])
 		assert(false, "遭遇行悬空（R1 前置守卫）")
 		return false
-	var eff_atk: int = atk_override if atk_override >= 1 else int(db.hero.atk)
-	var eff_max_hp: int = max_hp_override if max_hp_override >= 1 else int(db.hero.max_hp)
+	if not _spawn_hero_unit(int(req.hero_hp), int(req.get("hero_atk_override", -1)), int(req.get("hero_max_hp_override", -1)), String(req.get("hero_attack_type", "")), String(req.get("hero_armor_type", ""))):
+		return false
+	var mod: Dictionary[Variant, Variant] = db.run.difficulty.resolve_modifiers(int(req.level_index), int(req.node_depth))
+	if not _spawn_rowset(rowset, req.get("unit_count_overrides", []), req.get("enemy_atk_overrides", []), float(mod.get("hp_mult", 1.0)), float(mod.get("atk_mult", 1.0))):
+		return false
+	_spawned = true
+	_despawned = false
+	return true
+
+
+## 英雄单位构建域：生效上限与类型轴快照（读注入值，空串回退锻造工坊配置默认值 normal/light）。
+## max_hp = 生效上限（非入参 hero_hp）——跨战斗携带 HP 时上限不得压扁
+## （恢复点/治疗包的满血守卫与治疗上限随之失效）
+func _spawn_hero_unit(hero_hp: int, atk_override: int, max_hp_override: int, hero_attack_type: String, hero_armor_type: String) -> bool:
+	var eff_atk: int = atk_override if atk_override >= 1 else int(db.combat.hero.atk)
+	var eff_max_hp: int = max_hp_override if max_hp_override >= 1 else int(db.combat.hero.max_hp)
 	if hero_hp > eff_max_hp or hero_hp <= 0:
 		push_warning("[敌人系统] hero_hp 入参越界（EC16）: %d" % hero_hp)
 		return false
-	# max_hp = 生效上限（非入参 hero_hp）——跨战斗携带 HP 时上限不得压扁
-	# （恢复点/治疗包的满血守卫与治疗上限随之失效）
-	_hero = {"hp": hero_hp, "max_hp": eff_max_hp, "atk": eff_atk, "is_hero": true, "alive": true, "display_name": String(db.hero.display_name), "enemy_id": "hero", "armor_type": hero_armor_type if hero_armor_type != "" else db.forge_default_armor_type(), "attack_type": hero_attack_type if hero_attack_type != "" else db.forge_default_attack_type()}   # 护甲/攻击类型轴快照（读注入值，空串回退锻造工坊配置默认值 normal/light；甲效矩阵消费面）
-	_enemies.clear()	# 难度曲线与Boss DifficultyTable 修饰：施加于行值、行值快照之前——MVP 空表 = 恒 1.0 无行为（AC-10）；混编行集内全部敌种同乘（(L,D) 精确匹配一次取值——F9 同乘不改变异，敌人系统 v0.15）
-	var mod: Dictionary[Variant, Variant] = db.resolve_difficulty_modifiers(level_index, node_depth)
-	var hp_mult: float = float(mod.get("hp_mult", 1.0))
-	var atk_mult: float = float(mod.get("atk_mult", 1.0))
-	# 逐行数量定值（敌人系统 零随机纪律——骰定在 战斗结算 遭遇骰层按行完成，本层收确定值；
-	# 行 i 数量 = overrides[i]（≥1 时）否则该行 unit_count 行值）
-	var per_row_counts: Array[int] = []
+	_hero = {"hp": hero_hp, "max_hp": eff_max_hp, "atk": eff_atk, "is_hero": true, "alive": true, "display_name": String(db.combat.hero.display_name), "enemy_id": "hero", "armor_type": hero_armor_type if hero_armor_type != "" else db.crossrun.forge.default_armor_type, "attack_type": hero_attack_type if hero_attack_type != "" else db.crossrun.forge.default_attack_type}   # 护甲/攻击类型轴快照（甲效矩阵消费面）
+	return true
+
+
+## 行集实例化域（难度曲线修饰施加于行值、行值快照之前——MVP 空表 = 恒 1.0 无行为〔AC-10〕；
+## 混编行集内全部敌种同乘——(L,D) 精确匹配一次取值，F9 同乘不改变异，敌人系统 v0.15）
+func _spawn_rowset(rowset: Array, unit_count_overrides: Array, enemy_atk_overrides: Array, hp_mult: float, atk_mult: float) -> bool:
+	_enemies.clear()
+	var per_row_counts := _row_instance_counts(rowset, unit_count_overrides)
+	if per_row_counts.is_empty():
+		return false
 	var total_instances := 0
-	for row_i in range(rowset.size()):
-		var row_i_dict: Dictionary[Variant, Variant] = rowset[row_i]
-		var ovr: int = int(unit_count_overrides[row_i]) if row_i < unit_count_overrides.size() else -1
-		var count: int = ovr if ovr >= 1 else int(row_i_dict.unit_count)
-		if count < EnemyTable.UNIT_COUNT_MIN or count > EnemyTable.UNIT_COUNT_MAX:
-			push_warning("[敌人系统] 行 %d 实例化数量越域（单种数域 [%d,%d]）: %d" % [row_i, EnemyTable.UNIT_COUNT_MIN, EnemyTable.UNIT_COUNT_MAX, count])
-			return false
-		per_row_counts.append(count)
+	for count in per_row_counts:
 		total_instances += count
 	# 行集实例总数守卫（行集构成纪律③——各行骰后数量求和 ≤4；骰后值加载期不可判，此处 fail-fast）
 	if total_instances > EnemyTable.ROWSET_INSTANCE_MAX:
@@ -99,11 +115,24 @@ func spawn(level_index: int, node_depth: int, hero_hp: int, unit_count_overrides
 				"is_hero": false,
 			})
 			handle += 1
-	_spawned = true
-	_despawned = false
 	return true
 
 
+## 逐行数量定值（敌人系统 零随机纪律——骰定在 战斗结算 遭遇骰层按行完成，本层收确定值；
+## 行 i 数量 = overrides[i]（≥1 时）否则该行 unit_count 行值）。越域行 = 空数组（受理拒绝信号）
+func _row_instance_counts(rowset: Array, unit_count_overrides: Array) -> Array[int]:
+	var per_row_counts: Array[int] = []
+	for row_i in range(rowset.size()):
+		var row_i_dict: Dictionary[Variant, Variant] = rowset[row_i]
+		var ovr: int = int(unit_count_overrides[row_i]) if row_i < unit_count_overrides.size() else -1
+		var count: int = ovr if ovr >= 1 else int(row_i_dict.unit_count)
+		if count < EnemyTable.UNIT_COUNT_MIN or count > EnemyTable.UNIT_COUNT_MAX:
+			push_warning("[敌人系统] 行 %d 实例化数量越域（单种数域 [%d,%d]）: %d" % [row_i, EnemyTable.UNIT_COUNT_MIN, EnemyTable.UNIT_COUNT_MAX, count])
+			return []
+		per_row_counts.append(count)
+	return per_row_counts
+
+
 # 实例池快照（proposal §2.2：开战把模板快照一份，冷却全零——与"生成拿到当时的表值快照"同一条
 # 快照纪律。触发条件：技能行 trigger 是字段权威——快照随读；带 latch 行写单向闩标记
 # trigger_latched 初始锁定；缺省无 trigger=无条件技）
@@ -115,7 +144,7 @@ func _pool_snapshot(row: Dictionary) -> Array[Dictionary]:
 			"weight": int(entry.get("weight", 0)),
 			"cooldown_left": 0,
 		}
-		var srow_snap: Dictionary[Variant, Variant] = db.skill_row(String(entry.get("skill_id", "")))
+		var srow_snap: Dictionary[Variant, Variant] = db.combat.skill.row_by_id(String(entry.get("skill_id", "")))
 		if srow_snap.has("trigger"):
 			snap_entry["trigger"] = (srow_snap.get("trigger", {}) as Dictionary).duplicate(true)
 			if bool((snap_entry["trigger"] as Dictionary).get("latch", false)):
@@ -218,7 +247,7 @@ func special_skills(u: Dictionary, facts: Dictionary = {}) -> Array:
 	for e in u.pool:
 		if _entry_blocked(e, u, facts):
 			continue
-		var srow: Dictionary[Variant, Variant] = db.skill_row(String(e.skill_id))
+		var srow: Dictionary[Variant, Variant] = db.combat.skill.row_by_id(String(e.skill_id))
 		if not srow.is_empty() and String(srow.type) != "basic":
 			out.append({"skill_id": String(e.skill_id), "weight": int(e.weight)})
 	return out
@@ -276,7 +305,7 @@ func commit_action(u: Dictionary) -> void:
 	if sid == "":
 		_diag("commit_action 无待发动作（兑现序违例）")
 		return
-	var srow: Dictionary[Variant, Variant] = db.skill_row(sid)
+	var srow: Dictionary[Variant, Variant] = db.combat.skill.row_by_id(sid)
 	var cd: int = int(srow.get("cooldown_beats", 0)) if not srow.is_empty() else 0
 	for e in u.pool:
 		if String(e.skill_id) == sid: