- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduce SANAI, a post-training, zero-memory-overhead error-correcting code framework that defence against both high random bit-error and targeted adversarial bit-flip attacks.
SANAI identifies sensitive layers via a lightweight sorting rule, encodes only their top MSB planes using shortened binary BCH codes, scatters protected weights across codewords via a secret-keyed permutation to prevent localized codeword overloading, and evicts the resulting parity bits cross-layer into the low-order bits of insensitive carrier layers using key-seeded Spread-Transform Dither Modulation (STDM). The authors provide analytical bounds on codeword survival () and the zero-memory protection ceiling (), evaluate the scheme across ten vision backbones and ten large language models (up to 13B parameters), and synthesize an inline streaming hardware syndrome detector on a 45nm systolic array.
Critical strengths
-
Cross-Layer Keyed Parity Eviction at Zero Memory Overhead: By decoupling BCH parity bits from protected layers and hiding them cross-layer in the LSBs of robust carrier layers via key-seeded STDM; SANAI allocates strong t=12 BCH protection without adding storage overhead or exposing co-located data and parity to simultaneous burst/Rowhammer corruptions.
-
Replacing the NP-hard mixed-integer linear programming (MILP) solvers of prior embedded-ECC methods with an sensitivity-guided sorting step and closed-form capacity bounds ( and ) allows the protection pipeline to scale seamlessly from compact CNNs to 13B-parameter LLMs and standard ONNX graphs without retraining.
-
Keyed Codeword Interleaving and Algebraic Sign-Bit Immunity: Combining a secret-keyed logical permutation () with the codeword group sizing rule disperses concentrated adversarial flips across codewords (via a balls-into-bins bound) and algebraically guarantees bit-exact recovery on protected layers against sign-bit-only attacks of arbitrary flip budget.
Critical weaknesses
-
Missing Contemporary Sign-Bit Attack and Embedded-ECC Baselines: The manuscript lack both discussion and comparisons against highly relevant data-free and single-pass sign-bit flip attacks and selective sign-bit hardening baselines, as well as recent zero-overhead steganographic/multi-tier embedded-ECC and DNN STDM watermarking works (Maximal Brain Damage Without Data or Optimization: Disrupting Neural Networks via Sign-Bit Flips, 2025; Stegano-ECC: Enhancing DNN Fault Tolerance with Embedded Parity for Important Bits, 2026; PoP-ECC: Robust and Flexible Error Correction against Multi-Bit Upsets in DNN Accelerators, 2025).
-
Asymmetric Localized Fault Model in Random/Burst BER Evaluations: The headline claim of sustaining clean accuracy up to BER (and the state-of-the-art burst-error comparisons against prior embedded-ECC schemes) relies on a localized fault model where only the protected layers ( of weights) experience bit flips while the remaining carrier layers (and LLM embedding/output heads) remain at BER, whereas uniform full-model corruption or parity overflow degrades accuracy substantially.
-
Algebraic Discrepancies in BCH Shortening, STDM, and Proofs: Several theoretical formulations require reconciliation, including shortened and parity counts ( and bits vs. the algebraic and bits, exceeding parent length ), dither cancellation and rounding/step-size () inconsistencies in Equation 4 and Proposition 3, the perturbation claim versus the operating point (which perturbs weights by up to quantization steps), and a numerical contradiction in the Appendix C random-fault lemma ().
-
SANAI uses incompatible layer-ranking policies across threat regimes (data-free weight magnitude for LLM random BER vs. labeled-prompt gradient probing for LLM attacks, where using the default magnitude ranking against AttentionBreaker results in protected flips and total collapse), excludes LLM token-embedding and output-head matrices that are prime targets for modern bit-flip attacks.
-
Hardware-Software Coexistence, LFSR Security, and Unmeasured Recovery Latency: The synthesized hardware checker (Design A) implements a uniform, un-interleaved, in-place detect-only tap whose bit-0 parity collides with the software STDM configuration, uses a degree-20 linear LFSR that is vulnerable to known-plaintext seed recovery under white-box weight inspection, and delegates all error correction to an off-chip software Berlekamp-Massey decoder whose runtime latency overhead is never measured.
-
AI comments concerns and incomplete information: The manuscript contains unedited template placeholders (<repeated-token garbage; paste literal excerpt> in Table 16, pending re-extraction notes in Table 13, and n.a./blank entries in Master Tables 3 and 9), impossible codeword statistics in Master Table 6 (e.g., cw > t = 5 when max/cw = 2), unaccounted coordinate metadata for weight-mode selection, and single-seed vision evaluations. This is highly concerning command and raise the questions if the authors read the paper fully before submission).
Questions for authors
Please address the weaknesses, and most important to me is the related work and placeholders (#1 and #6).
6 comments
Conditioned Score Raise
Dear Authors.
ICLR let you upload a revision of your manuscript.
In this response you promised many changes. I want to see good intention and at least partially update the manuscript I will positively think to raise my score.
With the current state of the manuscript I am still concerned.
Revised manuscript uploaded: changes and where to find them
Thank you for your valuable comments and for the opportunity to revise the manuscript. We have uploaded the revised PDF. The main text stays within the page limit; Section 7 still ends on page 10. All new and changed text is in blue so the changes can be found at a glance; the marking will be removed in the final version. The changes, with the places where they appear:
Presentation. Parity counts (48 + 77 stored as 88; 96 + 28 stored as 32) in Section 3.3 and Appendix A; the failure probabilities 1.2e-9, 3.4e-6 and 0.15 in Section 5.1; Equation 4 and Proposition 2(a) rewritten with the dither and the tolerance Delta/4; the Appendix C lemma at GK = 48, t = 12; the placeholders in Tables 14 and 17 resolved (Table 17 now shows the literal Llama-3-8B-Instruct and Qwen2.5-7B outputs clean, under a 500-flip attack, and after SANAI); Master Table A1 row A1.14 made consistent and row A1.14b added; the n.a. cell in Table L3.4 filled.
Code-aware attacker and two-tier configuration (new Section 5.6, Table 3, and new Appendix L, Tables 21 to 26). The attacker who knows the protected layers and planes is measured against the single tier (500 flips leave ResNet-18 at 10.4%, 50 flips leave ResNet-50/ImageNet at 0.0%, 500 flips leave Llama-3-8B-Instruct at MMLU 24.4) and then against the two-tier configuration, which reverses every attack on all five models to the embedded accuracy at zero added memory (ResNet-18 94.89, ResNet-50 94.57, ResNet-50/ImageNet 84.41, Llama-3-8B-Instruct 72.0 / PPL 11.13, Qwen2.5-7B 78.8 / 8.00), with no codeword over t. Appendix L adds the K dial on the low planes, the token embedding and output head included as a light-code tier (100 sign flips in the Llama embedding took MMLU from 71.4 to 24.0 when excluded; included, every attack returns to 71.6), the SBFA-style few-bit search, five repeated attack rounds with and without write-back, FP32 and BF16 ResNet-18, runtime of every step, RADAR and an equal-storage checksum re-implemented under the same attacks (24.19 and 16.02 against 95.09 and 94.93 after 200 PBS flips), and three attack seeds (94.94 +- 0.04 and 94.62 +- 0.05).
Related work and comparison table. Stegano-ECC, PoP-ECC, Maximal Brain Damage, SBFA and PrisonBreak are discussed in Section 2 and Appendix D, and Stegano-ECC and PoP-ECC are rows of Table 11.
Hardware (Section 6, Appendix M, Tables 28, 29 and new Table 31). Two updates to the reported Design A numbers: 8,584.44 um2, 0.61% of the accelerator, 2.59 ns, 0.864 mW, from a flow in which the Galois-field table of the syndrome unit is generated as explicit XOR logic and the RTL is re-verified in VCS (7,520 of 7,520 flags, zero mismatches); the flow is described in Appendix M and the rows that remain from the submitted flow are labeled. Table 31 measures the checker at t = 2, 4 and 8 (0.61%, 0.82%, 2.30% of the accelerator) and on arrays from 8x8 to 256x256 (7.5% of the PE array down to 0.073%), every variant inside the 10 ns cycle with zero stalls. The coexistence rule between the software and hardware codes is stated in Appendix M.
Discussion (Section 7). The fault model behind each claim, the single ranking policy, and how SANAI composes with encrypted weight memory (embed first; under counter-mode encryption a ciphertext flip is the same plaintext flip, so the checker and decoder work unchanged).
We will be glad to run any further experiment during the discussion period.
Baselines placed, fault model measured, algebra fixed, embedding and head protected, placeholders resolved, three-seed results added
We thank the reviewer; each concern is answered below.
Comment 1 (baselines). All three works are discussed below and will be added as rows to the submission's comparison table in the revision. Maximal Brain Damage is a data-free sign-bit attack; the sign bit lies inside the protected planes, so protected layers have the algebraic immunity of Section 3. Stegano-ECC and PoP-ECC target random errors: Stegano-ECC protects the two MSBs of each INT8 weight with Hamming SEC(7,4) (one error per codeword), parity in the LSBs of the same four-weight block; PoP-ECC is a two-tier parity-of-parity scheme (parities of virtual parities, channel-wise quantization). Both use one code for all layers at fixed parity positions; neither considers an attacker. SANAI differs in four ways: layers selected by sensitivity with multi-bit correcting codes (t=12 and t=4; t=2, 4, 8 in hardware) instead of single-error correction; parity embedded in the low planes of the weights, zero added storage; keyed parity location and weight-to-codeword assignment, so a scheme-aware attacker can neither target the parity nor overload a codeword; and a synthesized stall-free checker. STDM watermarking is cited for the embedding primitive. RADAR, re-implemented under our attacks, leaves 24.2% and 16.0% on ResNet-18/50 after 200 PBS flips, against 95.09 and 94.93 for SANAI.
Comment 2 (fault model). We measured uniform BER over the whole model: ResNet-18 after correction keeps 94.85%, 94.69%, 94.61% at 1%, 3%, 6% BER (unprotected 85.5, 32.0, 14.0). Master Table V1b of the submission (rows V1.36, V1.37) shows the uniform model at 12% BER: 89.3% keyed, 78.8% sequential, 10.8% unprotected. The localized model is the attack model, the uniform model the one the lemma addresses; the revised version names the model behind each claim.
Comment 3 (algebra). The strong code has 77 true parity bits stored byte-padded as 88, the light code 28 stored as 32; the text will give stored counts only. Equation 4 and Proposition 3 will use one step size with floor-to-grid before the dither; the perturbation claim is replaced by the measured embedding cost. Appendix C will use GK=48, t=12: 1.2e-9, 3.4e-6, 0.15 at 3%, 6%, 20% BER.
Comment 4 (ranking; embedding and head). One policy, gradient-weighted ranking, is used for all LLM runs; magnitude ranking is an ablation. Excluded as submitted, 100 sign flips in Llama's token embedding give MMLU 24.0 (from 71.4), 500 flips PPL above 1e6; the output head, MMLU 51 to 54. Included as tier-2 layers, all are repaired exactly up to 2,000 flips (Llama 71.6, Qwen 77.6) at 1.8 parity bits per weight, no extra planes. Embedding cost, measured by writing bits into the low planes of all weights: per-tensor INT8 weights are 3 to 4 quantization steps in median and cannot carry parity (plane 0 alone: Llama MMLU 31.6); per-channel weights are 17 to 19 steps and carry two planes free (Llama 71.0 to 69.6, Qwen 79.2 to 80.6; two-tier parity 72.0, 78.8), so the revision uses per-channel INT8.
Comment 5 (coexistence, LFSR, latency). Software performs the sensitivity-guided allocation, keyed interleaving, STDM embedding and the correction; hardware is the load-path syndrome check that flags a corrupted block without stalling. No collision: the submission's coexistence experiment runs both codes together, software parity in bit 1 and Design A's in bit 0 over the resulting payload; both decode at zero BER, accuracy 88 with Design A alone, 87 with both (86 unprotected), no false flag. Cross-layer STDM is the software-only placement; with the hardware tap, software parity uses bit 1. The LFSR is the prototype keystream; the checker takes one key bit per weight from any source, so a counter-mode cipher replaces it. Recovery latency: full decode 0.48 s (ResNet-18), 6.8 s (ImageNet); write-back 15 to 58 ms; flag one cycle after the block.
Comment 6 (placeholders). The Table 16 cell is the attacked-model output under the AttentionBreaker-style attack, which drives the model into degenerate decoding; the cell held a note instead of the tokens. We re-ran the prompts: Llama-3-8B under 500 flips (MMLU 72.0 to 67.6) gives fluent English with changed wording; Qwen2.5-7B (MMLU 78.8 to 29.0, PPL 138) answers two in Chinese and repeats "vegas" on the third. After SANAI all outputs of both models are identical, token for token, to the clean ones; the revised Table 16 will show them. In the revision, Table 13 and the blank cells of Master Tables 3 and 9 will be filled or dropped; the Master Table 6 row (codewords over t inconsistent with the per-codeword maximum) will be replaced from one logged run; the weight-mode coordinate list will be counted (layer mode needs one bit per layer). Three seeds: ResNet-18 after SANAI 94.94 +- 0.04 (two-tier, PBS 500), 94.65 +- 0.08 (uniform 6%); ResNet-50 94.62 +- 0.05, 94.54 +- 0.14.