Skip to content
Octopus Research Institute
TR-2026-0032Technical reportPeer review: Not peer reviewedEvidence: ExperimentalStatus: Released

A sovereign decentralized bidding network (Ed25519 + a hash-chained ledger)

Ran Tao (Octoryn Research)

This is not peer-reviewed. Treat it as a working document, not a validated result.

Abstract

Design note: a prototype settlement substrate for a multi-node compute fleet, composed entirely from OS-native cryptographic primitives (no blockchain SDK, no external chain). Nodes self-certify with Ed25519, sign their bids, exchange double-signed receipts, and append events to a persistent SHA-256-chained, append-only, tamper-evident ledger. The architecture and its sovereignty-by-construction are described; no throughput, latency, or scale is measured. Explicitly not BFT, not consensus, not market-optimal — it assumes cooperating nodes within a single operator trust domain.

1. Contribution

Claimed. A prototype settlement substrate for a multi-node compute fleet can be built entirely on OS-native cryptographic primitives: each node self-certifies identity with an Ed25519 keypair, signs its bids, accepted work yields double-signed receipts (signed by both parties), and all events append to a persistent SHA-256-chained ledger that is append-only and tamper-evident. The design takes no dependency on any blockchain SDK or external chain — identity, signature, and the hash-chained ledger are all local primitives owned by the operator. The altitude of this note is systems-engineering / design, not a novel cryptographic or distributed-systems algorithm: Ed25519, signed messages, and hash-chaining are standard primitives; the contribution is composing them into a sovereign, dependency-free settlement record.

NOT claimed. This note does not claim Byzantine-fault-tolerance, consensus, or any distributed-ledger safety/liveness guarantee; it does not claim economic or market-design optimality of the bidding mechanism; it does not claim production-scale ledger throughput; and it presents no measured performance, latency, or scale numbers — the source records none, and none are introduced here. Tamper-evidence of an append-only hash chain is not the same as resistance to an adversary who controls the storage and can rewrite the entire chain; the design assumes cooperating nodes within a single operator's trust domain.

2. Design

The settlement substrate sits beneath a data-parallel fleet: a separate router decides routing, while this layer records, provably, what each node actually did.

ElementMechanism
Node identitySelf-certified Ed25519 keypair per node (no CA, no external identity provider)
BidsEach bid is signed by the bidding node's Ed25519 key
AcceptanceAccepted work produces a double-signed receipt — signed by both parties
LedgerPersistent SHA-256-chained, append-only, tamper-evident record of bid / win / served events
Crypto providerOS-native crypto framework only — no blockchain SDK, no external chain, no third-party settlement service
Trust modelCooperating nodes under a single operator's trust domain

The intended invariant is a provable record of who bid, who won, and who served what, owned entirely by the operator.

3. Evidence / Status

This is a design / prototype note. The source describes the architecture and its sovereign property (OS-native crypto only, no external chain) as the substrate for a multi-node fleet. The source records no empirical measurements — no throughput, latency, ledger size, node count, signature-verification timing, or parity/regression results. Accordingly there are no Results or Ablation tables; fabricating them would violate the record. The honest status is architecture described, sovereignty asserted by construction (dependency choice), no quantitative validation reported in the source.

4. Limitations

A skeptical reviewer should note:

  • No measurements at all. The source contains zero quantitative data. Claims of feasibility rest on the design and the dependency choice, not on a measured prototype run. An experimental evidence level is therefore on the optimistic side for what is recorded — this reads closer to a design/architecture note than an experiment with results.
  • Tamper-evident ≠ tamper-proof. An append-only SHA-256 chain detects mutation of past entries given an honest copy of the chain head; an adversary controlling the storage can recompute the entire chain. There is no external anchoring, timestamping authority, or replication described.
  • No Byzantine / consensus guarantees. Double-signed receipts bind two cooperating parties; they do not provide agreement, ordering, or fault-tolerance across a set of mutually distrusting nodes. Single-operator trust domain is a hard scope boundary.
  • No market-mechanism analysis. Bid signing proves provenance of a bid, not that the auction/allocation rule is incentive-compatible, fair, or optimal.
  • Sovereignty is a dependency property, not a measured one. "No blockchain SDK / OS-native crypto only" is verified by construction (the stated dependency set), not by a reported dependency-audit in the source.
  • Platform-bound. The chosen crypto framework is OS-native; portability of the prototype off that platform is not addressed in the source.

5. Provenance / Relation

  • Crypto stack: OS-native crypto framework; no blockchain SDK or external chain.
  • Relation: Settlement substrate beneath a data-parallel fleet — a sibling to the router (which decides routing). This layer records what each node did.
  • Hardware: Apple Silicon (M-series).
  • Sovereignty: built on the platform's native cryptographic framework only, with no third-party or blockchain framework.
  • Operational detail: version pins, node counts, and harness output are not recorded in the source.

Claim boundary

The author's explicit scope — what this work does and does not establish — carried over from the Octoryn Research publishing model.

Proves

  • A decentralized bidding/settlement record can be built sovereignly from OS-native crypto primitives (Ed25519 self-identity, signed bids, double-signed receipts, SHA-256-chained ledger) with no blockchain SDK or external chain dependency.

Does not prove

  • Byzantine-fault-tolerance, consensus, or any distributed-ledger safety/liveness guarantee.
  • Economic or market-design optimality of the bidding mechanism.
  • Production-scale ledger throughput.
  • Any measured performance, latency, ledger-size, or node-count figure — the source records none.
  • Tamper-proofness against an adversary controlling the storage; only tamper-evidence given an honest chain head.

Applies when

  • Recording a provable bid / win / served event log among cooperating nodes within a single operator trust domain.

Does not apply when

  • Adversarial Byzantine settings, consensus/BFT claims, or market-mechanism optimality claims.
  • Platforms where the OS-native crypto framework is unavailable, or any setting requiring measured benchmark-scale validation.

Authors

  • Ran Tao — Investigation, Writing

Cite this

Citation

Tao, R., Octoryn Research. (2026). A sovereign decentralized bidding network (Ed25519 + a hash-chained ledger) (TR-2026-0032). Octopus Research Institute.

BibTeX

@techreport{oritr20260032,
  title       = {A sovereign decentralized bidding network (Ed25519 + a hash-chained ledger)},
  author      = {Tao, Ran and {Octoryn Research}},
  institution = {Octopus Research Institute},
  year        = {2026},
  note        = {Permanent ID TR-2026-0032. Not peer reviewed.}
}

Disclosures

Funding
Hardware and infrastructure provided by Octoryn / Octopus Core Pty Ltd.
Conflicts of interest
Octoryn ships commercial inference and governance tooling; findings are reported independently.