This Online Appendix provides forty supplementary sections supporting the main manuscript. The principal contributions are: (i) a complete multi-input atomicity proof for the UTXO Consistency Result under crash-fault semantics, with six-case exhaustive analysis and sourcecode correspondence; (ii) a formal liveness theorem establishing bounded recovery from Validator crashes during the compensating-unspend protocol; (iii) three alternative scalingefficiency models (η(M): logarithmic, power-law, Amdahl) with cross-validation, bootstrap prediction intervals, and architectural justification for model selection; and (iv) an SPV verification analysis demonstrating that Simplified Payment Verification remains feasible at 10 11-TPS fleet scale without requiring archival nodes. Additional sections provide the full G/G/c throughput-ceiling derivation, 60-point derating calibration methodology, NVMe-spill and mixed-workload production estimates with uncertainty propagation, Aerospike strongconsistency formal model, and responses to all reviewer concerns including a mathematical foundation audit.

Double-entry bookkeeping keeps the books balanced, (the evidence behind each entry) — invoices, remittances, confirmations — sits outside the ledger, and can be altered, lost, or disputed and is costly for trading partners and auditors to reconcile. Triple-entry-accounting proposes a shared third record to anchor evidence, yet prior work does not specify how an invoice obligation is privately and verifiably linked to later settlement. This paper presents a design-science artefact that does. Each party publishes a small, tamper-evident note that an invoice or payment existed at a given time without revealing its contents; the notes are privately linked so only the partners, or an auditor they authorise, can confirm the connection; and sensitive fields are disclosed to the auditor one at a time under separate signed authorisations. The artefact is mapped to international audit assertions, analysed for security and failure modes, and validated by a working reference implementation: deterministic test vectors, automated-correctness and adversarial test suites that the implementation passes in full, and measured cryptographic-core performance on commodity hardware. It gives auditors independent, timestamped evidence of a transaction’s existence, the integrity of disclosed fields, and the invoice-to-payment link; it doesn't detect fabricated invoices or collusion, and doesn't establish legal admissibility.

Recent theoretical work analyses blockchain security at the consensus layer under assumptions of anonymous participants, frictionless entry, zero sunk costs, and no institutional enforcement. Those assumptions describe a limiting case. Payment-system security decomposes into three layers: transaction-level script conditions, consensus-level deterrence, and institutional enforcement. The layer containing the binding operational constraint varies by transaction class. For cost-disproportion transactions ($1$500), attack cost exceeds transaction value by a factor of 10 7 or more; the consensus-cost result does not bind. For script-conditioned transfers ($1K$1M), the result does not apply to the conditional release, whose operative constraint is script design; it applies to the funding transaction. For institutionally-enforced settlement ($1M and above), the result is supplemented by Beckerian deterrence where operators are identiable and legally reachable. For tokenised securities, it does not apply: security derives from the regulatory framework.

Distributed consensus systems face a tension that the literature has treated as a monotone trade-off: more validators improve resilience, but more validators also raise coordination cost and dilute defensive resources. This paper shows that the relationship is non-monotone. Treating security as a fixed budget split between consensus resilience and per-node hardening, we define net security as the difference between a security gain that saturates with the number of validators and a security drain that grows superlinearly. We prove the existence and uniqueness of an interior optimum, characterise the local oscillation of the exact binomial attack probability arising from threshold discretisation together with the strict concavity of its Chernoff envelope, and derive convexity of the drain from an explicit budget-allocation model. The optimum is computed by exact binomial-tail enumeration. For representative parameters the exact optimum falls near eighty-five validators, consistent with committee sizes adopted by deployed Byzantine fault-tolerant systems and offering an explanation for why protocols with very large validator sets rely on committee subsampling, signature aggregation, or checkpointed finality. The result is economic rather than protocol-specific: it applies to any system where consensus cost is superlinear in the participant count and a fixed budget must be shared between coordination and defence.

