Preprint
Article

This version is not peer-reviewed.

Financial Document Authentication and Verification Using Hierarchical Tokenization on Permissioned Blockchains

A peer-reviewed version of this preprint was published in:
Journal of Risk and Financial Management 2026, 19(4), 239. https://doi.org/10.3390/jrfm19040239

Submitted:

18 February 2026

Posted:

25 February 2026

You are already at the latest version

Abstract
Document authentication remains a pressing challenge in various domains, including financial services, academic credentialing, healthcare, and supply chain management. Existing centralized verification systems are vulnerable to manipulation, inefficiency, and limited transparency. Blockchain technology, with its immutability and tamper-resistant capabilities, offers a strong decentralized alternative; however, many current implementations lack structured, issuer-bound relationships for documents. This paper proposes a blockchain-based model that leverages a hierarchical token structure to authenticate and trace the provenance of high-value digital documents, with a focus in financial records. The model introduces the concept of an issuer-bound parent token and document-linked child tokens, enforcing a structured trust relationship between a legitimate institution and the documents it issues. By combining on-chain cryptographic hashing with off-chain file references, the approach is designed to balance verifiability with scalability. We implement a proof-of-concept using Ethereum-compatible smart contracts on a permissioned blockchain and evaluate it in a consortium-style financial setting. Our functional analyses demonstrate the model’s ability to ensure document integrity, provenance, and resistance to document fraud. This work offers a practical and extensible foundation for secure digital document authentication and verification in financial and other trust-sensitive settings.
Keywords: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

1.1. Background and Motivation

The proliferation of forged documents in finance, education, government, healthcare, and other domains undermines trust in digital workflows. Although familiar, centralized verification suffers from single points of failure, low transparency, and easy tampering. As processes digitize, we need mechanisms that ensure document authenticity without re-centralizing trust. Manipulation is now prevalent with consumer tools: high-resolution scans, editable PDFs, and convincing templates. In forensic contexts, image/spectral detection methods are used; however, image-processing approaches are often complex and time-consuming, while spectroscopy can be more accurate but harder to implement, so no single method is at once simple, accurate, automatable, inexpensive, and non-destructive (Al-Ameri et al., 2023). However, most verification occurs outside specialized forensic settings, requiring methods that integrate into everyday operational workflows. This gap becomes costly at scale.
The financial impact of document fraud is material: Europol categorizes document fraud as one of the ‘engines of organized crime’, citing financial scams as one of the broad spectrum of criminal activities it is linked to; Switzerland has averaged over 4,200 seized fraudulent IDs annually since 2007; Frontex recorded over 8100 fraudulent documents and 6,700 implicated travelers per year in 2017-2018 (Baechler, 2020). Online supply scales the problem: a longitudinal dark-web study reported over AUD 1.8 million in ID-related sales over 2.5 years and found that over 80% of ID-related listings were digital products (e.g., scans/images/templates of identity documents) (Devlin et al., 2024). Beyond financial contexts, falsified vaccine cards show how authentic-looking records can undermine policy and public health decision-making (Ali et al., 2024).
Classical integrity safeguards like public key infrastructure (PKI) and cryptographic hashing are useful but often impractical for everyday users; therefore, user-friendly schemes use secure QR codes that link verification to an issuer-controlled service/database, improving usability but reintroducing reliance on the issuer’s infrastructure (Szyjewski, 2023). Blockchain technology popularized by Bitcoin (Nakamoto, 2008) uses a peer-to-peer network and a hash-linked, time-stamped ledger that becomes computationally impractical to alter, allowing participants to share a consistent history without a trusted intermediary. By distributing records across a network of nodes and securing them with cryptographic mechanisms, blockchains can protect the integrity of valuable information against counterfeiting, unauthorized modifications, and other threats. Blockcerts, an open standard for issuing and verifying blockchain-based official records (including academic credentials), enables recipients to hold and share credentials and supports verification via blockchain proofs (Blockcerts, n.d.). In cross-border trade, where blockchain is used for trade documents, a systematic literature review finds that blockchain is best framed as an infrastructural trust layer rather than a universal remedy, especially when integrated with complementary systems (Böhmecke-Schwafert, 2024), and in multi-organization processes, its core contribution is not just immutability but cross-organizational capabilities—shared visibility, aggregation, validation, automation, and resilience, supporting auditable records and coordinated workflows (Yerpude et al., 2022). Blockchain-based traceability research shows that provenance/traceability information (e.g., origin and handling history) is critical alongside content integrity for reducing counterfeit risk (H. Lee & Yeon, 2021). These applications demonstrate that blockchain can support tamper-resistant recordkeeping and verification, strengthening defenses against document fraud in various contexts.
The work by H. Lee & Yeon (2021) also highlights the harm done to brand trust and marketplace credibility, making issuer/source provenance worth paying attention to. In credentialing and identity systems, issuer provenance is often formalized via the Self-Sovereign Identity (SSI) paradigm. SSI structures issuer-credential relationships using Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs). Credentials carry an issuer signature and can be checked against public identifiers/registries, enabling independent validation without contacting the issuer (Nita & Mihailescu, 2024; Satybaldy et al., 2022). Privacy-preserving identity wallet methods (e.g., selective disclosure, Zero-Knowledge Proofs (ZKPs)) further reduce the exposure of data during verification (Podda et al., 2025). We do not implement SSI (DIDs/VCs) or ZKPs in this proof-of-concept; we reference SSI as established context for issuer provenance. Our divergence is to enforce issuer-document lineage and non-transferability, complementing SSI-based models.
Tokenizing documents involves representing documents as non-fungible tokens (NFTs) on a blockchain, allowing the encoding of metadata and ownership information for each document. Existing blockchain document systems typically rely on two separable steps: (i) anchoring document hashes/off-chain pointers on-chain—used in both untokenized and tokenized designs—and, for tokenized designs specifically, (ii) minting flat ERC-721 (non-fungible token standard) tokens that require verifiers to infer issuer authority primarily from the legitimate issuer/organizer smart contract address (Susik et al., 2023) (often obtained from an official website or curated list), rather than from an explicit on-chain hierarchy. Since NFTs were made to be tradable or transferable (which is undesirable for credentials/documents), a malicious actor can decide to transfer a document token without authorization. Soulbound tokens (SBTs) have been proposed as non-transferable tokens held by a wallet (‘Soul’), representing commitments, credentials, and affiliations, and potentially revocable by the issuer (Weyl et al., 2022), and Rejectable SBTs extend SBTs by enabling holder acceptance/rejection and producing on-chain non-repudiation evidence of issuance and reception (Pericàs-Gornals et al., 2024). However, these approaches do not encode a formal issuer-document hierarchy. Similarly, academic credential verification prototypes typically register and verify each credential as a standalone record (e.g., degrees verifiable via QR codes and hash-based queries) (Quispe & Pacheco, 2025), rather than enforcing an on-chain issuer-credential hierarchy at the token layer. The missing piece is an on-chain structure that ties each document token to its issuing authority, with non-transferability enforced by smart contract logic. We do not implement soulbound logic in full; we only focus on the non-transferability aspect.
We adopt hierarchical tokenization: a hierarchical, non-transferable token model in which an issuer’s identity is a parent Organization Token (OT) and each document is a child Document Verification Token (DVT), under that parent. Non-transferability blocks post-issuance sale or reassignment of tokens; an on-chain hash anchors the integrity of an off-chain payload; and the system runs on a permissioned blockchain. Compared with hash anchoring and flat ERC-721 NFTs, hierarchical tokenization (a) binds issuer-document at the contract layer, (b) eliminates ad-hoc issuer inference, and (c) creates traceable issuer-document lineage, reducing false-acceptance risk for financial documents (Know-Your-Customer (KYC) files, loan packages, trade/claims evidence) while remaining domain-agnostic.
Because the model targets institutional verification workflows, the deployment environment matters. Deployment note: Public blockchains introduce concerns regarding transaction costs, privacy, and performance. A permissioned blockchain can mitigate these issues by limiting the number of participants, offering configurable fees/throughput, and utilizing more efficient consensus protocols. We therefore use a permissioned network under role-based governance for token issuance. As an example of how permissioned blockchains operationalize governance, Zhai et al. (2023) show that permissioned document workflows use role-separated peers, certificate-based membership/authority control, and private channels, enabling traceable document state changes within a consortium of known participants. Precht et al. (2026) report that blockchain-based document management systems frequently externalize payloads off-chain (about 68%, commonly via IPFS) while anchoring verifiable on-chain references (e.g., hashes/pointers) for scalable integrity checks, and further shows that implementations span both public and enterprise platforms, with permissioned frameworks such as Hyperledger Fabric and private Ethereum deployments among the common enterprise platforms in this space. From an accounting/audit perspective, Georgiou et al. (2024) emphasize that in private/permissioned settings, assurance depends on governance, and internal controls around the blockchain; auditors shift from testing transactions directly to evaluating blockchain controls and governance (e.g., code quality, protocol changes, and power allocation among peers), since blockchain use alone does not necessarily assure reporting reliability. Our model aligns with that view. The implementation details—node roles, consensus mechanism, network configuration, and storage mechanics—appear in a later section.

