SOST · Technology

Work that converges.

ConvergenceX replaces brute-force hashing with verifiable convergence: each attempt solves a linear system by deterministic gradient descent, mixed with memory-hard reads, and proves that the solution lies in a stable basin. Consensus is integer-only and deterministic on every node.

ConvergenceX & cASERT specWhitepaperDocumentation library

Convergence field · points descend the gradient of a landscape into stable basins (an illustration of gradient descent, not a mining computation)

Four ideas

Convergence, memory, validation, consensus

Mathematical convergence

Instead of brute-force hash collision, ConvergenceX requires miners to produce verifiable convergence certificates using Transcript V2. Each attempt solves a tip-bound linear system via deterministic gradient descent, mixed with memory-hard scratchpad reads, and proves the solution lies in a stable convergence basin.

Memory

Mining is memory-hard (ASIC resistant), but verification is lightweight (anyone can run a node). The miner must build and hold the full 4 GB dataset and 4 GB scratchpad in memory to solve the ConvergenceX puzzle.

Validation

The node only verifies the compact Transcript V2 proof — SHA256 hashes and merkle checks, no dataset required.

Consensus

Integer-only arithmetic · Zero floating point · Deterministic across all nodes

All four quotes: sost-technology.html (verbatim).

The consensus stack

Five layers, vertically integrated

  1. LAYER 01ConvergenceX PoWGradient-descent work + stability basin proof
  2. LAYER 02cASERT bitsQPer-block difficulty Q16.16 adjustment
  3. LAYER 03cASERT EqualizerStructural correction · Adaptive mode control
  4. LAYER 04SOSTCompactQ16.16 difficulty encoding (nBits)
  5. LAYER 05MTP ValidationMedian Time Past timestamp discipline

Layer names and descriptions as in the "Architecture Pipeline" of sost-technology.html.

All technology pages

Specifications and documents

SOST · Technology · quotes are verbatim from the linked pages