What is this page? Fast answers to the most common questions about integrity, ordering, ephemeris-free clocking, and public anchors in SSM-Clock Stamp.
Q1. Can I prove integrity and ordering fully offline (no servers, no PKI, no blockchain)?
Yes. The stamp binds exact bytes and a position in an append-only chain.
- File digest:
h_file = sha256(file_bytes)(oralgoviakv:algo). - Chain step:
chain_k = H_chain( ascii(chain_{k-1} + "|" + stamp_core) )withchain_0 = "0"*64.
Any byte change flipsh_file. Any deletion/reorder breaks the local chain.
Q2. How is the “human-checkable clock” computed without ephemerides?
From UTC only:wrap360(x) = x - 360*floor(x/360)theta_deg = wrap360( (unix_seconds / 86400) * 360 )rasi_idx = floor(theta_deg / 30)
Here iso_utc is YYYY-MM-DDThh:mm:ssZ. The values theta_deg and rasi_idx are interpretable, not random nonces.
Q3. Can I add a public “no-later-than” bound later without changing old stamps?
Yes. Publish a daily anchor (ASCII-only):rollup_D = sha256( ascii(Stamp_1 "|" ... "|" Stamp_n) ) using canonical sort by (iso_utc, stamp_core, chain).
This yields a public “no-later-than” time for that day’s set, while the original stamps remain unchanged.
Q4. What about leap seconds (23:59:60)?
Stamping during 23:59:60 is forbidden. Verifiers MUST reject any iso_utc that claims :60.
Q5. Can algorithms evolve without breaking older stamps?
Yes. Use the optional tail:|kv:algo=sha256;chain_algo=sha256;theta_prec=5;float=ieee75464;time_mode=derived_utc
Parsers ignore unknown keys. Verifiers recompute using declared algo/chain_algo.
Q6. How do multi-device chains avoid collisions?
Use provenance helpers (optional): kv:chain_id=<8hex>, kv:device=<ascii_token>. They aid merge safety without affecting verification logic.
Q7. What precision is used for theta_deg?
Fixed digits per theta_prec (default 5), with IEEE-754 binary64 round-half-to-even. Compare as strings.
Navigation
Back: SSM-Clock Stamp – Clarifications & Agility (0B)
Next: SSM-Clock Stamp – Core Ideas & Day-one Benefits (0D)
SHUNYAYA 