1.2. Problem Statement

  • In high-value contexts, trust must extend beyond the file integrity to provenance—the document’s origin under an issuing authority. Common designs lack a natively enforced issuer-document linkage; verification often traces addresses or registries rather than reading a formal on-chain relationship. Also, document NFTs are flat and transferable (unsuitable for personal and specific records), and on-chain storage is costly. We design a system for an institutional context, finance-first but domain-agnostic, that (i) cryptographically binds each document to its issuer with tokens, (ii) prevents post-issuance sale or transfer of document tokens, (iii) keeps verification simple and traceable, and (iv) fits role-based, permissioned deployments.
The high-level research question is “Can a hierarchical token model be used to achieve efficient, verifiable document authentication on a permissioned blockchain, improving provenance assurance, tamper evidence, and traceability for financial documents, while remaining applicable across domains?” This paper aims to design and implement a system that addresses all the stated requirements in unison.

1.3. Research Objectives

By achieving the following objectives, this paper aims to address the above challenges:
  • Design a hierarchical tokenization model that encodes a structured issuer-document (parent-child) relationship.
  • Implement smart contracts using ERC-721 and ERC-6150 (hierarchical token standard) with necessary features to support the parent-child token logic and non-transferability.
  • Integrate an off-chain storage solution for the document payloads while maintaining verification integrity through on-chain cryptographic hashes.
  • Deploy the proposed system on a permissioned, Ethereum-compatible multi-node network with governance and access control, mirroring a controlled institutional environment.
  • Simulate issuance/verification workflows and conduct a functional evaluation to show that the system preserves document trust and provenance without incurring excessive gas costs or computational overhead, confirming practical feasibility.

1.4. Research Contribution

This work is a proof-of-concept implementation that contributes the following to the state-of-the-art blockchain-based document authentication:
  • A theory-led hierarchical tokenization model that enforces issuer-document lineage on-chain and prohibits token transfer.
  • A smart contract realization of hierarchical NFTs (ERC-6150), with a form of soulbound behavior (non-transferability), tailored to document verification.
  • An on-chain/off-chain strategy that preserves scalability and recomputable proofs in the context of the proposed model.
  • A four-node, permissioned deployment that demonstrates feasibility and mirrors institutional governance and controlled access.
  • A domain-agnostic verification high-value document verification framework, prioritizing financial documents as the initial use case.

1.5. Paper Outline

The remainder of this paper is organized as follows: Section 2 reviews related work. Section 3 (Materials and Methods) details the hierarchical model and its components, presents the system architecture and network configuration, and algorithms, while describing the authentication and verification workflow in a financial scenario. Section 4 (Implementation & Results) reports execution evidence and screenshots, a verifier-user interface walkthrough, functional evaluation of the PoC, and basic/security tampering tests. Section 5 (Discussion) interprets the findings, outlining the limitations, and broader implications. Section 6 concludes with key findings and directions for future work.

3. Materials and Methods

The section describes the hierarchical tokenization method used to implement an issuer-bound document authentication prototype on a permissioned blockchain. The method digitally represents an issuing organization and their authenticated documents using a two-tier token system deployed as smart contracts. An Organizational Token (OT) and Document Verification Tokens (DVTs) are arranged in a parent–child relationship, with smart contracts enforcing minting rules, storing minimal metadata, and linking on-chain state to off-chain document storage for integrity and scalability enhancement.

3.1. Overview of the Hierarchical Model

The hierarchical model, illustrated in Figure 1, introduces a two-level token structure. At the core is the parent Organization Token (OT), a non-transferable NFT representing the identity of a verified institution (e.g., a financial institution, regulator, or certifying body). Once issued, the OT holder is the only entity permitted to mint children, non-transferable Document Verification Tokens (DVTs). Each DVT represents a verified document (e.g., an audited financial statement or audit report) and is cryptographically linked to its parent OT. DVTs are ‘lightweight’ in the sense that they store only essential metadata on-chain, such as a document identifier, cryptographic hash, and storage pointer, while the full document remains off-chain.
This structure serves three main objectives:
  • Issuer-bound verification. DVTs cannot exist independently; they are hierarchically linked to a legitimate OT, anchoring each document to its issuing institution.
  • Scalability and efficiency. On-chain data is minimized to hashes and references, while large document content is stored off-chain.
  • Governance and control. Only OT holders are authorized to mint DVTs, aligning token issuance with real-world institutional hierarchies and internal controls.
Figure 1. The proposed hierarchical token structure linking an Organization Token (OT) to its Document Verification Tokens (DVTs).
Figure 1. The proposed hierarchical token structure linking an Organization Token (OT) to its Document Verification Tokens (DVTs).
Preprints 199473 g001

3.2. Model Components

The hierarchical tokenization method comprises a permissioned blockchain network, Organization Tokens (OT), Document Verification Tokens (DVTs), their parent–child relationship, an off-chain storage and integrity layer, token-standard choices, and smart-contract logic.

3.2.1. Permissioned Blockchain Network

The model is deployed on a permissioned blockchain, where participation is restricted to authorized institutions and verifiers. A legitimate organization can mint an Organization Token (OT) and associated Document Verification Tokens (DVTs), its approved members can participate in consensus, and only authorized verifiers access the verification interface. Unlike public blockchains, a permissioned network provides fine-grained access control, institutional governance, and predictable performance, all of which are essential for document authentication in regulated financial and institutional contexts. Vetting members and controlling verifier access ensures that users query immutable, tamper-evident records from trusted nodes.

3.2.2. Organization Token (OT)

Each OT is a unique, non-transferable NFT representing an institution’s digital identity within the network. It serves as the parent anchor for all DVTs issued by that institution. OT metadata stored on-chain includes the token ID, token name, and a URI pointing to off-chain organizational metadata. Only the authorized organization node (admin) is permitted to mint an OT, ensuring a controlled and auditable issuance process. Non-transferability prevents impersonation or trading of institutional identity and guarantees that only a verified institution can issue document tokens.

3.2.3. Document Verification Token (DVT) and Document Requirements

A DVT is a non-transferable child token linked to a parent OT. It represents a specific document authenticated by the issuing organization, such as an audited financial statement, regulatory filing, license, or academic transcript. On-chain DVT metadata includes the DVT token ID, the parent OT ID, a cryptographic hash of the document and a URI pointing to the off-chain file. Only the owner of the OT can mint DVTs associated with it, preserving issuer authenticity. Non-transferability maintains the permanent link between each document and its issuing organization, preventing resale or misattribution of verified documents. Once minted, a DVT serves as durable, tamper-evident proof that a particular document instance was issued by the institution.
To ensure reliable hash-based verification, the model assumes that documents used for DVTs satisfy the following requirements:
  • Static and finalized. Documents are in their final form at issuance and are not edited afterward.
  • Deterministically hashable. Files use formats that yield stable hashes (e.g., PDF, XML) without dependence on external resources.
  • Self-contained and time-independent. Content and structure do not change based on access time, environment, or external links.
  • Institutionally approved. Each document reflects the institution’s official, authoritative version at the time of issuance.
  • Material significance. Only documents whose authenticity materially matter (e.g., certifications, contracts, high-value records) are tokenized.
  • Verifiable access. Documents remain accessible for verification, either publicly or through controlled access mechanisms.
These assumptions ensure that the DVT mechanism can be securely applied across domains while preserving document integrity and long-term trust.

3.2.4. Parent–Child Relationship

The model enforces a strict hierarchical relationship between the OT and DVTs. Every DVT must reference an existing OT via the parent token’s ID. This relationship is encoded in the smart contract and is fully verifiable on-chain. The linkage guarantees the origin traceability, prevents orphaned or unauthenticated tokens, and enables efficient hierarchical queries, such as retrieving all DVTs issued under a particular OT or resolving the parent OT for a given DVT.

3.2.5. Off-Chain Storage and Integrity Proofs

The Documents themselves are not stored on-chain due to storage limitations and gas costs. Instead, organizations use secure off-chain storage, such as IPFS/Pinata or institutional document management systems. The blockchain records a Keccak-256 hash of each document alongside a URI or link used to retrieve the file. OT metadata JSON files can also be stored off-chain, with their URIs referenced from the OT. This design balances scalability and trust: large documents remain off-chain, while integrity is enforced through cryptographic linkage between the on-chain hash and the retrieved file.
Figure 2 illustrates the combined metadata architecture of the OT and DVTs within the hierarchical model. Core metadata is stored on a permissioned blockchain—DVT ID, parent OT ID, parent token name, document hash, and URIs—while the underlying files reside off-chain. This separation enables decentralized, tamper-evident verification without incurring excessive on-chain storage costs.

3.2.6. Token Standards Compliance