This Online Appendix provides forty supplementary sections supporting the main manuscript. The principal contributions are: (i) a complete multi-input atomicity proof for the UTXO Consistency Result under crash-fault semantics, with six-case exhaustive analysis and sourcecode correspondence; (ii) a formal liveness theorem establishing bounded recovery from Validator crashes during the compensating-unspend protocol; (iii) three alternative scalingefficiency models (η(M): logarithmic, power-law, Amdahl) with cross-validation, bootstrap prediction intervals, and architectural justification for model selection; and (iv) an SPV verification analysis demonstrating that Simplified Payment Verification remains feasible at 10 11-TPS fleet scale without requiring archival nodes. Additional sections provide the full G/G/c throughput-ceiling derivation, 60-point derating calibration methodology, NVMe-spill and mixed-workload production estimates with uncertainty propagation, Aerospike strongconsistency formal model, and responses to all reviewer concerns including a mathematical foundation audit.

In many environments, a contest protects an activity whose revenue finances the contest: policing funded by property taxes, platform security funded by usage fees, insurance solvency funded by premiums. The prize is endogenous to the protection level. This article characterises the resulting fixed-point problem. Under primitive conditions on cost convexity, demand regularity, and attack technology, the equilibrium set forms a complete lattice with a shutdown state, a stable highsecurity equilibrium, and an unstable tipping threshold. Interior equilibria appear and vanish via saddle-node bifurcation, and all comparative statics inherit a common amplification denominator that diverges at the fold. The welfare-maximising fee lies below the revenue-maximising fee when the security externality is moderate. A continuous-time extension nests the static equilibria as stationary points.

In any Tullock contest with heterogeneous costs, the standard zero-profit substitution compresses three distinct objects-total expenditure, incremental acquisition cost, and deployment level-into one scalar. This article derives the conditions under which the compression fails, bounds the error, and characterises the welfare loss. The leading application is proof-of-work blockchain security, where Budish (2025) substitutes a zero-profit condition to derive a blockreward constraint. Under heterogeneous mining costs, the substitution understates acquisition cost, and the article derives a corrected security condition that depends on cost-schedule shape. The model nests Budish as a special case.

Designing payment infrastructure for sub-dollar transactions requires architectures that minimise value-dependent cost overhead. This study comparatively evaluates five payment providers — PayPal, Stripe, Visa, Mastercard, and a blockchain-based Simplified Payment Verification (SPV) implementation — across 55,000 fee evaluations spanning US$0.01–5.00. A two-part cost model distinguishes fixed-plus-percentage (value-denominated) from byte-denominated fee architectures; hierarchical regression with provider-specific interaction terms quantifies the structural differences (log-level R² = 0.997). The central finding is structural: value-denominated pricing produces hyperbolic cost profiles imposing an uneconomic interval below a provider-specific threshold, whereas byte-denominated pricing yields near-zero absolute fees irrespective of transaction value. In the US$0.01–0.49 band, mean legacy effective fees range from 38.43% (Mastercard) to 237.88% (PayPal); SPV averages 0.06%. Break-even analysis shows legacy providers require US$1.42–14.29 to achieve a 5% effective fee target; SPV achieves this at US$0.002. Sensitivity analysis confirms robustness to fee multipliers (2×–10×), legacy discounts (25–50%), EU interchange caps, and transaction-size variation. Four engineering evaluation metrics — fee prediction variance, independent verifiability cost, adaptive fee response, and confirmation reliability — provide a reusable assessment framework. The results identify byte-denominated fee design as a structural solution to the micropayment cost barrier.

This paper analyses forty-five works on property in information under a single method applied without variation to every author: premises are isolated in the author's own words and rendered in a formal notation, examined singly, then reassembled into the arguments they compose and tested for validity, with every fallacy named by its standard name and demonstrated by explicit derivation or counter-model rather than asserted. Part One treats the thirty works the case against intellectual property cites, contests or relies upon, among them.

Biais et al. (2019) prove that mining the longest chain is a Markov perfect equilibrium in a stochastic game with state-dependent strategies and history-encoding state variables. Subsequent literature cites this result as consistent with memoryless protocol dynamics. We clarify that "Markov" and "memoryless" are distinct mathematical properties. The Biais et al. state space-comprising the block tree, miner allocations, and coordination device-encodes extensive history. Their vested interest mechanism depends on accumulated block counts. Two additional Bitcoin protocol features, the 100-block coinbase maturity rule and the 2,016-block difficulty adjustment, enlarge the payoff-relevant state, reinforcing the history-dependent equilibrium structure.

