<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    jsea
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Software Engineering and Applications
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    1945-3116
   </issn>
   <issn publication-format="print">
    1945-3124
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jsea.2024.178036
   </article-id>
   <article-id pub-id-type="publisher-id">
    jsea-135574
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Blockchain-Based System for Secure and Efficient Cross-Border Remittances: A Potential Alternative to SWIFT
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Omoshola S.
      </surname>
      <given-names>
       Owolabi
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Emmanuel
      </surname>
      <given-names>
       Hinneh
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Prince C.
      </surname>
      <given-names>
       Uche
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Nathaniel T.
      </surname>
      <given-names>
       Adeniken
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Jennifer A.
      </surname>
      <given-names>
       Ohaegbulem
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Samuel
      </surname>
      <given-names>
       Attakorah
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Oluwabukola G.
      </surname>
      <given-names>
       Emi-Johnson
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff3"> 
      <sup>3</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Chinaza S.
      </surname>
      <given-names>
       Belolisa
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff4"> 
      <sup>4</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Harold
      </surname>
      <given-names>
       Nwariaku
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff5"> 
      <sup>5</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aDepartment of Data Science, Carolina University, Winston Salem, NC, USA
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aPatterson School of Business, Carolina University, Winston Salem, NC, USA
    </addr-line> 
   </aff> 
   <aff id="aff3">
    <addr-line>
     aDepartment of Statistical Sciences, Wake Forest University, Winston Salem, NC, USA
    </addr-line> 
   </aff> 
   <aff id="aff4">
    <addr-line>
     aDepartment of Computer Science, Fisk University, Nashville, TN, USA
    </addr-line> 
   </aff> 
   <aff id="aff5">
    <addr-line>
     aHarold&amp;Co Procurement and Supply Chain Consulting, Lagos, Nigeria
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     23
    </day> 
    <month>
     08
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    17
   </volume> 
   <issue>
    08
   </issue>
   <fpage>
    664
   </fpage>
   <lpage>
    712
   </lpage>
   <history>
    <date date-type="received">
     <day>
      9,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      25,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      25,
     </day>
     <month>
      August
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    This paper proposes a blockchain-based system as a secure, efficient, and cost-effective alternative to SWIFT for cross-border remittances. The current SWIFT system faces challenges, including slow settlement times, high transaction costs, and vulnerability to fraud. Leveraging blockchain technology’s decentralized, transparent, and immutable nature, the proposed system aims to address these limitations. Key features include modular architecture, implementation of microservices, and advanced cryptographic protocols. The system incorporates Proof of Stake consensus with BLS signatures, smart contract execution with dynamic pricing, and a decentralized oracle network for currency conversion. A sophisticated risk-based authentication system utilizes Bayesian networks and machine learning for enhanced security. Mathematical models are presented for critical components, including transaction validation, currency conversion, and regulatory compliance. Simulations demonstrate potential improvements in transaction speed and costs. However, challenges such as regulatory hurdles, user adoption, scalability, and integration with legacy systems must be addressed. The paper provides a comparative analysis between the proposed blockchain system and SWIFT, highlighting advantages in transaction speed, costs, and security. Mitigation strategies are proposed for key challenges. Recommendations are made for further research into scaling solutions, regulatory frameworks, and user-centric designs. The adoption of blockchain-based remittances could significantly impact the financial sector, potentially disrupting traditional models and promoting financial inclusion in underserved markets. However, successful implementation will require collaboration between blockchain innovators, financial institutions, and regulators to create an enabling environment for this transformative system.
   </abstract>
   <kwd-group> 
    <kwd>
     Interoperability
    </kwd> 
    <kwd>
      Tokens
    </kwd> 
    <kwd>
      AML/KYC Compliance
    </kwd> 
    <kwd>
      Peer-to-Peer Transfers
    </kwd> 
    <kwd>
      Financial Inclusion
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <sec id="s1_1">
    <title>1.1. The Importance of Cross-Border Remittances in the Global Economy</title>
    <p>Cross-border remittances play a vital role in the global economy, serving as a lifeline for millions of individuals, businesses, and families worldwide. According to the World Bank, global remittance flows are said to have reached $589 billion in 2021 <xref ref-type="bibr" rid="scirp.135574-1">
      [1]
     </xref>. Remittances are particularly crucial for developing nations, often exceeding official development assistance and foreign direct investment (FDI) <xref ref-type="bibr" rid="scirp.135574-2">
      [2]
     </xref>. These funds support recipients’ livelihoods, contribute to poverty alleviation, and promote economic growth in recipient countries <xref ref-type="bibr" rid="scirp.135574-3">
      [3]
     </xref> <xref ref-type="bibr" rid="scirp.135574-4">
      [4]
     </xref>.</p>
    <p>Remittances have shown remarkable resilience during economic crises, including the COVID-19 pandemic. While the pandemic initially led to a slight decline in remittance flows, they have since rebounded and were projected to grow by 7.3% in 2021 <xref ref-type="bibr" rid="scirp.135574-1">
      [1]
     </xref>. This resilience underscores the importance of remittances as a stable source of external financing for developing countries <xref ref-type="bibr" rid="scirp.135574-5">
      [5]
     </xref>.</p>
   </sec>
   <sec id="s1_2">
    <title>1.2. Current Challenges with Traditional Cross-Border Payment Systems, Including SWIFT</title>
    <p>Despite the significance of cross-border remittances, traditional payment systems, such as Society for Worldwide Interbank Financial Telecommunication (SWIFT), face several challenges that hinder their efficiency and accessibility. SWIFT, which facilitates global financial transactions among over 11,000 banks and financial institutions across more than 200 countries <xref ref-type="bibr" rid="scirp.135574-6">
      [6]
     </xref>, has been criticized for its slow settlement times, high transaction costs, and lack of transparency <xref ref-type="bibr" rid="scirp.135574-7">
      [7]
     </xref>.</p>
    <p>One of the primary issues with SWIFT is the slow processing of transactions, which can take several days to complete. This delay is particularly problematic for remittances, as recipients often rely on these funds for their daily needs. Additionally, SWIFT transactions involve multiple intermediaries, leading to high transaction fees that can range from 5% to 20% of the total amount <xref ref-type="bibr" rid="scirp.135574-1">
      [1]
     </xref> <xref ref-type="bibr" rid="scirp.135574-7">
      [7]
     </xref>. These high costs disproportionately affect low-income individuals and families who depend on remittances for their livelihoods.</p>
    <p>The SWIFT system lacks transparency, making it difficult for users to track their transactions and identify potential errors or fraud. The centralized nature of SWIFT also raises concerns about security and privacy, as it is vulnerable to cyber-attacks and data breaches <xref ref-type="bibr" rid="scirp.135574-8">
      [8]
     </xref>.</p>
   </sec>
   <sec id="s1_3">
    <title>1.3. The Potential of Blockchain Technology to Revolutionize the Remittance Industry</title>
    <p>Blockchain technology, which underpins cryptocurrencies like Bitcoin, has emerged as a potential solution to the challenges faced by traditional cross-border payment systems. A blockchain is a decentralized, distributed ledger that records transactions across a network of computers <xref ref-type="bibr" rid="scirp.135574-9">
      [9]
     </xref>. Its key features, such as transparency, immutability, and security, make it an attractive alternative to centralized systems like SWIFT <xref ref-type="bibr" rid="scirp.135574-7">
      [7]
     </xref>.</p>
    <p>Leveraging blockchain technology, the remittance industry can benefit from faster settlement times, lower transaction costs, and increased transparency. Blockchain-based remittance systems can facilitate near-instant transactions by eliminating the need for intermediaries and enabling direct peer-to-peer transfers. This reduction in intermediaries also leads to lower transaction fees, making remittances more accessible and affordable for users.</p>
    <p>Furthermore, the transparency and immutability of blockchain transactions enhance security and reduce the risk of fraud <xref ref-type="bibr" rid="scirp.135574-8">
      [8]
     </xref>. The decentralized nature of blockchain networks makes them more resilient to cyber-attacks and data breaches compared to centralized systems.</p>
    <p>Several blockchain-based remittance solutions, such as Ripple and Stellar, have already emerged, demonstrating the potential of this technology to transform the industry <xref ref-type="bibr" rid="scirp.135574-1">
      [1]
     </xref>. These platforms aim to provide faster, cheaper, and more secure cross-border payments, challenging the dominance of traditional systems like SWIFT.</p>
   </sec>
   <sec id="s1_4">
    <title>1.4. Statement of Problem</title>
    <p>Given the challenges faced by traditional cross-border payment systems and the potential of blockchain technology to address these issues, this article proposes that a well-designed blockchain-based system could serve as a secure, efficient, and cost-effective alternative to SWIFT for cross-border remittances. By leveraging the inherent features of blockchain technology, such as decentralization, transparency, and immutability, a blockchain-based remittance system can offer faster settlement times, lower transaction costs, and enhanced security compared to SWIFT <xref ref-type="bibr" rid="scirp.135574-7">
      [7]
     </xref> <xref ref-type="bibr" rid="scirp.135574-10">
      [10]
     </xref>.</p>
    <p>The proposed blockchain-based system would aim to streamline the remittance process by eliminating intermediaries, enabling direct peer-to-peer transactions, and reducing the overall cost of remittances. The system would prioritize user privacy and security, ensuring compliance with anti-money laundering (AML) and know-your-customer (KYC) regulations.</p>
    <p>Providing a more accessible, affordable, and secure means of sending and receiving cross-border payments, the proposed blockchain-based remittance system has the potential to revolutionize the industry and improve the lives of millions of individuals and families who rely on remittances for their livelihoods.</p>
   </sec>
   <sec id="s1_5">
    <title>1.5. Objectives and Scope of the Proposed Blockchain-Based System Design</title>
    <p>The primary objective of the proposed blockchain-based remittance system is to provide a secure, efficient, and cost-effective alternative to traditional cross-border payment systems like SWIFT. The system aims to address the limitations of existing remittance solutions by leveraging the inherent features of blockchain technology <xref ref-type="bibr" rid="scirp.135574-7">
      [7]
     </xref>.</p>
    <p>The specific objectives of the proposed system include:</p>
    <p>1) Reducing transaction costs: By eliminating intermediaries and enabling direct peer-to-peer transactions, the blockchain-based system aims to significantly reduce the cost of remittances compared to traditional systems.</p>
    <p>2) Improving transaction speed: The proposed system seeks to facilitate near-instant cross-border payments by leveraging the decentralized nature of blockchain technology and streamlining the settlement process.</p>
    <p>3) Enhancing security and transparency: By utilizing the immutable and transparent properties of blockchain ledgers, the proposed system aims to increase the security of remittance transactions and reduce the risk of fraud.</p>
    <p>4) Ensuring regulatory compliance: The system will incorporate necessary features to comply with AML and KYC regulations, ensuring a secure and legal framework for cross-border remittances <xref ref-type="bibr" rid="scirp.135574-1">
      [1]
     </xref>.</p>
    <p>The scope of the proposed blockchain-based remittance system encompasses the design and implementation of a decentralized, secure, and efficient platform for facilitating cross-border payments. The system will focus on the following key areas:</p>
    <p>1) Architectural framework: The design will include the choice of blockchain network (public, private, or hybrid), digital wallet integration, and cross-border payment processing mechanisms <xref ref-type="bibr" rid="scirp.135574-7">
      [7]
     </xref>.</p>
    <p>2) Functional components: The system will incorporate features such as fund transfer, currency conversion, transaction validation, and reporting capabilities.</p>
    <p>3) Operational and technical considerations: The design will address scalability, interoperability with existing financial systems, and regulatory compliance.</p>
    <p>Focusing on these objectives and key areas, the proposed blockchain-based remittance system aims to provide a comprehensive and innovative solution to the challenges faced by the cross-border payment industry, ultimately benefiting millions of individuals and families who rely on remittances for their livelihoods.</p>
    <sec id="s1">
     <title>2. Overview of the SWIFT System</title>
    </sec>
    <sec id="s2_6">
     <title>2.1. How SWIFT Works</title>
     <p>The Society for Worldwide Interbank Financial Telecommunication (SWIFT) is a global messaging system that facilitates cross-border financial transactions among banks and other financial institutions. Established in 1973, SWIFT has become the primary means of communication for international payments, connecting over 11,000 institutions across more than 200 countries and territories <xref ref-type="bibr" rid="scirp.135574-6">
       [6]
      </xref>.</p>
     <p>SWIFT operates by providing a standardized and secure platform for exchanging financial messages, such as payment instructions, between member institutions <xref ref-type="bibr" rid="scirp.135574-11">
       [11]
      </xref>. When a bank customer initiates a cross-border transaction, the sending bank creates a SWIFT message containing the relevant details, including the recipient’s information, the amount to be transferred, and the purpose of the payment. This message is then transmitted through the SWIFT network to the receiving bank, which processes the payment and credits the recipient’s account.</p>
     <p>Throughout the process, SWIFT acts as a messaging system rather than a clearing or settlement system <xref ref-type="bibr" rid="scirp.135574-12">
       [12]
      </xref>. This means that while SWIFT facilitates the exchange of payment instructions, the actual transfer of funds occurs through correspondent banking relationships or other settlement systems, such as central bank real-time gross settlement (RTGS) systems <xref ref-type="bibr" rid="scirp.135574-13">
       [13]
      </xref>.</p>
    </sec>
    <sec id="s2_7">
     <title>2.2. Advantages of SWIFT</title>
     <p>SWIFT has several advantages that have contributed to its widespread adoption and success in facilitating cross-border financial transactions. One of the primary benefits of SWIFT is its global reach and standardization. By connecting thousands of financial institutions worldwide and providing a common language for financial messaging, SWIFT has streamlined international payment processes and reduced the risk of errors and misinterpretations <xref ref-type="bibr" rid="scirp.135574-11">
       [11]
      </xref>.</p>
     <p>Another advantage of SWIFT is its focus on security. The system employs various measures to protect the confidentiality, integrity, and authenticity of financial messages, such as encryption, authentication, and secure network architecture <xref ref-type="bibr" rid="scirp.135574-6">
       [6]
      </xref>. These security features have helped to reduce the risk of fraud and unauthorized access to sensitive financial information <xref ref-type="bibr" rid="scirp.135574-12">
       [12]
      </xref>.</p>
     <p>SWIFT has established a robust governance framework and compliance standards to ensure that its member institutions adhere to international regulations, such as anti-money laundering (AML) and know-your-customer (KYC) requirements <xref ref-type="bibr" rid="scirp.135574-6">
       [6]
      </xref>. This has contributed to the overall stability and integrity of the global financial system <xref ref-type="bibr" rid="scirp.135574-13">
       [13]
      </xref>.</p>
    </sec>
    <sec id="s2_8">
     <title>2.3. Limitations and Challenges of SWIFT</title>
     <p>Despite its widespread adoption and advantages, the SWIFT system faces several limitations and challenges that have prompted the search for alternative cross-border payment solutions.</p>
     <p>One of the primary drawbacks of SWIFT is the slow processing of transactions, which can take several days to complete <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. This delay is due to the multi-step process involved in SWIFT transactions, which requires the coordination of multiple intermediaries, such as correspondent banks, before the funds can be credited to the recipient’s account. The lack of real-time settlement capabilities can be particularly problematic for time-sensitive payments, such as emergency remittances or business transactions <xref ref-type="bibr" rid="scirp.135574-13">
       [13]
      </xref>.</p>
     <p>Another challenge associated with SWIFT is the high cost of cross-border transactions. SWIFT payments often involve multiple intermediaries, each charging their own fees, which can accumulate to a significant portion of the total transaction amount <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. Moreover, the exchange rates applied to cross-border transactions may not always be favorable to the users, further increasing the overall cost of remittances <xref ref-type="bibr" rid="scirp.135574-1">
       [1]
      </xref>. These high costs disproportionately affect low-income individuals and small businesses that rely on international payments.</p>
     <p>Despite SWIFT’s efforts to enhance security and compliance, the system remains vulnerable to various financial crimes, such as fraud, money laundering, and terrorist financing. The centralized nature of SWIFT and its reliance on trust among member institutions create opportunities for bad actors to exploit the system for illicit purposes <xref ref-type="bibr" rid="scirp.135574-12">
       [12]
      </xref>. In some cases, hackers have successfully breached the security of SWIFT member institutions, resulting in significant financial losses and reputational damage <xref ref-type="bibr" rid="scirp.135574-11">
       [11]
      </xref>.</p>
     <p>Another limitation of SWIFT is the lack of transparency and traceability in transactions. The system does not give users real-time visibility into their payments’ status, making it difficult to track the progress of transactions and identify potential issues or delays. This lack of transparency can also hinder the ability of regulators and law enforcement agencies to monitor and investigate suspicious activities, as the information available through SWIFT may be limited or fragmented <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
     <p>These limitations and challenges have led to a growing interest in alternative cross-border payment solutions, such as blockchain-based systems, which have the potential to address the shortcomings of SWIFT and provide a more efficient, cost-effective, and secure means of facilitating international transactions.</p>
    </sec>
   </sec>
   <sec id="s3">
    <title>3. Blockchain Technology: Key Features and Applications</title>
    <sec id="s3_1">
     <title>3.1. Explanation of Blockchain Technology</title>
     <p>Blockchain technology, which underpins cryptocurrencies like Bitcoin, is a decentralized and distributed ledger system that records transactions across a network of computers <xref ref-type="bibr" rid="scirp.135574-9">
       [9]
      </xref>. In essence, a blockchain is a continuously growing list of records, called blocks, which are linked and secured using cryptography <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. Each block contains a cryptographic hash of the previous block, a timestamp, and transaction data, forming an immutable and tamper-evident chain <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>.</p>
     <p>One of the key features of blockchain technology is its decentralized and distributed nature. Unlike traditional centralized systems, where a single authority controls and maintains the ledger, a blockchain network is maintained by a distributed network of nodes. Each node in the network holds a copy of the ledger and participates in the validation and verification of transactions. This decentralization eliminates the need for intermediaries and reduces the risk of single points of failure <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
     <p>Another essential characteristic of blockchain technology is the transparency and immutability of transaction records. Once a transaction is validated and added to the blockchain, it becomes part of the permanent record and cannot be altered or deleted <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. This immutability ensures the integrity of the transaction history and prevents tampering or fraud <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>. Moreover, the transparency of the blockchain allows all participants in the network to view the transaction records, enhancing accountability and trust.</p>
     <p>Blockchain technology employs various security measures to protect the integrity of the network and prevent fraudulent activities. The use of cryptographic techniques, such as hash functions and digital signatures, ensures the authenticity and non-repudiation of transactions <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. Additionally, the consensus mechanisms employed by blockchain networks, such as proof-of-work (PoW) or proof-of-stake (PoS), make it extremely difficult for malicious actors to manipulate the ledger or carry out double-spending attacks <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>.</p>
    </sec>
    <sec id="s3_2">
     <title>3.2. Advantages of Blockchain for Cross-Border Remittances</title>
     <p>The inherent features of blockchain technology make it particularly well-suited for addressing the challenges faced by traditional cross-border remittance systems, such as SWIFT.</p>
     <p>Eliminating the need for intermediaries and enabling direct peer-to-peer transactions, blockchain-based remittance solutions can significantly reduce transaction costs compared to traditional systems <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. The decentralized nature of blockchain networks allows for the streamlining of the settlement process, resulting in faster transaction times. This is particularly beneficial for low-income individuals and families who rely on remittances, as it makes the process more affordable and accessible.</p>
     <p>The enhanced security features of blockchain technology, such as cryptographic techniques and consensus mechanisms, make it more resilient to fraud and hacking attempts compared to centralized systems <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>. The transparency and immutability of transaction records on the blockchain also provide a higher level of accountability and trust, as all participants can view and verify the transaction history <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. This transparency can help to reduce the risk of money laundering and other illicit activities associated with cross-border payments.</p>
    </sec>
    <sec id="s3_3">
     <title>3.3. Existing Blockchain-Based Remittance Solutions (Ripple, Stellar, Cryptocurrencies)</title>
     <p>Several blockchain-based remittance solutions have emerged in recent years, aiming to provide faster, cheaper, and more secure cross-border payment services. Some notable examples include:</p>
     <p>1) Ripple: Ripple is a real-time gross settlement system, currency exchange, and remittance network built on blockchain technology <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. It aims to facilitate fast, low-cost, and secure international payments by connecting banks, payment providers, and digital asset exchanges <xref ref-type="bibr" rid="scirp.135574-16">
       [16]
      </xref>.</p>
     <p>2) Stellar: Stellar is an open-source, decentralized payment protocol that enables fast, low-cost, and cross-border transactions <xref ref-type="bibr" rid="scirp.135574-17">
       [17]
      </xref>. It focuses on providing financial services to the unbanked and underbanked populations worldwide.</p>
     <p>3) Cryptocurrencies: Cryptocurrencies, such as Bitcoin and Ethereum, can be used for cross-border remittances, offering a decentralized and peer-to-peer alternative to traditional payment systems. However, the volatility and regulatory challenges associated with cryptocurrencies may limit their widespread adoption for remittances <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
     <p>These blockchain-based solutions demonstrate the potential of the technology to transform the cross-border remittance industry, providing faster, cheaper, and more secure payment services to individuals and businesses worldwide.</p>
    </sec>
   </sec>
   <sec id="s4">
    <title>4. Blockchain-Based System Design Considerations for Cross-Border Remittances</title>
    <sec id="s4_1">
     <title>4.1. Architectural Framework</title>
     <p>The architectural framework is a fundamental aspect in the design of a blockchain-based system for cross-border remittances. It serves as the cornerstone for the system’s functionality, security, and regulatory compliance. This framework encompasses several critical components, each of which requires careful consideration and rigorous analysis.</p>
     <p>The selection of an appropriate blockchain network topology is a pivotal decision that significantly impacts the system’s performance, security, and scalability. This choice is contingent upon the specific requirements and objectives of the remittance system. The options include:</p>
     <p>1) Public Blockchains: These are open, permissionless networks (e.g., Bitcoin, Ethereum) that allow unrestricted participation. While they offer high levels of decentralization and transparency, they may pose challenges in terms of privacy and regulatory compliance for financial transactions.</p>
     <p>2) Private Blockchains: These are permissioned networks controlled by a single entity or a consortium. They offer enhanced privacy and control but may sacrifice some aspects of decentralization.</p>
     <p>3) Hybrid Blockchains: These networks combine elements of both public and private blockchains, potentially offering a balance between openness and control.</p>
     <p>For a cross-border remittance system, a hybrid or private blockchain topology may be more appropriate, as it allows for greater control over access, privacy, and regulatory compliance while potentially maintaining some of the benefits of decentralization.</p>
     <p>To systematically evaluate and select the optimal blockchain network topology, we propose the application of the Analytic Hierarchy Process (AHP) <xref ref-type="bibr" rid="scirp.135574-18">
       [18]
      </xref>. This multi-criteria decision-making approach allows for a structured comparison of alternatives based on various weighted criteria.</p>
     <p>Let 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          C 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             c 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             c 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             c 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math> represent the set of criteria (e.g., security, scalability, compliance, cost) and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          A 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mn>
             3 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math> denote the alternatives (public, private, hybrid blockchains). The AHP process involves:</p>
     <p>1) Construction of a pairwise comparison matrix for criteria: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             m 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>2) Calculation of the priority vector w for criteria:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msubsup> 
               <mstyle mathsize="140%" displaystyle="true"> 
                <mo>
                  ∏ 
                </mo> 
               </mstyle> 
               <mrow> 
                <mi>
                  j 
                </mi> 
                <mo>
                  = 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
               <mi>
                 n 
               </mi> 
              </msubsup> 
              <mtext>
                  
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msub> 
               <mi>
                 m 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  j 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mrow> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               / 
             </mo> 
             <mi>
               n 
             </mi> 
            </mrow> 
           </mrow> 
          </msup> 
         </mrow> 
         <mrow> 
          <msubsup> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              k 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msubsup> 
               <mstyle mathsize="140%" displaystyle="true"> 
                <mo>
                  ∏ 
                </mo> 
               </mstyle> 
               <mrow> 
                <mi>
                  j 
                </mi> 
                <mo>
                  = 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
               <mi>
                 n 
               </mi> 
              </msubsup> 
              <mtext>
                  
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msub> 
               <mi>
                 m 
               </mi> 
               <mrow> 
                <mi>
                  k 
                </mi> 
                <mi>
                  j 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mrow> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               / 
             </mo> 
             <mi>
               n 
             </mi> 
            </mrow> 
           </mrow> 
          </msup> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>3) Formation of pairwise comparison matrices for alternatives: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           A 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             a 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mi>
              j 
            </mi> 
           </mrow> 
           <mi>
             k 
           </mi> 
          </msubsup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>4) Computation of priority vectors for each alternative-criterion combination:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           v 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msubsup> 
               <mstyle mathsize="140%" displaystyle="true"> 
                <mo>
                  ∏ 
                </mo> 
               </mstyle> 
               <mrow> 
                <mi>
                  j 
                </mi> 
                <mo>
                  = 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
               <mn>
                 3 
               </mn> 
              </msubsup> 
              <mtext>
                  
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msubsup> 
               <mi>
                 a 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  j 
                </mi> 
               </mrow> 
               <mi>
                 k 
               </mi> 
              </msubsup> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mrow> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               / 
             </mo> 
             <mn>
               3 
             </mn> 
            </mrow> 
           </mrow> 
          </msup> 
         </mrow> 
         <mrow> 
          <msubsup> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mn>
             3 
           </mn> 
          </msubsup> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msubsup> 
               <mstyle mathsize="140%" displaystyle="true"> 
                <mo>
                  ∏ 
                </mo> 
               </mstyle> 
               <mrow> 
                <mi>
                  j 
                </mi> 
                <mo>
                  = 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
               <mn>
                 3 
               </mn> 
              </msubsup> 
              <mtext>
                  
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msubsup> 
               <mi>
                 a 
               </mi> 
               <mrow> 
                <mi>
                  l 
                </mi> 
                <mi>
                  j 
                </mi> 
               </mrow> 
               <mi>
                 k 
               </mi> 
              </msubsup> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mrow> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               / 
             </mo> 
             <mn>
               3 
             </mn> 
            </mrow> 
           </mrow> 
          </msup> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>5) Derivation of the global priority vector:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            k 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           v 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math></p>
     <p>This rigorous approach ensures a comprehensive and objective evaluation of blockchain network topologies, taking into account multiple factors crucial for cross-border remittance systems.</p>
     <p>The architecture of digital wallets and the implementation of robust user authentication systems are paramount in ensuring the security, usability, and regulatory compliance of a blockchain-based cross-border remittance platform. The system proposes a multi-faceted approach that integrates advanced cryptographic techniques, risk-based authentication, and adaptive security measures.</p>
     <p>Cryptographic Foundation</p>
     <p>The digital wallet architecture is built upon asymmetric cryptography, utilizing elliptic curve cryptography (ECC) for its superior security-to-key-size ratio <xref ref-type="bibr" rid="scirp.135574-19">
       [19]
      </xref>. Each user is assigned a unique pair of public and private keys:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mtext>
            Private Key 
          </mtext> 
          <mo>
            : 
          </mo> 
          <mi>
            k 
          </mi> 
          <mo>
            ∈ 
          </mo> 
          <msub> 
           <mi>
             ℤ 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
            Public Key 
          </mtext> 
          <mo>
            : 
          </mo> 
          <mi>
            K 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            k 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            G 
          </mi> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math></p>
     <p>where G is the base point on the elliptic curve, and n is the order of G. This cryptographic foundation ensures secure transaction signing and user identification within the blockchain network.</p>
     <p>Risk-Based Authentication System</p>
     <p>To enhance the security of user interactions with the digital wallet, the system implements a sophisticated risk-based authentication system. This system leverages a Bayesian network model <xref ref-type="bibr" rid="scirp.135574-20">
       [20]
      </xref>, allowing for dynamic adjustment of security measures based on a multitude of risk factors. The core of this authentication system is grounded in the Bayesian probability theorem:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            Y 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            X 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              X 
            </mi> 
            <mo>
              | 
            </mo> 
            <mi>
              Y 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             Y 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             X 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>where:</p>
     <p>To operationalize this model, the system employs a logistic regression function <xref ref-type="bibr" rid="scirp.135574-21">
       [21]
      </xref>, which allows for the estimation of authentication success probability based on the identified risk factors:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            Y 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            | 
          </mo> 
          <mi>
            X 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mn>
           1 
         </mn> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            + 
          </mo> 
          <msup> 
           <mtext>
             e 
           </mtext> 
           <mrow> 
            <mo>
              − 
            </mo> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 β 
               </mi> 
               <mn>
                 0 
               </mn> 
              </msub> 
              <mo>
                + 
              </mo> 
              <msubsup> 
               <mstyle mathsize="140%" displaystyle="true"> 
                <mo>
                  ∑ 
                </mo> 
               </mstyle> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mo>
                  = 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
               <mi>
                 n 
               </mi> 
              </msubsup> 
              <mtext>
                  
              </mtext> 
              <msub> 
               <mi>
                 β 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
          </msup> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>where:</p>
     <p>Adaptive Security Measures</p>
     <p>To further enhance the robustness of the authentication system, the system incorporates machine learning techniques for continuous improvement and adaptation to evolving threat landscapes. the system implements an ensemble learning approach, combining multiple classifiers to improve prediction accuracy:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          F 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           M 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          F 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is the final classifier, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> are individual classifiers (e.g., decision trees, neural networks), and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
       </mrow> 
      </math> are the weights assigned to each classifier.</p>
     <p>Multi-Factor Authentication (MFA)</p>
     <p>In addition to the risk-based system, the system proposes the implementation of a tiered MFA approach. The authentication factors are dynamically selected based on the transaction risk level, which is calculated using the following formula:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtext>
          Risk Level 
        </mtext> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <mtext>
          Amount 
        </mtext> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <mtext>
          Destination Risk 
        </mtext> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mn>
           3 
         </mn> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <mtext>
          User History 
        </mtext> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math>, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mn>
           3 
         </mn> 
        </msub> 
       </mrow> 
      </math> are weights assigned to each factor based on their relative importance.</p>
     <p>Integration with Blockchain</p>
     <p>The authentication system is seamlessly integrated with the blockchain network through a secure API layer. This integration ensures that only authenticated and authorized transactions are processed on the blockchain. It utilizes a zero-knowledge proof protocol to verify user credentials without exposing sensitive information:</p>
     <p>
      <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
        <mtext>
          Prover 
        </mtext> 
        <mover> 
         <mo>
           → 
         </mo> 
         <mrow> 
          <mtext>
            Commitment 
          </mtext> 
         </mrow> 
        </mover> 
        <mtext>
          Verifier 
        </mtext> 
        <mover> 
         <mo>
           → 
         </mo> 
         <mrow> 
          <mtext>
            Challenge 
          </mtext> 
         </mrow> 
        </mover> 
        <mtext>
          Prover 
        </mtext> 
        <mover> 
         <mo>
           → 
         </mo> 
         <mrow> 
          <mtext>
            Response 
          </mtext> 
         </mrow> 
        </mover> 
        <mtext>
          Verifier 
        </mtext> 
       </mrow> 
      </math></p>
     <p>This zero-knowledge approach enhances privacy while maintaining the integrity of the authentication process.</p>
     <p>Adopting these advanced approaches to digital wallet architecture and user authentication, the proposed remittance system achieves a sophisticated balance between security, usability, and regulatory compliance. This multi-layered security framework is crucial for the system’s success in the complex and evolving landscape of international financial transactions, providing a robust foundation for secure, efficient, and compliant cross-border remittances.</p>
     <p>The efficient processing and settlement of cross-border payments are critical components of our blockchain-based remittance system. The system models the payment network as a weighted directed graph 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          G 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            V 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            E 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>, where V represents the set of financial institutions and E represents the set of possible transaction routes between them.</p>
     <p>Network Optimization</p>
     <p>To optimize transaction routing and minimize costs, it employs the Bellman-Ford algorithm <xref ref-type="bibr" rid="scirp.135574-22">
       [22]
      </xref>, which finds the shortest paths from a source vertex to all other vertices in a weighted graph, even in the presence of negative edge weights. This is particularly useful in the context of this system, as it allows for the consideration of various factors such as transaction fees, exchange rates, and processing times (<xref ref-type="bibr" rid="scirp.135574-#A1">
       Algorithm 1
      </xref>).</p>
     <p>
      <xref ref-type="bibr" rid="scirp.135574-"></xref>Algorithm 1. Enhanced bellman-ford algorithm for payment routing.</p>
     <fig id="fig1" position="float">
      <label>Figure 1</label>
      <caption>
       <title>The calculate Weight function incorporates multiple factors:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    w
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     v
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mi>
           
   α
  
          </mi>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mi>
           
   f
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <msub> 
   
           <mi>
            
    e
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     v
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <mi>
           
   β
  
          </mi>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   x
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   h
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   g
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   R
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <msub> 
   
           <mi>
            
    e
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     v
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <mi>
           
   γ
  
          </mi>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mi>
           
   p
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   s
  
          </mi>
  
          <mi>
           
   s
  
          </mi>
  
          <mi>
           
   i
  
          </mi>
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   g
  
          </mi>
  
          <mi>
           
   T
  
          </mi>
  
          <mi>
           
   i
  
          </mi>
  
          <mi>
           
   m
  
          </mi>
  
          <msub> 
   
           <mi>
            
    e
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     v
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  α
 
         </mi>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  β
 
         </mi>

        </math>, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  γ
 
         </mi>

        </math> are weighting factors that can be dynamically adjusted based on user preferences or market conditions.Settlement MechanismFor settlement, the system implements a hybrid approach combining off-chain state channels and on-chain settlements. State channels allow for rapid, low-cost transactions between parties, while periodic on-chain settlements ensure security and finality.Let 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    S
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     j
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> represent the state channel between institutions i and j. The channel balance at time t is given by:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    B
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     j
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    t
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <msub> 
   
           <mi>
            
    B
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     j
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mn>
            
    0
   
           </mn> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   +
  
          </mo>
  
          <munderover> 
   
           <mstyle mathsize="140%" displaystyle="true">
    
            <mo>
             
     ∑
    
            </mo>
   
           </mstyle> 
   
           <mrow> 
    
            <mi>
             
     k
    
            </mi>
    
            <mo>
             
     =
    
            </mo>
    
            <mn>
             
     1
    
            </mn>
   
           </mrow> 
   
           <mi>
            
    n
   
           </mi> 
  
          </munderover> 
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    
  
          </mtext>
  
          <msub> 
   
           <mi>
            
    T
   
           </mi> 
   
           <mi>
            
    k
   
           </mi> 
  
          </msub> 
 
         </mrow>

        </math>where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    B
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     j
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mn>
            
    0
   
           </mn> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> is the initial channel balance and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    T
   
           </mi> 
   
           <mi>
            
    k
   
           </mi> 
  
          </msub> 
 
         </mrow>

        </math> represents individual transactions. On-chain settlement occurs when:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mo>
            
    |
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               B 
             </mi> 
     
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
             </mrow> 
    
            </msub> 
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mi>
               t 
             </mi> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     −
    
            </mo>
    
            <msub> 
     
             <mi>
               B 
             </mi> 
     
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
             </mrow> 
    
            </msub> 
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mn>
               0 
             </mn> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
   
           </mrow> 
   
           <mo>
            
    |
   
           </mo>
  
          </mrow>
  
          <mo>
           
   &gt;
  
          </mo>
  
          <mi>
           
   θ
  
          </mi>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
   or
  
          </mtext>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    
  
          </mtext>
  
          <mi>
           
   t
  
          </mi>
  
          <mo>
           
   −
  
          </mo>
  
          <msub> 
   
           <mi>
            
    t
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   &gt;
  
          </mo>
  
          <mi>
           
   τ
  
          </mi>
 
         </mrow>

        </math>where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  θ
 
         </mi>

        </math> is a predefined balance threshold and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  τ
 
         </mi>

        </math> is the maximum time between settlements.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId60.jpeg?20240828110310" />
     </fig>
     <p>Ensuring compliance with international regulations is crucial for the legitimacy and adoption of the proposed system cross-border remittance system. it implements a sophisticated fuzzy logic system for compliance scoring and risk assessment <xref ref-type="bibr" rid="scirp.135574-23">
       [23]
      </xref>.</p>
     <p>Fuzzy Compliance Scoring</p>
     <p>The compliance score is calculated using a centroid defuzzification method:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msup> 
         <mi>
           y 
         </mi> 
         <mtext>
           * 
         </mtext> 
        </msup> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <mrow> 
            <mo>
              ∫ 
            </mo> 
            <mrow> 
             <mi>
               y 
             </mi> 
             <mo>
               ⋅ 
             </mo> 
             <msub> 
              <mi>
                μ 
              </mi> 
              <mrow> 
               <mi>
                 a 
               </mi> 
               <mi>
                 g 
               </mi> 
               <mi>
                 g 
               </mi> 
              </mrow> 
             </msub> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                y 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
             <mtext>
               d 
             </mtext> 
             <mi>
               y 
             </mi> 
            </mrow> 
           </mrow> 
          </mstyle> 
         </mrow> 
         <mrow> 
          <mstyle displaystyle="true"> 
           <mrow> 
            <mo>
              ∫ 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                μ 
              </mi> 
              <mrow> 
               <mi>
                 a 
               </mi> 
               <mi>
                 g 
               </mi> 
               <mi>
                 g 
               </mi> 
              </mrow> 
             </msub> 
             <mrow> 
              <mo>
                ( 
              </mo> 
              <mi>
                y 
              </mi> 
              <mo>
                ) 
              </mo> 
             </mrow> 
             <mtext>
               d 
             </mtext> 
             <mi>
               y 
             </mi> 
            </mrow> 
           </mrow> 
          </mstyle> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            g 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           y 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is the aggregate membership function:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            g 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           y 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mtext>
          max 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             α 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <msub> 
           <mi>
             μ 
           </mi> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             y 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             α 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <msub> 
           <mi>
             μ 
           </mi> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mn>
              2 
            </mn> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             y 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             α 
           </mi> 
           <mi>
             k 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <msub> 
           <mi>
             μ 
           </mi> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             y 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>Here, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mrow> 
          <mi>
            C 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           y 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> represents the membership function for the i-th compliance criterion, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is its corresponding weight.</p>
     <p>Dynamic Rule Adaptation</p>
     <p>To adapt to evolving regulatory landscapes, the system implements a dynamic rule adaptation mechanism. Let 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          R 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math> be the set of compliance rules. Each rule 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           r 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is associated with an effectiveness score 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> at time t:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          λ 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            λ 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         λ 
       </mi> 
      </math> is a decay factor and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is the performance of rule 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           r 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> at time t. Rules are periodically updated based on their effectiveness scores:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            ∈ 
          </mo> 
          <mi>
            R 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            : 
          </mo> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            &gt; 
          </mo> 
          <mi>
            ε 
          </mi> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
        <mo>
          ∪ 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         ε 
       </mi> 
      </math> is a minimum effectiveness threshold and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           r 
         </mi> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> represents newly introduced rules based on regulatory updates.</p>
     <p>Regulatory Reporting</p>
     <p>The system further implements an automated regulatory reporting system that leverages the blockchain’s immutability and transparency. Transaction data is aggregated and anonymized using zero-knowledge proofs to protect user privacy while providing necessary information to regulators.</p>
     <p>Let 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          T 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math> be the set of transactions in a reporting period. The aggregated report 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           A 
         </mi> 
         <mi>
           R 
         </mi> 
        </msub> 
       </mrow> 
      </math> is generated as:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           A 
         </mi> 
         <mi>
           R 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          ZKP 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <munderover> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </munderover> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               t 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> extracts relevant features from transaction 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           t 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math>, and ZKP represents a zero-knowledge proof protocol that allows verification of the aggregated data without revealing individual transaction details.</p>
     <p>This comprehensive approach to cross-border payment processing, settlement, and regulatory compliance ensures that the blockchain-based remittance system is not only efficient and cost-effective but also fully compliant with international regulations, thereby fostering trust and facilitating wider adoption in the global financial ecosystem.</p>
    </sec>
    <sec id="s4_2">
     <title>4.2. Functional Components</title>
     <p>The efficacy of our blockchain-based cross-border remittance system hinges on several key functional components. These components are designed to address the unique challenges of international money transfers, ensuring efficiency, security, and regulatory compliance.</p>
     <p>A critical aspect of cross-border remittances is the accurate and efficient conversion of currencies. it implements a dynamic exchange rate model based on the Generalized Autoregressive Conditional Heteroskedasticity (GARCH) framework <xref ref-type="bibr" rid="scirp.135574-24">
       [24]
      </xref>, which accounts for the time-varying volatility characteristic of financial markets.</p>
     <p>Dynamic Exchange Rate Model</p>
     <p>The model incorporates an Exponential Moving Average (EMA) for trend estimation and a volatility component to capture market fluctuations:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtext>
          EMA 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          α 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mtext>
          Rate 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            α 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ⋅ 
        </mo> 
        <mtext>
          EMA 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(1)</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msup> 
         <mi>
           σ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          ω 
        </mi> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msup> 
         <mi>
           ε 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           β 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msup> 
         <mi>
           σ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(2)</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          R 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mtext>
          EMA 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ± 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          σ 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(3)</p>
     <p>where:</p>
     <p>This model allows for real-time adjustment of exchange rates, crucial for minimizing currency risk in cross-border transactions.</p>
     <p>Liquidity Management</p>
     <p>To ensure sufficient liquidity for currency conversion, it implements a multi-currency liquidity pool. The optimal allocation of funds in the pool is determined by solving a constrained optimization problem:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtable columnalign="left"> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow> 
            <mtext>
              maximize 
            </mtext> 
           </mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <munderover> 
             <mstyle mathsize="140%" displaystyle="true"> 
              <mo>
                ∑ 
              </mo> 
             </mstyle> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mo>
                = 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
             <mi>
               n 
             </mi> 
            </munderover> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <msub> 
             <mi>
               w 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
            <mo>
              ⋅ 
            </mo> 
            <mi mathvariant="double-struck">
              E 
            </mi> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 R 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow> 
            <mtext>
              subject to 
            </mtext> 
           </mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <munderover> 
             <mstyle mathsize="140%" displaystyle="true"> 
              <mo>
                ∑ 
              </mo> 
             </mstyle> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mo>
                = 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
             <mi>
               n 
             </mi> 
            </munderover> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <msub> 
             <mi>
               w 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow></mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <msub> 
             <mi>
               w 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
            <mo>
              ≥ 
            </mo> 
            <mn>
              0 
            </mn> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mo>
              ∀ 
            </mo> 
            <mi>
              i 
            </mi> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow></mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <mtext>
              VaR 
            </mtext> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mi>
               w 
             </mi> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              ≤ 
            </mo> 
            <msub> 
             <mrow> 
              <mtext>
                VaR 
              </mtext> 
             </mrow> 
             <mrow> 
              <mtext>
                max 
              </mtext> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           w 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is the weight of currency i, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi mathvariant="double-struck">
          E 
        </mi> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             R 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is its expected return, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtext>
          VaR 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           w 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is the Value at Risk of the portfolio.</p>
     <p>The integrity and security of the blockchain network are ensured through robust transaction validation and consensus mechanisms. it implements a hybrid approach, combining elements of Proof of Work (PoW), Proof of Stake (PoS), and a reputation system.</p>
     <p>Proof of Work (PoW)</p>
     <p>For initial block validation, it utilizes a PoW mechanism <xref ref-type="bibr" rid="scirp.135574-9">
       [9]
      </xref>:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          T 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          g 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          t 
        </mi> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msup> 
           <mn>
             2 
           </mn> 
           <mrow> 
            <mn>
              256 
            </mn> 
           </mrow> 
          </msup> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mrow> 
          <mi>
            D 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            f 
          </mi> 
          <mi>
            f 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            y 
          </mi> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>A block is considered valid if:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          S 
        </mi> 
        <mi>
          H 
        </mi> 
        <mi>
          A 
        </mi> 
        <mn>
          256 
        </mn> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            S 
          </mi> 
          <mi>
            H 
          </mi> 
          <mi>
            A 
          </mi> 
          <mn>
            256 
          </mn> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              b 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              c 
            </mi> 
            <mi>
              k 
            </mi> 
            <mtext>
              _ 
            </mtext> 
            <mi>
              h 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              d 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              r 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          &lt; 
        </mo> 
        <mi>
          T 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          g 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          t 
        </mi> 
       </mrow> 
      </math></p>
     <p>The difficulty is dynamically adjusted to maintain a consistent block time:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          f 
        </mi> 
        <mi>
          f 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          t 
        </mi> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          f 
        </mi> 
        <mi>
          f 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          t 
        </mi> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mrow> 
          <mi>
            o 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            d 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            A 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            T 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            T 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            g 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            T 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>Proof of Stake (PoS)</p>
     <p>To reduce energy consumption and increase scalability, it transitions to a PoS system <xref ref-type="bibr" rid="scirp.135574-25">
       [25]
      </xref> after the initial distribution phase:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           v 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            S 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            k 
          </mi> 
          <mi>
            e 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             v 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            T 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            S 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            k 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>The expected time for validator v to forge a block is:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <mi>
            T 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             v 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            B 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            k 
          </mi> 
          <mi>
            I 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            v 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             v 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>Reputation System</p>
     <p>To further enhance security and incentivize good behavior, it implements a reputation system <xref ref-type="bibr" rid="scirp.135574-26">
       [26]
      </xref>:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          R 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           v 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          α 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          S 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          R 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           v 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          β 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          U 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          e 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           v 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          γ 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          S 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          k 
        </mi> 
        <mi>
          e 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           v 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          α 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          β 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          γ 
        </mi> 
       </mrow> 
      </math> are weighting factors. The reputation score influences the probability of being selected as a validator:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            t 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           v 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            R 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            p 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             v 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            S 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            k 
          </mi> 
          <mi>
            e 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             v 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              ∈ 
            </mo> 
            <mi>
              V 
            </mi> 
           </mrow> 
          </msub> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            R 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            p 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             i 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            S 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            k 
          </mi> 
          <mi>
            e 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             i 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>Comprehensive reporting and auditing capabilities are essential for regulatory compliance and system integrity. I implement advanced anomaly detection and secure audit logging mechanisms.</p>
     <p>Anomaly Detection</p>
     <p>We employ an Isolation Forest algorithm <xref ref-type="bibr" rid="scirp.135574-27">
       [27]
      </xref> for detecting anomalous transactions:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          s 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            n 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <msup> 
         <mn>
           2 
         </mn> 
         <mrow> 
          <mo>
            − 
          </mo> 
          <mfrac> 
           <mrow> 
            <mi>
              E 
            </mi> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mi>
                h 
              </mi> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 x 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
           </mrow> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mi>
               n 
             </mi> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
          </mfrac> 
         </mrow> 
        </msup> 
       </mrow> 
      </math></p>
     <p>where:</p>
     <p>This approach allows for the efficient detection of outliers in high-dimensional datasets, which is crucial for identifying potentially fraudulent activities.</p>
     <p>Secure Audit Logging</p>
     <p>The system implements a tamper-evident audit logging system using Merkle trees. Each log entry 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is hashed and combined with previous entries:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           h 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          h 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             h 
           </mi> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msub> 
          <mo>
            | 
          </mo> 
          <mo>
            | 
          </mo> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>The root hash is periodically anchored to the blockchain:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          B 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          k 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          A 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          r 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          h 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            R 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            H 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            h 
          </mi> 
          <mo>
            | 
          </mo> 
          <mo>
            | 
          </mo> 
          <mi>
            T 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mo>
            | 
          </mo> 
          <mo>
            | 
          </mo> 
          <mi>
            P 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            v 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            A 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            r 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>This ensures the integrity and non-repudiation of audit logs, crucial for regulatory compliance and dispute resolution.</p>
     <p>Implementing these sophisticated functional components, the blockchain-based remittance system achieves a high degree of efficiency, security, and compliance. The dynamic exchange rate model ensures accurate currency conversion, the hybrid consensus mechanism provides robust security while maintaining scalability, and the advanced reporting and auditing capabilities facilitate regulatory compliance and system integrity.</p>
    </sec>
    <sec id="s4_3">
     <title>4.3. Operational and Technical Considerations</title>
     <p>The successful implementation of a blockchain-based cross-border remittance system necessitates careful consideration of various operational and technical aspects. This section delves into the critical areas of scalability, interoperability, and regulatory compliance, presenting advanced models and frameworks to address these challenges.</p>
     <p>Scalability is a paramount concern for any blockchain system, particularly one designed for high-volume financial transactions. The system proposes to address this challenge through a multi-faceted approach, leveraging parallel processing, sharding, and advanced consensus mechanisms.</p>
     <p>Parallel Processing Optimization</p>
     <p>It proposes the application of Amdahl’s Law <xref ref-type="bibr" rid="scirp.135574-28">
       [28]
      </xref> to model the theoretical speedup in transaction processing:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          S 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          p 
        </mi> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mn>
           1 
         </mn> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mo>
            + 
          </mo> 
          <mfrac> 
           <mi>
             p 
           </mi> 
           <mi>
             n 
           </mi> 
          </mfrac> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math>(4)</p>
     <p>where s is the proportion of execution time spent on the serial component, p is the proportion of parallelizable execution, and n is the number of processors.</p>
     <p>However, recognizing the limitations of Amdahl’s Law in the context of blockchain systems, it also considers Gustafson’s Law <xref ref-type="bibr" rid="scirp.135574-29">
       [29]
      </xref>:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          S 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          S 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          p 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          s 
        </mi> 
        <mo>
          + 
        </mo> 
        <mi>
          p 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          n 
        </mi> 
       </mrow> 
      </math>(5)</p>
     <p>This formulation accounts for the fact that increased computational resources often lead to tackling larger problem sizes in blockchain networks.</p>
     <p>Sharding Implementation</p>
     <p>To further enhance scalability, it proposes the implementation of a sharding mechanism <xref ref-type="bibr" rid="scirp.135574-30">
       [30]
      </xref>. The total transaction throughput of the system is modeled as:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          T 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          T 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          g 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          t 
        </mi> 
        <mo>
          = 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           k 
         </mi> 
        </munderover> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mn>
              1 
            </mn> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               O 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(6)</p>
     <p>where k is the number of shards, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is the throughput of shard i, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           O 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is the overhead associated with cross-shard communication and coordination.</p>
     <p>It proposed the optimization shard allocation using a dynamic programming approach:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              j 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            = 
          </mo> 
          <munder> 
           <mrow> 
            <mtext>
              max 
            </mtext> 
           </mrow> 
           <mrow> 
            <mn>
              0 
            </mn> 
            <mo>
              ≤ 
            </mo> 
            <mi>
              k 
            </mi> 
            <mo>
              ≤ 
            </mo> 
            <mi>
              j 
            </mi> 
           </mrow> 
          </munder> 
          <mrow> 
           <mo>
             { 
           </mo> 
           <mrow> 
            <mi>
              f 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mo>
                − 
              </mo> 
              <mn>
                1 
              </mn> 
              <mo>
                , 
              </mo> 
              <mi>
                k 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              + 
            </mo> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              r 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              g 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              p 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              t 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                k 
              </mi> 
              <mo>
                + 
              </mo> 
              <mn>
                1 
              </mn> 
              <mo>
                , 
              </mo> 
              <mi>
                j 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             } 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
            for 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            to 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            n 
          </mi> 
          <mo>
            , 
          </mo> 
          <mtext>
              
          </mtext> 
          <mi>
            j 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            to 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            m 
          </mi> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math>(7)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            j 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> represents the maximum throughput achievable with i shards and j nodes, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          g 
        </mi> 
        <mi>
          h 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          t 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            b 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> calculates the throughput for nodes a to b in a single shard.</p>
     <p>Ensuring seamless interoperability with existing financial infrastructure is crucial for the adoption and effectiveness of the proposed blockchain-based remittance system. it proposes to implement a comprehensive interoperability framework that encompasses secure authentication, efficient API design, and data standardization.</p>
     <p>Secure Authentication Protocol</p>
     <p>It adopts the OAuth 2.0 framework <xref ref-type="bibr" rid="scirp.135574-31">
       [31]
      </xref> for secure, token-based authentication. The access token structure is defined as:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
        <mtr> 
         <mtd> 
          <mtext>
            Access Token 
          </mtext> 
          <mo>
            = 
          </mo> 
          <mtext>
            Base 
          </mtext> 
          <mn>
            64 
          </mn> 
          <mtext>
            Encode 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mtext>
              Header 
            </mtext> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            + 
          </mo> 
          <mo>
            “ 
          </mo> 
          <mo>
            . 
          </mo> 
          <mo>
            ” 
          </mo> 
          <mo>
            + 
          </mo> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            Base 
          </mtext> 
          <mn>
            64 
          </mn> 
          <mtext>
            Encode 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mtext>
              Payload 
            </mtext> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            + 
          </mo> 
          <mo>
            “ 
          </mo> 
          <mo>
            . 
          </mo> 
          <mo>
            ” 
          </mo> 
          <mo>
            + 
          </mo> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            Base 
          </mtext> 
          <mn>
            64 
          </mn> 
          <mtext>
            Encode 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mtext>
              Signature 
            </mtext> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math>(8)</p>
     <p>To enhance security, It proposes the implementation of JSON Web Token (JWT) with an Elliptic Curve Digital Signature Algorithm (ECDSA):</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mtext>
            Signature 
          </mtext> 
          <mo>
            = 
          </mo> 
          <mtext>
            ECDSA 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mtext>
              Base 
            </mtext> 
            <mn>
              64 
            </mn> 
            <mtext>
              UrlEncode 
            </mtext> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mtext>
                Header 
              </mtext> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
          </mrow> 
          <mo>
            + 
          </mo> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            “ 
          </mo> 
          <mo>
            . 
          </mo> 
          <mo>
            ” 
          </mo> 
          <mo>
            + 
          </mo> 
          <mtext>
            Base 
          </mtext> 
          <mn>
            64 
          </mn> 
          <mtext>
            UrlEncode 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mtext>
              Payload 
            </mtext> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            , 
          </mo> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mrow> 
           <mrow> 
            <mtext>
              PrivateKey 
            </mtext> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math>(9)</p>
     <p>API Efficiency and Performance</p>
     <p>The system recommends designing the API following REST principles <xref ref-type="bibr" rid="scirp.135574-32">
       [32]
      </xref> and measuring its efficiency using a composite metric:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
        <mtr> 
         <mtd> 
          <mtext>
            Efficiency 
          </mtext> 
          <mo>
            = 
          </mo> 
          <mfrac> 
           <mrow> 
            <mtext>
              Successful Requests 
            </mtext> 
           </mrow> 
           <mrow> 
            <mtext>
              Total Requests 
            </mtext> 
           </mrow> 
          </mfrac> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            ⋅ 
          </mo> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mn>
              1 
            </mn> 
            <mo>
              − 
            </mo> 
            <mfrac> 
             <mrow> 
              <mtext>
                Avg Response Time 
              </mtext> 
             </mrow> 
             <mrow> 
              <mtext>
                Max Acceptable Time 
              </mtext> 
             </mrow> 
            </mfrac> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            ⋅ 
          </mo> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mn>
              1 
            </mn> 
            <mo>
              − 
            </mo> 
            <mfrac> 
             <mrow> 
              <mtext>
                Error Rate 
              </mtext> 
             </mrow> 
             <mrow> 
              <mtext>
                Max Acceptable Error Rate 
              </mtext> 
             </mrow> 
            </mfrac> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math>(10)</p>
     <p>To optimize API performance, the system intends to implement a caching strategy based on the Least Recently Used (LRU) algorithm, with cache hit ratio H defined as:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          H 
        </mi> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            C 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            H 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            s 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            C 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            H 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            s 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            C 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            M 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            s 
          </mi> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>Data Standardization and Transformation</p>
     <p>It adopts the ISO 20022 standard for financial messaging, implementing a transformation layer that converts between blockchain data structures and ISO 20022 messages. The transformation process T is modeled as:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          T 
        </mi> 
        <mo>
          : 
        </mo> 
        <mi>
          B 
        </mi> 
        <mo>
          → 
        </mo> 
        <mi>
          I 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msup> 
         <mi>
           T 
         </mi> 
         <mrow> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msup> 
        <mo>
          : 
        </mo> 
        <mi>
          I 
        </mi> 
        <mo>
          → 
        </mo> 
        <mi>
          B 
        </mi> 
       </mrow> 
      </math></p>
     <p>where B represents the blockchain data space and I represents the ISO 20022 message space.</p>
     <p>Adherence to regulatory requirements is critical for the legitimacy and adoption of the blockchain-based remittance system. It also proposes to implement a probabilistic framework for assessing and ensuring compliance across multiple jurisdictions.</p>
     <p>Compliance Probability Model</p>
     <p>It employs a Bayesian network approach <xref ref-type="bibr" rid="scirp.135574-20">
       [20]
      </xref> to model compliance probability:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            C 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            e 
          </mi> 
          <mo>
            | 
          </mo> 
          <mi>
            E 
          </mi> 
          <mi>
            v 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            d 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              E 
            </mi> 
            <mi>
              v 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              d 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              n 
            </mi> 
            <mi>
              c 
            </mi> 
            <mi>
              e 
            </mi> 
            <mo>
              | 
            </mo> 
            <mi>
              C 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
            <mi>
              p 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              n 
            </mi> 
            <mi>
              c 
            </mi> 
            <mi>
              e 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
            <mi>
              p 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              n 
            </mi> 
            <mi>
              c 
            </mi> 
            <mi>
              e 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            P 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              E 
            </mi> 
            <mi>
              v 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              d 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              n 
            </mi> 
            <mi>
              c 
            </mi> 
            <mi>
              e 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>This model is extended to account for multiple regulatory requirements and jurisdictions:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            C 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∏ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            C 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            c 
          </mi> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            | 
          </mo> 
          <mi>
            E 
          </mi> 
          <mi>
            v 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            d 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            c 
          </mi> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          C 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          c 
        </mi> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> represents compliance with the i-th regulatory requirement.</p>
     <p>Dynamic Regulatory Adaptation</p>
     <p>To address the evolving nature of regulatory landscapes, a dynamic regulatory adaptation mechanism is proposed. Let 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          R 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             r 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math> be the set of regulatory rules. Each rule 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           r 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is associated with a compliance score 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> at time t:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          λ 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            λ 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         λ 
       </mi> 
      </math> is a decay factor and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is the compliance level for rule 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           r 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> at time t. The system automatically adjusts its compliance mechanisms based on these scores:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtext>
          ComplianceAction 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <mtable columnalign="left"> 
           <mtr columnalign="left"> 
            <mtd columnalign="left"> 
             <mrow> 
              <mtext>
                Enhance 
              </mtext> 
              <mo>
                , 
              </mo> 
             </mrow> 
            </mtd> 
            <mtd columnalign="left"> 
             <mrow> 
              <mtext>
                if 
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msub> 
               <mi>
                 c 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 t 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
              <mo>
                &lt; 
              </mo> 
              <msub> 
               <mi>
                 θ 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
             </mrow> 
            </mtd> 
           </mtr> 
           <mtr columnalign="left"> 
            <mtd columnalign="left"> 
             <mrow> 
              <mtext>
                Maintain 
              </mtext> 
              <mo>
                , 
              </mo> 
             </mrow> 
            </mtd> 
            <mtd columnalign="left"> 
             <mrow> 
              <mtext>
                if 
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msub> 
               <mi>
                 θ 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
              <mo>
                ≤ 
              </mo> 
              <msub> 
               <mi>
                 c 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 t 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
              <mo>
                &lt; 
              </mo> 
              <msub> 
               <mi>
                 θ 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
             </mrow> 
            </mtd> 
           </mtr> 
           <mtr columnalign="left"> 
            <mtd columnalign="left"> 
             <mrow> 
              <mtext>
                Optimize 
              </mtext> 
              <mo>
                , 
              </mo> 
             </mrow> 
            </mtd> 
            <mtd columnalign="left"> 
             <mrow> 
              <mtext>
                if 
              </mtext> 
              <mtext>
                  
              </mtext> 
              <msub> 
               <mi>
                 c 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 t 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
              <mo>
                ≥ 
              </mo> 
              <msub> 
               <mi>
                 θ 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
             </mrow> 
            </mtd> 
           </mtr> 
          </mtable> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>(11)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           θ 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           θ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math> are predefined thresholds.</p>
     <p>Cross-Jurisdictional Compliance Optimization</p>
     <p>To optimize compliance across multiple jurisdictions, the system formulates a multi-objective optimization problem:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtable columnalign="left"> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow> 
            <mtext>
              maximize 
            </mtext> 
           </mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <mrow> 
             <mo>
               { 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 C 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 x 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 C 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 x 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
              <mo>
                , 
              </mo> 
              <mo>
                ⋯ 
              </mo> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 C 
               </mi> 
               <mi>
                 k 
               </mi> 
              </msub> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 x 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
             <mo>
               } 
             </mo> 
            </mrow> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow> 
            <mtext>
              subject to 
            </mtext> 
           </mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <msub> 
             <mi>
               g 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mi>
               x 
             </mi> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              ≤ 
            </mo> 
            <mn>
              0 
            </mn> 
            <mo>
              , 
            </mo> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
            <mo>
              , 
            </mo> 
            <mo>
              ⋯ 
            </mo> 
            <mo>
              , 
            </mo> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow></mrow> 
          </mtd> 
          <mtd columnalign="left"> 
           <mrow> 
            <msub> 
             <mi>
               h 
             </mi> 
             <mi>
               j 
             </mi> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mi>
               x 
             </mi> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              = 
            </mo> 
            <mn>
              0 
            </mn> 
            <mo>
              , 
            </mo> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              j 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
            <mo>
              , 
            </mo> 
            <mo>
              ⋯ 
            </mo> 
            <mo>
              , 
            </mo> 
            <mi>
              n 
            </mi> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
      </math>(12)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           C 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> represents the compliance level in jurisdiction i, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           g 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           h 
         </mi> 
         <mi>
           j 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> represent operational and regulatory constraints, respectively.</p>
     <p>Addressing these critical operational and technical considerations, the blockchain-based remittance system achieves high levels of scalability, interoperability, and regulatory compliance. The sophisticated models and frameworks presented here provide a robust foundation for a system capable of meeting the complex demands of cross-border financial transactions in a rapidly evolving technological and regulatory landscape.</p>
    </sec>
    <sec id="s4_4">
     <title>4.4. Addressing User Privacy and Compliance with AML/KYC Regulations</title>
     <p>In the design and implementation of the blockchain-based cross-border remittance system, the system faced the dual challenge of preserving user privacy while ensuring compliance with Anti-Money Laundering (AML) and Know Your Customer (KYC) regulations. This section presents advanced techniques and models that address these seemingly conflicting requirements.</p>
     <p>To protect user privacy in blockchain transactions, it implements a suite of cryptographic techniques with a focus on ring signatures and zero-knowledge proofs.</p>
     <p>Ring Signatures</p>
     <p>We employ an enhanced version of ring signatures <xref ref-type="bibr" rid="scirp.135574-33">
       [33]
      </xref> to obfuscate the identity of transaction signers while maintaining verifiability. The process is as follows:</p>
     <p>Let 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
      </math> be the set of public keys in the ring, where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mi>
           s 
         </mi> 
        </msub> 
       </mrow> 
      </math> is the signer’s public key.</p>
     <p>1) Generate a random value q and compute:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          e 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            q 
          </mi> 
          <mi>
            G 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where H is a cryptographic hash function, m is the message, and G is the base point of the elliptic curve.</p>
     <p>2) For each 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          i 
        </mi> 
        <mo>
          ≠ 
        </mo> 
        <mi>
          s 
        </mi> 
       </mrow> 
      </math>, randomly select 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> and compute:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mi>
            G 
          </mi> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>3) Solve for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           s 
         </mi> 
        </msub> 
       </mrow> 
      </math>:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          q 
        </mi> 
        <mi>
          G 
        </mi> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           s 
         </mi> 
        </msub> 
        <mi>
          G 
        </mi> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mi>
           s 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mi>
           s 
         </mi> 
        </msub> 
       </mrow> 
      </math></p>
     <p>4) The ring signature is 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          σ 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             e 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mo>
            ⋯ 
          </mo> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mi>
             n 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>To enhance the privacy guarantees, we implement a dynamic ring size selection based on transaction value and user risk profile:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mtable columnalign="left"> 
         <mtr columnalign="left"> 
          <mtd columnalign="left"> 
           <mrow> 
            <mi>
              R 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              n 
            </mi> 
            <mi>
              g 
            </mi> 
            <mi>
              S 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              z 
            </mi> 
            <mi>
              e 
            </mi> 
            <mo>
              = 
            </mo> 
            <mtext>
              max 
            </mtext> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mfrac> 
               <mrow> 
                <mtext>
                  log 
                </mtext> 
                <mrow> 
                 <mo>
                   ( 
                 </mo> 
                 <mrow> 
                  <mi>
                    T 
                  </mi> 
                  <mi>
                    r 
                  </mi> 
                  <mi>
                    a 
                  </mi> 
                  <mi>
                    n 
                  </mi> 
                  <mi>
                    s 
                  </mi> 
                  <mi>
                    a 
                  </mi> 
                  <mi>
                    c 
                  </mi> 
                  <mi>
                    t 
                  </mi> 
                  <mi>
                    i 
                  </mi> 
                  <mi>
                    o 
                  </mi> 
                  <mi>
                    n 
                  </mi> 
                  <mi>
                    V 
                  </mi> 
                  <mi>
                    a 
                  </mi> 
                  <mi>
                    l 
                  </mi> 
                  <mi>
                    u 
                  </mi> 
                  <mi>
                    e 
                  </mi> 
                 </mrow> 
                 <mo>
                   ) 
                 </mo> 
                </mrow> 
               </mrow> 
               <mrow> 
                <mtext>
                  log 
                </mtext> 
                <mrow> 
                 <mo>
                   ( 
                 </mo> 
                 <mrow> 
                  <mi>
                    B 
                  </mi> 
                  <mi>
                    a 
                  </mi> 
                  <mi>
                    s 
                  </mi> 
                  <mi>
                    e 
                  </mi> 
                  <mi>
                    V 
                  </mi> 
                  <mi>
                    a 
                  </mi> 
                  <mi>
                    l 
                  </mi> 
                  <mi>
                    u 
                  </mi> 
                  <mi>
                    e 
                  </mi> 
                 </mrow> 
                 <mo>
                   ) 
                 </mo> 
                </mrow> 
               </mrow> 
              </mfrac> 
              <mo>
                , 
              </mo> 
              <mi>
                M 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                n 
              </mi> 
              <mi>
                R 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                n 
              </mi> 
              <mi>
                g 
              </mi> 
              <mi>
                S 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                z 
              </mi> 
              <mi>
                e 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
      </math>(13)</p>
     <p>Zero-Knowledge Proofs</p>
     <p>The system complements ring signatures with zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs) for enhanced privacy in complex transactions. The general form of the zk-SNARK implementation is:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mi>
            π 
          </mi> 
          <mo>
            = 
          </mo> 
          <mtext>
            Prove 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              P 
            </mi> 
            <mi>
              K 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mrow> 
           <mo>
             { 
           </mo> 
           <mrow> 
            <mn>
              0 
            </mn> 
            <mo>
              , 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mo>
             } 
           </mo> 
          </mrow> 
          <mo>
            = 
          </mo> 
          <mtext>
            Verify 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              V 
            </mi> 
            <mi>
              K 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              x 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              π 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math>(14)</p>
     <p>where PK is the proving key, VK is the verification key, x is the public input, w is the private witness, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         π 
       </mi> 
      </math> is the proof.</p>
     <p>To ensure compliance with AML/KYC regulations while maintaining user privacy, it implements a sophisticated risk scoring model based on gradient boosting techniques <xref ref-type="bibr" rid="scirp.135574-34">
       [34]
      </xref>, coupled with a privacy-preserving federated learning approach.</p>
     <p>Gradient Boosting Risk Scoring Model</p>
     <p>The risk-scoring model is defined as follows:</p>
     <p>Initialize the model with a constant value:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           F 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mtext>
          arg 
        </mtext> 
        <munder> 
         <mrow> 
          <mtext>
            min 
          </mtext> 
         </mrow> 
         <mi>
           γ 
         </mi> 
        </munder> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            γ 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>For 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          m 
        </mi> 
        <mo>
          = 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </math> to M (number of iterations):</p>
     <p>1) Compute pseudo-residuals:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           r 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <mfrac> 
             <mrow> 
              <mo>
                ∂ 
              </mo> 
              <mi>
                L 
              </mi> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mrow> 
                <msub> 
                 <mi>
                   y 
                 </mi> 
                 <mi>
                   i 
                 </mi> 
                </msub> 
                <mo>
                  , 
                </mo> 
                <mi>
                  F 
                </mi> 
                <mrow> 
                 <mo>
                   ( 
                 </mo> 
                 <mrow> 
                  <msub> 
                   <mi>
                     x 
                   </mi> 
                   <mi>
                     i 
                   </mi> 
                  </msub> 
                 </mrow> 
                 <mo>
                   ) 
                 </mo> 
                </mrow> 
               </mrow> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
             <mrow> 
              <mo>
                ∂ 
              </mo> 
              <mi>
                F 
              </mi> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mrow> 
                <msub> 
                 <mi>
                   x 
                 </mi> 
                 <mi>
                   i 
                 </mi> 
                </msub> 
               </mrow> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
            </mfrac> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mi>
            F 
          </mi> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             F 
           </mi> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
        </msub> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          for 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          = 
        </mo> 
        <mn>
          1 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          to 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          n 
        </mi> 
       </mrow> 
      </math></p>
     <p>2) Fit a regression tree to the pseudo-residuals:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mrow> 
          <mrow> 
           <mo>
             { 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               R 
             </mi> 
             <mrow> 
              <mi>
                j 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             } 
           </mo> 
          </mrow> 
         </mrow> 
         <mn>
           1 
         </mn> 
         <mrow> 
          <msub> 
           <mi>
             J 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
        </msubsup> 
        <mo>
          = 
        </mo> 
        <mi>
          J 
        </mi> 
        <mtext>
          -terminal node tree 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msubsup> 
           <mrow> 
            <mrow> 
             <mo>
               { 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 r 
               </mi> 
               <mrow> 
                <mi>
                  i 
                </mi> 
                <mi>
                  m 
                </mi> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               } 
             </mo> 
            </mrow> 
           </mrow> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>3) Compute optimal terminal node predictions:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           γ 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          arg 
        </mtext> 
        <munder> 
         <mrow> 
          <mtext>
            min 
          </mtext> 
         </mrow> 
         <mi>
           γ 
         </mi> 
        </munder> 
        <munder> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            ∈ 
          </mo> 
          <msub> 
           <mi>
             R 
           </mi> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </munder> 
        <mtext>
            
        </mtext> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             F 
           </mi> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            + 
          </mo> 
          <mi>
            γ 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          for 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          j 
        </mi> 
        <mo>
          = 
        </mo> 
        <mn>
          1 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          to 
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           J 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
       </mrow> 
      </math></p>
     <p>4) Update the model:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           F 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           F 
         </mi> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          ν 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             J 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           γ 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
        <mi>
          I 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            x 
          </mi> 
          <mo>
            ∈ 
          </mo> 
          <msub> 
           <mi>
             R 
           </mi> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         ν 
       </mi> 
      </math> is the learning rate, and I is the indicator function.</p>
     <p>To enhance the model’s effectiveness in detecting money laundering patterns, it incorporates temporal features using a Long Short-Term Memory (LSTM) network:</p>
     <p>
      <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mi>
            σ 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               W 
             </mi> 
             <mi>
               f 
             </mi> 
            </msub> 
            <mo>
              ⋅ 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 h 
               </mi> 
               <mrow> 
                <mi>
                  t 
                </mi> 
                <mo>
                  − 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mi>
                 t 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mo>
              + 
            </mo> 
            <msub> 
             <mi>
               b 
             </mi> 
             <mi>
               f 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             i 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mi>
            σ 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               W 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
            <mo>
              ⋅ 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 h 
               </mi> 
               <mrow> 
                <mi>
                  t 
                </mi> 
                <mo>
                  − 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mi>
                 t 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mo>
              + 
            </mo> 
            <msub> 
             <mi>
               b 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <msub> 
           <mover accent="true"> 
            <mi>
              C 
            </mi> 
            <mo>
              ˜ 
            </mo> 
           </mover> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mtext>
            tanh 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               W 
             </mi> 
             <mi>
               C 
             </mi> 
            </msub> 
            <mo>
              ⋅ 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 h 
               </mi> 
               <mrow> 
                <mi>
                  t 
                </mi> 
                <mo>
                  − 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mi>
                 t 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mo>
              + 
            </mo> 
            <msub> 
             <mi>
               b 
             </mi> 
             <mi>
               C 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             C 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            ∗ 
          </mo> 
          <msub> 
           <mi>
             C 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msub> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             i 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            ∗ 
          </mo> 
          <msub> 
           <mover accent="true"> 
            <mi>
              C 
            </mi> 
            <mo>
              ˜ 
            </mo> 
           </mover> 
           <mi>
             t 
           </mi> 
          </msub> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             o 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mi>
            σ 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               W 
             </mi> 
             <mi>
               o 
             </mi> 
            </msub> 
            <mo>
              ⋅ 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 h 
               </mi> 
               <mrow> 
                <mi>
                  t 
                </mi> 
                <mo>
                  − 
                </mo> 
                <mn>
                  1 
                </mn> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mi>
                 t 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mo>
              + 
            </mo> 
            <msub> 
             <mi>
               b 
             </mi> 
             <mi>
               o 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             h 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             o 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
          <mo>
            ∗ 
          </mo> 
          <mtext>
            tanh 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               C 
             </mi> 
             <mi>
               t 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math>(15)</p>
     <p>The output of the LSTM network is then fed into the gradient boosting model as additional features.</p>
     <p>Privacy-Preserving Federated Learning</p>
     <p>A federated learning approach has been implemented to maintain user privacy while leveraging data from multiple sources for AML/KYC compliance. The global model G is updated as follows:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           G 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           G 
         </mi> 
         <mi>
           t 
         </mi> 
        </msub> 
        <mo>
          + 
        </mo> 
        <mi>
          η 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mfrac> 
         <mn>
           1 
         </mn> 
         <mi>
           K 
         </mi> 
        </mfrac> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            k 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           K 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mo>
          ∇ 
        </mo> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             G 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(16)</p>
     <p>where K is the number of participating entities, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         η 
       </mi> 
      </math> is the learning rate, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mo>
          ∇ 
        </mo> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             G 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is the gradient of the loss function for entity k.</p>
     <p>To protect against potential privacy leaks in the federated learning process, the system incorporates differential privacy:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mover accent="true"> 
         <mo>
           ∇ 
         </mo> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             G 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mo>
          ∇ 
        </mo> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             G 
           </mi> 
           <mi>
             t 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi mathvariant="script">
          N 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msup> 
           <mi>
             σ 
           </mi> 
           <mn>
             2 
           </mn> 
          </msup> 
          <msup> 
           <mi>
             C 
           </mi> 
           <mn>
             2 
           </mn> 
          </msup> 
          <mi>
            I 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(17)</p>
     <p>where C is the clipping threshold for gradients, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         σ 
       </mi> 
      </math> is the noise scale.</p>
     <p>Implementing these advanced privacy-preserving techniques and sophisticated AML/KYC compliance models, the blockchain-based remittance system achieves a delicate balance between user privacy and regulatory compliance. This approach not only enhances the security and confidentiality of transactions but also ensures the system’s adherence to global financial regulations, thereby fostering trust and facilitating wider adoption in the international remittance market.</p>
    </sec>
   </sec>
   <sec id="s5">
    <title>5. Software Implementation and Architecture</title>
    <p>The implementation of the blockchain-based cross-border remittance system requires a robust, scalable, and secure software architecture. This section details the system design, focusing on modular architecture, microservices implementation, and critical security considerations.</p>
    <sec id="s5_1">
     <title>5.1. System Design</title>
     <p>The system design philosophy emphasizes modularity, scalability, and security, leveraging cutting-edge software engineering practices and architectural patterns.</p>
     <p>The system adopts a highly modular architecture to enhance system flexibility, maintainability, and scalability. The modularity of The system is quantified using the Normalized Cluster Coupling (NCC) metric, which measures the degree of interdependence between different system modules:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          N 
        </mi> 
        <mi>
          C 
        </mi> 
        <mi>
          C 
        </mi> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msubsup> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
          <mtext>
              
          </mtext> 
          <msubsup> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
          <mfrac> 
           <mrow> 
            <msub> 
             <mi>
               c 
             </mi> 
             <mrow> 
              <mi>
                i 
              </mi> 
              <mi>
                j 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mrow> 
            <mrow> 
             <mo>
               | 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 C 
               </mi> 
               <mi>
                 i 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               | 
             </mo> 
            </mrow> 
            <mrow> 
             <mo>
               | 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 C 
               </mi> 
               <mi>
                 j 
               </mi> 
              </msub> 
             </mrow> 
             <mo>
               | 
             </mo> 
            </mrow> 
           </mrow> 
          </mfrac> 
         </mrow> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mrow> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                n 
              </mi> 
              <mo>
                − 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             / 
           </mo> 
           <mn>
             2 
           </mn> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math>(18)</p>
     <p>where:</p>
     <p>To optimize system modularity, the system employs a genetic algorithm to minimize the NCC: (<xref ref-type="bibr" rid="scirp.135574-#A2">
       Algorithm 2
      </xref>)</p>
     <p>This approach ensures a highly modular system structure, facilitating easier maintenance, updates, and scalability.</p>
     <p>The system implements a microservices architecture to enhance system scalability and resilience. The microservices are orchestrated using a service mesh</p>
     <p>
      <xref ref-type="bibr" rid="scirp.135574-"></xref>Algorithm 2. Modular optimization algorithm.</p>
     <fig id="fig2" position="float">
      <label>Figure 2</label>
      <caption>
       <title>implemented with Istio <xref ref-type="bibr" rid="scirp.135574-35">
         [35]
        </xref>. The service mesh provides critical capabilities such as traffic management, security, and observability.A simplified Istio configuration for the remittance service might look like this:<p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/9303308-rId304.jpeg?20240828110319" /></p>To optimize microservice communication and reduce latency, The system implements a dynamic service discovery mechanism based on a gossip protocol:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   P
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mtext>
             
     discover
    
            </mtext>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   1
  
          </mn>
  
          <mo>
           
   −
  
          </mo>
  
          <msup> 
   
           <mrow> 
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mrow> 
              <mn>
                1 
              </mn> 
              <mo>
                − 
              </mo> 
              <mi>
                p 
              </mi> 
             </mrow> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
   
           </mrow> 
   
           <mi>
            
    k
   
           </mi> 
  
          </msup> 
 
         </mrow>

        </math>where p is the probability of discovering a service in a single gossip round, and k is the number of rounds. the system would dynamically adjust k based on network conditions to maintain a balance between discovery speed and network overhead.<xref ref-type="bibr" rid="scirp.135574-"></xref>5.1.3. Security and Privacy ConsiderationsSecurity and privacy are paramount in the system design. it, therefore, implements state-of-the-art cryptographic protocols to ensure the confidentiality and integrity of all communications and transactions.Key Exchange ProtocolIt utilizes Elliptic Curve Diffie-Hellman (ECDH) for secure key exchange <xref ref-type="bibr" rid="scirp.135574-19">
         [19]
        </xref>:</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId303.jpeg?20240828110319" />
     </fig>
     <p>1) Alice generates: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             A 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             Q 
           </mi> 
           <mi>
             A 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             A 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            G 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>2) Bob generates: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             B 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             Q 
           </mi> 
           <mi>
             B 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             B 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            G 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>3) Shared secret: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          S 
        </mi> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           A 
         </mi> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           Q 
         </mi> 
         <mi>
           B 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           B 
         </mi> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           Q 
         </mi> 
         <mi>
           A 
         </mi> 
        </msub> 
       </mrow> 
      </math></p>
     <p>where G is the base point on the elliptic curve and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           A 
         </mi> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           B 
         </mi> 
        </msub> 
       </mrow> 
      </math> are private keys.</p>
     <p>To enhance the security of the ECDH protocol, the system further implements a post-quantum variant using supersingular isogeny cryptography:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           ϕ 
         </mi> 
         <mi>
           A 
         </mi> 
        </msub> 
        <mo>
          : 
        </mo> 
        <mi>
          E 
        </mi> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mi>
           E 
         </mi> 
         <mi>
           A 
         </mi> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           ϕ 
         </mi> 
         <mi>
           B 
         </mi> 
        </msub> 
        <mo>
          : 
        </mo> 
        <mi>
          E 
        </mi> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mi>
           E 
         </mi> 
         <mi>
           B 
         </mi> 
        </msub> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          j 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             E 
           </mi> 
           <mrow> 
            <mi>
              A 
            </mi> 
            <mi>
              B 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          j 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             ϕ 
           </mi> 
           <mi>
             A 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               E 
             </mi> 
             <mi>
               B 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          j 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             ϕ 
           </mi> 
           <mi>
             B 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               E 
             </mi> 
             <mi>
               A 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where E is the starting curve, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           ϕ 
         </mi> 
         <mi>
           A 
         </mi> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           ϕ 
         </mi> 
         <mi>
           B 
         </mi> 
        </msub> 
       </mrow> 
      </math> are isogenies computed by Alice and Bob respectively, and j is the j-invariant of the curve.</p>
     <p>Key Derivation</p>
     <p>For key derivation, the remittance system employs the HKDF (HMAC-based Key Derivation Function) <xref ref-type="bibr" rid="scirp.135574-36">
       [36]
      </xref>:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          R 
        </mi> 
        <mi>
          K 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          M 
        </mi> 
        <mi>
          A 
        </mi> 
        <mi>
          C 
        </mi> 
        <mo>
          − 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          h 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            t 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            I 
          </mi> 
          <mi>
            K 
          </mi> 
          <mi>
            M 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          O 
        </mi> 
        <mi>
          K 
        </mi> 
        <mi>
          M 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          K 
        </mi> 
        <mi>
          D 
        </mi> 
        <mi>
          F 
        </mi> 
        <mo>
          − 
        </mo> 
        <mi>
          E 
        </mi> 
        <mi>
          x 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          d 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            P 
          </mi> 
          <mi>
            R 
          </mi> 
          <mi>
            K 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            f 
          </mi> 
          <mi>
            o 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            L 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where:</p>
     <p>To further enhance the security of the key derivation process, The system implements a multi-stage key derivation scheme:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           K 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          K 
        </mi> 
        <mi>
          D 
        </mi> 
        <mi>
          F 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            I 
          </mi> 
          <mi>
            K 
          </mi> 
          <mi>
            M 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            f 
          </mi> 
          <msub> 
           <mi>
             o 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           K 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          K 
        </mi> 
        <mi>
          D 
        </mi> 
        <mi>
          F 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             K 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            f 
          </mi> 
          <msub> 
           <mi>
             o 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           K 
         </mi> 
         <mrow> 
          <mtext>
            final 
          </mtext> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          H 
        </mi> 
        <mi>
          K 
        </mi> 
        <mi>
          D 
        </mi> 
        <mi>
          F 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             K 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <msub> 
           <mi>
             t 
           </mi> 
           <mn>
             3 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            f 
          </mi> 
          <msub> 
           <mi>
             o 
           </mi> 
           <mn>
             3 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mrow> 
            <mtext>
              final 
            </mtext> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>This multi-stage approach provides additional protection against potential weaknesses in any single derivation step.</p>
     <p>Secure Multiparty Computation</p>
     <p>For operations requiring collaborative computation without revealing individual inputs, The system implements a secure multiparty computation (MPC) protocol based on Shamir’s Secret Sharing:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           i 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          mod 
        </mi> 
        <mi>
          p 
        </mi> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          for 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          = 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mi>
          n 
        </mi> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is a polynomial of degree 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          t 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </math>, and p is a prime number. The secret s can be reconstructed using Lagrange interpolation:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          s 
        </mi> 
        <mo>
          = 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           t 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <munder> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∏ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            ≠ 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </munder> 
        <mfrac> 
         <mi>
           j 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </mfrac> 
        <mi>
          mod 
        </mi> 
        <mi>
          p 
        </mi> 
       </mrow> 
      </math></p>
     <p>Integrating these advanced security and privacy measures into the system’s modular, microservices-based architecture ensures that the blockchain-based remittance system provides robust protection against a wide range of potential threats while maintaining high performance and scalability (<xref ref-type="fig" rid="fig1">
       Figure 1
      </xref>).</p>
     <fig id="fig3" position="float">
      <label>Figure 3</label>
      <caption>
       <title>Figure 1. Flow chart of the blockchain-based remittance system.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId341.jpeg?20240828110320" />
     </fig>
    </sec>
    <sec id="s5_2">
     <title>5.2. Mathematical Model</title>
     <p>The core functionality of the blockchain-based remittance system is underpinned by sophisticated mathematical models. These models govern critical aspects such as transaction validation, consensus mechanisms, smart contract execution, and currency conversion.</p>
     <p>The remittance system employs a Proof of Stake (PoS) consensus mechanism with slashing conditions enhanced by BLS signature aggregation for improved efficiency and security.</p>
     <p>Proof of Stake with Slashing Conditions</p>
     <p>In the PoS model <xref ref-type="bibr" rid="scirp.135574-37">
       [37]
      </xref>, the probability of validator 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           v 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> being selected to propose the next block is proportional to its stake:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             v 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mrow> 
          <msubsup> 
           <mstyle mathsize="140%" displaystyle="true"> 
            <mo>
              ∑ 
            </mo> 
           </mstyle> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             n 
           </mi> 
          </msubsup> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mi>
             j 
           </mi> 
          </msub> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is the stake of validator 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           v 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math>, and n is the total number of validators.</p>
     <p>To disincentivize malicious behavior, the system implements a slashing mechanism. If a validator is found to be Byzantine, a portion of their stake is slashed according to:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          S 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          h 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             v 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mtext>
          min 
        </mtext> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             s 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mi>
            C 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               B 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where C is a base slashing amount, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           B 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math> is the number of previous Byzantine behaviors by 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           v 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math>, and f is an increasing function, e.g., 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           x 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <msup> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
       </mrow> 
      </math>.</p>
     <p>BLS Signature Aggregation</p>
     <p>To enhance the efficiency of block validation, the system employs BLS (Boneh-Lynn-Shacham) signature aggregation <xref ref-type="bibr" rid="scirp.135574-38">
       [38]
      </xref>. This allows us to compress multiple signatures into a single signature, reducing bandwidth and verification time.</p>
     <p>The aggregate signature is computed as:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          σ 
        </mi> 
        <mo>
          = 
        </mo> 
        <munderover> 
         <mstyle mathsize="140%" displaystyle="true"> 
          <mo>
            ∑ 
          </mo> 
         </mstyle> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           k 
         </mi> 
        </munderover> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           σ 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
       </mrow> 
      </math></p>
     <p>And the aggregate public key:</p>
     <fig id="fig4" position="float">
      <label>Figure 4</label>
      <caption>
       <title>Verification is performed using a bilinear pairing e:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   e
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     σ
    
            </mi>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mi>
           
   e
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     H
    
            </mi>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mi>
               m 
             </mi> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     k
    
            </mi>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>where g is the generator of the group, H is a hash function mapping messages to group elements, and m is the message being signed.To further optimize the verification process, the system implements batch verification:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   e
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     σ
    
            </mi>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mi>
           
   e
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     H
    
            </mi>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mrow> 
              <msub> 
               <mi>
                 m 
               </mi> 
               <mn>
                 1 
               </mn> 
              </msub> 
             </mrow> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     p
    
            </mi>
    
            <msub> 
     
             <mi>
               k 
             </mi> 
     
             <mn>
               1 
             </mn> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mi>
           
   e
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     H
    
            </mi>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mrow> 
              <msub> 
               <mi>
                 m 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
             </mrow> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     p
    
            </mi>
    
            <msub> 
     
             <mi>
               k 
             </mi> 
     
             <mn>
               2 
             </mn> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mo>
           
   ⋯
  
          </mo>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mi>
           
   e
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     H
    
            </mi>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mrow> 
              <msub> 
               <mi>
                 m 
               </mi> 
               <mi>
                 k 
               </mi> 
              </msub> 
             </mrow> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     p
    
            </mi>
    
            <msub> 
     
             <mi>
               k 
             </mi> 
     
             <mi>
               k 
             </mi> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>This allows us to verify multiple signatures in a single pairing operation, significantly reducing computational overhead.<xref ref-type="bibr" rid="scirp.135574-"></xref>5.2.2. Smart Contract ExecutionThis smart contract execution model is designed to ensure fair pricing, efficient resource utilization, and incentive alignment.Payment Transfer ModelThe remittance system implements a gas-based payment transfer model for smart contract execution <xref ref-type="bibr" rid="scirp.135574-39">
         [39]
        </xref>: (<xref ref-type="bibr" rid="scirp.135574-#A3">
         Algorithm 3
        </xref>)</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="" />
     </fig>
     <p>
      <xref ref-type="bibr" rid="scirp.135574-"></xref>Algorithm 3. Enhanced payment transfer model for smart contract execution.</p>
     <fig id="fig5" position="float">
      <label>Figure 5</label>
      <caption>
       <title>Dynamic Pricing ModelThe system enhanced the basic gas model with a dynamic pricing mechanism <xref ref-type="bibr" rid="scirp.135574-40">
         [40]
        </xref> to account for varying network conditions and computational complexity:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   p
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   i
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   n
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   s
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mo>
           
   =
  
          </mo>
  
          <mi>
           
   b
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   s
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   s
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mo>
           
   ×
  
          </mo>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   m
  
          </mi>
  
          <mi>
           
   p
  
          </mi>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   x
  
          </mi>
  
          <mi>
           
   i
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   y
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   f
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mo>
           
   ×
  
          </mo>
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   w
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   k
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   f
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
 
         </mrow>

        </math>(19)where:<li class="lid"><p>
  
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
    
            <mi>
             
     b
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
   
           </mrow>
  
          </math> is the fundamental cost of the operation </p></li>