The model builds on NFT token standards. ERC-721 provides the basic non-fungible token interface but lacks native support for hierarchical relationships. Implementing parent–child links solely with ERC-721 requires additional manual mappings in the smart contract.
To model issuer–document hierarchies more naturally, the design adopts concepts from ERC-6150, which introduces native parent–child token logic. At the contract level, key elements include:
  • Implementing parentOf(tokenId) and childrenOf(parentTokenId) functions.
  • Overriding the _transfer function to enforce non-transferability for the OT and DVTs.
  • Internally mapping each DVT to its OT via a stored parentTokenId.
Table 1 summarizes how ERC-721 and ERC-6150 compare for this hierarchical document-token use case.

3.2.7. Role of Smart Contracts

Smart contracts form the enforcement layer of the hierarchical token model. They define:
  • Which address is permitted to mint an OT
  • How DVTs are created and linked to their parent OT
  • The rules that disable token transfers.
  • How document hashes, URIs, and other metadata are stored immutably on-chain.
These rules ensure that only verified institutions issue authenticated document tokens, preserving the trust model without centralized oversight. The logic is implemented in Solidity contracts deployed on the permissioned network and provides a transparent, auditable mechanism for token creation, hierarchy management, and metadata integrity.

3.3. System Architecture

The system architecture instantiates the hierarchical OT–DVT model (Section 3.2) on a permissioned Ethereum-compatible blockchain and integrates it with off-chain storage and verification tools. Figure 3 shows the logical architecture, while Figure 4 depicts the four-node Hyperledger Besu topology.

3.3.1. Logical Architecture

As illustrated in Figure 3, the system comprises the following components:
• Minting interface (Remix IDE + MetaMask) - The issuing institution uses Remix IDE, connected to MetaMask, as an administrative interface to deploy the Solidity contracts and to invoke minting functions for the Organization Token (OT) and Document Verification Tokens (DVTs) during the proof-of-concept.
• Permissioned Besu network - A Hyperledger Besu network, configured with Clique Proof-of-Authority (PoA), hosts the OT–DVT contracts and maintains the ledger state. All token operations (minting, metadata queries) are recorded as transactions in this network
• Hierarchical token smart contracts - Custom Solidity contracts implement ERC-6150-style parent–child logic for the OT and DVTs. On-chain metadata is kept intentionally lightweight and includes the DVT token ID, parent OT ID, the Keccak-256 hash of the underlying document, and a URI pointing to the off-chain payload. Contract logic also enforces access control and non-transferability for the OT and DVTs and kept extensible for optional revocation behavior.
• Off-chain storage and IPFS integration - To optimize storage, documents and auxiliary JSON metadata are stored off-chain using IPFS, with a pinning service (Pinata) ensuring persistence. When a document is uploaded, IPFS returns a content identifier (CID), which can be expressed as a content-address URI. This URI, together with a Keccak-256 hash of the original file, is then submitted to the mintDVT() function. The smart contract stores the documentHash and documentURI as the DVT’s verification fingerprint and lookup pointer; no document content is stored on-chain.
Verifier web interface and hashing logic - A lightweight HTML/JavaScript front end, implemented with Ethers.js, connects to the verifier node to retrieve DVT metadata. The verifier web interface connects to a read-only RPC endpoint on the dedicated verifier node described in Section 3.3.2. Given a DVT ID, the interface:
o Queries the contract for the parent OT ID, document hash, and URI.
o Downloads the referenced file from IPFS.
o Recomputes the Keccak-256 hash in the browser (using the same logic as the Python-based hashing script used at minting time).
o Compares the recomputed hash with the on-chain hash to return an authenticity verdict to the user.
This architecture provides a full path from token issuance to independent verification, while keeping on-chain storage minimal and preserving institutional control over token minting.

3.3.2. Besu Topology, Deployment, and Permissioning.

Figure 4 shows the four-node Hyperledger Besu topology used to implement the permissioned network configured with the Clique Proof-of-Authority (PoA) consensus protocol:
• Organization node - Participates in consensus and is the minting authority for the OT and DVTs. It is the node connected to the administrative (Remix) interface, and its Ethereum address is whitelisted to submit state-changing transactions.
• Two consensus-only nodes - Participate in consensus but do not mint tokens. They improve network resilience, availability, and fault tolerance by maintaining additional replicas of the ledger.
• Verifier node - Maintains a synchronized copy of the blockchain but does not participate in consensus. It exposes a read-only RPC endpoint used by the verifier web interface for metadata queries, ensuring that verifiers cannot alter network state.
All four nodes run in isolated Docker containers orchestrated with Docker Compose on a shared bridge network. The Compose configuration specifies RPC ports, peer-to-peer networking, and custom genesis settings (Clique PoA). Static peer discovery and node-level permissioning restrict participation to the four authorized enode identities, while account-level permissioning ensures that only the organization node’s address can submit state-changing transactions.
This deployment confirms that the hierarchical token model can operate on a private, multi-node, permission-controlled Ethereum-compatible network, with clear separation among node roles: minting authority, consensus-only (validator-only), and read-only verification.
Figure 3. Logical system architecture linking the minting interface, Besu permissioned network, off-chain IPFS storage, and verifier web interface.
Figure 3. Logical system architecture linking the minting interface, Besu permissioned network, off-chain IPFS storage, and verifier web interface.
Preprints 199473 g003
Figure 4. Four-node Hyperledger Besu topology showing the organization node, two consensus nodes, and a read-only verifier node.
Figure 4. Four-node Hyperledger Besu topology showing the organization node, two consensus nodes, and a read-only verifier node.
Preprints 199473 g004

3.4. Blockchain Platform Selection and Justification

Building on the requirements outlined in Section 3.2 and Section 3.3, the blockchain platform must support hierarchical NFTs for document authentication in a permissioned, consortium-style environment. In such settings, institutions require tamper-resistant ledgers and strong provenance guarantees, but also practical control over membership, governance, and operating costs.
Permissioned blockchains are therefore preferable to permissionless networks such as Bitcoin or public Ethereum because membership can be restricted to identified entities, transaction validation can be limited to authorized validators, and governance can be tailored to audit and compliance requirements (Faccia et al., 2022)
For this hierarchical token-based document authentication system, the platform must in particular:
• Allow the authenticity of documents to be determined solely by authorized institutional actors, without external intermediaries.
• Provide an immutable, auditable record of token issuance and verification, visible to all authorized participants.
• Restrict participation to known, identifiable members of the consortium, with configurable read and write permissions.
• Support high-volume transaction processing without significant performance degradation.
• Enable automation of issuance and verification workflows through smart contracts.
• Protect sensitive document data by keeping only hashes and metadata on-chain and relying on permissioned access and off-chain storage, rather than advanced privacy schemes such as zero-knowledge proofs or fully private contracts.
These requirements lead naturally to an Ethereum-compatible, permissioned platform that can support hierarchical NFTs and standard Ethereum tooling.

3.4.1. Selection Criteria.

Based on the above, the following criteria were defined for choosing the blockchain platform:
• Ethereum compatibility - Full support for the Ethereum Virtual Machine and standard token interfaces (e.g., ERC-721 and ERC-6150-style hierarchies), enabling flexible smart-contract implementation of OT–DVT relationships.
• Consensus flexibility for permissioned networks - Support for configurable Proof-of-Authority consensus mechanisms (such as Clique, IBFT 2.0, or QBFT), allowing organizations to trade off finality, validator count, and fault tolerance.
• Permissioning and governance - Native support for node-level and account-level permissioning so that only authorized entities can participate in consensus, mint tokens, or access network data, consistent with consortium governance models.
• Deployment flexibility - Support for Docker-based on-premise or cloud deployment, with the ability to customize network parameters, node configurations, and access-control policies to match organizational security requirements
• Enterprise readiness and tool integration - Compatibility with standard Ethereum tools (Remix, MetaMask, Ethers.js) for contract development, deployment, and front-end integration, and strong auditability through smart contracts.
• Scalability and performance - Demonstrated ability to support substantial transaction volumes and document-token issuance in permissioned, multi-node deployments (Khan et al., 2025; Pierro et al., 2024).
• Pragmatic data protection - Emphasis on permissioned membership, role-based access control, and off-chain storage of payloads, rather than reliance on advanced privacy mechanisms that are not implemented in this proof-of-concept
These platform capabilities (permissioning and PoA options) are documented in Hyperledger Besu’s official documentation (Hyperledger Foundation, 2025).
These criteria ensure that the chosen platform can support hierarchical tokenization, controlled governance, and efficient verification workflows in a realistic enterprise setting.

3.4.2. Choice of Blockchain Platform

