Repository navigation
Description
Current state: Proposed since 2026-10-29 with no linked PR; implementation and goal-acceptance owners are TBD, and the one review comment (2026-10-29) proposing Slice C acceptance cases has no author reply.
Decision needed: The initial online-quantization scope, the first model/engine/backend and skill set, the Skill Indexer's discovery role, and where evaluation criteria are frozen, from the maintainers.
Next action: The maintainers record those decisions and designate an acceptance owner; no implementer is assigned.
Status: Proposed for discussion. Prepared on 2026-10-29.
Governing implementation Issue and acceptance owner: TBD.
Decision requested
Add a small, source-grounded online quantization knowledge and skill set, and
define when the existing Skill Indexer should surface it. Focus on converting
weights during engine initialization, quantizing activations during forward
execution, and quantizing KV as the cache is populated and consumed. Separate
finding relevant guidance from selecting and executing an experiment.
The recommended first delivery combines reusable diagnosis and evaluation
procedures with one engine-owned online quantization procedure. Reuse collect and the
whole-resource selection delivered by RFC #128.
The host agent remains responsible for checking the task contract, choosing
experiments and acting within the user's authority.
This proposal defines knowledge and selection behavior. Automatic search
execution, new quantization kernels and performance claims require their own
accepted scope and evidence.
Meaning of online quantization
| Lifecycle | Scope in this RFC | Cost and state to track |
|---|---|---|
| Weight conversion during loading/initialization | Load the original model and create the selected low-precision runtime representation; retain it for reuse | Conversion and packing time, transient original/quantized copies, scale allocation and release of source buffers |
| Activation conversion during forward execution | Quantize current activations, with the scheme's declared scale computation and granularity | Range reduction, quantize/dequantize work, intermediate allocation, fusion and actual GEMM dispatch |
| KV conversion during generation | Quantize cache writes and consume/dequantize the stored representation through a compatible attention path | Cache and scale lifetime, read/write overhead, long-context error and reuse/reset behavior |
Weights converted once during initialization are not assumed to be re-quantized
for every request. Online conversion and dynamic scale estimation are separate
properties. A runtime KV path may use fixed, calibrated or dynamically computed
scales; each source must state which behavior it implements.
The vLLM online quantization documentation
describes load-time weight conversion from BF16/FP16 without a pre-quantized
checkpoint or calibration dataset, with scheme-dependent activation behavior.
This is an initial implementation reference, not a claim that every online
scheme is calibration-free or supported on every backend.
PTQ describes when quantization is introduced relative to training; online
describes when conversion occurs relative to loading and inference. Online
quantization can therefore be PTQ. Offline AWQ/GPTQ checkpoint production,
model calibration/reconstruction, checkpoint distribution and QAT belong to the
model-delivery workflow, outside this inference-engine optimization scope.
Serving an already quantized checkpoint alone does not satisfy
the online weight-conversion scope. Automatic per-request precision switching
and learning from live traffic are also separate proposals.
Model delivery and inference-engine responsibilities
For this RFC, offline quantized weights are a versioned model input. Producing
and accepting that artifact is model-delivery work. The inference engine owns
correct and efficient execution of the declared input and its runtime contract.
This boundary follows the changed artifact and behavior, even when both tools
ship in the same inference ecosystem.
| Work | Responsibility | Treatment in this RFC |
|---|---|---|
| Generate an offline quantized checkpoint; select its calibration data, reconstruct/fine-tune weights, validate quality and publish model/scale metadata | Model delivery and its quality owner | A separate model task; do not introduce it as a default inference-framework optimization candidate |
| Read an existing quantized checkpoint, interpret scales/zero points and preserve its declared numerical contract | Inference-engine compatibility | In scope as a prerequisite or compatibility procedure; loading support alone establishes no optimization gain |
| Repack an existing quantized representation without changing its declared numerical values, optimize quantized kernels, fusion, dispatch, scheduling and memory lifetime | Inference-engine execution | Eligible framework optimizations with numerical and end-to-end validation |
| Convert weights during loading, quantize activations during forward execution, or quantize KV during generation | Inference-engine runtime mechanism, constrained by the model-quality contract | The online optimization focus; effective precision changes require an explicit quality budget and full validation |
The LLM Compressor deployment workflow
provides a concrete interface example: a compressed model is prepared before
deployment with vLLM. Supporting that model format is engine work; preparing a
different model artifact is a different delivery outcome.
Consequently, replacing the original checkpoint with offline INT4 weights must
be reported as a model/deployment comparison. It cannot, by itself, support a
claim that the inference framework became faster. An engine comparison holds
the model artifact and effective numerical contract fixed while changing the
engine. A quality-constrained online comparison may hold the original checkpoint
fixed and change runtime precision, but must identify that approximation in the
claim; equal source-checkpoint bytes do not establish equal effective precision.
If both model artifact and engine change, retain separate controlled comparisons
before attributing their effects.
This responsibility boundary is distinct from SIAS plane selection. Choosing a
different quantization/precision policy changes the effective Model contract,
including when the conversion is implemented online. Optimizing its runtime
implementation under a fixed numerical contract is an Infra change. Declaring
online conversion an engine feature does not permit mixing both planes in one
campaign step or bypassing the model-quality owner.
Problem and existing coverage
The inspected source snapshot contains 79 SKILL.md files. A broad scan for
quantization, algorithm names and low-precision dtypes matches 24 bodies, including
incidental mentions and explicit exclusions. Two catalog records focus directly
on quantization:
| Existing owner | Reusable content | Evidence boundary |
|---|---|---|
| LMDeploy KV quantization | Capacity, long-context quality and latency tradeoffs; retain the throughput regression | Upstream report; locally_verified=false |
| MiniMax-H3 CUDA MXFP8 | Selective DiT conversion, sensitive components, loading peaks and quality limitations | Upstream candidate report; locally_verified=false |
| Ascend model adaptation | FP8 checkpoint scale handling and source-scoped dequantization during loading | Compatibility guidance; not native low-precision speed evidence |
| AscendC tiling and h3.c precision | Specific MXFP8 matmul and Metal INT8 numerical/dispatch contracts | Scoped source analysis; no transferable service result |
No dedicated online quantization SKILL.md was found. The existing H3 and KV
records are useful starting points for runtime mechanisms. The gap is a complete
procedure connecting bottleneck diagnosis, conversion/scale lifetime, effective
kernel dispatch, quality evaluation and end-to-end measurements.
These counts describe the inspected local checkout, not today's upstream main.
There is also a software-version difference:
| Component | Inspected behavior | Consequence for this RFC |
|---|---|---|
Local build_skill_index.py |
Generates catalog projections from the canonical registry and source hashes | Continue to use it; add no second catalog generator |
Local catalog.py / KnowledgeReader.collect |
Catalog search has lexical scoring; local Collect uses token filtering and identity order | They are different operations; do not infer task selection from either |
| Upstream Collect contract, inspected on 2026-10-29 | RFC #128 delivered opt-in relevance ranking and context_bytes, complete mandatory resources and explicit omissions |
Base integration on that delivered contract; reconcile the target checkout before implementation |
RFC #128 accepted its bounded software/evidence delivery without accepting a
lower-cost, preserved-quality claim. This proposal adds quantization cases to
that work; it does not reopen its closeout or assume skill-selection efficacy.
Issue #220 reports an
exploratory failure mode relevant here: quantization material filed under a
diffusion owner was missed for an audio weight-traffic problem. It also reports
discarding procedures because a profiling tool was unavailable. These are
hypotheses for selection cases; the issue's exploratory setup and unavailable
raw evidence do not establish general effectiveness or authorize new runs.
Knowledge and skill additions
Organize by mechanism and preserve source ownership
Use the existing knowledge-base contract. Repository and
framework owners retain implementation facts; generic methods explain how to
reason across implementations. A reference to another owner permits investigation,
not transfer of its compatibility or validation status.
| Mechanism | Initial knowledge to acquire | Questions each entry must answer |
|---|---|---|
| Online weight conversion | Supported load-time FP8/INT8 and lower-bit paths; extend existing H3 material | Conversion point relative to loading/adapter fusion, scales and packing, source-buffer release, duplicate copies and dispatch? |
| Runtime activation quantization | Supported dynamic integer/FP8 paths and quantization/GEMM fusion | Range reduction granularity, outliers, accumulation dtype, shape constraints, allocation/synchronization and total forward cost? |
| Runtime KV-cache quantization | Extend LMDeploy material and inspect the selected engine's cache implementation | Scale computation and lifetime, actual bytes including metadata, head constraints, long-context quality and read/write cost? |
| Selective online conversion | Layer/component sensitivity and supported per-layer runtime choices | Which components retain original precision, when is the choice fixed, and how is it reproduced without tuning on final holdouts? |
| Diffusion and multimodal execution | Extend existing H3/component owners before adding generic recipes | Which repeated projections benefit; how do adapters, conditioning and decoder paths interact with conversion and complete-output quality? |
Keep algorithm, representation, artifact format and execution backend distinct.
INT4/FP8 describe representations with additional scheme details; an online
conversion setting does not identify the kernel that actually executes.
Weight-only, weight-and-activation, KV and transport quantization address different
bytes and quality contracts. Communication compression is a separate candidate;
quantizing linear weights does not by itself reduce collective traffic.
Seed the source review from the official
vLLM online quantization guide,
vLLM KV-cache contracts and
torchao inference workflows,
which distinguish weight-only and dynamic activation configurations. Prioritize
actual load/forward/cache code paths and the existing H3 source readsets over
offline checkpoint-production recipes. Record exact
implementation revisions and license/readset information during acquisition.
These sources identify candidate mechanisms, not an accuracy or speed ranking
for an InferRSI workload.
Deliver a bounded initial skill set
The following paths and IDs are proposed, not registered capabilities:
Proposed owner/path under src/inferrsi/data/skill_library/ |
Procedure and required output |
|---|---|
methods/assess-online-quantization-opportunity/ |
Identify the limiting bytes/work, permitted approximation, conversion lifecycle and backend prerequisites; produce a conditional shortlist with amortization, counter-signals and the next check |
methods/validate-online-quantization/ |
Freeze initialization/warmup, scale-state policy, development/held-out separation, quality and performance boundaries and required levels; produce a campaign-specific evaluation specification |
repositories/vllm/online-quantization/ |
Apply one compatible online scheme to an original model through the selected engine; produce conversion/scale settings, dispatch and lifetime checks, reproducibility and recovery instructions |
Reuse performance-ceiling-analysis, optimization-search-policy,
inference-benchmark-design, the existing evidence workflow and model validators.
The evaluation method should specify quantization-specific inputs and checks,
while linking common benchmarking and claim procedures instead of copying them.
Keep new library bodies and their resources in English.
Begin with one declared model/engine/backend combination, chosen in the
implementation Issue. Extend the H3/vLLM-Omni owner when the target task is a
repeated audio/video projection, and use torchao-owned guidance when its runtime
path fits the task. Supported engine configuration and a custom quantized kernel
are separate delivery slices; neither requires an offline conversion pipeline
as a prerequisite. Training, offline conversion and adaptive serving policies
remain separately scoped.
Record applicability and evidence once
Use existing JSON and skill sidecars for descriptions, tags, applicability,
sources, limitations and verification. Add mechanism-oriented discovery terms
such as weight bandwidth, model residency, online quantization, load-time conversion, dynamic activation, KV capacity, scale lifetime, activation outliers and quality-sensitive. Relevant English descriptions should
explain the trigger in ordinary language. Evaluate Chinese task prompts as well;
the caller can supply equivalent English mechanism cues without adding another
alias registry. Avoid keyword stuffing or making every skill a quantization hit.
Each acquired entry must preserve:
- Source identity, version/readset, attribution and license; paper versions and
implementation commits remain distinct provenance. - Model/component, engine/backend/device, scheme/granularity, scales/zero points,
packing/layout, accumulator, shape and parallelism constraints; conversion timing,
scale origin/update scope, source-buffer release, explicit fallback behavior and
the evidence needed to confirm actual dispatch. - Required initialization, calibration if applicable and evaluation assumptions,
sensitive modules, negative results, failure modes and a minimal verification plan. - Separate paper/upstream observations, source-derived guidance and qualified
local experiments; import or green CPU CI does not promote validation.
Do not create a parallel quantization registry or duplicate per-record summaries.
Place source-specific records in their existing contribution/dependency/peer
owners. A new knowledge-only source does not require an executable repository
adapter. Register approved skills in skill-index.json, then regenerate projections
from committed source using the existing generator. Update the two matrices to
describe actual coverage and its evidence limits; do not add a third matrix.
When the Skill Indexer should select online quantization material
Separate discovery from experiment choice
The internal Skill Indexer selects relevant owners and whole resources through
collect. Its lexical score is a relevance signal. The host agent interprets
that material against observed task facts and chooses the next action.
flowchart TD
A["Task goal and observed target facts"] --> B["Collect: relevant skills and complete resources"]
B --> C["Host agent: contract, bottleneck and compatibility checks"]
C --> D["Missing facts: diagnosis or contract clarification"]
C --> E["Eligible mechanisms: compare next experiments"]
E --> F["Existing runner: frozen campaign and validators"]
F --> G["Retain outcomes; reassess the limiting stage"]
G --> B
An explicit request about online quantization should retrieve its guidance even when
hardware or quality inputs are missing. Knowledge discovery needs no experiment
authorization. Missing inputs determine the next investigation or clarification;
they must not hide relevant knowledge or imply readiness to execute.
When the task is inference-framework optimization, keep offline checkpoint
production outside the default candidate set. If diagnosis suggests it as a
possible alternative, name it as a separately scoped model-delivery dependency.
An explicit offline-quantization request should retrieve or hand off to model
preparation guidance, with that different scope stated. An existing offline
quantized model may still need engine compatibility/kernel guidance; its origin
does not exclude optimization of its execution.
For a general optimization request, surface online quantization diagnosis when the task
facts suggest one of the following mechanisms:
| Observed signal | Material to select | Next check / counter-signal |
|---|---|---|
| Required steady-state weight residency exceeds capacity | Load-time weight conversion and complete-pipeline memory inventory | Check whether conversion can start within the available memory. Coexisting original/converted weights or fusion buffers can still OOM; do not assume a streaming loader |
| Repeated weight reads dominate exposed decode/GEMV time | Once-per-initialization weight conversion, selective routing and compatible kernels | Check reuse count, batch/shape regime and unpack/dequantization; avoid re-quantizing invariant weights each forward |
| KV allocation limits the required context or concurrent requests | Runtime KV quantization and engine cache contracts | Include scales/metadata, cache write/read cost, long-context quality and attention support; retain latency regressions |
| Dominant GEMM/attention work has a supported low-precision path | Runtime activation plus compatible weight/attention quantization | Measure scale estimation, conversion, synchronization and the complete operator path; a faster GEMM alone is insufficient |
| Dynamic quantization error follows activation ranges/outliers or batching | Scale-granularity and sensitive-module guidance | Confirm per-token/group/tensor behavior and batch dependence; an outlier statistic alone does not show performance headroom |
| Selective online conversion fails quality while most components remain acceptable | Fixed per-layer/component exclusions and precision choices | Change one declared component set, evaluate complete outputs, and keep holdouts sealed |
| Short worker lifetime or strict startup budget | Initialization and amortization guidance | Compare the conversion cost with the expected useful workload; online conversion does not shrink the original download or disk artifact |
| Host scheduling, I/O, codec/VAE work or collectives dominate | Skills for that measured owner; quantization may be a secondary lead | Reconsider quantization only if it affects the limiting bytes/work or changes feasibility |
Selection should happen at task intake for explicit quantization/fit requests,
after initial measurement for general speed requests, and again when a change
moves the bottleneck. A model that cannot start may use source-grounded memory
accounting and a bounded feasibility probe before profiling is possible.
Conditions before candidate experiments
The host agent should choose a quantization experiment only when the following
conditions have a concrete answer:
- Allowed change. The task permits the relevant numerical approximation and
effective model/runtime changes. Preserving original checkpoint bytes does not make
runtime quantization an exact transformation. If the task requires exact
parity or unchanged effective precision, route to compatible alternatives. - Relevant mechanism. The hypothesis names the component and bytes/work it
can remove, and relates them to the actual objective. A capacity experiment
and a latency experiment may have different objectives. - Executable path. The selected model, scheme, engine revision, device,
shapes and parallelism have a compatible implementation or an explicitly
scoped implementation task. Use the engine's actual support contracts, such
as the vLLM hardware/implementation table,
then check effective dispatch on the target. Branding alone is insufficient. - Frozen evaluation. The acceptance Issue defines the quality, memory,
performance and stability requirements, required levels and stop conditions;
plan/andvalidator/are frozen before candidate search. Unknown quality
tolerance permits investigation, not an assumed default tolerance. - Affordable lifecycle. Initialization conversion, any required calibration,
runtime scale/conversion overhead, engineering and validation fit the delegated
resource budget and objective. Preserve a restartable incumbent and recovery
path. A documented calibration-free path must not be blocked for lacking a
calibration dataset; it still requires frozen quality evaluation.
Do not require every exact optimization to fail first. Compare eligible
quantization and exact mechanisms by objective relevance, plausible removable
time/bytes, uncertainty and total experiment cost. Use observed stage fractions
and appropriate attainable envelopes; no universal memory, utilization, quality
loss or gain percentage decides the choice. Quantization can change the work and
traffic, so the current high-precision roofline is not its performance ceiling.
For reused weights, compare the extra initialization cost against the useful
work over the declared worker lifetime. For activation and KV conversion, include
the recurring overhead in each measured path; it cannot be amortized as a one-time
load cost. Use matched timing boundaries and avoid summing overlapping profiler
durations as though they were exposed service time. A warm-service objective may
exclude initialization from its primary metric only when that boundary is frozen
in the plan; initialization time and peak memory must still be reported.
Explain selection and abstention
For each shortlisted mechanism, the agent should report its supporting
observation/source, applicability gaps, strongest counter-signal, next check and
reason for its relative priority. This can live in the existing task/campaign
plan; this RFC introduces no decision database or required response schema.
Distinguish missing evidence from known incompatibility. If a profiling tool is
unavailable, retain the skill's diagnosis and seek supported measurement or
accounting alternatives. Do not discard all of its guidance or fabricate a
profile. A failure under one engine/shape/device is a counter-signal for that
scope, not a universal ban on the quantization family.
These are planning recommendations, not new experiment verdicts. Campaigns keep
only PASS, FAIL and INCONCLUSIVE under the existing evidence contract.
Indexer integration and compatibility
Recommend content and selection cases first. Use the upstream #128
relevance/context_bytes opt-ins and exact-version reader instead of adding a
public quantization router, mandatory metadata schema or model-based reranker.
Better descriptions and mechanism cues are the first intervention. A structured
applicability filter is a separate follow-up only if labeled cases show that
content changes cannot address the selection errors.
- Preserve default query/filter/order behavior and explicit-ID membership/order.
The existing token-AND query can exclude cross-domain owners before relevance
ranking: the caller must deliberately broaden discovery rather than silently
bypass its filters. Investigate a mechanism across owners, then qualify it for
the target model and backend. - Eligible generated skill projections retain
kind=knowledge. Ordinary imported
records, checkout skills and cases use their existing reads; do not relabel
them to force entry into the packaged-skill ranking scope. Combine independent
knowledge and skill discovery at the caller when needed. - Preserve canonical Bundle closure, qualified refs, exact revisions and hashes.
materialretains its existing meaning; selected context is a separate view. - Return complete core, mandatory prerequisites, provenance and licenses. If the
mandatory set exceedscontext_bytes, report the whole-owner omission with
required/available bytes. Never emit a truncated procedure as ready to apply. - Treat
index_unavailable,context_limit, no-match and unsupported scope as
explicit limitations. Resolve them through the existing read/budget choices;
retrieval omissions do not establish technical incompatibility.
Evaluation and evidence
Validate discovery and decisions separately
Extend the existing Skill Eval and selection contract
tests. Freeze labeled cases before tuning descriptions or selection behavior;
separate development cases from held-out cases. Labels specify relevant owners,
required counter-signals and the appropriate next action, not one universally
best quantization algorithm.
| Case | Expected behavior |
|---|---|
| Weight-bandwidth-bound audio decode; source example filed under diffusion | Find online weight-conversion guidance and the source lead; require target-specific qualification |
| Long-context capacity pressure with otherwise adequate weight residency | Select KV guidance; do not substitute weight-only quantization without a hypothesis |
| OOM caused by VAE decode or fixed-adapter loading peak | Identify the actual peak owner before recommending DiT weight conversion |
| Exact-output contract or explicit approximation prohibition | Explain the exclusion and select compatible optimizations |
| Explicit online quantization research with missing hardware/quality budget | Return guidance and the missing inputs; do not claim experiment readiness |
| Already quantized model; host-launch-bound service | Diagnose host overhead rather than automatically reducing bit width |
| Online conversion succeeds but GEMM/attention silently executes a fallback | Require dispatch evidence before using the low-precision speed hypothesis |
| Framework optimization request; a search hit proposes offline AWQ/GPTQ checkpoint production | Explain the model-delivery boundary and select runtime/engine candidates; do not silently replace the model input |
| Existing offline INT4 checkpoint; inefficient packing or kernel dispatch | Select compatible execution optimization while holding that model's declared numerical contract fixed |
| Faster service after changing only the offline checkpoint | Attribute the comparison to the changed model/deployment; do not claim an engine implementation gain |
| Calibration-free online path with no calibration dataset | Permit the documented path when other experiment conditions hold; still require quality validation |
| Quantized residency fits, but conversion temporarily holds both weight copies | Reject the assumed fit or investigate a supported staged loader; do not count only final residency |
| Low-precision GEMM is faster but range reduction/conversion dominates | Compare the complete forward/service path and retain the regression |
| Invariant weights are converted on every forward | Check initialization ownership and reuse before treating the kernel result as an optimization |
| Missing profiler or an undersized context budget | Preserve the diagnosis or report complete-owner omission; never fabricate evidence or cut prerequisites |
| Same source failure on different hardware or workload | Preserve the original failure and investigate changed conditions |
Report relevant-owner recall, wrong-family selections, unsafe experiment
recommendations, correct abstentions, required-resource coverage and omission
handling. Numeric acceptance bars belong in the accepted evaluation Issue and
frozen plan, not reusable skills or CI defaults.
For task effects, compare the same client, task facts, available tools and
budgets with and without the new content; evaluate selection changes in a
separate contrast so content and selector effects are distinguishable. Retain
all outcomes, tokens, latency and missing observations. Offline labels establish
software/selection behavior; separately authorized agent trials establish only
their scoped task outcomes. Neither establishes an engine speedup.
Validate an actual online quantization campaign
Record <baseline_sha>, <candidate_sha>, <campaign-id>, the original model
manifest, tokenizer/preprocessing, conversion/kernel revision and configuration,
component exclusions, scale policy, initialization order and actual runtime
dispatch. Identify any calibration inputs or supplied scale metadata only when
the selected path requires them. The original checkpoint stays the common input;
a separately produced quantized checkpoint is not a prerequisite. When no runtime
artifact is serialized, bind the effective representation through its construction
code, original input hashes, complete settings and recorded numerical checks;
do not invent an artifact hash. Extend campaign-owned manifests first; add no
RunSpec field or generic configuration interface solely for this RFC.
Keep development/search evaluation and sealed final acceptance inputs distinct.
If calibration or warmup-derived scales are used, freeze their input identities,
update/reset policy and separation from final evaluation. Final measured requests
may compute per-input dynamic scales as defined by the frozen algorithm; do not
silently turn them into cross-request training/calibration state. Include the task's domains, lengths, languages and
modalities; PPL, tensor error or a single media example cannot replace complete
task quality. Hold sampling, geometry, steps and useful work constant except for
the declared approximation. Record sensitive data through approved identities
and access controls rather than publishing raw private prompts or paths.
Use L0 for quantize/dequantize and operator contracts, L1 for complete real-shape
operator paths, L2 for loading/dispatch/component integration, L3 for complete
model/modality quality and L4 for service claims. Select the required ladder in
the acceptance Issue. In particular, verify:
- Weights convert at the declared initialization point, source buffers are
released as specified, and adapter/fusion changes invalidate or rebuild affected
representations. Record transient and steady memory separately. - Activation scale granularity, numerical edge cases, batch/shape dependence and
complete conversion/GEMM cost match the declared policy, including compile/graph
capture and warmup behavior where used. - KV scales and storage stay paired through append, attention reads, prefix
reuse, request reset and cancellation. Long-context quality and repeated-request
state checks cover the selected cache implementation.
Report cold conversion/startup time and peak, steady residency, complete warm
execution, any calibration cost and stability separately. A smaller runtime
tensor or faster single GEMM does not establish service gains.
Separate a matched-workload comparison from a capacity experiment that increases
concurrency or context under the same memory budget. Retain conversion overhead,
scale/packing memory, failed requests and regressions. Quantization strategy
changes belong to the declared Model plane; runtime/kernel implementation belongs
to Infra when its numerical contract stays fixed; changing selection/evaluation
belongs to Harness. Use separate campaign
steps and frozen controls, following contributing.
Delivery plan and acceptance
| Slice | Deliverable | Acceptance boundary |
|---|---|---|
| A: source acquisition | Review initial primary sources, record applicability/licenses/counter-signals, reconcile existing owners | Traceable content and documented omissions; no hardware verification claim |
| B: knowledge and skills | Add the bounded skill set, canonical records, navigation, registry projections and two-matrix mappings | Links/resources, metadata/generator drift, catalog reads and installed-package access verified |
| C: discovery and decision cases | Add frozen development/held-out cases to existing selection/Skill Eval infrastructure | Compatibility, complete-resource delivery and decision quality assessed separately |
| D: target campaign | One accepted model/engine/backend online comparison from the same original checkpoint, using existing runner and validators | Complete issue-scoped evidence including conversion lifecycle; L3 quality and L4 required for a service gain claim |
Open or reuse an accepted scoped Issue before implementation. Assign its outcome
owner and independent reviewer for bounded slices; report PR readiness separately
from Issue completion. Protected knowledge changes follow the existing
authorship admission policy, with truthful model
and effort declarations. Campaign gates and research-source provenance remain
separate. Draft/ready/merge/nightly retain their existing roles; add no default
model downloads, paid calls, accelerator jobs or campaign thresholds to CI.
The RFC decision can accept a phased plan without accepting all proposed skills
at once. Knowledge delivery, improved selection and quantization performance are
three independently evidenced outcomes.
Alternatives and open decisions
| Option | Tradeoff | Recommendation |
|---|---|---|
| Add references/tags only | Cheap and useful for discovery, but leaves lifecycle, overhead and quality workflow gaps | Use for existing owners alongside the small procedure set |
| Generic assessment/evaluation plus an engine procedure | Reuses existing owners and exposes cross-domain mechanisms while keeping executable steps specific | Start here |
| Automatic quantization planner with a new schema and optimizer | Adds semantic selection, search and integration costs before their benefit is measured | Defer pending labeled failures and task evidence |
Decisions for maintainers:
- Confirm the initial scope: weight conversion at initialization, runtime
activation conversion and runtime KV quantization. Offline checkpoint
production and its quality acceptance belong to model delivery; support for
loading/executing those artifacts remains an engine responsibility. Training
and automatic per-request precision policies stay separately scoped. - Choose the first model/engine/backend and whether its first procedure belongs
to vLLM, H3/vLLM-Omni or torchao. Confirm the bounded initial skill set and owner. - Agree that Skill Indexer discovery may surface conditional quantization
guidance, while the host agent applies the experiment eligibility checks. - Freeze selection/task evaluation criteria and the target campaign's quality,
resource and performance gates in their respective accepted Issues.
Ownership and completion
- Actual requester: the human requester in the authoring chat; RFC publication explicitly requested.
- Acting contributor: Codex, for drafting and publication.
- Status: Proposed.
- Accountable implementation owner: TBD.
- Goal-acceptance and closure owner: TBD; to be designated by maintainers.
- Authorized scope: prepare and publish this RFC. Implementation and campaign execution require their own accepted scope.
- RFC completion criteria: record decisions on the scope, initial skill set, first target and evaluation criteria; link accepted follow-up Issues and retain deferred or unresolved items. Publication alone does not satisfy those decisions.
Activity
Dong1017 commentedon Oct 29, 2026
增量设计 review:把跨来源检索与多语言归因落实到 Slice C 验收
复核当前 #254 正文及 main
ab03f3ffb8f2e5bc02c304828c5c41890eef673e。本次仅讨论检索链路的可核验性,不评价量化方案的硬件效果,也不增加 router、reranker 或实验门禁。正文已经明确:packaged-skill 排名不覆盖所有知识来源,caller 需要组合发现结果;中文任务可以补充等价英语机制线索。这两个边界是合理的。建议进一步落实到 Slice C 的具体验收案例,否则“新增 skill 被命中”仍可能被误当成“实际跨领域任务已找到必需来源”。
1. 同时检查新 skill 命中和原始 source lead 可达性
当前
KnowledgeReader.collect()的候选范围限制 在relevance is not None and ids is None时,只接纳package下的index_type=packaged-skill记录;普通 peer/contribution 记录与 checkout skills 不会自动加入这条排名结果。随后仍应用 token-AND 查询过滤,提高 relevance 分数不能挽回已经被 query 排除的 owner。具体风险:“音频 weight-bandwidth 问题,来源位于 diffusion owner”的案例,可能只命中新写的通用量化 skill,却没有让 agent 获得方案所依赖的原始来源和限制条件。仅统计新 skill 的 recall 会漏掉这一失败。
**建议的最小验收:**为这个跨领域案例保留真实调用参数(
query/relevance/kind/ids/context_bytes等)、预期 owner/ref,以及 caller 组合普通知识发现与 skill 发现的步骤。分别断言新 skill 命中、原来源可达、必需材料实际交付;再覆盖收紧 query 后失配、预算不足导致完整 owner omission 的负例。链接可达与材料已经交付应分开记录。复用现有 reader 与测试即可,不需要新增公共 API。2. 分开评价原始中文输入与 caller 的英语改写
现有 query 使用
casefold().split()后的词面匹配。当中文请求经过 caller 改写为英语机制词后才命中,得到的是含改写步骤的组合链路效果,不能单独归因于 Indexer 原生跨语言能力或新知识内容。**建议的最小验收:**同一个冻结案例保留原始中文请求、显式标准化的机制线索,以及最终传入 reader 的参数;分别报告两条路径的召回、错误 owner 和必需资源遗漏。需要改写时说明执行者与规则。后续评价内容增益时固定该改写/查询策略;评价 caller 或 selector 改善时另设对照,避免同时改变内容和输入策略后无法归因。
这两项是对已提出边界的验收细化建议,不是认定当前 RFC 与既有实现冲突。验证限于静态正文和源码检查;未运行测试、模型调用或硬件实验。本评论不构成实现、执行、合入或 Issue 完成授权。