A recent literature makes automation and repression complements: the transferneeded to deter a revolt grows as the labour share falls, while the cost of coercion does not.The revolt prize is a selective incentive proportional to capital income; the repression cost isa free parameter unrelated to it. Tullock (1971) required both sides to purchase selective incentives.Pricing the guards against the same prize makes the repression bill quadratic in it, sorepression is bounded above as well as below, and if punishment is weak enough it is neverchosen at any capital stock. The constraint binds on the extensive margin only.

Distributed data storage systems face a fundamental verification problem: how can a data owner confirm that a remote storage provider has retained the data it was paid to store, without downloading the entire dataset? Existing approaches require centralised trust authorities, impose prohibitive bandwidth costs, or lack enforceable economic consequences for storage failure. This paper proposes a blockchain-verified distributed storage architecture addressing these limitations through three integrated mechanisms. First, a distributed hash table (DHT) overlay partitions data across storage nodes using cryptographic key-addressed routing, reducing per-node storage from O(D) to O(D/N). Second, a Merkle tree proof-of-retention protocol enables any storage node to demonstrate continued possession of its assigned data blocks by producing compact cryptographic proofs—hash paths from challenged leaf nodes to a publicly committed root—without revealing the underlying data. Third, these proofs are embedded in blockchain transactions using a locking-script challenge mechanism, where a service oracle constructs transactions that can only be unlocked by a storage provider possessing the challenged data block and the corresponding Merkle proof. The architecture supports encrypted multi-copy storage with per-copy key differentiation for collusion resistance, RAID-inspired data striping for parallel retrieval, and reputation-scored admission for Sybil resistance. Monte Carlo simulation validation (10,000 trials per configuration) confirms analytical detection bounds within 2.2% and timing-based outsourcing detection achieving 99.65% statistical power with as few as five challenge epochs. For a 1 TB dataset across 100 nodes with replication factor 2, per-node storage is approximately 20 GB and Merkle proof size is O(log D) regardless of dataset size.​

This paper proposes a novel mechanism leveraging Simplified Payment Verification (SPV) and pre-signed Bitcoin transactions to enable secure, multi-path, state-encoded signalling in constrained IoT networks. By utilising deterministic transaction paths and deferred on-chain resolution, we present a scalable architecture for integrating micro-devices as cryptographic signalling systems. Channels are maintained using off-chain pre-signed commitments, which encode the signal intention. Only the enacted transaction finalised on-chain becomes authoritative, with all alternate states voided. This mechanism combines the rigour of timestamped state with the flexibility of SPV, enabling trustless synchronisation across asynchronous, distributed device networks.

We present a framework for implementing command-and-control (C2) systems over a blockchain infrastructure where deterministic addressing of agents is neither necessary nor possible. In contrast to classical C2 and malware networks that risk deanonymisation and central point failures, our model enables secure, verifiable, and decentralised coordination through unidirectional observation of blockchain states. Devices such as smart sensors, AI agents, and IoT nodes interpret instructions embedded in blockchain transactions while remaining unreachable and unidentifiable. This architecture preserves operational privacy and enables resilient coordination without requiring peer-to-peer communication or server-client dialogues.

This paper presents a praxeological analysis of artificial intelligence and algorithmic governance, challenging assumptions about the capacity of machine systems to sustain economic and epistemic order. Drawing on Misesian a priori reasoning and Austrian theories of entrepreneurship, we argue that AI systems are incapable of performing the core functions of economic coordination: interpreting ends, discovering means, and communicating subjective value through prices. Where neoclassical and behavioural models treat decisions as optimisation under constraint, we frame them as purposive actions under uncertainty. We critique dominant ethical AI frameworks such as Fairness, Accountability, and Transparency (FAT) as extensions of constructivist rationalism, which conflict with a liberal order grounded in voluntary action and property rights. Attempts to encode moral reasoning in algorithms reflect a misunderstanding of ethics and economics. However complex, AI systems cannot originate norms, interpret institutions, or bear responsibility. They remain opaque, misaligned, and inert. Using the concept of epistemic scarcity, we explore how information abundance degrades truth discernment, enabling both entrepreneurial insight and soft totalitarianism. Our analysis ends with a civilisational claim: the debate over AI concerns the future of human autonomy, institutional evolution, and reasoned choice. The Austrian tradition, focused on action, subjectivity, and spontaneous order, offers the only coherent alternative to rising computational social control.