Four platforms were considered: Hyperledger Fabric, Quorum (GoQuorum), private Ethereum using Geth, and Hyperledger Besu (Khan et al., 2025; Pierro et al., 2024).
• Hyperledger Fabric is a mature permissioned framework widely adopted for enterprise workflows. However, it does not natively support Ethereum token standards; tokenization must be implemented as custom chaincode that mimics ERC-20 or ERC-721 semantics. Implementing and maintaining hierarchical NFTs in Fabric would therefore require additional development effort and separate tooling, making it less aligned with an Ethereum-based NFT ecosystem (Hyperledger Foundation, 2023).
• Quorum (GoQuorum) is an enterprise Ethereum fork that provides advanced privacy features such as private transactions, encrypted payloads, and transaction managers like Tessera (ConsenSys, 2024). By contrast, the hierarchical token model in this paper emphasizes transparency within a permissioned consortium: all authorized participants should observe the same OT–DVT hierarchy and hash anchors. Quorum’s privacy mechanisms are not required for this design and would introduce additional infrastructure and operational complexity.
• Private Ethereum with Geth as commonly used in research prototypes (e.g., (Khan et al., 2025)), offers full EVM compatibility and supports private-network configuration for permissioned deployments (Ethereum Foundation, 2024). However, Geth is primarily geared towards public Ethereum and does not provide rich, built-in permissioning or consortium-management features; these must be added externally, increasing the engineering overhead for a research-grade, multi-node permissioned deployment.
• Hyperledger Besu is an enterprise Ethereum client designed for both public and private permissioned networks, with comprehensive node- and account-level permissioning and multiple PoA consensus algorithms (Clique, IBFT 2.0, QBFT) (Hyperledger Foundation, 2025). As an EVM-compatible client, Besu natively supports smart contracts implementing ERC-721, ERC-1155, and ERC-6150-style interfaces, allowing the OT–DVT model to be realized without modifying the client. Besu integrates well with standard Ethereum tooling (Remix, MetaMask, Ethers.js) and has been empirically evaluated in token-centric PoA deployments, including comparative studies with Quorum in energy-token scenarios (Pierro et al., 2024).
Given the selection criteria in Section 3.4.1, Hyperledger Besu provides the most balanced option. It:
• Enables transparent, issuer-anchored token hierarchies using standard Ethereum smart contracts.
• Supports permissioned, multi-node deployments with configurable PoA consensus (Clique in this proof-of-concept) for low-cost, predictable finality.
• Offers native node- and account-level permissioning without requiring additional privacy layers that are not used in this work.
Hyperledger Besu therefore aligns closely with the requirements of a hierarchical document-authentication system: Ethereum compatibility, flexible permissioning, and a pragmatic privacy model based on permissioned access and off-chain storage, rather than advanced cryptographic privacy schemes.

3.4.3. Network Parameters and Toolchain

The permissioned network was instantiated as a private Hyperledger Besu chain configured with Clique Proof-of-Authority via a custom genesis file. The genesis configuration specifies the validator set, private chain identifier, block period, and gas limits suitable for token and metadata transactions, and pre-funds the four nodes described in Section 3.3.2 to cover smart-contract deployment and minting costs.
The implementation used Hyperledger Besu (v25.2.0), Solidity compiler (Remix IDE online, v0.8.31), Docker (v28.0.1) and Docker Compose (v2.33.1-desktop.1), Node.js (v16.20.2), and standard Ethereum tools (Remix IDE, MetaMask, Ethers.js) for contract deployment and verifier interface integration. The full genesis file, Docker Compose configuration, and permissioning TOML files (accounts and nodes) are provided in the project’s online repository/supplementary materials for exact replication.

3.5. Algorithms

This section summarizes the core logic of the hierarchical token model as language-agnostic pseudocode. Algorithms 1 and 2 describe the minting of the Organization Token (OT) and Document Verification Tokens (DVTs). Algorithm 3 captures the hierarchical queries between parents and children. Algorithm 4 outlines access-control checks for minting. Algorithm 5 describes the off-chain verification process that recomputes the document hash and compares it to the on-chain anchor.
Algorithm 1: MintOrganizationToken (OT minting)
1: Input: admin address a , orgId, orgName, orgURI.
2: Require that a is the authorised admin and has not previously minted an OT.
3: Require that orgId has not been used.
4: Mint a non-fungible token with ID orgId to a .
5: Store organisation metadata (orgName, orgURI) under orgId.
6: Record that a has an OT and link a o r g I d .
7: Mark the OT as non-transferable (soulbound).
8: Output: OT ID orgId. (used later as parentId for DVTs)
Algorithm 2: MintDVT (document token under an OT)
1: Input: issuer address a , document hash h, document URI uri.
2: On-chain: fetch parentId = orgTokenIdOf[a]; require parentId ≠ 0 and ownerOf(parentId) = a.
3:Require that h and uri have not been used by any previous DVT.
4: Allocate a new DVT ID dvtId from an auto-increment counter.
5: Mint DVT dvtId to a and set its parent to parentId.
6: Store DVT metadata (parentId, h , uri) and mark hash and URI as used.
7: Mark the DVT as non-transferable (soulbound).
8: Output: DVT ID dvtId
Algorithm 3: HierarchicalQueries (parent–child)
1: Input (A): OT ID parentId.
2: Verify that parentId exists.
3: Return the list of DVT IDs childrenOf(parentId).
4: Input (B): DVT ID dvtId.
5: Verify that dvtId exists.
6: Return the parent OT ID parentOf(dvtId).
Algorithm 4: Access-Control Check for Minting
1: Input: caller address a , action ∈ {MintOT, MintDVT}.
2: If action = MintOT:
3: Require that a is the contract owner/admin and has not minted an OT.
4: If true, authorise; otherwise, reject.
5: If action = MintDVT:
6: Require that orgTokenIdOf[a] ≠ 0 and ownerOf(orgTokenIdOf[a]) = a.
7: If true, authorise; otherwise, reject.
8: Output: allow / reject
Algorithm 5: Off-Chain Document Verification (hash comparison)
1: Input: DVT ID dvtId.
2: On-chain: via the verifier node, call getParentTokenId(dvtId) to obtain parentId; if parentId does not correspond to a valid Organization Token, classify the document as Not authentic and abort.
3: On-chain: read DVT metadata for dvtId and obtain stored hash h_stored and document URI uri.
4: Off-chain: fetch the document bytes from uri (IPFS or HTTPS).
5: Compute h_computed = Keccak-256 of the fetched bytes.
6: Normalise h_stored and h_computed to the same hex format.
7: If h_computed = h_stored, classify the document as Authentic; otherwise classify as Not authentic.
8: Output: verification result (Authentic / Not authentic)

3.6. Document Authentication and Verification Workflow (Financial-Document Scenario)

This practical sequence for deploying the smart contract and issuing tokens in a financial institution setting (e.g., banks, audit firms) is outlined below for relevant financial documents such as account statements, audit reports, and loan approval letters.
(a)Smart-contract deployment
1. A regulated financial institution (or its designated administrator) deploys the hierarchical-token smart contract to the permissioned blockchain.
2. This initial deployment instantiates the document-authentication logic and the rules governing the issuance of the OT and DVTs.
(b)Document issuance process
i. Document creation. - The issuing organization generates a digital financial document and stores it off-chain (e.g., IPFS or a secure internal document server).
ii. Document hashing - Before minting, the institution computes a cryptographic Keccak-256 hash of the final document content using a trusted tool, script, or UI component. The resulting hash is retained for tokenization.
iii. Organization Token minting - The institution mints its non-transferable OT (e.g., via mintOrganizationToken), establishing its verified on-chain identity. This is a one-time action that anchors all subsequent DVTs.
iv. Initiating document issuance - To issue a document on-chain, the institution calls the DVT-minting function (e.g., mintDVT) on the deployed contract, supplying the pre-computed document hash and the URI pointing to the off-chain file.
v. Smart-contract validation - Before minting a DVT, the contract performs two key checks:
• OT ownership verification - It verifies that the caller address (msg.sender) is the owner of a valid OT, confirming the legitimacy of the issuing financial institution.
• Parent–child consistency - It confirms that the referenced OT exists and can serve as the parent in the hierarchy.
vi. DVT minting - If the checks pass, the contract mints a new DVT as a child of the OT, assigns it a unique ID from the DVT counter, and stores the document hash and URI in the DVT metadata.
These steps constitute the authentication phase of the system and are represented in the left-hand side of Figure 5.
(c)Verification process
The verification logic enables decentralized authentication of financial documents without requiring any blockchain transactions from verifiers. It relies on on-chain metadata and off-chain storage to validate integrity and provenance.
Verifier workflow and validation logic
i. Verifier access and DVT query - A verifier (e.g., employer, regulator, auditor, counterparty, credit bureau) is granted read access to the permissioned blockchain, typically via a verifier node. The verifier supplies a DVT ID to query the smart contract.
ii. Parent token retrieval - The verifier calls getParentTokenId(dvtId) to obtain the OT ID associated with the DVT, confirming the link to a specific financial institution.
iii. DVT metadata retrieval - The verifier calls getDVTMetadata(dvtId) to retrieve the parent OT ID (for cross-check), the stored document hash, and the document URI (IPFS link or storage URL).
iv. Parent-token match check.
  • The verifier compares the parent OT ID returned by getParentTokenId with the parent ID embedded in the DVT metadata. If they do not match, the process is terminated, and the document is treated as untrusted.