<li class="lid"><p>
  
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     x
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     f
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
   
           </mrow>
  
          </math> is derived from the operation’s computational complexity </p></li>
<li class="lid"><p>
  
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
    
            <mi>
             
     n
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     k
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     d
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     f
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
   
           </mrow>
  
          </math> is a function of current network utilization </p></li>The 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   w
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   k
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   f
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
 
         </mrow>

        </math> is modeled as:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   w
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   k
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   f
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   1
  
          </mn>
  
          <mo>
           
   +
  
          </mo>
  
          <mi>
           
   α
  
          </mi>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mfrac> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     n
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     d
    
            </mi>
    
            <mo>
             
     −
    
            </mo>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     d
    
            </mi>
   
           </mrow> 
   
           <mrow> 
    
            <mi>
             
     m
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     x
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     d
    
            </mi>
    
            <mo>
             
     −
    
            </mo>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mtext>
             
     _
    
            </mtext>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     d
    
            </mi>
   
           </mrow> 
  
          </mfrac> 
 
         </mrow>

        </math>where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  α
 
         </mi>

        </math> is a tuning parameter, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   u
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   g
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
 
         </mrow>

        </math>, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   m
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   x
  
          </mi>
  
          <mtext>
           
   _
  
          </mtext>
  
          <mi>
           
   l
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
 
         </mrow>

        </math> represent the current, desired, and maximum network loads respectively.Refund and Reward MechanismsTo incentivize efficient contract writing and execution, the system implements a refund mechanism:</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId366.jpeg?20240828110322" />
     </fig>
     <p>Additionally, the system introduces a reward system for contracts that consistently use fewer resources than estimated:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          w 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          d 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          m 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          x 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <mi>
            e 
          </mi> 
          <mi>
            x 
          </mi> 
          <mi>
            p 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            d 
          </mi> 
          <mtext>
            _ 
          </mtext> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <mtext>
            _ 
          </mtext> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          × 
        </mo> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          w 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          d 
        </mi> 
        <mtext>
          _ 
        </mtext> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </math>(21)</p>
     <p>The 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          w 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          d 
        </mi> 
        <mtext>
          _ 
        </mtext> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </math> is dynamically adjusted based on network conditions to maintain system stability:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          w 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          d 
        </mi> 
        <mtext>
          _ 
        </mtext> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          b 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          e 
        </mi> 
        <mtext>
          _ 
        </mtext> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
        <mo>
          × 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            β 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            n 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            k 
          </mi> 
          <mtext>
            _ 
          </mtext> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            d 
          </mi> 
          <mtext>
            _ 
          </mtext> 
          <mi>
            f 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            r 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          b 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          e 
        </mi> 
        <mtext>
          _ 
        </mtext> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </math> is the default reward rate, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         β 
       </mi> 
      </math> is a tuning parameter.</p>
     <p>Accurate and fair currency conversion is crucial for cross-border remittances. due to this, the system employs a decentralized oracle network with advanced aggregation techniques to ensure reliable exchange rates.</p>
     <p>Weighted Median Algorithm</p>
     <p>To aggregate exchange rate data from multiple sources, the system uses a weighted median algorithm: (<xref ref-type="bibr" rid="scirp.135574-#A4">
       Algorithm 4
      </xref>)</p>
     <p>
      <xref ref-type="bibr" rid="scirp.135574-"></xref>Algorithm 4. Weighted median algorithm for exchange rate aggregation.</p>
     <fig id="fig6" position="float">
      <label>Figure 6</label>
      <caption>
       <title>The weights 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    w
   
           </mi> 
   
           <mi>
            
    j
   
           </mi> 
  
          </msub> 
 
         </mrow>

        </math> are dynamically adjusted based on the historical accuracy of each oracle:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    w
   
           </mi> 
   
           <mi>
            
    j
   
           </mi> 
  
          </msub> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    t
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <msub> 
   
           <mi>
            
    w
   
           </mi> 
   
           <mi>
            
    j
   
           </mi> 
  
          </msub> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mo>
             
     −
    
            </mo>
    
            <mn>
             
     1
    
            </mn>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   +
  
          </mo>
  
          <mi>
           
   γ
  
          </mi>
  
          <mo>
           
   ⋅
  
          </mo>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <msub> 
     
             <mi>
               y 
             </mi> 
     
             <mi>
               j 
             </mi> 
    
            </msub> 
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mi>
               t 
             </mi> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     −
    
            </mo>
    
            <mover accent="true"> 
     
             <mrow> 
              <mi>
                a 
              </mi> 
              <mi>
                c 
              </mi> 
              <mi>
                c 
              </mi> 
              <mi>
                u 
              </mi> 
              <mi>
                r 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                c 
              </mi> 
              <mi>
                y 
              </mi> 
              <mrow> 
               <mo>
                 ( 
               </mo> 
               <mi>
                 t 
               </mi> 
               <mo>
                 ) 
               </mo> 
              </mrow> 
             </mrow> 
     
             <mo stretchy="true">
               ¯ 
             </mo> 
    
            </mover> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  γ
 
         </mi>

        </math> is a learning rate, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <mi>
           
   u
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   c
  
          </mi>
  
          <msub> 
   
           <mi>
            
    y
   
           </mi> 
   
           <mi>
            
    j
   
           </mi> 
  
          </msub> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    t
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> is the accuracy of oracle j at time t, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mover accent="true"> 
   
           <mrow> 
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mi>
               t 
             </mi> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
   
           </mrow> 
   
           <mo stretchy="true">
            
    ¯
   
           </mo> 
  
          </mover> 
 
         </mrow>

        </math> is the average accuracy across all oracles.Decentralized Data ModelThe system adopts Chainlink’s Decentralized Data Model <xref ref-type="bibr" rid="scirp.135574-41">
         [41]
        </xref> for robust oracle aggregation:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   A
  
          </mi>
  
          <mi>
           
   g
  
          </mi>
  
          <mi>
           
   g
  
          </mi>
  
          <mi>
           
   r
  
          </mi>
  
          <mi>
           
   e
  
          </mi>
  
          <mi>
           
   g
  
          </mi>
  
          <mi>
           
   a
  
          </mi>
  
          <mi>
           
   t
  
          </mi>
  
          <mi>
           
   i
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   R
  
          </mi>
  
          <mi>
           
   o
  
          </mi>
  
          <mi>
           
   u
  
          </mi>
  
          <mi>
           
   n
  
          </mi>
  
          <mi>
           
   d
  
          </mi>
  
          <mo>
           
   =
  
          </mo>
  
          <mtext>
           
   min
  
          </mtext>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mtext>
             
     max
    
            </mtext>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mrow> 
              <mi>
                R 
              </mi> 
              <mi>
                e 
              </mi> 
              <mi>
                s 
              </mi> 
              <mi>
                p 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                n 
              </mi> 
              <mi>
                s 
              </mi> 
              <mi>
                e 
              </mi> 
              <mi>
                s 
              </mi> 
             </mrow> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
    
            <mo>
             
     ,
    
            </mo>
    
            <mn>
             
     3
    
            </mn>
    
            <mi>
             
     Ω
    
            </mi>
    
            <mo>
             
     +
    
            </mo>
    
            <mn>
             
     1
    
            </mn>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>where Ω represents the Byzantine fault tolerance, typically set to n/3 for n oracles.To further enhance the reliability of the exchange rate data, the system implements a reputation-based oracle selection mechanism:
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   P
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
    
            <msub> 
     
             <mi>
               t 
             </mi> 
     
             <mi>
               i 
             </mi> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mfrac> 
   
           <mrow> 
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <msub> 
     
             <mi>
               n 
             </mi> 
     
             <mi>
               i 
             </mi> 
    
            </msub> 
   
           </mrow> 
   
           <mrow> 
    
            <msubsup> 
     
             <mstyle mathsize="140%" displaystyle="true"> 
              <mo>
                ∑ 
              </mo> 
             </mstyle> 
     
             <mrow> 
              <mi>
                j 
              </mi> 
              <mo>
                = 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
     
             <mi>
               n 
             </mi> 
    
            </msubsup> 
    
            <mtext>
             
      
    
            </mtext>
    
            <mtext>
             
      
    
            </mtext>
    
            <mi>
             
     r
    
            </mi>
    
            <mi>
             
     e
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <msub> 
     
             <mi>
               n 
             </mi> 
     
             <mi>
               j 
             </mi> 
    
            </msub> 
   
           </mrow> 
  
          </mfrac> 
 
         </mrow>

        </math>The reputation of each oracle is updated after each aggregation round:</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId399.jpeg?20240828110322" />
     </fig>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          o 
        </mi> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          r 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          p 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          o 
        </mi> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          δ 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            c 
          </mi> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <mi>
            t 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            e 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            d 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         δ 
       </mi> 
      </math> is a reputation update rate, and threshold is a minimum accuracy requirement.</p>
     <p>Implementing these advanced mathematical models for transaction validation, consensus, smart contract execution, and currency conversion, the blockchain-based remittance system achieves high levels of security, efficiency, and fairness. These sophisticated mechanisms ensure the integrity of the platform while providing a robust foundation for complex cross-border financial transactions.</p>
     <p>The decentralized oracle network plays a crucial role in the blockchain-based remittance system, particularly in facilitating accurate and reliable currency conversion. This network bridges the gap between on-chain smart contracts and off-chain real-world data, ensuring that the system has access to up-to-date exchange rates.</p>
     <p>Role and Operation Mechanism</p>
     <p>The decentralized Oracle network performs several key functions:</p>
     <p>The operation mechanism of the proposed system Oracle network is as follows:</p>
     <p>1) Data Collection: Each oracle node independently collects exchange rate data from pre-approved sources at regular intervals.</p>
     <p>2) Local Aggregation: Nodes perform local aggregation of collected data, applying statistical methods to remove outliers.</p>
     <p>3) Consensus Round: Nodes participate in a consensus round, submitting their aggregated rates to the network.</p>
     <p>4) Weighted Median Calculation: The network calculates the weighted median of submitted rates, with weights based on each oracle’s historical accuracy and stake in the network.</p>
     <p>5) On-Chain Update: The final agreed rate is submitted to the blockchain through a multi-signature transaction, requiring approval from a quorum of oracle nodes.</p>
     <p>This process is formalized in the following <xref ref-type="bibr" rid="scirp.135574-#A5">
       Algorithm 5
      </xref>:</p>
     <p>
      <xref ref-type="bibr" rid="scirp.135574-"></xref>Algorithm 5. Decentralized oracle network consensus.</p>
     <fig id="fig7" position="float">
      <label>Figure 7</label>
      <caption>
       <title>Impact on System EfficiencyThe decentralized Oracle network significantly affects the overall efficiency of the remittance system:<li class="lid"><p>Accuracy and Reliability: By aggregating data from multiple sources and using a consensus mechanism, the network provides more accurate and reliable exchange rates compared to relying on a single centralized source.</p></li>
