checksum-copy register · bound register page

Inventory Repeated Archive Fingerprints Without Deleting a Single File

Repeated filenames are weak evidence of duplication. Group an existing archive manifest by full fingerprints and byte counts, then count the copies beyond a stated retention scenario without touching the files.

1 · File code | SHA-256 hex fingerprint | byte count

FIRST-LOAD

HYPOTHESIS / PROTOTYPE — checkout unavailable. Calculation is local. A draft is saved automatically in this browser profile when storage is available; Reset to sample clears it. Optional Pro history stores only five summaries and has its own deletion control. State links encode your inputs and can remain in browser history, clipboard or recipients’ records; share only non-sensitive rows. Optional external AI formatting leaves this device. The required site analytics beacon reports page activity; shared URLs contain encoded inputs. Do not treat an encoded URL as private. The calculator has no input-collection endpoint.

Data note: This checksum-copy register calculates in the tab from File code | SHA-256 hex fingerprint | byte count. No input-collection endpoint, AI request or file upload is built into it. Drafts may be saved locally; explicit input-state links and optional external formatting can disclose the records. Use non-sensitive codes and clear the draft when finished.

Perspective: Before: repeated filenames seemed like removable clutter. After: full supplied fingerprints, consistent sizes and an explicit retention scenario define an auditable copy inventory.

2 · Read the checksum-copy register

Manifest inventory only: no file inspection, fingerprint verification, deletion action or backup guarantee. Keep tested independent backups and inspect actual files with trusted local tools or an archiving professional before any separate cleanup.

Paid layer: checksum-copy register filing layer

one-time step · the free reading above stays complete

hidden patterns detected after your first run

Free tier

one full, unwatermarked checksum-copy register App execution
three invented readings and unlimited calculations in the paired article demo
copy the complete working and boundary; voluntarily share non-sensitive input state

What $4 one-time adds

subsequent checksum-copy register App calculations through a browser-local convenience signal
boundary-preserving print and row-and-summary CSV of this checksum-copy register; conditional retyping budget uses only your entered minutes
five local headline/count/time summaries, separately deletable; full-input draft is separate and not a backup

HYPOTHESIS / PROTOTYPE: the proposed $4 one-time price concerns filing this checksum-copy register, not obtaining its answer. No checkout is available. An optional manual-retyping baseline computes a conditional one-export retyping budget; preparation, review, measured savings and buyer demand are not implied.

Local history (this device)

No saved runs yet — your first run files here.

Filing prototype — checkout unavailable

Checkout is unavailable. Browser-local, profile-scoped convenience gating is best-effort, not server-verified access. A URL or browser flag is not proof of payment. Clearing browser data removes local state; no account or cross-device recovery is provided.

Optional filing controls are a local prototype.

Checkout is unavailable. The reading above is complete; print, CSV and five local summaries are optional enhancements, not hidden answers.

Before using the checksum-copy register

Make a manifest using a trusted local hashing workflow before entering anything here. This register does not read files, compute fingerprints, check media, upload photos or delete data. Every example digest is invented, not a real file hash. Use file codes rather than private paths or family names. A SHA-256 digest is a long identifier, not encryption; the manifest can disclose archive structure. The copy setting is an inventory scenario, not a recommended number of backups. Two copies on one failing drive do not provide two independent recovery paths, and a digest match does not tell you which physical copy has sound storage.

Boundary and sources

Declared local method: Normalize hexadecimal case and group by the entire fingerprint. Require matching byte counts within every matching-digest group; a conflict stops the calculation as inconsistent metadata instead of picking a preferred size. For each row beyond the retained count, add its byte count once. Safe-integer bounds keep the summed byte inventory exact. Row workings show group membership, copy position, retained count and supplied size so the headline can be checked against the manifest.
Every sample code, measurement, date, price, fingerprint and scenario is invented. Artifact checks do not verify reader data, policies, actual files, tickets, votes or health/accessibility outcomes.
Google’s official Gemini pricing page, fetched 2026-10-01, lists AI Studio access in its Free section, limited model access and free input/output tokens. Free-tier content may be used to improve products. Optional external formatting may require an account; limits/access can change. Manual local entry needs none. Do not send sensitive records.

Mechanism: competence-autonomy-loop

Optional AI formatting, never the calculation

Manual entry completes this checksum-copy register for free without signup. If available to you, the free AI Studio interface linked in the sources may format fictional or non-sensitive notes; external access may require an account. No API key or AI call is built into this tool. Free-tier content may be used to improve products. Review each cell and transcribe it to the labeled row schema; do not paste the JSON object into the row box.

Format only these fictional or non-sensitive notes for a checksum-copy register. Return strict JSON shaped as {"rows": [{"label": "string", "cells": ["string", "string"]}], "setting": "string"}. The columns are File code | SHA-256 hex fingerprint | byte count; the setting is Copies retained per fingerprint group. Keep all supplied strings and quantities exactly; do not calculate, infer missing entries, invent dates or add advice. If any required value is missing, return an empty rows array and ask me for it separately. I will verify every cell against my source and manually transcribe rows using vertical bars before running the local calculator.

An AI response is not executed, fetched or trusted as a result. Missing values remain questions; the strict local parser checks the rows you actually enter.