v. Document retrieval.
  • If the parent IDs are consistent, the verifier fetches the document from the off-chain document URI provided in the metadata.
vi. Hash recalculation.
  • The verifier recomputes the document hash using the same Keccak-256 algorithm on the fetched bytes.
vii.  Hash comparison.
  • The recomputed hash is compared to the hash stored in the DVT metadata. If they match, the document is considered authentic; if not, it is treated as altered or replaced.
Verification outcome
• Match: the financial document is authentic and issued by the correct organization
• No match: the document is not authentic.
Because verifiers only perform read-only queries and off-chain hashing, no additional blockchain transactions are required during verification, which saves gas and supports scalability. These steps constitute the verification phase of the system and are represented on the right-hand side of Figure 5.
Figure 5. End-to-end process flow of the hierarchical tokenization approach.
Figure 5. End-to-end process flow of the hierarchical tokenization approach.
Preprints 199473 g005
The diagram illustrates the full lifecycle of the system, from smart-contract deployment and OT/DVT minting (left) to hash-based validation and verification outcome (right).

4. Implementation and Results.

4.1. Smart-Contract Execution Evidence

This section reports execution evidence that the hierarchical token contracts compiled, deployed, and behaved as intended on the four-node Hyperledger Besu Clique network. All transactions were initiated via the Remix IDE and signed in MetaMask using the organization node’s administrator account. Token minting and policy enforcement were observed through Remix transaction receipts, and emitted Solidity events. All four Besu nodes were successfully launched and remained synchronized during testing; the full Docker Compose configuration is provided in the online repository (Supplementary Materials). Token minting was validated via transaction logs and wallet confirmations in MetaMask, confirming that each operation was mined into a finalized block.

4.1.1. Organization Token Minting (Figure 6).

Preprints 199473 i001
  • Figure 6 shows the successful execution of mintOrganizationToken. Panel (a) presents the transaction receipt for the OT with a specified orgId, confirming that the transaction was mined and gas was consumed as expected. Panel (b) shows the corresponding OrganizationMinted event, including the admin address and OT identifier, demonstrating that the organization’s non-transferable anchor token was recorded on-chain and linked to its metadata

4.1.2. Document Verification Token Minting (Figure 7).

4.1.3. Non-Transferability Enforcement(Figure 8).

4.1.4. Child Token Retrieval Under the Parent (Figure 9)

Preprints 199473 i002
Figure 9 reports the result of querying the OT→DVT relationship using the read-only ‘getDVTsByOrganization/childrenOf’ call. The output lists the set of DVT IDs associated with a given OT (e.g., IDs 1–10 under OT 123456), demonstrating that the contract maintains a consistent parent–child structure and that verifiers or auditors can programmatically enumerate all document tokens issued by a particular financial institution.

4.1.5. Access Control Checks (Figure 10)

All these results align with the role-based restrictions specified in Section 3.2 and Algorithms 1–4, and demonstrate that unauthorized token issuance is blocked at the smart-contract layer.

4.2. Verifier User Interface

A lightweight web-based Verifier User Interface (UI) was implemented in HTML, JavaScript, and Ethers.js to realize the off-chain verification flow described in Section 3.6 and Algorithm 5. The UI connects to the read-only verifier node via JSON-RPC and encapsulates the required contract calls (getParentTokenId, getDVTMetadata) and hash comparison logic.
In a typical session, the verifier enters a DVT ID, and the UI automatically retrieves the parent OT ID and DVT metadata, fetches the referenced document from IPFS or HTTPS, recomputes its Keccak-256 hash in the browser, and displays an Authentic / Not authentic result together with the underlying hash values. This allows employers, auditors, and regulators to verify financial documents without interacting directly with the blockchain client or command-line tools.
Figure 11. Verification simulation of a document using DVT ID 6 on the Verifier Interface.
Figure 11. Verification simulation of a document using DVT ID 6 on the Verifier Interface.
Preprints 199473 g009

4.3. Functional Evaluation

This subsection evaluates whether the implemented system meets the core functional requirements derived from the model in Section 3. The focus is on correctness of behavior rather than throughput benchmarking. Each requirement is mapped to concrete evidence (figures, sections, or algorithms) and a qualitative pass/fail outcome.
Table 2. Functional requirements, evaluation evidence, and outcome.
Table 2. Functional requirements, evaluation evidence, and outcome.
ID Functional Requirement Evidence (section / figure /algorithm) Outcome
R1 Only the designated organization node can mint an OT Contract logic in Section 3.2.7; Algorithms 1 & 4; access-control results in Figure 10 (non-admin OT mint rejected) Pass
R2 Only OT holders can mint DVTs under their own OT Contract logic in Section 3.2.7; Algorithms 2 & 4;
Figure 10 (failed DVT mint from non-OT address)
Pass
R3 OT and DVTs are non-transferable (soulbound semantics) Non-transferability design in Section 3.2.6; Algorithms 1 & 2 ; Figure 8 (transfer attempt revert) Pass
R4 Hierarchical OT→DVT linkage is correctly maintained and queryable Hierarchy model in Section 3.2.4; Algorithm 3; Figure 9 (list of child DVT IDs under an OT) Pass
R5 Each document is uniquely represented by its hash and URI DVT metadata design in Section 3.2.3; Algorithm 2;
contract checks on usedDocumentHashes and usedDocumentURIs
Pass
R6 Off-chain verification of documents without new blockchain transactions for verifiers Verification workflow in Section 3.6; Algorithm 5; verifier UI in Section 4.2 and Figure 11 Pass
R7 Permissioned network with separated roles (organization, consensus-only nodes, verifier) System architecture in Section 3.3; smart-contract
execution evidence in Section 4.1
Pass
R8 Acceptable responsiveness for typical minting and verification operations Qualitative observations from test runs in Section 4.1 and verifier UI interactions in Section 4.2 Pass
Overall, the implementation satisfied all functional requirements considered in this proof-of-concept. Role-based minting, enforced non-transferability, and consistent parent–child linkage were confirmed through on-chain events and failed transaction attempts. The verifier interface demonstrated that third parties can perform hash-based verification in real time against the permissioned Besu network without initiating new transactions, supporting the intended separation between issuance and verification.

4.4. Basic Security Considerations

The implementation incorporates several security measures aimed at preserving authenticity, integrity, and controlled access, consistent with the design in Section 3.
• Layered access control - Access restrictions are enforced at both the smart-contract level and the network level. Contract functions use role-based checks (e.g., onlyOwner, OT-ownership checks) to limit OT minting to a single authorized administrator address and DVT minting to the OT holder, while Besu’s node- and account-level permissioning restricts who can connect to the network and submit transactions, respectively. This dual layer reduces the risk of unauthorized token issuance from both internal misuse and external intrusion.
• Hash-based integrity protection - Each document is anchored by a Keccak-256 hash stored in the DVT metadata. Verification recomputes the hash over the retrieved document bytes and compares it with the on-chain value (Algorithm 5). Any modification to the document content or substitution of a different file causes a hash mismatch, signaling loss of integrity.
• Issuer-bound, non-transferable credentials - OT and DVTs are intentionally non-transferable: transfer and approval functions revert, and ERC-5192-style “locked” semantics (soulbound token interface) are signaled. This prevents tokens from being sold, reassigned, or moved to other accounts, reducing impersonation risk and preserving a stable, auditable issuer–document relationship over time.
• Controlled exposure of document data - The blockchain only stores hashes and URIs; full document payloads remain off-chain (Section 3.2.5). This limits on-chain exposure of sensitive financial information and allows institutions to apply their own access controls at the storage layer (e.g., IPFS with pinning, or internal repositories), while still enabling authorized (semi-public) integrity checks.
• Read-only verification path - Verifiers interact with a dedicated read-only node that exposes JSON-RPC for contract queries but does not participate in consensus or minting. This reduces the attack surface on critical validator nodes and confines verifier activity to non-transactional reads.
These considerations provide a baseline security posture appropriate for a proof-of-concept. A more detailed threat model and controlled tampering experiment with mutable off-chain storage is shown in Section 4.5.

4.5. Tampering Scenario: Mutable Off-Chain Storage

To evaluate behavior under mutable storage, a PDF document as in the baseline scenario was hashed (Keccak-256) and its hash stored on-chain as part of the DVT metadata, while the file itself was hosted on Google Drive. After anchoring the hash, the PDF was edited and re-saved at the same Drive location, so the document URI remained unchanged.
During verification, the system fetched the file from the stored URI, recomputed its hash, and compared it to the on-chain value. As shown in Figure 12, the mismatch caused the verifier interface to report an authentication failure. This confirms that even subtle edits to a document on a mutable platform cannot pass verification: any change to the underlying bytes produces a hash mismatch. The experiment also illustrates that practical integrity depends on both immutable on-chain hashes and careful operational controls over off-chain storage.

