應用於公有區塊鏈之具監督與挑戰機制的可驗證更新模型設計與效能分析

Abstract

鏈上仲裁仰賴區塊鏈機制，以確保公平性與可信度，同時降低對中心化機構的依賴。本論文透過智能合約執行鏈上仲裁以實現挑戰機制，並透過上鏈證明的方式以達到監督機制，此外，為建立可驗證更新模型，將透過Merkle Tree與Verkle Tree兩樹狀結構，以達到資料安全的更新與驗證。本論文採用Rust實作Merkle Tree與Verkle Tree結構，並以Solidity撰寫智能合約以執行鏈上仲裁功能，以產生實驗數據。在實驗評估中會從兩個面向進行：時間效能與gas成本。時間效能部份涵蓋四項核心指標：樹狀結構的建構、資料更新、證明的生成與驗證所需時間；成本方面則依據樹種與架構差異，透過使用對應的智能合約，以測量其上鏈與驗證過程中的gas消耗。本研究以系統架構不同、樹狀結構類型以及樹的架構調整作為三大主要變數，進行多樣化實驗設計，透過蒐集實證數據，進一步分析和比較各種情境下的效能與成本表現。最終彙整研究成果，作為未來實務應用與系統設計之參考依據。On-chain arbitration leverages blockchain mechanisms to ensure fairness and credibility while reducing reliance on centralized institutions. This thesis proposes a verifiable update model that integrates an on-chain challenge mechanism through smart contracts and an off-chain monitoring process by submitting proof to the blockchain. To enable secure and verifiable updates, the system utilizes two tree-based data structures: Merkle Tree and Verkle Tree.In this study, the Merkle Tree and Verkle Tree data structures are implemented in Rust, while a smart contract for on-chain arbitration is developed using Solidity. These components form the foundation for generating experimental data. The evaluation focuses on two key aspects: time efficiency and gas cost. The time efficiency analysis includes four core metrics: tree construction, data update, proof generation, and proof verification. For cost evaluation, the study measures gas consumption associated with uploading and verifying data on-chain, depending on the tree structure and architecture used.This research adopts three primary variables: system architecture, the type of tree structure and its architectural configuration. A series of experiments are conducted to collect empirical data under diverse conditions, followed by a comparative analysis of performance and cost. The findings provide insights that serve as a reference for future practical applications and system design.