Bitcoin Forum
September 26, 2026, 08:27:17 PM *
News: Latest Bitcoin Core release: 31.1 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: [ANN][DSM] Deterministic State Machine — Sovereign, trustless, Offline, DeTfi  (Read 268 times)
cryptskii (OP)
Newbie
*
Offline

Activity: 27
Merit: 3


View Profile
April 04, 2026, 01:44:34 PM
Last edit: April 06, 2026, 06:15:18 PM by cryptskii
 #1

    ◆ DSM — DETERMINISTIC STATE MACHINE ◆
    Sovereign Bitcoin transactions without a global ledger, without intermediaries, without waiting.

    Website | GitHub | X / Updates | Irrefutable Labs



    What is DSM?

    DSM is a deterministic state machine: a cryptographic framework that lets you move your Bitcoin into a sovereign environment where you can transact instantly, offline, with no fees, no intermediaries, and no global ledger then move it back to Bitcoin whenever you choose.

    Bitcoin inside DSM is called dBTC. It is not a wrapped token. It is not custodied by a federation, a validator set, or trusted hardware. Moving your Bitcoin into DSM is a unilateral action secured by cryptography on the DSM side and proof-of-work on the Bitcoin side. The conservation law that evry satoshi of dBTC is backed 1:1 by confirmed Bitcoin in the vault grid is formally verified at three levels: TLC model checking, Lean 4 mechanized proof, and TLAPS proof scaffolding.

    Beta is live now on Bitcoin Signet. Anyone with an Android device and some Signet BTC from a faucet can try it today.



    What DSM lets you do with Bitcoin

    Transact instantly and offline.
    Two people in a room, on a plane, in a dead zone it doesn't matter. A valid dBTC transfer between two devices is final the moment the state advance happens. No confirmations. No later settlement step. No mesh network hoping to reconcile later. The bilateral state transition is the settlement.

    Pay no transaction fees inside DSM.
    There are no DSM side fees. You pay normal Bitcoin network fees when value enters or exits Bitcoin custody. Everything in between is feeless.

    Maintain sovereign custody at all times.
    Your Bitcoin is never handed to a bridge operator, a multisig committee, a federation, sequencer, or any form of trusted third party. The trust model inside DSM is reduced to cryptography. At the Bitcoin boundary, it reduces to Bitcoin proof-of-work. That's it.

    Scale without bottlenecks.
    Unrelated parties never serialize through a shared global state. Your transactions with Alice do not wait for, depend on, or even observe Bob's transactions with Carol. Throughput is additive: every new relationship is independent capacity.

    Operate post-quantum from day one.
    All DSM signatures use SPHINCS+. Key derivation uses BLAKE3 with domain separation. Key encapsulation uses ML-KEM (Kyber). There are no ECDSA keys to harvest now and crack later.



    How it works (short version)

    DSM has no blocks, no miners, no validators, no timestamps, and no global ordering layer.

    State is local to each bilateral relationship. If you and I transact, we each maintain a hash chain for our shared relationship. Every new state commits to its predecessor by hash adjacency that's where ordering comes from. Not from clocks. Not from block heights. From cryptographic structure.

    The Tripwire theorem provides fork exclusion: under standard cryptographic assumptions (EUF-CMA signatures, collision-resistant hashing), producing two accepted successors for the same parent state is negligible. This replaces consensus.

    The C-DBRW (Chaotic Dual-Binding Random Walk) mechanism binds state to both the device hardware and the execution environment. Cloning a device doesn't give you the ability to extend state you'd need the exact hardware and environment to derive the binding key. This is not a PUF in the traditional sense. Traditional PUFs fight environmental drift as a liability. C-DBRW is designed in the opposite direction: durable physical chaos is part of the security model, not a weakness to be compensated for.



    dBTC: Bitcoin inside DSM

    WhatDetail
    Backing1:1 with confirmed Bitcoin in the vault grid
    Conservationspendable + in-flight = grid backing (formally verified)
    EntryUnilateral deposit via Bitcoin HTLC; dBTC minted after d_min confirmations
    ExitCommit withdrawal → vault selection → Bitcoin spend → final burn
    Withdrawal resolutionCommitted withdrawals either settle or refund — no value is ever stranded
    Trust boundaryDSM-side: cryptography. Bitcoin-side: SPV inclusion + PoW header chain + confirmation depth
    Supply capCannot exceed 21M BTC by construction (BoundedSupply invariant, machine-checked)



    Architecture overview

    • Hash chains, not blocks. Each relationship is a forward only chain. Every state embeds the hash of its predecessor. Reversing or editing requires a hash collision.
    • Per-Device Sparse Merkle Trees. Each device maintains an SMT mapping its bilateral relationships to chain tips. Inclusion proofs are logarithmic.
    • Device Tree. Devices attach to a user's cryptographic genesis. Identity is not an account row it's a position in an authenticated tree.
    • Stitched receipts. Every state transition produces a receipt carrying inclusion proofs, Device Tree membership, and dual SPHINCS+ signatures. Invalid proofs mean the receipt is rejected no network call needed.
    • Storage nodes. Dumb by design. They replicate bytes and serve Merkle proofs. They never validate acceptance predicates. Censorship resistance follows from client-side verification and deterministic replica placement.
    • Deterministic Limbo Vaults (DLV). Trustless escrow, deferred payments, no oracle, no contract VM.



    Formal verification

    DSM's core safety properties are not just argued they are machine-checked:

    • TLA+ / TLC: Bounded model checking across 142,491 distinct states, 0 errors. 8 safety invariants and 3 liveness properties verified. Refinement mapping from concrete vault model to abstract conservation law verified.
    • Lean 4: Mechanized proofs of dBTC conservation, bounded supply, settled monotonicity, and transfer zero-sum unbounded, not just bounded.
    • TLAPS: Proof scaffolding for the safety/refinement core.
    • Trust reduction model: A separate TLA+ module makes the Bitcoin side trust boundary explicit and machine checkable: final burn requires observed Bitcoin spend + SPV inclusion + PoW validity + checkpoint-rooted header chain + confirmation depth ≥ d_min.



    What DSM is not

    • Not a blockchain. There is no chain of blocks, no block production, no miners.
    • Not a sidechain. There is no separate consensus mechanism.
    • Not a rollup. There is no sequencer, no data availability layer, no L1 posting off state diffs.
    • Not a payment channel network. There is no routing, no liquidity locks, no channel capacity limits, no watchtowers.
    • Not a federation or bridge with trusted operators. There is no multisig committee.




    Try it now (Signet beta)

      • Get an Android device.
      • Get some Signet BTC from a faucet.
      • Install the DSM beta from deterministicstatemachine.org.
      • Deposit Signet BTC. Transact with another user. Withdraw back to Bitcoin.



      Source and documentation


             VIDEO DEMO



      Background

      DSM was built mostly under wraps. Solo dev, no marketing cycle, no community-building campaign, no public hype phase. Some of the early seed ideas were posted here, but DSM is where those ideas actually led.

      With the beta now open, I'm also open to hearing from technically strong contributors and from serious parties interested in supporting the project.

      Contact: info@irrefutablelabs.org



      A note on critiquing DSM

      If your critique assumes a global ledger, an intermediary, a witness set, delayed finality, timestamps, or waiting on unrelated parties you are critiquing a different system. DSM is clockless. Ordering comes from hash adjacency and relationship local state progression. Read the spec before assuming the usual architecture applies.


      DSM is experimental software. This is not financial advice. Do your own research.[/list][/list]
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      April 05, 2026, 03:47:49 PM
       #2

      On why DSM has its own token instead of just using dBTC for everything.

      DSM is arguably more decentralized than Bitcoin. Bitcoin still depends on global consensus, miners, and a shared ordering layer. DSM doesn't. Everything resolves through math, not through waiting for a network of unrelated parties to agree. If you denominate DSM's internal economics in dBTC, you're taking a system that runs on deterministic verification and making it depend on consensus again. That defeats the point.

      Sovereignty means not coupling to someone elses monetary policy. If DSM infrastructure runs on dBTC, then Bitcoin's fee market, halving schedule, and price volatility dictate your storage economics, your spend gate cost, and your network entry. Thats a dependency. DSM is designed to have no dependencies on unrelated systems. Denominating in your own unit is the same principle applied to economics that we already applied to state. Keep unrelated concerns seperate.

      There's also the blast radius argument. Bitcoin was not built post quantum. It will have to retrofit. If that retrofit goes wrong, or goes late, or introduces new attack surface during migration, and your entire infrastructure layer is denominated in BTC, then a Bitcoin layer failure cascades directly into DSM's ability to function. DSM was built post quantum from genesis. SPHINCS+, BLAKE3, ML-KEM. None of that is patched on top. Keeping the economic layer on a separate token means a quantum failure in Bitcoin's signature scheme doesn't take down DSM's internal operations. The BTC Tap is an interface, not a dependency. If Bitcoin has a bad day, your dBTC Tap might pause, but DSM's storage nodes still get paid, spend gates still function, and the internal economy keeps running.

      Nobody forced the BTC Tap to exist either. It's there because it's useful. If you want feeless offline Bitcoin transactions, it's there. If you don't, DSM still works without it.
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      April 23, 2026, 04:32:45 AM
       #3

      If anyone wants a more Bitcoin-specific, higher-level overview before digging into the full technical material, I also wrote this:

      Daily Usable Bitcoin

      It lays out the problem from the Bitcoin side first and gives the plain-English version of what DSM is trying to solve.
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      May 14, 2026, 12:40:37 PM
       #4

      If anyone wants to understand exactly how DSM works without diving into the formal spec, I wrote a guided walkthrough from first principles. 11 chapters, 8 interactive demos, no crypto background required. By the end you'll see why DSM replaces consensus, accounts, and validators with cryptography that simply refuses to lie.

      DSM — From First Principles
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      May 23, 2026, 04:24:48 AM
       #5

      Quick update for anyone following DSM SoFi (sovereign finance).

      I put together a short explainer here:

      DSM SoFi (Sovereign Finance) explained

      It covers what actually happened in the recent cross device AMM test: two separate Samsung Galaxy devices settling a constant product vault trade without a custodian, validator set, global mempool, or owner coordination.

      The important part is simple:

      once a valid σ exists on storage, the vault unlock is computable by anyone.

      That is the core SoFi property. Storage makes the proof available. DSM math determines whether settlement is valid.

      Doing real things out here. If you wan't to help change the world, and bitcoin on steroid injections come find me.
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      July 03, 2026, 01:24:42 AM
       #6

      Deterministic State Machines as Guarded Linear Constraint Systems:
      Precommitment Forking, Guard Algebra, Explicit Resource
      Consumption, Tripwire, Morphism Detection, and Consensus Free
      Fork Exclusion:

      https://eprint.iacr.org/archive/2025/592/1783023301.pdf
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      July 05, 2026, 05:12:18 AM
       #7

      I'd like to point to an old conversation among some of the OGs, especially this comment from Peter Todd:

      https://bitcointalk.org/index.php?topic=321085.msg3441124#msg3441124

      Peter wasn't wrong.

      Offline bearer value has always had the same hard problem: if the state is only software, it can be copied. If the value is only a private key, it can be extracted or duplicated. If the hardware can be cloned or rewound, then the receiver does not really have offline finality.

      DSM does not pretend otherwise.

      The distinction is that DSM does not ask the receiver to trust one thing. It uses the secure element because physical, non-rewindable progression is necessary for offline bearer value, but the secure element is not sufficient on its own.

      A chip counter alone does not authorize a DSM transfer. A hardware signature alone does not authorize a DSM transfer. A phone, relay, storage node, or issuer does not authorize it either.

      The receiver verifies the whole fused transition: the DSM state transition, the SMT root, the consumed parent, the authority policy, the receiver challenge, the fused anchor state, the secure element identity, and authenticated live counter evidence.

      So the question is not:

      “Do I trust this card?”

      The question is:

      “Did this exact DSM state transition advance from the receiver’s accepted root, and did the same physical secure element move forward exactly once in a way that matches that transition?”

      That is the important difference.

      Peter’s objection is still the right test. If the physical state can be duplicated or rewound, offline bearer finality fails. DSM accepts that. It narrows the hardware assumption down to one job, then surrounds it with deterministic public verification so no single component is trusted by itself.
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      August 28, 2026, 04:51:04 PM
      Last edit: August 28, 2026, 05:06:57 PM by cryptskii
       #8

      Inverting Chaum’s Wallet with Observers: Hardware Identity vs. Software Authority in DSM
      Why Physical Silicon Should Never Be Trusted as a Double-Spend Prevention Register

      The historical literature on secure offline electronic cash has been split into two core paradigms:

      1. Detection-Based Offline Cash, pioneered by David Chaum, Amos Fiat, and Moni Naor in 1988 and given an elegant, efficient construction by Stefan Brands in 1993. In this family, a coin can be spent offline. Offline double spending is not prevented but detected: a coin spent once remains anonymous, while spending it twice reveals the spender’s identity when the coins are later deposited with an issuer. This paradigm is poorly suited to general-purpose state execution or non-monetary coordination because it defers enforcement to a post-facto deposit step.
      2. Hardware-Prevented Offline Cash, famously proposed by David Chaum and Torben Pedersen in their 1992 paper “Wallet Databases with Observers”, and also situated within Brands’ work. In this model, a tamper-resistant physical chip—the Observer—participates in signing each payment and refuses to authorize the same value twice. This design makes the hardware part of the transaction authority, placing the no-double-spend rule inside tamper-resistant silicon.

      DSM completely rejects this historical assignment. By analyzing the limitations of the Observer model, DSM introduces a clean separation of concerns: hardware is demoted to a pure identity witness, while double-spend prevention is isolated entirely within the software authority.

      You can view the full development workspace and related papers here:

      GitHub Repository: https://github.com/deterministicstatemachine/dsm

      Software Authority & Hardware Identity Paper: DSM Software Authority & Hardware Identity

      Technical Paper: https://eprint.iacr.org/2025/592.pdf

      Telegram Group: Join the DSM Telegram Group


      1. The Vulnerability of the Observer Paradigm
      Relying on hardware to enforce double spend rules makes the hardware's physical attack surface the entire protocol's attack surface. If an attacker can successfully mount a physical attack, such as clock glitching, voltage manipulation, or laser assisted fault injection, they can bypass the double signing check inside the silicon. Once that physical barrier is broken, the security of the entire ledger collapses.

      Furthermore, historical implementations often derived transient session keys from chip state machines. For example, cryptographic slot states, such as MAC based or PIN verification slots, are often host restorable by replaying known inputs, as demonstrated by vendor reference PIN flows that restore consumed slots by replaying a derived input. Such slot states carry no true forward only, non rewindable lineage.



      2. DSM's Separation: Software Authority, Hardware Identity
      DSM resolves these issues by decomposing trust. The central claim is a strict separation:

      o Software enforces correctness and uniqueness of state transitions.
      o Hardware, the Anchor, serves strictly to verify the uniqueness of the physical device instance.

      In DSM, the hardware is semantics blind and never acts as a transaction authority. The receiver's offline acceptance predicate reads no live chip state, no active host registers, and no raw hardware counters. Instead, double spend prevention is a pure mathematical property of whole state consumption in software.

      The entire device state is committed inside a sparse Merkle tree, or SMT. A parent state root is consumed as a whole, admitting exactly one accepted and executed successor. If an attacker attempts to clone the software state chain and run it on another device, the software remains internally consistent but lacks the physical hardware bound to the account. The hardware's only job is to prove that the transaction was executed on the one, uniquely enrolled physical device, rather than a software clone.



      3. The Three Factor Release Witness
      To achieve this without letting the hardware dictate state validity, DSM binds offline bearer transfers to a three factor identity fusion over a single root advance message. A complete release proves the live cooperation of the phone, the chip, and the host over the exact transition, the exact recipient, and the exact challenge:

      o Factor 1, User Entropy: A signature under seed derived keys proving user intent, using the DSM device signature scheme.
      o Factor 2, Silicon Identity: An Ed25519 signature executed inside a TROPIC01 secure element under a resident key pair generated in slot at birth. The private half is non exportable and protected at rest by the silicon's Physically Unclonable Function, or PUF.
      o Factor 3, Host Firmware: A signature generated inside the secure partition of the RP2350 microcontroller.

      During the offline enrollment ceremony, or birth, the public keys pk_chip and pk_host are exported and bound into an immutable Anchor Bundle. Receivers of offline transfers do not verify live chip registers; they simply verify the signatures against the public keys pinned in the bundle.



      4. Measurement Gating and Firmware Isolation
      In a traditional secure element setup, the chip cannot verify if the host software has been compromised; it signs whatever raw payload is sent over the communication bus. Any attacker with root access on the host could theoretically bypass the local state checks and force the secure element to sign multiple conflicting transitions.

      DSM blocks this through measurement gating. At appliance birth, the RP2350 host partition key is generated under a partition seal p0. The unsealing gate is the enrolled firmware measurement. Only firmware whose measurement matches the enrolled policy hash may obtain the host signing service.

      If an attacker modifies the host operating system or flashes rogue firmware to bypass the software's state uniqueness checks, the firmware measurement changes. The RP2350 secure monitor instantly returns an unsealing failure and refuses to sign. Because offline receivers verify both the chip signature and the host signature, the transaction fails acceptance immediately, with no live network query required.



      5. The Physical Counter as a Tripwire, Not an Authority
      DSM does include a monotonic counter, but its placement is radically different from the Observer literature:

      o The SMT State Counter in Software: The authoritative register is a monotone counter committed directly as a leaf in the device's sparse Merkle tree. Position is explicit inside the state root itself, and advancing the state index is part of the single atomic root replacement that consumes the state.
      o The TROPIC01 Counter in Hardware: The physical monotonic counter is not an acceptance authority. It merely tracks the SMT counter one to one where the anchor counter coordinate ui equals H0 minus H.

      If an attacker restores a cloned software image with an older state root to attempt a double spend, the local SMT counter will show an older coordinate. The hardware appliance detects this desynchronization and permanently refuses offline operations, failing closed.



      6. Commit Discipline and Single Appliance Emission
      To prevent a malicious host from executing prepare abort cycles to harvest multiple signed certificates for a single state origin, DSM enforces a strict Commit Discipline:

      o Prepare Phase: The appliance checks the parent root and counter synchronization but mints no signatures. Prepare stores only the staged fields, producing no signed release certificates.
      o Commit Phase: The appliance stores the committed candidate, re pins the counter, executes exactly one physical raw counter update, and only then mints the chip and host signatures over the root advance message.

      Because witnesses come into existence only after the irreversible physical counter step, single use of the host witness is a physical timing property of the hardware counter, rather than a confidentiality property of host storage. Under enrolled firmware, a single physical appliance cannot mathematically or physically emit two distinct valid offline releases from the same origin, ensuring that disconnected first contact receivers are completely protected against double spending.
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      September 03, 2026, 01:23:53 AM
       #9

      Update: DSM High-Level Explainer Published

      I've released a new formal explainer document that breaks down the mathematics and architecture of the protocol.

      📄 Read: Deterministic State Machines Explained Mathematically (PDF)

      The purpose of this paper is to show how state validity can be derived from canonical cryptographically committed state rather than relying on a global ordering authority.

      For this community, I have included shaded comparison boxes throughout the document that directly contrast DSM's architecture with Bitcoin's. Key technical comparisons include:
      • How DSM's explicit linear resource consumption compares to Bitcoin's UTXO model.
      • Why DSM replaces global proof of work transaction ordering with conflict local finality and bilateral state chains.
      • The role of Sparse Merkle Trees (SMTs) in authenticated state evolution versus Bitcoin's transaction Merkle roots.

      I welcome any technical feedback, questions, or critiques on the architecture.
      cryptskii (OP)
      Newbie
      *
      Offline

      Activity: 27
      Merit: 3


      View Profile
      September 25, 2026, 10:03:11 PM
       #10

      New design

      B

      https://www.deterministicstatemachine.org/dBTC.pdf
      Pages: [1]
        Print  
       
      Jump to:  

      Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!