5. Discussion

5.1. Known Limitations

As a proof-of-concept, the implementation deliberately focuses on issuer-anchored integrity and provenance for high-value financial documents, rather than reproducing every advanced feature discussed in the literature. Accordingly, the prototype is intentionally scoped and has several limitations:
• Controlled, small-scale environment - All tests were conducted on a local permissioned Besu network with a modest number of nodes and tokens. The model has not yet been exercised in a multi-institution, production financial setting or anchored to a public chain.
• No formal scalability or fault-tolerance evaluation - Beyond qualitative responsiveness, there is no systematic benchmarking under high transaction volumes, adverse network conditions, or validator failures. Performance and resilience remain to be quantified separately.
• No lifecycle controls for documents - DVTs are permanently active in this prototype. The contract does not yet support explicit revocation, expiry, or versioning of documents, even though such mechanisms are important for financial records that may be corrected or rescinded. The prototype also does not track dynamic metadata changes or support “dynamic NFT” behavior; each token is treated as a static anchor for a single document version.
• Off-chain storage assumptions - The model relies on IPFS (with pinning) and, in one scenario, Google Drive. Persistence, retention, and version control are not enforced by the contract; they depend on institutional storage policies and external services.
• Scope of document types – The design targets high-value, relatively low-frequency financial documents (e.g., audited reports or formal statements), rather than everyday transactional records where per-document tokenization may be operationally excessive.
• No built-in compliance or advanced identity layer - The system assumes that compliant financial documents already exist and does not implement jurisdiction-specific regulation, automated document generation, or a full SSI/VC stack. These aspects are left for integration or future work.
These constraints are consistent with a proof-of-concept focused on integrity and provenance rather than full-scale deployment.

5.1. Positioning and Implications

A purely hash-based verification scheme can show that a file has not changed since its hash was first recorded, but it cannot guarantee that the initial hash corresponded to a legitimate financial document. A forged statement can be hashed once and then “verified” forever against that false baseline. What such schemes lack is institutional provenance—assurance that the first recorded hash was issued under the authority of a regulated institution.
The hierarchical model addresses this gap by introducing the Organization Token (OT) as an issuer-anchored root. The OT serves as a non-transferable, on-chain identity for the institution, and all DVTs must be minted as its children. Minting rights are tied to the issuer’s address; as a result, each document hash is embedded in an auditable lineage of issuance, not treated as a free-floating checksum. For high-value financial documents—such as account statements, audited reports, loan approvals, or trade confirmations—this provides a stronger basis for trust than hash anchoring alone.
ERC-6150-style semantics make this linkage transparent and queryable. Auditors, regulators, counterparties, or employers can inspect parent–child relationships, enumerate all DVTs under a given OT, or confirm that a purported tokenized statement actually descends from the proper institutional root. Deploying this structure on a permissioned blockchain further reinforces trust by adding governed membership, accountable validators, and a ledger of actions aligned with institutional risk management. By relying on standard Ethereum-compatible interfaces, the model remains interoperable with existing toolchains and can be extended without altering the core ledger design.
The design also clarifies the relationship to other credential paradigms. While it shares non-transferability traits with Soulbound Token proposals, the binding here is deliberately asymmetric: the OT is bound to the issuer; DVTs are not yet bound to recipients’ wallets. The focus is on authenticity and provenance of financial documents, not on self-custodied credentials. Likewise, the prototype does not implement an SSI framework (DID/VCs) or credentials wallets; instead, it offers an issuer-anchored ledger that could later be combined with such frameworks if desired.
Finally, the current implementation uses a simplified two-tier hierarchy (issuer → documents). Real-world financial organizations often have multi-level business units and approval chains. The same hierarchical logic can be extended to deeper trees and delegated minting rights—e.g., business-line-level issuance under a group-level OT, or policies that apply across sets of documents. These richer structures are beyond the scope of the present prototype but align naturally with the model’s intent.
Together, these results indicate that the proposed model delivers issuer-anchored provenance, tamper-evident verification, and gas-free validation for high-value financial documents in a permissioned setting.

6. Conclusion and Future Work

6.1. Summary of Findings

This study proposed and implemented a hierarchical tokenization model for authenticating high-value financial documents on a permissioned Ethereum-compatible blockchain. An issuer-anchored OT represents the institution; non-transferable DVTs represent individual documents and carry cryptographic hashes and references to off-chain storage.
The main findings are:
• The prototype successfully bound documents to issuers via an OT–DVT parent–child structure, with the hierarchy behaving as intended on a live Besu Clique network.
• Hash-based verification with off-chain storage detected tampering: when document bytes were modified, the recomputed hash no longer matched the on-chain value and verification failed.
• Role-based minting and a verifier UI operated correctly in practice: only the organization admin could mint an OT and DVTs, while external verifiers used a read-only node and web interface to perform decentralized, transaction-free checks.
• A permissioned Hyperledger Besu network proved operationally suitable for this use case, offering governance, configurable PoA consensus, and predictable behavior under the tested conditions.
• In a mutable storage scenario (Google Drive-hosted PDF updated without link change), the system correctly flagged a mismatch between the recomputed and stored hash, demonstrating robustness when off-chain locations are editable.
Taken as a whole, these results show that a hierarchical, issuer-anchored token model on a permissioned Ethereum client can provide strong integrity and provenance guarantees for high-value financial documents, while keeping verification lightweight for external stakeholders.

6.1. Future Work

Future work will focus on deepening, rather than radically changing, the proposed model:
• Token lifecycle controls - Introduce explicit mechanisms for revocation, expiry, and controlled updates of DVTs, allowing institutions to reflect the full lifecycle of financial documents (e.g., corrected statements, rescinded approvals) while preserving audit trails.
• Richer use of hierarchy - Extend the issuer-anchored structure beyond a simple two-tier model to support more nuanced organizational and document groupings (for example, business units or document sets), while leaving detailed decomposition strategies and policies to later work.
• Integration with identity frameworks - Explore optional integration with decentralized identity or Verifiable Credentials, where hierarchical tokens continue to guarantee issuer authenticity and integrity anchoring, and an external identity layer handles recipient and verifier identities in a privacy-aware manner, including the design of explicit acceptance or opt-out flows if DVTs are later bound to recipients’ wallets, similar in spirit to SBT-style accept/reject patterns.
• Privacy-preserving verification - Explore lightweight zero-knowledge or related techniques that would allow verifiers to confirm authenticity or selected attributes of financial documents without revealing full content or sensitive metadata, while keeping the core issuer-anchored model unchanged.
• Performance and deployment patterns - Conduct a separate evaluation of performance characteristics and deployment options for larger consortia, without committing to specific consensus experiments or parameter choices in this paper.
• Application-layer extensions - Investigate controlled forms of metadata-driven or template-based document handling, including dynamic metadata generation for documents whose content is derived from on-chain state, without turning the blockchain into a document store, and examine how metadata sensitivity and regulatory and legal requirements in specific financial jurisdictions can be layered onto the framework.
These directions preserve the core contribution—issuer-anchored, hierarchical tokenization for financial documents on a permissioned chain—while leaving room to refine lifecycle management, identity, and performance in subsequent work and follow-on studies.

Supplementary Materials

The following supporting information can be downloaded at the website of this paper posted on Preprints.org. Supplementary File S1 (ZIP) contains the smart contract source code (Solidity); verifier web interface (HTML/JavaScript with ethers.js, including hashing logic); Python hashing script; sample PDF documents (original and altered); Docker Compose and blockchain configuration files (genesis and permissioning configuration); and a README with reproduction steps.

Author Contributions

Conceptualization, C.I. and S.-C.H.; methodology, C.I. and B.N.; software, C.I.; validation, C.I., S.-C.H. and B.N.; formal analysis, C.I.; investigation, C.I.; resources, C.I., S.-C.H. and B.N.; data curation, C.I.; writing—original draft preparation, C.I.; writing—review and editing, C.I., S.-C.H. and B.N.; visualization, C.I.; supervision, S.-C.H. and B.N.; project administration, S.-C.H. and B.N. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data and code supporting the reported results are provided in Supplementary File S1.

Acknowledgments

