Developer Guides

Getting started with SXIAUM. Connect to the testnet, deploy Solidity smart contracts, and build using native tooling.

Quick Start

SXIAUM is 100% equivalent to the EVM execution spec. Standard tooling like Hardhat, Foundry, and MetaMask work out-of-the-box. The only difference is the requirement to wrap public state modifications in a pre-ordered cryptographic commitment phase.

Foundry Config Example

[profile.default]
src = 'src'
out = 'out'
libs = ['lib']

[rpc_endpoints]
sxiaum_testnet = "https://rpc-testnet.sxiaum.network/v1"

MEV Proof Specification

Technical implementation details of SXIAUM's Native Commit-Reveal elimination mechanism.

Mempool Encryption & Commitments

To resolve the frontrunning vulnerability inherent to public mempools, transactions are submitted in two phases:

Commitment Phase: The client computes a SHA-256 hash $C = H(Tx || r)$ representing the payload encrypted with a secret nonce $r$. Only $C$ is transmitted and ordered in the block, shielding trade contents from frontrunning validators.
Reveal Phase: Once the block sequence is finalized, the nonce $r$ is revealed to execute the payload. Frontrunning is mathematically impossible since ordering is completed prior to content exposure.

Theorem (Zero MEV): Under the SHA-256 pre-image resistance assumption, the expected profit of an ordering arbitrageur is exactly zero (π* = 0).

Benchmark Data

Empirical performance diagnostics and comparisons across major consensus networks.

Parallel Throughput Benchmarks

By introducing Optimistic Concurrency Control (OCC) and EIP-2930 transaction routing matrices, SXIAUM scales execution throughput linearly with validator core counts.

Throughput Comparison (Peak TPS)

Ethereum (L1) 15 TPS

Arbitrum One 150 TPS

Solana (Typical) 2,200 TPS

SXIAUM (OCC Sharded) 4,500+ TPS

Rust Architecture

Internal core structural design of the memory-safe L1 engine.

Libp2p & Redb Ledger DB

SXIAUM is implemented entirely in Rust without a garbage collector. Consensus nodes run on an actor model architecture communicating via Libp2p. State variables are persisted inside an embedded `redb` state ledger, providing ACID-compliant read-write guarantees with sub-millisecond seek speeds.

Verkle & ZK Runtimes

State trie space reduction and cryptographic validation proofs.

Verkle State Trees

Replacing legacy Merkle Patricia Tries with 256-branch Verkle Trees (using IPA polynomial commitments) reduces consensus witness proof sizes from 100 KB down to just ~2.5 KB. Transactions are validated inside zero-knowledge execution templates using the SP1 prover framework, generating verifiable Groth16 proofs.

API & RPC Reference

API and RPC gateway specifications.

Custom Commit-Reveal RPC Methods

To submit encrypted transactions, client software interfaces with the following RPC endpoints:

POST sxiaum_sendCommitment

Broadcasts a SHA-256 commitment hash payload to validator block queues.

POST sxiaum_revealTransaction

Exposes the nonce key to trigger block execution of pre-ordered commitments.

Security Audits

Validator consensus audits and smart contract engine evaluations.

Audit Summaries

SXIAUM is evaluated under continuous audit streams by premier cryptographic security firms. Our commit-reveal protocol design has been verified against replay attacks, validator frontrunning collusions, and validator block withholding vectors.