- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper observes that trigger-based LLM fingerprints live in rare, semantically anomalous directions that KV-cache compression tends to discard, and proposes FinCa to make ownership evidence survive compression. FinCa (i) embeds a keyed rank-r perturbation into one Value projection so that ordinary inputs produce an input-conditioned signature in the cache, (ii) compresses the cache with a causal predictive codec that reserves the fingerprint subspace, allocates distortion via Fisher-weighted capped water-filling, and applies QIM on the reserved coordinates, and (iii) audits ownership by comparing reconstructed caches to a clean reference and running a Wald sequential test on calibrated H0/H1 score distributions. Experiments on ten open checkpoints report 0% BER and 100% exact recovery of a 2-symbol payload on 20 held-out WikiText-2 documents, with additional results under third-party cache policies, fine-tuning, and a comparison against seven prior fingerprinting methods.
Critical strengths
S1. A new and relevant angle. Treating inference-time KV-cache compression as a distortion channel for ownership evidence is, to my knowledge, not previously studied, and the idea of placing the fingerprint in the cache domain rather than in output behaviour is clean and well motivated.
S2. Careful audit design. The matched four-route protocol (C0/C1/F0/F1), the explicit calibration of QIM-induced bias under H0, and the pre-registered sequential test correctly separate weight-derived evidence from codec artifacts. This is more rigorous than most fingerprinting papers, which simply report trigger accuracy.
Critical weaknesses
W1. The threat model does not match the motivating threat, and this hollows out the main contribution. The introduction motivates the work with stolen weights redistributed by unauthorized parties, but the codec, authenticated cache traces, private decoder state, and QIM lattice are all executed by the deployer. A thief will not run the owner's fingerprint-preserving codec. The detection-constrained compression therefore only applies to a cooperative serving platform, where simpler attestation would suffice. Compounding this, the paper's own Appendix G shows the rank-2 perturbation already survives most third-party compression without the codec, so the problem the codec solves is largely absent for this signal.
W2. The headline comparison (Fig. 1, Table 5) is structurally unfair and partly undefined. FinCa keeps its carrier axes at 6 bits under its own codec while every baseline is pushed through KIVI-style INT2 plus eviction; the baselines are never given a protected subspace, so the table measures "protected vs. unprotected," not method vs. method. The adaptation of output-based methods (Trigger-set, UTF, EverTracer, DuFFin, LLMPrint) to "keys," "SNR," and "BER" in a KV channel is not explained; FinCa is listed at a 32x nominal factor though the main text reports approximately 3.2x; two FinCa rows (INT3/50% and INT2/50%) are numerically identical; and one entry reads Exact = 110.0%.
W3. The recovery results are close to vacuous because the payload is 2 bits, and the evaluation scale contradicts the long-context motivation. With r = 2, random guessing gives 25% exact recovery per document, so 0% BER across ten models says little about channel capacity; the ownership decision is actually carried by the continuous score and sequential test. The authors defer the payload-scaling study (where Phi conditioning degrades) to future work, but it is essential to the claim. All experiments use 96-token sequences and 20 audit documents, a regime in which no one compresses a KV cache, and the 20-document CIs (e.g., [83.2, 100]) are too wide to support "perfectly stable."
W4. Several reported numbers and protocol statements are internally inconsistent or implausible, which undermines trust in the empirical section. Clean WikiText-2 perplexities of ~1445 (Gemma 2 2B) and ~360 (Gemma 3 1B IT) are far above published values and suggest a tokenization/BOS bug, casting doubt on all Gemma delta-log-PPL claims. Min-SNR values of 1e5-1e7 arise from a near-zero variance denominator and are uninformative. Final-test Transfer ratios (3.06-3.82) exceed every search-trial value (<= 2.72) with no explanation. Section 4.2 says alpha, q, mu_max are fixed across models while Table 8 and Section 4.3 show them tuned per model. Table 6 promises FPR/TNR but reports only TPR/FNR. Robustness is also thin: fine-tuning erases the signal on Gemma 3 (10% TPR), and weight quantization, pruning, merging, and an adaptive low-rank-noise adversary are untested; no intrinsic baseline (e.g., REEF/CKA against the clean checkpoint) is provided under the same gray-box access.
Questions for authors
-
In the stolen-weights scenario, who runs the FinCa codec? If no one, what role does Section 3.2 play in that scenario?
-
How exactly are BER/SNR/Pass computed for the five LLM-fingerprinting baselines in Table 5, and how is FinCa run at 25% token retention given its codec has no eviction?
-
Why do final-test Transfer ratios exceed all search-trial values?
-
What are the clean, uncompressed perplexities of Gemma 2 2B and Gemma 3 1B IT under your pipeline, and how do they compare to published numbers?
-
How do BER, Phi conditioning, and compression ratio change for r = 8/16/32 and for 2k-32k-token sequences?