During the preparation of this manuscript, the authors used generative artificial intelligence (ChatGPT-5, OpenAI) as an interactive technical assistant for drafting support, language refinement, and exploratory code prototyping under author supervision. All implementation, testing, validation, and scholarly analysis were conducted by the authors, who take full responsibility for the content of this publication.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Afrakhteh, M., Ibrahim, S., & Salleh, M. (2010). Printed Document Authentication Using Watermarking Technique. 2010 Second International Conference on Computational Intelligence, Modelling and Simulation, 367–370. [CrossRef]
  2. Al-Ameri, M. A. A., Mahmood, B., Ciylan, B., & Amged, A. (2023). Unsupervised Forgery Detection of Documents: A Network-Inspired Approach. Electronics, 12(7), 1682. [CrossRef]
  3. Ali, V. E., Asika, M. O., Elebesunu, E. E., Agbo, C., & Antwi, M. H. (2024). Cognizance and mitigation of falsified immunization documentation: Analyzing the consequences for public health in Nigeria, with a focus on counterfeited COVID-19 vaccination cards: A case report. Health Science Reports, 7(2), e1885. [CrossRef]
  4. Anwar, M. J., & Gill, A. Q. (2025). NFTs enabled federated digital identity data representation and management. Discover Data, 3(1), 19. [CrossRef]
  5. Artha, K. A. R., Zain, S. N., Alkautsar, A. A., & Widianto, M. H. (2022). Implementation of Smart Contracts for E-Certificate as Non-Fungible Token using Solana Network. Proceedings of the 2022 IEEE 7th International Conference on Information Technology and Digital Applications, ICITDA 2022. [CrossRef]
  6. Baechler, S. (2020). Document Fraud: Will Your Identity Be Secure in the Twenty-first Century? European Journal on Criminal Policy and Research, 26(3), 379–398. [CrossRef]
  7. Banaeian Far, S., & Hosseini Bamakan, S. M. (2023). NFT-based identity management in metaverses: challenges and opportunities. SN Applied Sciences, 5(10), 260. [CrossRef]
  8. Bhagat, N., Bae, J., & Lee, S.-H. (2025). Dynamic Management of Hierarchical NFTs: Efficient Splitting and Merging. Journal of the Korea Society of Computer and Information, 30(2), 73–82. [CrossRef]
  9. Blockcerts. (n.d.). Blockcerts: The open standard for blockchain credentials. Retrieved November 20, 2025, from https://www.blockcerts.org.
  10. Böhmecke-Schwafert, M. (2024). The role of blockchain for trade in global value chains: A systematic literature review and guidance for future research. Telecommunications Policy, 48(9), 102835. [CrossRef]
  11. ConsenSys, Inc. (2024). ConsenSys GoQuorum documentation. https://docs.goquorum.consensys.io/.
  12. Devlin, C., Chadwick, S., Moret, S., Baechler, S., Rossy, Q., & Morelato, M. (2024). Illuminating the dark web market of fraudulent identity documents and personal information: An international and Australian perspective. Forensic Science International, 363, 112203. [CrossRef]
  13. Eltuhami, M., Abdullah, M., & Talip, B. A. (2022). Identity Verification and Document Traceability in Digital Identity Systems using Non-Transferable Non-Fungible Tokens. 2022 International Visualization, Informatics and Technology Conference (IVIT), 136–142. [CrossRef]
  14. Ethereum Foundation. (2024, June 16). Private networks. Go-Ethereum Documentation. https://geth.ethereum.org/docs/fundamentals/private-network.
  15. Faccia, A., Pandey, V., & Banga, C. (2022). Is Permissioned Blockchain the Key to Support the External Audit Shift to Entirely Open Innovation Paradigm? Journal of Open Innovation: Technology, Market, and Complexity, 8(2), 85. [CrossRef]
  16. Gebreab, S. A., Salah, K., Jayaraman, R., & Zemerly, J. (2023). Trusted Traceability and Certification of Refurbished Medical Devices Using Dynamic Composable NFTs. IEEE Access, 11, 30373–30389. [CrossRef]
  17. Georgiou, I., Sapuric, S., Lois, P., & Thrassou, A. (2024). Blockchain for Accounting and Auditing—Accounting and Auditing for Cryptocurrencies: A Systematic Literature Review and Future Research Directions. Journal of Risk and Financial Management, 17(7), 276. [CrossRef]
  18. Guidi, B., & Michienzi, A. (2023). From NFT 1.0 to NFT 2.0: A Review of the Evolution of Non-Fungible Tokens. Future Internet, 15(6), 189. [CrossRef]
  19. Hammi, B., Zeadally, S., & Perez, A. J. (2023). Non-Fungible Tokens: A Review. IEEE Internet of Things Magazine, 6(1), 46–50. [CrossRef]
  20. Hasan, H. R., Madine, M., Musamih, A., Jayaraman, R., Salah, K., Yaqoob, I., & Omar, M. (2024). Non-fungible tokens (NFTs) for digital twins in the industrial metaverse: Overview, use cases, and open challenges. Computers & Industrial Engineering, 193, 110315. [CrossRef]
  21. Hyperledger Foundation. (2023). Hyperledger Fabric documentation (release 2.5). https://hyperledger-fabric.readthedocs.io/en/release-2.5/.
  22. Hyperledger Foundation. (2025, December 19). Besu for private (permissioned) networks. https://besu.hyperledger.org/private-networks.
  23. Jirgensons, M., & Kapenieks, J. (2018). Blockchain and the Future of Digital Learning Credential Assessment and Management. Journal of Teacher Education for Sustainability, 20(1), 145–156. [CrossRef]
  24. Khan, M. M., Khan, F. S., Nadeem, M., Khan, T. H., Haider, S., & Daas, D. (2025). Scalability and Efficiency Analysis of Hyperledger Fabric and Private Ethereum in Smart Contract Execution. Computers, 14(4), 132. [CrossRef]
  25. Kim, G., & Ryou, J. (2023). Digital Authentication System in Avatar Using DID and SBT. Mathematics, 11(20), 4387. [CrossRef]
  26. Kumar, N. N., Kumar, R. S., Basale, R. R., & Saffath, M. (2022). Decentralized Storage Of Educational Assets Using NFTs And Blockchain Technology. 2022 International Conference on Smart Systems and Inventive Technology (ICSSIT), 260–266. [CrossRef]
  27. Kuznetsov, O., Frontoni, E., Kuznetsova, K., Shevchuk, R., & Karpinski, M. (2024). NFT Technology for Enhanced Global Digital Registers: A Novel Approach to Tokenization. Future Internet, 16(7), 252. [CrossRef]
  28. Lee, H., & Yeon, C. (2021). Blockchain-Based Traceability for Anti-Counterfeit in Cross-Border E-Commerce Transactions. Sustainability, 13(19), 11057. [CrossRef]
  29. Lee, K., msfew, Kartin, & qizhou. (2022, December 15). ERC-6150: Hierarchical NFTs. Ethereum Improvement Proposals. https://eips.ethereum.org/EIPS/eip-6150.
  30. Lockyer, M., Mudge, N., Schalm, J., Echeverry, S., & Zhou, Z. V. (2018, July 7). ERC-998: Composable non-fungible token. Ethereum Improvement Proposals. https://eips.ethereum.org/EIPS/eip-998.
  31. López-Pimentel, J. C., Gonzalez-Sanchez, J., & Morales-Rosales, L. A. (2025). A Digital Identity Blockchain Ecosystem: Linking Government-Certified and Uncertified Tokenized Objects. Applied Sciences, 15(15), 8577. [CrossRef]
  32. Lunesu, M. I., Tonelli, R., Pinna, A., & Sansoni, S. (2023). Soulbound Token for Covid-19 Vaccination Certification. 2023 IEEE International Conference on Pervasive Computing and Communications Workshops and Other Affiliated Events (PerCom Workshops), 243–248. [CrossRef]
  33. Mohammad Saeidia, F., Zahedi, M. H., & Farahani, E. (2025). A Secure and Reliable Model for Financial Documents Using Digital Signature and Blockchain Technology. AI and Tech in Behavioral and Social Sciences, 3(1), 23–33. [CrossRef]
  34. Mohsin Arkah, Z., Alzubaidi, L., Ali, A. A., & Abdulameer, A. T. (2020). Digital Color Documents Authentication Using QR Code Based on Digital Watermarking. In Advances in Intelligent Systems and Computing (Vol. 940, pp. 1093–1101). Springer Verlag. [CrossRef]
  35. Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System. https://bitcoin.org/bitcoin.pdf.
  36. Nita, S. L., & Mihailescu, M. I. (2024). A Novel Authentication Scheme Based on Verifiable Credentials Using Digital Identity in the Context of Web 3.0. Electronics, 13(6), 1137. [CrossRef]
  37. Weyl, E. G., Ohlhaver, P., & Buterin, V. (2022). Decentralized Society: Finding Web3’s Soul. SSRN Electronic Journal. [CrossRef]
  38. Ongwook Bae, J., Bhagat, N., Lee, S.-H., & Bae, J. (2024). Hierarchical NFT using Parent-Child Structure. Journal of The Korea Society of Computer and Information, 29(2), 127–136. [CrossRef]
  39. Patel, A., Sai, S., Daiya, A., Akolekar, H., & Chamola, V. (2025). Blockchain enabled traceability in the jewel supply chain. Scientific Reports, 15(1), 3837. [CrossRef]
  40. Peelam, M. S., Chamola, V., Sharma, A. K., & Chaurasia, B. K. (2025). Decentralized Trust: NFT and Blockchain-Enabled Evidence System using Fog Computing. Blockchain: Research and Applications, 100321. [CrossRef]
  41. Pericàs-Gornals, R., Mut-Puigserver, M., Payeras-Capellá, M. M., Cabot-Nadal, M. Á., & Ramis-Bibiloni, J. (2024). Digital credentials management system using rejectable soulbound tokens. Annals of Telecommunications, 79(11–12), 843–855. [CrossRef]
  42. Pierro, G. A., Cocco, L., & Tonelli, R. (2024). Besu vs. Quorum: Comparative analysis in the context of simulated energy communities. In M. Bartoletti, C. Schifanella, & A. Vitaletti (Eds.), Proceedings of the Sixth Distributed Ledger Technology Workshop (DLT 2024) (CEUR Workshop Proceedings, Vol. 3791) (pp. 1–16). CEUR-WS.org. https://ceur-ws.org/Vol-3791/paper24.pdf.
  43. Podda, E., Hölzmer, P., Amard, A., Sedlmeir, J., & Fridgen, G. (2025). The impact of zero-knowledge proofs on data minimisation compliance of digital identity wallets. Internet Policy Review, 14(3). [CrossRef]
  44. Precht, H., Hüllmann, J. A., & Marx Gómez, J. (2026). Paperless Everything: A Systematic Literature Review for the Design of Blockchain-based Document Management Systems. Distributed Ledger Technologies: Research and Practice, 5(2), 1–48. [CrossRef]
  45. Pu, S., & Lam, J. S. L. (2023). The benefits of blockchain for digital certificates: A multiple case study analysis. Technology in Society, 72, 102176. [CrossRef]
  46. Cardenas-Quispe, M. A., & Pacheco, A. (2025). Blockchain ensuring academic integrity with a degree verification prototype. Scientific Reports, 15(1), 9281. [CrossRef]
  47. Ramadhan, M. R., Mandala, S., & Yulianto, F. A. (2023). Analysis and Implementation of Digital Signature Algorithm in PDF Document. 2023 11th International Conference on Information and Communication Technology (ICoICT), 2023-August, 11–16. [CrossRef]
  48. Ramirez Lopez, L. J., & Morillo Ledezma, G. G. (2025). Employing Blockchain, NFTs, and Digital Certificates for Unparalleled Authenticity and Data Protection in Source Code: A Systematic Review. Computers, 14(4), 131. [CrossRef]
  49. Razi, Q., Devrani, A., Abhyankar, H., Chalapathi, G. S. S., Hassija, V., & Guizani, M. (2024). Non-Fungible Tokens (NFTs)—Survey of Current Applications, Evolution, and Future Directions. IEEE Open Journal of the Communications Society, 5, 2765–2791. [CrossRef]
  50. Satybaldy, A., Subedi, A., & Nowostawski, M. (2022). A Framework for Online Document Verification Using Self-Sovereign Identity Technology. Sensors, 22(21), 8408. [CrossRef]
  51. Silaghi, D. L., & Popescu, D. E. (2025). A Systematic Review of Blockchain-Based Initiatives in Comparison to Best Practices Used in Higher Education Institutions. Computers, 14(4), 141. [CrossRef]
  52. Singh, P., Sagar, S., Singh, S., Alshahrani, H. M., Getahun, M., & Soufiene, B. O. (2024). Blockchain-enabled verification of medical records using soul-bound tokens and cloud computing. Scientific Reports, 14(1), 24830. [CrossRef]
  53. Subramanya, S. R., & Yi, B. K. (2006). Digital signatures. IEEE Potentials, 25(2), 5–8. [CrossRef]
  54. Susik, R., Nowotniak, R., & Kulczycki, E. (2023). Blockchain-based certification of research outputs and academic achievements: A case of scientific conference. Communication Papers of the 18th Conference on Computer Science and Intelligence Systems, 37, 329–333. [CrossRef]
  55. Szyjewski, G. (2023). Securing Digital Copies of the Documents to Ensure Documents’ Integrity. EUROPEAN RESEARCH STUDIES JOURNAL, XXVI(Issue 4), 718–726. [CrossRef]
  56. Teraura, N., Echizen, I., & Iwamura, K. (2020). A QR Symbol with ECDSA for Both Public and Secret Areas using Rhombic Sub-cells. 2020 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), 1392–1399.
  57. Usha, B. A., Monish, S., Murali Manohara Hegde, A. S., Kumar, N., Aditya, P., & Manjunath, A. (2023). Blockchain Technology in Document Authentication: A Comprehensive Literature Review. 2023 4th International Conference on Communication, Computing and Industry 6.0 (C216), 1–5. [CrossRef]
  58. Walidaniy, W. D., Yuliana, M., & Darwito, H. A. (2023). Enhancing Document Authenticity with QR Codes and ECC-Based Digital Signatures. 2023 International Electronics Symposium (IES), 238–243. [CrossRef]
  59. Wellem, T., Nataliani, Y., & Iriani, A. (2022). Academic Document Authentication using Elliptic Curve Digital Signature Algorithm and QR Code. JOIV : International Journal on Informatics Visualization, 6(3), 667. [CrossRef]
  60. Yerpude, S., Sood, K., & Grima, S. (2022). Blockchain-Augmented Digital Supply Chain Management: A Way to Sustainable Business. Journal of Risk and Financial Management, 16(1), 7. [CrossRef]
  61. Zhai, X., Pang, S., Wang, M., Qiao, S., & Lv, Z. (2023). TVS: a trusted verification scheme for office documents based on blockchain. Complex & Intelligent Systems, 9(3), 2865–2877. [CrossRef]
