snaproot: Decentralized File Integrity Verification Using Blockchain-Anchored Cryptographic Hashing

• URL: http://arxiv.org/abs/2606.10625v1
• Date: Tue, 09 Jun 2026 09:25:49 GMT
• Title: snaproot: Decentralized File Integrity Verification Using Blockchain-Anchored Cryptographic Hashing
• Abstract summary: We present snaproot, a lightweight system that implements the hash-anchoring paradigm of Haber and Stornetta on the Solana blockchain.<n> snaproot generates a SHA-256 hash of a file and stores it immutably on-chain as a permanent reference record.<n>We present a formal threat model, a security analysis grounded in the second-preimage resistance of SHA-256, and an empirical evaluation on Solana Devnet across file sizes from 1 KB to 500 MB.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rapid growth of digital content has made reliable integrity verification increasingly important. Existing solutions rely either on centralized authorities, which introduce trust dependencies and single points of failure, or on decentralized storage systems that incur prohibitive resource overhead. In this paper, we present snaproot, a lightweight system that implements the hash-anchoring paradigm of Haber and Stornetta on the Solana blockchain to provide efficient, decentralized file integrity verification. snaproot generates a SHA-256 hash of a file and stores it immutably on-chain as a permanent reference record. Verification is performed by recomputing the hash and comparing it to the stored value, yielding a deterministic binary outcome. We describe a four-tier trust architecture comprising three realized tiers and one prospective tier for long-term persistence beyond the lifetime of any single blockchain. We present a formal threat model, a security analysis grounded in the second-preimage resistance of SHA-256, and an empirical evaluation on Solana Devnet across file sizes from 1 KB to 500 MB. A central conceptual contribution is the explicit separation between existence proof, the key-independent claim that a file existed at a given time, and authorship proof, the key-dependent binding between a record and a specific wallet identity. This separation allows existence guarantees to survive key loss while preserving stronger authorship claims where keys are retained. We position snaproot against OpenTimestamps, OriginStamp, and Chainpoint and discuss limitations with respect to pre-registration manipulation and AI-generated content.

Related papers

• Safecloud: A Distributed, Encrypted Storage Cloud for Streaming [0.0]
  We present Safecloud, a distributed, encrypted, self-pricing storage and streaming network.<n>Each file is split into chunks, encrypted on the owner's device, and distributed across Drops and Jets.<n>Only the owner, or an authorised grantee, can decrypt.
  arXiv  Detail & Related papers  (2026-06-02T02:12:42Z)
• ElephantBroker: A Knowledge-Grounded Cognitive Runtime for Trustworthy AI Agents [45.88028371034407]
  ElephantBroker is an open source cognitive runtime that unifies a Neo4j knowledge graph with a Qdrant vector store.<n>The system implements a complete cognitive loop (store, retrieve, score, compose, protect, learn) comprising a hybrid five source retrieval pipeline.
  arXiv  Detail & Related papers  (2026-03-26T07:03:12Z)
• Decentralized Firmware Integrity Verification for Cyber-Physical Systems Using Ethereum Blockchain [0.42970700836450487]
  We propose a decentralized firmware integrity verification framework built on the blockchain.<n>Our system stores SHA-256 hashes of firmware binaries within smart contracts deployed on the Sepolia testnet.<n>A Python-based client tool computes firmware hashes and communicates with the blockchain to register and verify firmware authenticity.
  arXiv  Detail & Related papers  (2026-01-13T00:19:20Z)
• DESTinE Block: Private Blockchain Based Data Storage Framework for Power System [0.9809641612354518]
  DESTinE Block is a blockchain-based data storage framework designed for power systems and optimized for resource-constrained environments.<n>The proposed architecture leverages the InterPlanetary File System (IPFS) for storing large files while maintaining secure and traceable metadata on a custom blockchain named DESTinE Block.<n>The framework was tested on both an x86-based device and an ARM64-based Raspberry Pi, demonstrating its potential for secure, decentralized logging and measurement storage in smart grid applications.
  arXiv  Detail & Related papers  (2025-10-18T17:41:30Z)
• Fast Authenticated and Interoperable Multimedia Healthcare Data over Hybrid-Storage Blockchains [7.52489180846388]
  We propose an innovative scheme for underlineFast underlineAuthenticated and underlineInteroperable mulunderlineTimedia underlineHealthcare data storage and sharing over hybrid-storage blockchains.<n>Rather than user-side hash re-computations, FAITH lets an off-chain storage provider generate verifiable proofs using ZKPs.<n>For flexible access authorization, we leverage Proxy Re-Encryption (PRE) and enable the provider to conduct ciphertext re-
  arXiv  Detail & Related papers  (2025-10-15T09:07:31Z)
• Decompiling Smart Contracts with a Large Language Model [51.49197239479266]
  Despite Etherscan's 78,047,845 smart contracts deployed on (as of May 26, 2025), a mere 767,520 ( 1%) are open source.<n>This opacity necessitates the automated semantic analysis of on-chain smart contract bytecode.<n>We introduce a pioneering decompilation pipeline that transforms bytecode into human-readable and semantically faithful Solidity code.
  arXiv  Detail & Related papers  (2025-06-24T13:42:59Z)
• Registered Attribute-Based Encryption with Reliable Outsourced Decryption Based on Blockchain [12.205762282360482]
  Attribute-based encryption (ABE) is a promising solution that enables fine-grained access control in data sharing.<n>We propose the first auditable RABE scheme with reliable outsourced decryption (ORABE) based on blockchain.
  arXiv  Detail & Related papers  (2024-12-12T05:38:50Z)
• An Integrated Blockchain and IPFS Solution for Secure and Efficient Source Code Repository Hosting using Middleman Approach [0.9895793818721335]
  This study introduces a novel hybrid architecture combining the security of the blockchain and the InterPlanetary File System.<n>Our results demonstrate that this architecture achieves a secure, auditable, and resilient platform for source code hosting.
  arXiv  Detail & Related papers  (2024-09-22T16:57:38Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Combining Decentralized IDentifiers with Proof of Membership to Enable Trust in IoT Networks [44.99833362998488]
  The paper proposes and discusses an alternative (mutual) authentication process for IoT nodes under the same administration domain. The main idea is to combine the Decentralized IDentifier (DID)-based verification of private key ownership with the verification of a proof that the DID belongs to an evolving trusted set.
  arXiv  Detail & Related papers  (2023-10-12T09:33:50Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.