What a Deletion Certificate Covers, and Where It Expires: Auditable Removal from a Support-Vector Memory

We study deletion in a context memory that fits a support-vector boundary around stored keys and uses the resulting nonnegative coefficients to weight their values. An exactly zero coefficient lets us remove a key without changing the current normalized readout. In a three-key construction, however, a later admission makes the discarded key active in a solve over the full history. For a positive-weight key, a decremental update targets a refit on the remaining keys at the original coefficient cap, under its stated assumptions. Earlier standalone comparisons show close typical gate-score agreement, while similar keys with different values can yield larger readout differences. The journal extension tests chained deletions and admissions, checking coefficient feasibility and optimality conditions in both returned states and fresh references. The initial audit completes 66 of 80 trajectories and exposes numerical failures. A separately checked wrapper completes all 5,120 scheduled operations at unchanged acceptance thresholds, with eight initialization rescues and 84 update rescues. Its largest readout difference is 0.5273% of retained-value range. These finite results support explicit acceptance and rescue rules for the evaluated memory edits. They do not extend the current-state removal guarantee to arbitrary future admissions.