This paper presents a complete formal specification, protocol description, and mathematical proof structure for Simplified Payment Verification (SPV) as originally defined in the Bitcoin whitepaper . In stark contrast to the misrepresentations proliferated by popular implementations, we show that SPV is not only secure under bounded adversarial assumptions but strictly optimal for digital cash systems requiring scalable and verifiable transaction inclusion. We reconstruct the SPV protocol from first principles, grounding its verification model in symbolic automata, Merkle membership relations, and chain-of-proof dominance predicates. Through rigorous probabilistic and game-theoretic analysis, we derive the economic bounds within which the protocol operates securely and verify its liveness and safety properties under partial connectivity, hostile relay networks, and adversarial propagation delay. Our specification further introduces low-bandwidth optimisations such as adaptive polling and compressed header synchronisation while preserving correctness. This document serves both as a blueprint for secure SPV implementation and a rebuttal of common misconceptions surrounding non-validating clients.

Memory integrity in AI systems remains a foundational weakness in both training reproducibility and operational trustworthiness. Large-scale vector data, embeddings, and internal memory traces are discarded, rewritten, or silently drift over time without cryptographic anchors or verifiable context. This paper introduces AnchorChain, a mechanism for binding AI memory and volume-based data structures (e.g. embedding matrices, long-term memory vector stores) to blockchain-indexed anchors. Each memory state is summarised into a cryptographically verifiable Merkle root, indexed in a deterministic fashion, and immutably committed to a transaction on a Bitcoin-based ledger. This enables traceable recovery, rollback, and accountability in AI training and inference workflows-resolving the problem of memory state erosion across system restarts, deployments, or trust boundaries. The system supports deterministic reference resolution, anchor-based recall indexing, and verifiable memory finality, solving a critical missing reliability gap in AI-driven software engineering.

Distributed data systems silently propagate field-level errors, inconsistencies, and unverifiable state across databases, creating systemic reliability failures. This paper presents a cryptographic anchoring framework using Bitcoin's immutable ledger and deterministic Merkle structure to map and verify individual field updates across disparate systems. Each field is reduced to a hash, inserted into a Merkle tree, and timestamped on-chain. Anchors are stored in relational, document, or graph databases with verification metadata. This mechanism eliminates garbage-in-garbage-out at the ingestion layer, providing cross-system provenance, finality, and automaton-bound state transitions enforceable via Bitcoin Script.

It is frequently claimed in blockchain discourse that immutability guarantees trust. This paper rigorously refutes that assertion. We define immutability as the cryptographic persistence of historical states in an append-only data structure and contrast it with trust, understood as a rational epistemic expectation under uncertainty. Employing predicate logic, automata-theoretic models, and epistemic game-theoretic analysis, we demonstrate that immutability neither entails nor implies correctness, fairness, or credibility. Through formal constructions and counterexamples–including predictive fraud schemes and the phenomenon of garbage permanence–we show that the belief conflates structural and epistemic domains. Immutability preserves all data equally, regardless of veracity. Therefore, the assertion that immutability guarantees trust collapses under the weight of formal scrutiny.

This paper presents a formalised architecture for synthetic agents designed to retain immutable memory, verifiable reasoning, and constrained epistemic growth. Traditional AI systems rely on mutable, opaque statistical models prone to epistemic drift and historical revisionism. In contrast, we introduce the concept of the Merkle Automaton, a cryptographically anchored, deterministic computational framework that integrates formal automata theory with blockchain-based commitments. Each agent transition, memory fragment, and reasoning step is committed within a Merkle structure rooted on-chain, rendering it non-repudiable and auditably permanent. To ensure selective access and confidentiality, we derive symmetric encryption keys from ECDH exchanges contextualised by hierarchical privilege lattices. This enforces cryptographic access control over append-only DAG-structured knowledge graphs. Reasoning is constrained by formal logic systems and verified through deterministic traversal of policy-encoded structures. Updates are non-destructive and historied, preserving epistemic lineage without catastrophic forgetting. Zero-knowledge proofs facilitate verifiable, privacy-preserving inclusion attestations. Collectively, this architecture reframes memory not as a cache but as a ledger - one whose contents are enforced by protocol, bound by cryptography, and constrained by formal logic. The result is not an intelligent agent that mimics thought, but an epistemic entity whose outputs are provably derived, temporally anchored, and impervious to post hoc revision. This design lays foundational groundwork for legal, economic, and high-assurance computational systems that require provable memory, unforgeable provenance, and structural truth.