Quote verification

This proves the quote below is recorded by Citatio exactly as displayed and has not been altered since it was committed and anchored. It documents Citatio's crawl observation; it does not imply endorsement by the source platform. The quote links to the original review.

“The limited number of passwords is perfectly sufficient for the most important ones.”

Checks (re-run on this request)

Proof data

Record hash (SHA-256)
4946de8024b2079b248da014c0370cb900ed03630c6453ca081ddb27b48f1a52
Signature (Ed25519, base64)
vmAmhHPauNmuNQfP7YcEaSuCTBzsT9xHS//kNYAad9rDEL6ggixcDny/YKHoJf48fgljJlfs7Rm/Ji4SuubiAg==
Merkle root
afb9ffbb4b4e88017e1c868247f919ebcfe69f09127d391e7daa08019eb2b63b
Merkle path
["494132d0c2178aca4d2a1c5247264fd9b28517942d8f3a5565e7d42c512a9a95","100bb30e1a480b4bfef26219c8248bd9d94e4bb2c677100cec296f904203ff85","e5487af137b68270be543119bb554354078b2b86313d57dbe624369833e60254","29075174472525b757f10387b7ba78a82970c19f5bf74db1adb829047716d677","23c6a69663ecb0cd846e12fc8068717f0412707976f703818aff3089ece1b8f1","fda31be9c12d87d48e80409c489b89a8a1b7ab1730fd6444018a8d9d27395e14","3d23d35b9fbdde91e58f63a2348a9059cd5ffed4a649e867608a4c99f0ed2cae","8d079a67c4297436d56f0f4b1c6b35586886b6466d6b9260c23f15df8907e3cf","644f069643ca4553559065c771420ace42bb878c2e118027e5ab7dd86a871d2e","a944b2bed0dcb518ce8dc9378f31a852a1846c9219113f6b05ae412a94b8ba04","9f372f75569a18e4bb05d863077337355bb923165d334ee979313fcba831d207","ed12f30047dd4c3669ec0c51ddd1fe0336b8b598549b0f1447b25501a6c42fa5","cfc6855eeb5cd3bfbc64cd1a8365b676fdd5adf536ee2637beb35214ad734bd3","15ecb20ce6559654c94b8b858c027c014996a92eb19771813db0b794d6214fb6","72bbc4ee0a973113b1d556f76d02fea2c4704794a0d313a96e49ff7b6174dec2"]
Anchored
2026-10-10
Public log entry
search.sigstore.dev, log index 3178115911 · entry 108e9186e8c5677a2bba…
Expected log hash
a144ffc32dfaa9fe45b4895b7f4c17280667152868dd8de227ca2811c60c870f The log entry's spec.data.hash.value must equal this value: the SHA-256 of the Merkle root string above. Recompute it yourself from the root to confirm.
Canonical record
{"dataset_version":"v1791604579182","kind":"published-quote","locale":"en","page":"theme:dashlane/price/en","quote":"The limited number of passwords is perfectly sufficient for the most important ones.","rating":4,"review_date":"2026-08-21","source":"Google Play","source_url":"https://play.google.com/store/apps/details?id=com.dashlane","v":1}

Verify in the public log

  1. Open the Rekor entry (pre-filled with this proof's log index).
  2. In the entry, compare spec.data.hash.value with the "Expected log hash" above: it is the SHA-256 of the Merkle root string (afb9ffbb4b4e…), which ties this proof's root to the log entry.
  3. Decode spec.signature.publicKey.content from base64: it must equal Citatio's published key at /.well-known/citatio-signing.json.
  4. The entry's integratedTime is the independent timestamp: the root, and with it this quote, existed no later than that moment.
  5. Locally, without any Citatio infrastructure: SHA-256 the canonical record (must equal the record hash), verify the Ed25519 signature against the public key, and fold the hash through the Merkle path (sorted-pair SHA-256) to reach the anchored root.