Original data
Exact object/member bytes and source/revision mapping. Hash-only assigns byte custody to the customer.
Evidence structures, hash trees, timestamps, trust context and their relation to Trusted LTANS REST resources.
Exact object/member bytes and source/revision mapping. Hash-only assigns byte custody to the customer.
An ERS or XMLERS record, timestamps and binding structures; not merely a JSON resource.
Certificates, paths and status material under evaluation time/policy; current sources cannot automatically replace history.
Policy revisions, renewal continuity and original/rendition relations; audit explains actions but does not replace ERS.
Freeze bytes, members, processing/order rules and syntax; retain inventory outside the cryptographic structure as needed.
Compute digests/tree paths under the applicable ERS/XMLERS profile; claimed digests are not byte verification.
Validate token, imprint, algorithm, TSA and certificate material before publication.
| Component | Role | Boundary |
|---|---|---|
| EvidenceRecord / ArchiveTimeStampSequence | RFC 4998 defines ERS structures requiring actual decoding/validation. | The JSON EvidenceRecord resource is not ASN.1 encoding. |
| Reduced hash tree | Binds member digests to timestamps through evidence structures. | Missing members/paths limit group validation. |
| XMLERS | XML model with its own RFC 6283 processing rules. | No simple relabeling/serialization conversion from ERS. |
| EvidenceRecord resource | Identity, syntax and references under the REST contract. | Resource retrieval does not prove cryptographic validation. |
| Decision | Input | Result |
|---|---|---|
| Timestamp renewal | Previous evidence; tree hash remains suitable. | New archive timestamp in the applicable chain. |
| Hash-tree renewal | Original data and prior evidence under the processing model. | Rehash, new tree, new timestamp and new chain. |
Hash-Tree Renewal requires access to the archived data and prior evidence required by the applicable Evidence Record processing model.
Timestamp and hash-tree renewal need different inputs. Preserve starting revisions, algorithms, tokens and continuation checks. Never alter original bytes to fit evidence.