Show simple item record

dc.contributor.advisorDagenborg, Håvard
dc.contributor.authorMøller-Hansen, Marius
dc.date.accessioned2025-07-09T03:31:40Z
dc.date.available2025-07-09T03:31:40Z
dc.date.issued2025
dc.description.abstractDistributed systems struggle with synchronization, especially when components must agree on the order of events across application or trust boundaries. Without clear causal ordering, systems can become vulnerable to inconsistencies, coordination failures, and auditability issues. This thesis presents \textbf{Chronolock}, a blockchain-hybrid system that enforces causal-time ordering across distributed components. Chronolock combines on-chain dependency verification through a blockchain smart contract with a developer-focused SDK that abstracts away blockchain complexity. Messages are published with explicit dependencies, which must be verified on-chain before the message is accepted, ensuring a tamper-proof and verifiable event sequence. Chronolock is designed as a proof-of-concept that prioritizes ordering integrity over raw throughput. Through controlled experiments, we evaluate its performance and limitations, including throughput constraints and deployment complexity. While not suited for high-throughput applications, Chronolock is a viable coordination mechanism for scenarios where traceability, causality, and correctness are more important than speed or flexibility.
dc.description.abstractDistributed systems struggle with synchronization, especially when components must agree on the order of events across application or trust boundaries. Without clear causal ordering, systems can become vulnerable to inconsistencies, coordination failures, and auditability issues. This thesis presents \textbf{Chronolock}, a blockchain-hybrid system that enforces causal-time ordering across distributed components. Chronolock combines on-chain dependency verification through a blockchain smart contract with a developer-focused SDK that abstracts away blockchain complexity. Messages are published with explicit dependencies, which must be verified on-chain before the message is accepted, ensuring a tamper-proof and verifiable event sequence. Chronolock is designed as a proof-of-concept that prioritizes ordering integrity over raw throughput. Through controlled experiments, we evaluate its performance and limitations, including throughput constraints and deployment complexity. While not suited for high-throughput applications, Chronolock is a viable coordination mechanism for scenarios where traceability, causality, and correctness are more important than speed or flexibility.
dc.descriptionFull text not available
dc.identifier.urihttps://hdl.handle.net/10037/37476
dc.identifierno.uit:wiseflow:7267640:62280515
dc.language.isoeng
dc.publisherUiT The Arctic University of Norway
dc.rights.holderCopyright 2025 The Author(s)
dc.rights.urihttps://creativecommons.org/licenses/by/4.0en_US
dc.rightsAttribution 4.0 International (CC BY 4.0)en_US
dc.titleChronolock: Causal Time-Ordering with Blockchain Smart Contracts
dc.typeMaster thesis


File(s) in this item

FilesSizeFormatView

This item appears in the following collection(s)

Show simple item record

Attribution 4.0 International (CC BY 4.0)
Except where otherwise noted, this item's license is described as Attribution 4.0 International (CC BY 4.0)