SUM Innovation Inc. Mainnet Connecting to the SUM Chain public endpoint.

Research

The protocol,
written down
before it shipped.

Nothing on this page is a blog post. Where a document is not public yet, the entry says so instead of linking to a landing page.

Under review
Whitepaper, external cryptography group
Entries
5

R-01

2026

Whitepaper

SUM Chain: verifiable coordination for storage, compute, and credentials

The full protocol description. Consensus and finality, the typed transaction system, Proof of Retrievability, Proof of Contribution, the trust architecture for credentialing, selective disclosure, and the economic design that keeps supply conserved.

Reviewer An outside cryptography group, review in progress

  1. SUM Chain: consensus, state, typed transactions, verifiable work
  2. Storage coordination: retrievability, assignment, slashing
  3. Compute coordination: verification rather than re-execution
  4. Identity and credentialing: trust architecture, zero-knowledge disclosure
  5. Tokenomics: the utility floor and controlled supply
  6. Privacy and compliance: mechanisms by primitive
Under external cryptography review Request the draft

R-02

2026

Protocol note

Proof of Contribution and the case against re-execution

Re-running an inference to check it costs as much as performing it. OmniNode verifies instead: verifier-signed digests over Halo2 proof artifacts, anchored on chain, with eligibility, maturity, dispute, and refund enforced by consensus. Rewards are escrow funded, so the mechanism conserves supply.

  1. Verification rather than re-execution
  2. Uniqueness and admission
  3. Claim maturity: inclusion, finality depth, dispute window
  4. Validator-quorum dispute resolution
Active on mainnet Settlement specification

R-03

2026

Circuit review

Halo2 circuits for contribution attestation

The zero-knowledge circuits that let a contributor prove work was performed on assigned weights without revealing the weights, the input, or the output. Reviewed alongside the whitepaper cryptography.

  1. Circuit construction and constraint budget
  2. Proof artifact format and verifier signature domain
  3. On-chain anchoring boundary: what consensus enforces, what remains off chain

R-04

2026

Design analysis

Per-field privacy across nineteen document families

Everything on a public ledger is readable by anyone, without authentication. That constraint is the starting point, not a problem to be patched. This analysis catalogs every SRC token family and states, field by field, what is public, what is a commitment, and what never touches the chain.

  1. SRC-80X trust infrastructure through SRC-89X finance
  2. Commitment design and schema canonicalization
  3. Selective disclosure and the verifier contract

R-05

2024

Research lineage

Graph search and consensus design

DARPA-backed graph search work at UCLA under Professors Andrea Bertozzi and Paolo Climaco. The propagation and partitioning results from that program inform how SUM Chain schedules proposers and assigns storage chunks deterministically across a changing node set.

  1. Graph propagation under adversarial partition
  2. Deterministic assignment and reassignment
Prior work Prior work, no public artifact