<li class="lid"><p>Reduced Latency: The regular on-chain updates of exchange rates allow for near-real-time currency conversion, reducing the latency in processing remittance transactions.</p></li>
<li class="lid"><p>Improved Transparency: The decentralized nature of the Oracle network enhances the transparency of the exchange rate determination process, building trust among users.</p></li>
<li class="lid"><p>Resistance to Manipulation: The use of multiple oracles and a weighted consensus mechanism makes the system more resistant to price manipulation attempts, enhancing overall security. </p></li>Some of the challenges that the oracle network also introduces are:<li class="lid"><p>Increased Complexity: The need to coordinate multiple oracle nodes and reach consensus adds complexity to the system architecture.</p></li>
<li class="lid"><p>Network Overhead: The communication required between oracle nodes can introduce some network overhead, although this is generally outweighed by the benefits of decentralization. </p></li>To optimize efficiency, the remittance system implements strategies as follows:<li class="lid"><p>Adaptive update frequencies based on market volatility, reducing unnecessary updates during stable periods. </p></li>
<li class="lid"><p>Batching of exchange rate updates to minimize on-chain transactions. </p></li>
<li class="lid"><p>Implementation of a reputation system for oracles, prioritizing data from the most reliable nodes. </p></li>Implementation with a decentralized oracle network for currency conversion, The remittance system achieves a balance between accuracy, efficiency, and decentralization, crucial for handling cross-border transactions in a robust and transparent manner.5.3. Blockchain Technology Implementation DetailsThe proposed blockchain-based remittance system adopts a hybrid blockchain architecture, combining elements of both public and private blockchains to optimize for security, scalability, and regulatory compliance. The core blockchain layer proposes the implementation using a modified version of the Ethereum protocol, leveraging its smart contract functionality while incorporating custom consensus mechanisms and privacy features <xref ref-type="bibr" rid="scirp.135574-42">
         [42]
        </xref>.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId418.jpeg?20240828110323" />
     </fig>
     <p>The choice of Proof of Stake (PoS) consensus mechanism and Boneh-Lynn-Shacham (BLS) signatures for the blockchain-based remittance system is motivated by several key factors:</p>
     <p>Proof of Stake:</p>
     <p>PoS offers significant advantages over traditional Proof of Work (PoW) systems:</p>
     <p>1) Energy Efficiency: PoS eliminates the need for energy-intensive mining, making it more environmentally sustainable.</p>
     <p>2) Improved Scalability: PoS can potentially process more transactions per second, crucial for a high-volume remittance system.</p>
     <p>3) Reduced Centralization Risk: PoS mitigates the risk of mining pool centralization seen in PoW systems.</p>
     <p>However, PoS also presents challenges:</p>
     <p>1) Nothing-at-Stake Problem: Validators might be incentivized to validate conflicting chains</p>
     <p>2) Initial Distribution: Fair initial token distribution can be complex.</p>
     <p>3) Long-Range Attacks: The system must guard against history-rewriting attacks.</p>
     <p>BLS Signatures:</p>
     <p>BLS signatures complement the PoS system by offering:</p>
     <p>1) Signature Aggregation: Multiple signatures can be combined into a single signature, reducing bandwidth and storage requirements</p>
     <p>2) Threshold Signatures: Facilitates distributed key generation and signing, enhancing security</p>
     <p>3) Non-interactivity: Signatures can be aggregated without signer interaction, improving efficiency</p>
     <p>Challenges with BLS signatures include:</p>
     <p>1) Computational Overhead: Pairing-based cryptography in BLS can be computationally intensive.</p>
     <p>2) Quantum Vulnerability: Like many cryptographic systems, BLS is potentially vulnerable to quantum computing attacks.</p>
     <p>3) Implementation Complexity: Correct implementation of BLS signatures requires careful attention to detail to avoid security vulnerabilities.</p>
     <p>To address these challenges, the system recommended the implementation of several mitigation strategies:</p>
     <p>1) Slashing conditions and checkpointing to disincentivize misbehavior in the PoS system.</p>
     <p>2) Careful initial token distribution through a combination of public sale and targeted allocation to remittance industry stakeholders.</p>
     <p>3) Optimized BLS signature verification using batch verification techniques to reduce computational overhead.</p>
     <p>4) Ongoing research into post-quantum cryptographic alternatives to ensure long-term security.</p>
     <p>Leveraging the strengths of PoS and BLS signatures while actively addressing their limitations, The system aims to provide a secure, efficient, and scalable infrastructure for cross-border remittances.</p>
     <p>To address privacy concerns and improve scalability, the system proposed the incorporation of zero-knowledge proofs, specifically zk-SNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge), into the transaction validation process <xref ref-type="bibr" rid="scirp.135574-44">
       [44]
      </xref>. This allows for the verification of transactions without revealing sensitive information, crucial for maintaining user privacy in cross-border remittances.</p>
     <p>The proposed system employs a modular architecture to enhance flexibility and maintainability. A key example of this is the smart contract module, which is designed as a set of interoperable, upgradeable contracts following the proxy pattern <xref ref-type="bibr" rid="scirp.135574-45">
       [45]
      </xref>. This allows for the seamless updating of contract logic without disrupting the overall system or requiring users to migrate to new contract addresses.</p>
     <p>The proposed main remittance contract considers implementations in Solidity like this:</p>
     <fig id="fig8" position="float">
      <label>Figure 8</label>
      <caption>
       <title>This proxy contract allows for upgrading the core remittance logic by simply pointing to a new implementation address, providing flexibility for future improvements and bug fixes.<xref ref-type="bibr" rid="scirp.135574-"></xref>5.3.4. Microservices ImplementationThe system leverages a microservices architecture to improve scalability and maintainability. Key components, such as user authentication, transaction processing, and currency conversion, are implemented as separate microservices. These services communicate via a message broker (e.g., Apache Kafka) to ensure loose coupling and high availability <xref ref-type="bibr" rid="scirp.135574-46">
         [46]
        </xref>.The transaction processing microservice might be implemented in Node.js as follows:<p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/9303308-rId420.jpeg?20240828110326" /></p>This microservice receives transaction requests via HTTP and publishes them to a Kafka topic for further processing by other components of the system.Adopting these advanced blockchain technologies and architectural patterns, the proposed remittance system achieves high levels of security, scalability, and flexibility, positioning it as a robust alternative to traditional remittance systems.6. Blockchain Remittance System Simulation6.1. Code in Python<p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/9303308-rId421.jpeg?20240828110327" /></p></title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId419.jpeg?20240828110325" />
     </fig>
    </sec>
    <sec id="s5_3">
     <title>6.2. Results</title>
     <p>Here are 10 sample transaction results from the simulation:</p>
     <fig id="fig9" position="float">
      <label>Figure 9</label>
      <caption>
       <title>6.3. Final SummaryThe simulation results are as follows:<p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/9303308-rId423.jpeg?20240828110328" /></p>7. System Integration OverviewThe blockchain-based cross-border remittance system presented in this paper integrates several advanced technologies and methodologies to create a secure, efficient, and compliant platform for international money transfers. As illustrated in <xref ref-type="fig" rid="fig1">
         Figure 1
        </xref>, the system encompasses a comprehensive flow from user authentication to final settlement, incorporating cutting-edge cryptographic techniques, consensus mechanisms, and smart contract execution.The process begins with robust user authentication utilizing Elliptic Curve Diffie-Hellman (ECDH) key exchange and HKDF key derivation, ensuring secure access to digital wallets. Transaction initiation triggers a series of validation processes, leading to a Proof of Stake (PoS) consensus mechanism enhanced by BLS signature aggregation for improved efficiency and security.Central to the system’s operation is the smart contract execution module, which employs a sophisticated gas model with dynamic pricing to optimize resource utilization. This module interacts closely with the currency conversion component, which leverages a weighted median algorithm and a decentralized oracle network to ensure accurate and fair exchange rates.The entire process is underpinned by a modular architecture and microservices implementation, providing scalability and flexibility. Security and privacy considerations are woven throughout the system, from the initial key exchange to the final settlement and clearing processes.<xref ref-type="fig" rid="fig1">
         Figure 1
        </xref> provides a visual representation of this integrated workflow, demonstrating how each component contributes to the overall functionality of the remittance system. This holistic approach ensures that the system not only meets the technical requirements for efficient cross-border transactions but also adheres to regulatory standards and prioritizes user privacy and security.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9303308-rId422.jpeg?20240828110328" />
     </fig>
    </sec>
   </sec>
   <sec id="s6">
    <title>8. Comparative Analysis: Blockchain-Based System vs. SWIFT</title>
    <sec id="s6_1">
     <title>8.1. Transaction Speed and Settlement Time</title>
     <p>One of the key advantages of a blockchain-based remittance system over SWIFT is the potential for faster transaction speeds and shorter settlement times. SWIFT transactions often take several days to complete, as they require the coordination of multiple intermediaries and are subject to various clearing and settlement processes. In contrast, blockchain-based systems can facilitate near-instant transactions by enabling direct peer-to-peer transfers and automating the settlement process through smart contracts <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
     <p>For a blockchain-based system, the actual transaction speed and settlement time depend on various factors, such as the consensus mechanism, network congestion, and block confirmation times. For example, the Bitcoin blockchain has an average block time of 10 minutes, which means that transactions may take up to an hour to be fully confirmed. More recent blockchain platforms, such as Ethereum or Ripple, offer faster transaction speeds, with confirmation times ranging from seconds to minutes. Even with these limitations, blockchain-based systems can provide a significant improvement in transaction speed and settlement time compared to the multi-day process of SWIFT <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>.</p>
     <p>SWIFT transactions typically take 1 - 5 business days to complete <xref ref-type="bibr" rid="scirp.135574-6">
       [6]
      </xref>. This prolonged settlement time is due to the involvement of multiple intermediary banks and the batch-processing nature of transactions.</p>
     <p>Empirical Data: A study by McKinsey <xref ref-type="bibr" rid="scirp.135574-47">
       [47]
      </xref> found that the average cross-border payment takes 3.5 days to settle.</p>
     <p>The blockchain-based system aims to significantly reduce settlement times, potentially to minutes or even seconds.</p>
     <p>Case Study: Ripple’s blockchain-based solution demonstrated settlement times of 3 - 5 seconds in a pilot with Santander Bank <xref ref-type="bibr" rid="scirp.135574-48">
       [48]
      </xref>.</p>
     <p>Empirical Data: The Stellar network, another blockchain-based system, reports an average transaction time of 2 - 5 seconds <xref ref-type="bibr" rid="scirp.135574-49">
       [49]
      </xref> (<xref ref-type="table" rid="table1">
       Table 1
      </xref>).</p>
     <table-wrap id="table1">
      <label>
       <xref ref-type="table" rid="table1">
        Table 1
       </xref></label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.135574-"></xref>Table 1. Comparison of settlement times.</title>
      </caption>
      <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
       <tr> 
        <td class="custom-bottom-td acenter" width="39.64%">System<p style="text-align:center"></p></td> 
        <td class="custom-bottom-td acenter" width="40.97%">Average Settlement Time<p style="text-align:center"></p></td> 
        <td class="custom-bottom-td acenter" width="19.39%">Source<p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="custom-top-td acenter" width="39.64%">SWIFT<p style="text-align:center"></p></td> 
        <td class="custom-top-td acenter" width="40.97%">1 - 5 days<p style="text-align:center"></p></td> 
        <td class="custom-top-td acenter" width="19.39%">
         <xref ref-type="bibr" rid="scirp.135574-6">
          [6]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="39.64%">Blockchain (Ripple)<p style="text-align:center"></p></td> 
        <td class="acenter" width="40.97%">3 - 5 seconds<p style="text-align:center"></p></td> 
        <td class="acenter" width="19.39%">
         <xref ref-type="bibr" rid="scirp.135574-48">
          [48]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="39.64%">Blockchain (Stellar)<p style="text-align:center"></p></td> 
        <td class="acenter" width="40.97%">2 - 5 seconds<p style="text-align:center"></p></td> 
        <td class="acenter" width="19.39%">
         <xref ref-type="bibr" rid="scirp.135574-49">
          [49]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
      </table>
     </table-wrap>
    </sec>
    <sec id="s6_2">
     <title>8.2. Transaction Costs and Exchange Rate Management</title>
     <p>Another potential advantage of a blockchain-based remittance system is the reduction of transaction costs compared to SWIFT. SWIFT transactions often involve multiple intermediaries, each charging their own fees, which can accumulate to a significant portion of the total transaction amount. Blockchain-based systems can reduce these costs by eliminating the need for intermediaries and enabling direct peer-to-peer transfers. Additionally, the use of cryptocurrency tokens or stablecoins can help to minimize currency conversion fees, and exchange rate spreads, as these assets can be easily traded on decentralized exchanges <xref ref-type="bibr" rid="scirp.135574-10">
       [10]
      </xref> <xref ref-type="bibr" rid="scirp.135574-50">
       [50]
      </xref>.</p>
     <p>Blockchain-based systems are not entirely free of transaction costs, as users may need to pay network fees to incentivize miners or validators to process their transactions. The level of these fees can vary depending on the blockchain platform and the current network conditions. The volatility of cryptocurrency prices can pose challenges for exchange rate management, as the value of the transferred funds may fluctuate significantly between the initiation and completion of the transaction. The use of stablecoins or price oracles can help mitigate these risks, but they may introduce additional complexities and dependencies into the system.</p>
     <p>SWIFT transactions involve multiple fees, including sending bank fees, intermediary bank fees, and receiving bank fees. These can accumulate to a significant percentage of the transfer amount.</p>
     <p>Empirical Data: The World Bank reports that the global average cost of sending remittances was 6.5% of the transfer amount in Q4 2020 <xref ref-type="bibr" rid="scirp.135574-1">
       [1]
      </xref>.</p>
     <p>Blockchain systems can potentially reduce costs by eliminating intermediaries and automating processes.</p>
     <p>Case Study: In a trial by Banco Santander, blockchain-based international payments reduced costs by 50% compared to traditional methods <xref ref-type="bibr" rid="scirp.135574-51">
       [51]
      </xref>.</p>
     <p>Empirical Data: A study by Ripple found that financial institutions using their blockchain solution saved an average of 46% on transaction fees compared to traditional systems <xref ref-type="bibr" rid="scirp.135574-48">
       [48]
      </xref> (<xref ref-type="table" rid="table2">
       Table 2
      </xref>).</p>
     <table-wrap id="table2">
      <label>
       <xref ref-type="table" rid="table2">
        Table 2
       </xref></label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.135574-"></xref>Table 2. Comparison of transaction costs.</title>
      </caption>
      <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
       <tr> 
        <td class="custom-bottom-td acenter" width="39.64%">System<p style="text-align:center"></p></td> 
        <td class="custom-bottom-td acenter" width="40.97%">Average Cost (% of transfer)<p style="text-align:center"></p></td> 
        <td class="custom-bottom-td acenter" width="19.39%">Source<p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="custom-top-td acenter" width="39.64%">SWIFT<p style="text-align:center"></p></td> 
        <td class="custom-top-td acenter" width="40.97%">6.5%<p style="text-align:center"></p></td> 
        <td class="custom-top-td acenter" width="19.39%">
         <xref ref-type="bibr" rid="scirp.135574-1">
          [1]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="39.64%">Blockchain (Santander trial)<p style="text-align:center"></p></td> 
        <td class="acenter" width="40.97%">3.25% (est.)<p style="text-align:center"></p></td> 
        <td class="acenter" width="19.39%">
         <xref ref-type="bibr" rid="scirp.135574-51">
          [51]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="39.64%">Blockchain (Ripple study)<p style="text-align:center"></p></td> 
        <td class="acenter" width="40.97%">3.51% (est.)<p style="text-align:center"></p></td> 
        <td class="acenter" width="19.39%">
         <xref ref-type="bibr" rid="scirp.135574-48">
          [48]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
      </table>
     </table-wrap>
    </sec>
    <sec id="s6_3">
     <title>8.3. Security and Fraud Prevention Mechanisms</title>
     <p>Security and fraud prevention are critical aspects of any remittance system, and both SWIFT and blockchain-based systems have their own mechanisms to address these concerns. SWIFT has implemented various security measures, such as secure communication protocols, multi-factor authentication, and customer security controls, to protect the integrity and confidentiality of transactions. However, SWIFT has been the target of several high-profile cyber-attacks, such as the Bangladesh Bank heist in 2016, which exploited weaknesses in the bank’s security controls and resulted in the theft of $81 million <xref ref-type="bibr" rid="scirp.135574-11">
       [11]
      </xref>.</p>
     <p>Blockchain-based systems, on the other hand, rely on the inherent security features of distributed ledger technology, such as cryptographic hashing, digital signatures, and consensus mechanisms, to ensure the integrity and immutability of transactions. The decentralized nature of blockchain networks makes them more resilient to single points of failure and cyber-attacks, as there is no central authority or database that can be compromised. The transparency and audit-ability of blockchain transactions can help to detect and deter fraudulent activities, as all parties have access to a shared and tamper-proof record of the transaction history <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
     <p>Although blockchain-based systems are not immune to security risks, they may be vulnerable to software bugs and smart contract vulnerabilities. The use of cryptocurrency wallets also introduces new attack vectors, such as private key theft or social engineering attacks, which can result in the loss of funds. Therefore, the security of a blockchain-based remittance system depends on the proper implementation of security best practices, such as secure key management, regular security audits, and user education <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>.</p>
     <p>SWIFT has implemented various security measures but remains vulnerable to certain types of attacks.</p>
     <p>Case Study: The 2016 Bangladesh Bank heist, where attackers exploited SWIFT’s system to steal $81 million, highlights potential vulnerabilities <xref ref-type="bibr" rid="scirp.135574-52">
       [52]
      </xref>.</p>
     <p>Blockchain systems offer enhanced security through cryptographic techniques and decentralized architecture.</p>
     <p>Empirical Data: A study by Deloitte found that 73% of enterprises consider blockchain to be more secure than traditional systems <xref ref-type="bibr" rid="scirp.135574-53">
       [53]
      </xref>.</p>
     <p>Case Study: The Australian Securities Exchange (ASX) is replacing its CHESS system with a blockchain-based solution, citing improved security and efficiency <xref ref-type="bibr" rid="scirp.135574-54">
       [54]
      </xref>.</p>
    </sec>
    <sec id="s6_4">
     <title>8.4. Transparency and Traceability</title>
     <p>Transparency and traceability are crucial aspects of international remittance systems, affecting both user confidence and regulatory compliance. The ability to track transactions in real-time and maintain a clear audit trail is increasingly important in the global financial landscape. This section compares the SWIFT system and blockchain-based solutions in terms of their capabilities to provide transparent and traceable transactions.</p>
     <p>SWIFT transactions often lack real-time tracking and transparency.</p>
     <p>Empirical Data: A survey by PYMNTS found that 64% of businesses cite lack of payment traceability as a major pain point in cross-border transactions <xref ref-type="bibr" rid="scirp.135574-55">
       [55]
      </xref>.</p>
     <p>Blockchain systems offer real-time tracking and enhanced transparency.</p>
     <p>Case Study: IBM’s blockchain-based payment network provides real-time visibility into transaction status and fees for all parties involved <xref ref-type="bibr" rid="scirp.135574-56">
       [56]
      </xref>.</p>
    </sec>
    <sec id="s6_5">
     <title>8.5. Scalability and Transaction Throughput</title>
     <p>SWIFT processes about 42 million messages per day, equivalent to about 486 transactions per second (TPS) <xref ref-type="bibr" rid="scirp.135574-57">
       [57]
      </xref>.</p>
     <p>Scalability varies among blockchain systems. While Bitcoin processes about 7 TPS and Ethereum about 15 TPS, newer blockchain solutions show promise for higher throughput.</p>
     <p>Empirical Data: Ripple claims to handle 1500 TPS <xref ref-type="bibr" rid="scirp.135574-16">
       [16]
      </xref>, while research on sharding techniques suggests the potential for over 10,000 TPS <xref ref-type="bibr" rid="scirp.135574-58">
       [58]
      </xref> (<xref ref-type="table" rid="table3">
       Table 3
      </xref>).</p>
     <table-wrap id="table3">
      <label>
       <xref ref-type="table" rid="table3">
        Table 3
       </xref></label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.135574-"></xref>Table 3. Comparison of transaction throughput.</title>
      </caption>
      <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
       <tr> 
        <td class="custom-bottom-td acenter" width="46.12%">System<p style="text-align:center"></p></td> 
        <td class="custom-bottom-td acenter" width="36.63%">Transactions Per Second<p style="text-align:center"></p></td> 
        <td class="custom-bottom-td acenter" width="17.24%">Source<p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="custom-top-td acenter" width="46.12%">SWIFT<p style="text-align:center"></p></td> 
        <td class="custom-top-td acenter" width="36.63%">486<p style="text-align:center"></p></td> 
        <td class="custom-top-td acenter" width="17.24%">
         <xref ref-type="bibr" rid="scirp.135574-57">
          [57]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="46.12%">Bitcoin<p style="text-align:center"></p></td> 
        <td class="acenter" width="36.63%">7<p style="text-align:center"></p></td> 
        <td class="acenter" width="17.24%">
         <xref ref-type="bibr" rid="scirp.135574-59">
          [59]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="46.12%">Ethereum<p style="text-align:center"></p></td> 
        <td class="acenter" width="36.63%">15<p style="text-align:center"></p></td> 
        <td class="acenter" width="17.24%">
         <xref ref-type="bibr" rid="scirp.135574-60">
          [60]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="46.12%">Ripple<p style="text-align:center"></p></td> 
        <td class="acenter" width="36.63%">1500<p style="text-align:center"></p></td> 
        <td class="acenter" width="17.24%">
         <xref ref-type="bibr" rid="scirp.135574-16">
          [16]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="46.12%">Sharded Blockchain (theoretical)<p style="text-align:center"></p></td> 
        <td class="acenter" width="36.63%">10,000<p style="text-align:center"></p></td> 
        <td class="acenter" width="17.24%">
         <xref ref-type="bibr" rid="scirp.135574-58">
          [58]
         </xref><p style="text-align:center"></p></td> 
       </tr> 
      </table>
     </table-wrap>
    </sec>
    <sec id="s6_6">
     <title>8.6. Room for Improvement in Blockchain Systems</title>
     <p>While blockchain-based systems show significant advantages, there are areas for improvement:</p>
     <p>1) Regulatory Compliance: Ensuring compliance with diverse international regulations remains a challenge. Case Study: The development of Central Bank Digital Currencies (CBDCs) aims to address this by combining blockchain technology with regulatory oversight <xref ref-type="bibr" rid="scirp.135574-61">
       [61]
      </xref>.</p>
     <p>2) Interoperability: Improving interoperability between different blockchain networks and with traditional financial systems is crucial. Case Study: The Interledger Protocol aims to facilitate transactions across different ledgers <xref ref-type="bibr" rid="scirp.135574-62">
       [62]
      </xref>.</p>
     <p>3) Energy Efficiency: Some blockchain consensus mechanisms, particularly Proof of Work, are energy-intensive. Empirical Data: A single Bitcoin transaction consumes 2291.39 kWh, equivalent to the power consumption of an average U. S. household over 78.26 days <xref ref-type="bibr" rid="scirp.135574-63">
       [63]
      </xref>.</p>
     <p>4) User Experience: Simplifying the user interface and experience for non-technical users remains an area for improvement.</p>
    </sec>
    <sec id="s6_7">
     <title>8.7. Compliance and Integration with Existing Financial Infrastructure</title>
     <p>Compliance with regulatory requirements and integration with existing financial infrastructure are critical challenges for both SWIFT and blockchain-based remittance systems. SWIFT has established a comprehensive regulatory compliance framework, which includes customer due diligence, anti-money laundering (AML), and counter-terrorist financing (CTF) measures <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. SWIFT also works closely with financial institutions and regulatory authorities to ensure that its network and standards are aligned with the evolving regulatory landscape.</p>
     <p>Blockchain-based systems, on the other hand, may face significant regulatory hurdles, as they operate in a largely unregulated and decentralized environment. The use of cryptocurrencies and anonymous transactions may raise concerns about money laundering, tax evasion, and other illicit activities <xref ref-type="bibr" rid="scirp.135574-64">
       [64]
      </xref>. To address these concerns, blockchain-based remittance systems need to implement robust KYC/AML procedures and comply with relevant regulations, such as the Travel Rule and the Fifth Anti-Money Laundering Directive (5AMLD) <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>.</p>
     <p>The integration of blockchain-based systems with existing financial infrastructure, such as banks, payment processors, and liquidity providers, can be challenging due to the differences in technology standards, data formats, and business models <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. The lack of interoperability and standardization among different blockchain platforms and networks can also hinder the seamless exchange of information and value across different systems. Therefore, the success of a blockchain-based remittance system depends on its ability to bridge the gap between the traditional financial system and the emerging blockchain ecosystem.</p>
    </sec>
   </sec>
   <sec id="s7">
    <title>9. Challenges and Mitigation Strategies</title>
    <sec id="s7_1">
     <title>9.1. Regulatory and Legal Hurdles</title>
     <p>One of the most significant challenges facing the implementation of a blockchain-based remittance system is navigating the complex and often uncertain regulatory and legal landscape. As blockchain technology and cryptocurrencies are still relatively new and rapidly evolving, there is a lack of clear and consistent regulations across different jurisdictions. This regulatory uncertainty can create legal risks and compliance challenges for blockchain-based remittance providers, as they may face different requirements and restrictions depending on the countries and regions they operate in <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
     <p>To mitigate these regulatory and legal hurdles, blockchain-based remittance providers should:</p>
     <p>By working together to address the regulatory and legal challenges, the blockchain remittance industry can create a more stable and predictable environment for innovation and growth.</p>
    </sec>
    <sec id="s7_2">
     <title>9.2. User Adoption and Change Management</title>
     <p>Another challenge facing the blockchain-based remittance system is driving user adoption and managing the change from traditional remittance methods to the new blockchain-based approach. Many potential users of blockchain remittances, especially in developing countries, may have limited knowledge and understanding of blockchain technology and cryptocurrencies, as well as limited access to the necessary digital infrastructure and tools <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>.</p>
     <p>To overcome these adoption barriers, blockchain-based remittance providers should:</p>
     <p>To manage the change from traditional remittance methods to the blockchain-based approach, blockchain remittance providers should develop a clear and phased transition plan that minimizes disruptions and risks for users and partners. They should provide training and support to their staff and agents to ensure that they are equipped to handle the new technology and processes, as well as to communicate the benefits and changes to users <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>.</p>
    </sec>
    <sec id="s7_3">
     <title>9.3. User Adoption: Barriers and Incentives</title>
     <p>The successful implementation of the blockchain-based remittance system ultimately depends on its adoption by end-users. Understanding and addressing the barriers to adoption while providing compelling incentives is crucial for the system’s widespread acceptance and use.</p>
     <p>Several factors may impede the adoption of the blockchain-based remittance system:</p>
     <p>To overcome these barriers and encourage adoption, the system proposes implementing the following incentives:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          F 
        </mi> 
        <mi>
          e 
        </mi> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mrow> 
          <mi>
            b 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            k 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          F 
        </mi> 
        <mi>
          e 
        </mi> 
        <msub> 
         <mi>
           e 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            d 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          × 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            D 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            s 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            R 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(22)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          R 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
       </mrow> 
      </math> decreases over time to incentivize early adoption.</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          R 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          w 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          s 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          T 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          s 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          c 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          V 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          m 
        </mi> 
        <mi>
          e 
        </mi> 
        <mo>
          × 
        </mo> 
        <mi>
          R 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          w 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          R 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          t 
        </mi> 
        <mi>
          e 
        </mi> 
        <mo>
          + 
        </mo> 
        <mi>
          R 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          f 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          r 
        </mi> 
        <mi>
          a 
        </mi> 
        <mi>
          l 
        </mi> 
        <mi>
          B 
        </mi> 
        <mi>
          o 
        </mi> 
        <mi>
          n 
        </mi> 
        <mi>
          u 
        </mi> 
        <mi>
          s 
        </mi> 
       </mrow> 
      </math>(23)</p>
     <p>To maximize the effectiveness of these incentives and overcome adoption barriers, the system proposes a phased rollout strategy:</p>
     <p>1) Pilot Phase: Launch in a limited number of high-volume remittance corridors, focusing on tech-savvy early adopters.</p>
     <p>2) Feedback and Iteration: Gather user feedback and iterate on the system design and user experience.</p>
     <p>3) Strategic Partnerships: Establish partnerships with local financial institutions and mobile money providers to expand reach.</p>
     <p>4) Educational Campaign: Launch a comprehensive educational campaign to increase awareness and understanding of the system.</p>
     <p>5) Gradual Expansion: Expand to additional remittance corridors, adapting the strategy based on lessons learned from the pilot phase.</p>
     <p>The expected adoption rate can be modeled using a modified Bass diffusion model <xref ref-type="bibr" rid="scirp.135574-67">
       [67]
      </xref>:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mfrac> 
         <mrow> 
          <mtext>
            d 
          </mtext> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <mtext>
            d 
          </mtext> 
          <mi>
            t 
          </mi> 
         </mrow> 
        </mfrac> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mo>
            + 
          </mo> 
          <mfrac> 
           <mi>
             q 
           </mi> 
           <mi>
             m 
           </mi> 
          </mfrac> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            m 
          </mi> 
          <mo>
            − 
          </mo> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>(24)</p>
     <p>where:</p>
     <p>
      <xref ref-type="bibr" rid="scirp.135574-"></xref>This model can be adjusted to account for the impact of the incentives and marketing efforts on the coefficients p and q.</p>
    </sec>
    <sec id="s7_4">
     <title>9.4. Scalability and Network Congestion</title>
     <p>Scalability and network congestion are technical challenges that can affect the performance and reliability of the blockchain-based remittance system, especially as it grows and processes more transactions. Blockchain networks have limited transaction throughput and can become congested when there is a high volume of transactions, leading to slower confirmation times and higher fees.</p>
     <p>To mitigate these scalability and congestion issues, blockchain-based remittance providers can explore and implement various scaling solutions and techniques, such as:</p>
     <p>1) Layer 2 solutions: These are protocols and networks that operate on top of the main blockchain network and enable faster and cheaper transactions by offloading some of the transaction processing and data storage to off-chain channels or sidechains <xref ref-type="bibr" rid="scirp.135574-64">
       [64]
      </xref>. Examples of Layer 2 solutions include the Lightning Network for Bitcoin and the Raiden Network for Ethereum <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>.</p>
     <p>2) Sharding: This is a technique that partitions the blockchain network into smaller subsets or shards, each processing a portion of the transactions in parallel, thereby increasing the overall throughput and capacity of the network <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. Sharding is being implemented in some blockchain platforms, such as Ethereum 2.0 and Zilliqa.</p>
     <p>3) Consensus algorithm optimization: Blockchain-based remittance providers can also explore alternative consensus algorithms that are more scalable and efficient than the traditional Proof-of-Work (PoW) algorithm, such as Proof-of-Stake (PoS), Delegated Proof-of-Stake (DPoS), or Practical Byzantine Fault Tolerance (PBFT). These algorithms can help to reduce the computational resources and time required to reach consensus and validate transactions <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>.</p>
     <p>4) Off-chain transactions: Another approach to scaling blockchain remittances is to process some transactions off-chain, using private or permissioned networks that are faster and cheaper than public blockchains <xref ref-type="bibr" rid="scirp.135574-64">
       [64]
      </xref>. These off-chain transactions can be periodically settled and recorded on the main blockchain for security and auditability <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>.</p>
     <p>Implementing these scaling solutions and techniques, blockchain-based remittance providers can improve the performance and reliability of their systems, even as they grow and process more transactions. However, they should also carefully evaluate and test these solutions to ensure that they do not compromise the security, decentralization, or usability of the blockchain-based remittance system <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>.</p>
    </sec>
    <sec id="s7_5">
     <title>9.5. Integration with Legacy Financial Systems</title>
     <p>Integrating the blockchain-based remittance system with legacy financial systems and infrastructure can be a significant challenge, as it requires bridging the gap between two very different and often incompatible technologies and standards. Legacy financial systems, such as banks, payment processors, and correspondent networks, rely on centralized databases, proprietary protocols, and complex regulatory frameworks that may not easily accommodate or recognize blockchain-based transactions and assets <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>.</p>
     <p>To enable seamless and secure integration with legacy financial systems, blockchain-based remittance providers should develop and adopt interoperability standards and protocols that allow different blockchain networks and traditional financial systems to communicate and exchange data and value <xref ref-type="bibr" rid="scirp.135574-64">
       [64]
      </xref>. These interoperability solutions can include:</p>
     <p>1) Blockchain agnostic protocols: These are protocols that enable communication and transaction exchange between different blockchain networks, regardless of their underlying technologies or consensus mechanisms <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. Examples include the Interledger Protocol (ILP) and the Cosmos Network.</p>
     <p>2) Blockchain-to-traditional finance gateways: These are intermediaries or platforms that act as bridges between blockchain networks and traditional financial systems, enabling the conversion and transfer of funds and data between the two domains <xref ref-type="bibr" rid="scirp.135574-7">
       [7]
      </xref>. Examples include blockchain-based stablecoins, such as Tether or USDC, that are pegged to fiat currencies and can be easily integrated with bank accounts and payment systems.</p>
     <p>3) Regulatory sandboxes and pilot programs: Blockchain-based remittance providers can also collaborate with regulators and traditional financial institutions to establish regulatory sandboxes and pilot programs that allow for the testing and validation of blockchain remittance solutions in a controlled and supervised environment <xref ref-type="bibr" rid="scirp.135574-15">
       [15]
      </xref>. These programs can help to identify and address the technical, legal, and operational challenges of integrating blockchain remittances with legacy financial systems, as well as to build trust and partnerships between the two industries <xref ref-type="bibr" rid="scirp.135574-64">
       [64]
      </xref>.</p>
     <p>By developing and adopting these interoperability solutions and collaborative approaches, blockchain-based remittance providers can gradually overcome the integration challenges and tap into the vast network and resources of the traditional financial system while also bringing the benefits of blockchain technology to a wider audience <xref ref-type="bibr" rid="scirp.135574-14">
       [14]
      </xref>. However, this integration process will require significant investment, coordination, and compromise from both the blockchain and traditional finance communities, as well as support and guidance from regulators and policymakers.</p>
    </sec>
   </sec>
   <sec id="s8">
    <title>10. Conclusions</title>
    <p>The proposed blockchain-based remittance system offers several comparative advantages over the SWIFT system, which has long dominated the cross-border payments industry. Firstly, blockchain technology enables faster and cheaper transactions by eliminating the need for intermediaries and enabling peer-to-peer transfers, reducing the time and cost of settlement. Secondly, blockchain provides a higher level of security and transparency by using cryptographic techniques and distributed ledgers to prevent fraud and enable real-time auditing.</p>
    <p>Blockchain enables programmable and automated transactions through smart contracts, reducing the risk of errors and disputes and enabling new use cases and business models. Finally, blockchain has the potential to promote financial inclusion and access by providing a more open and accessible infrastructure for remittances, particularly in underserved and unbanked regions.</p>
    <p>However, it is important to note that the adoption and impact of blockchain-based remittance systems will depend on various factors, such as regulatory support, user acceptance, and technological maturity, and may vary across different countries and market segments.</p>
    <p>While the proposed blockchain-based remittance system offers significant potential benefits, it also has several limitations and challenges that need to be addressed through further research and development. This paper recommends that:</p>
    <p>The development and adoption of blockchain-based remittance systems have significant implications for the remittance industry and the broader financial sector. Firstly, blockchain technology has the potential to disrupt the traditional remittance value chain and business models, by enabling new entrants and business models, such as digital-only providers, peer-to-peer platforms, and decentralized marketplaces, to compete with incumbent players and offer innovative and affordable services.</p>
    <p>Secondly, blockchain-based remittances may have a positive impact on financial inclusion and development by providing access to fast, cheap, and secure payment services for underserved and unbanked populations, particularly in emerging and frontier markets. This can help to reduce the costs and risks of remittances, increase the flow of funds into local economies, and support the achievement of the United Nations’ Sustainable Development Goals (SDGs).</p>
    <p>However, the adoption of blockchain-based remittances may also pose challenges and risks for the financial sector, such as the need to adapt to new technologies and standards, the potential for disintermediation and loss of market share, and the exposure to new types of risks, such as cyber-attacks, money laundering, and consumer protection issues. Therefore, financial institutions and regulators need to proactively engage with the blockchain ecosystem and develop strategies and frameworks to harness the opportunities and mitigate the risks of this emerging technology.</p>
   </sec>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.135574-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     World Bank (2021) Remittance Flows Register Robust 7.3 Percent Growth in 2021. &gt;https://www.worldbank.org/en/news/press-release/2021/11/17/remittance-flows-register-robust-7-3-percent-growth-in-2021
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ratha, D., De, S., Kim, E.J., Plaza, S., Seshan, G. and Yameogo, N.D. (2021) Migration and Development Brief 34. &gt;https://www.knomad.org/publication/migration-and-development-brief-34
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Adams, R.H. and Cuecuecha, A. (2013) The Impact of Remittances on Investment and Poverty in Ghana. World Development, 50, 24-40. &gt;https://doi.org/10.1016/j.worlddev.2013.04.009
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Aggarwal, R., Demirgüç-Kunt, A. and Pería, M.S.M. (2011) Do Remittances Promote Financial Development? Journal of Development Economics, 96, 255-264. &gt;https://doi.org/10.1016/j.jdeveco.2010.10.005
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     De, S., Islamaj, E., Kose, M.A. and Reza Yousefi, S. (2019) Remittances over the Business Cycle: Theory and Evidence. Economic Notes, 48, e12143. &gt;https://doi.org/10.1111/ecno.12143
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     SWIFT (2021) About Us. &gt;https://www.swift.com/about-us
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Guo, Y. and Liang, C. (2016) Blockchain Application and Outlook in the Banking Industry. Financial Innovation, 2, Article No. 24. &gt;https://doi.org/10.1186/s40854-016-0034-9
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yermack, D. (2018) Blockchain in Finance, In: Durlauf, S.N. and Blume, L.E., Eds., The New Palgrave Dictionary of Economics, Palgrave Macmillan, 1-12.
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nakamoto, S. (2008) Bitcoin: A Peer-to-Peer Electronic Cash System. &gt;https://bitcoin.org/bitcoin.pdf
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Treleaven, P., Gendal Brown, R. and Yang, D. (2017) Blockchain Technology in Finance. Computer, 50, 14-17. &gt;https://doi.org/10.1109/mc.2017.3571047 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Scott, S.V. and Zachariadis, M. (2012) Origins and Development of SWIFT, 1973-2009. Business History, 54, 462-482. &gt;https://doi.org/10.1080/00076791.2011.638502
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gomber, P., Kauffman, R.J., Parker, C. and Weber, B.W. (2018) On the Fintech Revolution: Interpreting the Forces of Innovation, Disruption, and Transformation in Financial Services. Journal of Management Information Systems, 35, 220-265. &gt;https://doi.org/10.1080/07421222.2018.1440766
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bank for International Settlements (2018) Annual Economic Report 2018. &gt;https://www.bis.org/publ/arpdf/ar2018e.htm
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yaga, D., Mell, P., Roby, N., and Scarfone, K. (2018) Blockchain Technology Over-View, NIST Interagency/Internal Report (NISTIR)-8202. National Institute of Standards and Technology.
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zheng, Z., Xie, S., Dai, H., Chen, X. and Wang, H. (2017) An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends. 2017 IEEE International Congress on Big Data (BigData Congress), Honolulu, 25-30 June 2017, 557-564. &gt;https://doi.org/10.1109/bigdatacongress.2017.85
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ripple (2024) Cross-Border Payments: Send Cross-Border Payments in Real-Time. &gt;https://ripple.com/solutions/cross-border-payments/
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Stellar Development Foundation (2014) Stellar: Frequently Asked Question. &gt;https://web.archive.org/web/20210114230922/&gt;https://stellar.org/community/faq 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saaty, T.L. (1990) How to Make a Decision: The Analytic Hierarchy Process. European Journal of Operational Research, 48, 9-26. &gt;https://doi.org/10.1016/0377-2217(90)90057-i
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Koblitz, N. (1987) Elliptic Curve Cryptosystems. Mathematics of Computation, 48, 203-209. &gt;https://doi.org/10.1090/s0025-5718-1987-0866109-5
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pearl, J. (1988) Bayesian Inference. In: Pearl, J., Ed., Probabilistic Reasoning in Intelligent Systems, Elsevier, 29-75. &gt;https://doi.org/10.1016/b978-0-08-051489-5.50008-4
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hosmer, D.W., Lemeshow, S. and Sturdivant, R.X. (2013) Applied Logistic Regression. Wiley. &gt;https://doi.org/10.1002/9781118548387
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bellman, R. (1958) On a Routing Problem. Quarterly of Applied Mathematics, 16, 87-90. &gt;https://doi.org/10.1090/qam/102435
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zadeh, L.A. (1965) Fuzzy Sets. Information and Control, 8, 338-353. &gt;https://doi.org/10.1016/s0019-9958(65)90241-x
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bollerslev, T. (1986) Generalized Autoregressive Conditional Heteroskedasticity. Journal of Econometrics, 31, 307-327. &gt;https://doi.org/10.1016/0304-4076(86)90063-1
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     King, S. and Nadal, S. (2012) PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake. &gt;https://decred.org/research/king2012.pdf
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hendrikx, F., Bubendorfer, K. and Chard, R. (2015) Reputation Systems: A Survey and Taxonomy. Journal of Parallel and Distributed Computing, 75, 184-197. &gt;https://doi.org/10.1016/j.jpdc.2014.08.004
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, F.T., Ting, K.M. and Zhou, Z. (2008) Isolation Forest. 2008 Eighth IEEE International Conference on Data Mining, Pisa, 15-19 December 2008, 413-422. &gt;https://doi.org/10.1109/icdm.2008.17
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Amdahl, G.M. (1967) Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities. Proceedings of the April 18-20, 1967, Spring Joint Computer Conference, Atlantic City, 18-20 April 1967, 483-485. &gt;https://doi.org/10.1145/1465482.1465560
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gustafson, J.L. (1988) Reevaluating Amdahl’s Law. Communications of the ACM, 31, 532-533. &gt;https://doi.org/10.1145/42411.42415
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref30">
    <label>30</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S. and Saxena, P. (2016) A Secure Sharding Protocol for Open Blockchains. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, 24-28 October 2016, 17-30. &gt;https://doi.org/10.1145/2976749.2978389
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref31">
    <label>31</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hardt, D. (2012) The OAuth 2.0 Authorization Framework. &gt;https://auth0.com/docs/authenticate/protocols/oauth
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref32">
    <label>32</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fielding, R.T. (2000) Architectural Styles and the Design of Network-Based Software Architectures. University of California. &gt;https://ics.uci.edu/~fielding/pubs/dissertation/top.htm 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref33">
    <label>33</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rivest, R.L., Shamir, A. and Tauman, Y. (2001) How to Leak a Secret. Advances in Cryptology—ASIACRYPT 2001, Australia, 9-13 December 2001, 552-565. &gt;https://doi.org/10.1007/3-540-45682-1_32
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref34">
    <label>34</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Friedman, J.H. (2001) Greedy Function Approximation: A Gradient Boosting Machine. The Annals of Statistics, 29, 1189-1232. &gt;https://doi.org/10.1214/aos/1013203451
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref35">
    <label>35</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Istio Authors (2021) Istio. &gt;https://istio.io/
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref36">
    <label>36</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Krawczyk, H. (2010) Cryptographic Extraction and Key Derivation: The HKDF Scheme. Advances in Cryptology—CRYPTO 2010, Santa Barbara, 15-19 August 2010, 631-648. &gt;https://doi.org/10.1007/978-3-642-14623-7_34
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref37">
    <label>37</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Buterin, V. and Griffith, V. (2017) Casper the Friendly Finality Gadget. arXiv: 1710.09437. &gt;https://arxiv.org/abs/1710.09437
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref38">
    <label>38</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Boneh, D., Lynn, B. and Shacham, H. (2001) Short Signatures from the Weil Pairing. Advances in Cryptology—ASIACRYPT 2001, Australia, 9-13 December 2001, 514-532. &gt;https://doi.org/10.1007/3-540-45682-1_30
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref39">
    <label>39</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wood, G. (2014) Ethereum: A Secure Decentralised Generalised Transaction Ledger. Ethereum Project Yellow Paper, 1-32. &gt;https://membres-ljk.imag.fr/Jean-Guillaume.Dumas/Enseignements/ProjetsCrypto/Ethereum/ethereum-yellowpaper.pdf
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref40">
    <label>40</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Buterin, V. (2016) EIP-150: Gas Cost Changes for IO-Heavy Operations. &gt;https://eips.ethereum.org/EIPS/eip-150 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref41">
    <label>41</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chainlink (2021) Chainlink 2.0: Next Steps in the Evolution of Decentralized Oracle Networks. &gt;https://chain.link/whitepaper
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref42">
    <label>42</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Buterin, V. (2014) Ethereum: A Next-Generation Smart Contract and Decentralized Application Platform. &gt;https://ethereum.org/en/whitepaper/
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref43">
    <label>43</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, R., Wang, L. and Zhu, R. (2022) Improvement of Delegated Proof of Stake Consensus Mechanism Based on Vague Set and Node Impact Factor. Entropy, 24, 1013. &gt;https://doi.org/10.3390/e24081013 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref44">
    <label>44</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ben-Sasson, E., Chiesa, A., Tromer, E., and Virza, M. (2014) Succinct Non-Interactive Zero Knowledge for a Von Neumann Architecture. Proceedings of the 23rd USENIX Conference on Security Symposium, San Diego, 20-22 August 2014, 781-796.
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref45">
    <label>45</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     OpenZeppelin (2017) Proxy Upgrade Patterns. &gt;https://docs.openzeppelin.com/upgrades-plugins/1.x/proxies
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref46">
    <label>46</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Newman, S. (2015) Building Microservices: Designing Fine-Grained Systems. O’Reilly Media, Inc.
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref47">
    <label>47</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     McKinsey&amp;Company (2018) Global Payments 2018: A Dynamic Industry Continues to Break New Ground. &gt;https://www.mckinsey.com/~/media/mckinsey/industries/financial%20services/our%20insights/global%20payments%20expansive%20growth%20targeted%20opportunities/global-payments-map-2018.ashx 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref48">
    <label>48</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ripple (2016) Ripple and XRP Can Cut Banks’ Global Settlement Costs up to 60 Percent. &gt;https://ripple.com/insights/ripple-and-xrp-can-cut-banks-global-settlement-costs-up-to-60-percent/ 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref49">
    <label>49</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Stellar Development Foundation (2021) Stellar Network Overview. &gt;https://stellar.org/learn/intro-to-stellar
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref50">
    <label>50</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ali, M.S., Vecchio, M., Pincheira, M., Dolui, K., Antonelli, F. and Rehmani, M.H. (2019) Applications of Blockchains in the Internet of Things: A Comprehensive Survey. IEEE Communications Surveys&amp;Tutorials, 21, 1676-1717. &gt;https://doi.org/10.1109/comst.2018.2886932
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref51">
    <label>51</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Santander (2018) Santander Launches the First Blockchain-Based International Money Transfer Service across Four Countries. &gt;https://www.santander.co.uk/about-santander/media-centre/press-releases/santander-launches-the-first-blockchain-based-international-money-transfer-service-across-four
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref52">
    <label>52</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Reuters (2018) Special Report: Inside the Bangladesh Bank Cyber Heist.
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref53">
    <label>53</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Deloitte (2021) Deloitte’s 2021 Global Blockchain Survey. &gt;https://www2.deloitte.com/content/dam/insights/articles/US144337_Blockchain-survey/DI_Blockchain-survey.pdf 
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref54">
    <label>54</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Australian Securities Exchange (2021) CHESS Replacement. &gt;https://www2.asx.com.au/markets/clearing-and-settlement-services/chess-replacement
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref55">
    <label>55</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     PYMNTS (2020) 64 Pct of Businesses Cite Payment Traceability as Cross-Border Pain Point.
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref56">
    <label>56</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     IBM (2019) IBM Blockchain World Wire. &gt;https://www.ibm.com/blockchain/solutions/world-wire
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref57">
    <label>57</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     SWIFT (2022) SWIFT FIN Traffic&amp;Figures. &gt;https://www.swift.com/about-us/swift-fin-traffic-figures
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref58">
    <label>58</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zamani, M., Movahedi, M. and Raykova, M. (2018) RapidChain: Scaling Blockchain via Full Sharding. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, 15-19 October 2018, 931-948. &gt;https://doi.org/10.1145/3243734.3243853
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref59">
    <label>59</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bitcoin (2022) Bitcoin Transaction Rate. &gt;https://www.blochain.com/charts/transactions-per-second
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref60">
    <label>60</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ethereum (2022) Ethereum Transaction Rate. &gt;https://etherscan.io/chart/tx
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref61">
    <label>61</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bank for International Settlements (2020) Central Bank Digital Currencies: Foundational Principles and Core Features. &gt;https://www.bis.org/publ/othp33.pdf
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref62">
    <label>62</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Thomas, S. and Schwartz, E. (2019) A Protocol for Interledger Payments. &gt;https://interledger.org/interledger.pdf
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref63">
    <label>63</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Digiconomist (2022) Bitcoin Energy Consumption Index. &gt;https://digiconomist.net/bitcoin-energy-consumption
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref64">
    <label>64</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xu, X., Weber, I., Staples, M., Zhu, L., Bosch, J., Bass, L., et al. (2017) A Taxonomy of Blockchain-Based Systems for Architecture Design. 2017 IEEE International Conference on Software Architecture (ICSA), Gothenburg, 3-7 April 2017, 243-252. &gt;https://doi.org/10.1109/icsa.2017.33
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref65">
    <label>65</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Arner, D.W., Buckley, R.P., Zetzsche, D.A. and Veidt, R. (2020) Sustainability, Fintech and Financial Inclusion. European Business Organization Law Review, 21, 7-35. &gt;https://doi.org/10.1007/s40804-020-00183-y
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref66">
    <label>66</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Garaus, M. and Treiblmaier, H. (2021) The Influence of Blockchain-Based Food Traceability on Retailer Choice: The Mediating Role of Trust. Food Control, 129, Article 108082. &gt;https://doi.org/10.1016/j.foodcont.2021.108082
    </mixed-citation>
   </ref>
   <ref id="scirp.135574-ref67">
    <label>67</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bass, F.M. (1969) A New Product Growth for Model Consumer Durables. Management Science, 15, 215-227. &gt;https://doi.org/10.1287/mnsc.15.5.215
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>