Figure 2. On-chain metadata and off-chain payload in the proposed model.
Figure 2. On-chain metadata and off-chain payload in the proposed model.
Preprints 199473 g002
Figure 7. provides evidence of DVT creation under the previously minted OT. Panel (a) displays the transaction receipt for mintDVT, where a new DVT ID is auto-incremented and written to the ledger. Panel (b) shows the DVTMinted event, which logs the DVT ID and its parent OT ID, confirming that each document token is correctly attached to its issuing organization in the on-chain hierarchy.
Figure 7. provides evidence of DVT creation under the previously minted OT. Panel (a) displays the transaction receipt for mintDVT, where a new DVT ID is auto-incremented and written to the ledger. Panel (b) shows the DVTMinted event, which logs the DVT ID and its parent OT ID, confirming that each document token is correctly attached to its issuing organization in the on-chain hierarchy.
Preprints 199473 g006
Figure 8. illustrates the enforcement of the soulbound policy for both OT and DVTs. Panel (a) shows the selection of an existing DVT ID; panel (b) displays Remix’s “transaction likely to fail” estimation when a transfer is attempted; panel (c) shows the final transaction revert with the custom error message. Together, these panels confirm that token transfers and burns are blocked at the contract level, ensuring that issued financial documents remain permanently custodied by the organization.
Figure 8. illustrates the enforcement of the soulbound policy for both OT and DVTs. Panel (a) shows the selection of an existing DVT ID; panel (b) displays Remix’s “transaction likely to fail” estimation when a transfer is attempted; panel (c) shows the final transaction revert with the custom error message. Together, these panels confirm that token transfers and burns are blocked at the contract level, ensuring that issued financial documents remain permanently custodied by the organization.
Preprints 199473 g007
Figure 10. summarizes access control behavior for OT and DVT minting. Panel (a) shows a failed OT mint attempt from a non-admin account, which is rejected by the onlyOwner modifier. Panel (b) shows a failed DVT mint attempt from an address that does not own an OT, confirming the requirement that only OT holders can issue child DVTs.
Figure 10. summarizes access control behavior for OT and DVT minting. Panel (a) shows a failed OT mint attempt from a non-admin account, which is rejected by the onlyOwner modifier. Panel (b) shows a failed DVT mint attempt from an address that does not own an OT, confirming the requirement that only OT holders can issue child DVTs.
Preprints 199473 g008
Figure 12. Verification failure due to hash mismatch after an update to a Google Drive–hosted PDF.
Figure 12. Verification failure due to hash mismatch after an update to a Google Drive–hosted PDF.
Preprints 199473 g010
Table 1. Comparison of ERC-721 and ERC-6150 for hierarchical document-token modeling.
Table 1. Comparison of ERC-721 and ERC-6150 for hierarchical document-token modeling.
Feature ERC-721 ERC-6150
Parent–child token relationship Not natively supported; requires manual mappings Natively supported via parentOf() and related functions
Multi-level hierarchy Flat, single-level ownership Supports tree-like multi-level hierarchies
Transferability Transferable by default; must be overridden for non-transfer Transferable by default; allows hierarchy-aware transfer restrictions
Suitability for document issuance Feasible with workarounds (e.g., external mappings) Well-suited to issuer–document hierarchies
Customizability for the DVT use case Requires extensive custom logic for hierarchy Designed for hierarchical assets; aligns more naturally with the DVT model.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated