Terminal

Syrpts Network: A Scientific Approach to Decentralized Digital Currency

A peer-to-peer electronic cash system for defining the economic value of websites through tokenized markets, SHA-256 proof-of-work mining, and a shared immutable ledger.

March 27, 2026 Version 3.0 scientificnexus.net Scientific Nexus Team

Table of Contents

  1. Abstract
  2. Introduction
  3. Transaction Model
  4. Privacy
  5. Proof of Work
  6. Network Architecture
  7. Disk Space Reclaiming
  8. Tokenomics
  9. Staking & Rewards
  10. DelChain: Token Deployment
  11. OpenChain: Permissionless Tokens
  12. Security Model
  13. Governance
  14. Simplified Payment Verification
  15. Calculations & Formulas
  16. Graphs & Visualizations
  17. Conclusion
  18. References & Team
Section 01

Abstract

A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending.

We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of computational power.

The Syrpts Network extends this model with a novel purpose: defining the economic value of websites. Any website can create its own tokenized currency on the Syrpts DataChain. The market price of that token — driven by supply, demand, and real trading activity — becomes a quantifiable, real-time valuation of the website itself. This transforms website monetization from ad-based revenue into a decentralized financial system where both site owners and users are economically incentivized participants.

Core Innovation: While Bitcoin defines "digital gold," Syrpts defines digital value for the web. Every website on the network has a live market price, not just a user count.
Section 02

Introduction

Commerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust-based model. Completely non-reversible transactions are not possible, since financial institutions cannot avoid mediating disputes.

Bitcoin's 2008 whitepaper proposed a solution to this problem using cryptographic proof instead of trust. The Syrpts Network builds on this foundation while addressing several limitations:

Section 03

Transaction Model

We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin.

Account-Based Model

Unlike Bitcoin's UTXO model, the Syrpts Network uses an account-based model (similar to Ethereum). Each wallet address has a balance that is updated atomically on every transaction. This simplifies the programming model for custom token interactions while maintaining full cryptographic security through ECDSA P-256 signatures.

Transaction Types

Type Description Signed
TRANSFERDirect wallet-to-wallet token transfer
BUYPurchase tokens from a liquidity pool (adds USD, removes tokens)
SELLSell tokens to a liquidity pool (adds tokens, removes USD)
MARKET_TRADEMatched order book trade between two parties
MINTSystem-generated token creation (genesis, rewards, stablecoins)System
BURNPermanent destruction of tokens (withdrawal, conversion)
STAKE / UNSTAKELock/unlock tokens for staking rewards
DEPLOY_TOKENCreate a new custom token on the network

Double-Spend Prevention

Every transaction includes a cryptographic signature using the sender's ECDSA P-256 private key. The DataChain validates that: (1) the signature is valid against the sender's public key, (2) the sender has sufficient balance, and (3) the transaction has not been previously processed (replay protection via timestamps and nonce tracking). Only after passing all three checks is the transaction included in a pending block for mining.

Section 04

Privacy

The traditional banking model achieves privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous.

In the Syrpts Network, each wallet is identified by a compressed ECDSA P-256 public key derived from a BIP39 12-word mnemonic seed phrase. The public key serves as the wallet address. There is no link between a public key and a real-world identity unless the user voluntarily discloses it. Users can generate an unlimited number of wallets for different purposes.

The key hierarchy follows standard derivation:

Seed → BIP39 Mnemonic (128-bit entropy → 12 words) Mnemonic → HD Wallet Root Key (PBKDF2 with 2048 rounds) Root Key → ECDSA P-256 Private Key → Public Key (compressed) Public Key → Wallet Address (DER-encoded, base64)

Private keys are stored as non-extractable CryptoKey objects in the browser's IndexedDB, secured by AES-GCM encryption. They never leave the user's device in plaintext form.

Section 05

Proof of Work

To implement a distributed timestamp server on a peer-to-peer basis, we use a proof-of-work system similar to Adam Back's Hashcash. The proof-of-work involves scanning for a value that when hashed with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required.

Syrpts Difficulty Adjustment Algorithm (Syrpts DAA)

The network adjusts mining difficulty every 10 blocks (compared to Bitcoin's 2,016 blocks). The target block time is 10 seconds per block. The adjustment formula:

TARGET_TIME = 10,000 ms (10 seconds) ADJUSTMENT_INTERVAL = 10 blocks Expected Duration = TARGET_TIME × ADJUSTMENT_INTERVAL = 100,000 ms If actual_time < expected_time / 2 → difficulty++ If actual_time > expected_time × 2 → difficulty-- Minimum difficulty floor: 2 (cannot go below)

This aggressive adjustment schedule allows the network to respond to sudden hashrate changes within minutes rather than weeks, making the network resilient to both flash mining attacks and miner dropoff.

Merkle Tree Block Structure

Each block contains a Merkle root computed from all transactions in the block. Instead of hashing the entire transaction payload (which can be megabytes for blocks with hundreds of transactions), the mining worker hashes only the 64-character Merkle root. This provides:

Block Hash = SHA-256(index + previousHash + timestamp + merkleRoot + nonce) where merkleRoot = MerkleTree(tx₁, tx₂, ..., txₙ)
Section 06

Network Architecture

The Syrpts Network uses a hybrid architecture combining a centralized primary node with a decentralized peer-to-peer mesh:

Railway Primary Node

The primary node runs on Railway infrastructure and serves as the authoritative source of truth. It handles: API requests from all web terminals, block mining, transaction validation, PostgreSQL database operations, payment gateway integrations (PayPal, NowPayments), and WebSocket real-time updates.

DataChain-Core Peer Nodes

Desktop peers running DataChain-Core.exe form a resilient backup mesh. These nodes:

Resilience Model: The Railway server is the PRIMARY; desktop peers are REPLICAS. Data replicated: transactions, balances, leaderboard, block history, token registry. Data NOT replicated (Railway-only): PayPal gateway, NowPayments gateway.

Mining Token Support

The DataChain-Core mining module supports two tokens: SYR (SilverCash) and DelChain tokens. OpenChain tokens are not minable — they are created through permissionless deployment and distributed by their creators.

Section 07

Disk Space Reclaiming

Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. The Syrpts DataChain implements this through two mechanisms:

Block Data Offloading

The in-memory chain only retains full transaction data for the most recent 10 blocks. Older blocks store the string "Historical block data offloaded to DB" in place of their transaction arrays. The full transaction history remains permanently in PostgreSQL, indexed for fast retrieval.

Merkle Root Preservation

Even when transaction data is offloaded, each block's Merkle root is preserved. This allows any node to verify the integrity of the full chain without needing the raw transaction data — the chain of Merkle roots is sufficient to prove no blocks have been tampered with.

Section 08

Tokenomics

SilverCash (SYR) — The Native Token

Total Supply12,000,000,000 SYR (12 Billion)
Sub-unitSats (smallest division)
Block Reward50 SYR (halves every 100,000 blocks)
Genesis DateMarch 27, 2026
Starting Price$0.50 USD
ConsensusSHA-256 Proof-of-Work
Block Time Target~10 seconds
Difficulty AdjustmentEvery 10 blocks

Halving Schedule

The block reward halves every 100,000 blocks. With a target block time of 10 seconds, each halving epoch lasts approximately 11.6 days. The halving formula:

Reward(block) = 50 / 2^⌊block_height / 100,000⌋ Epoch 0 (blocks 0–99,999): 50.00 SYR per block Epoch 1 (blocks 100K–199,999): 25.00 SYR per block Epoch 2 (blocks 200K–299,999): 12.50 SYR per block Epoch 3 (blocks 300K–399,999): 6.25 SYR per block Epoch 4 (blocks 400K–499,999): 3.125 SYR per block ...

Supply Schedule Visualization

Epoch 0
5.0B
Epoch 1
2.5B
Epoch 2
1.25B
Epoch 3
625M
Epoch 4
312.5M
Epoch 5+
~156M+

Figure 1 — SYR Mining Emission by Halving Epoch

Stablecoins

Section 09

Staking & Rewards

The Syrpts Network supplements mining rewards with a staking mechanism. Users can lock their SYR tokens for a fixed period to earn passive rewards from the network's transaction fee pool.

Staking Mechanics

Section 10

DelChain: Token Deployment Platform

DelChain is the Syrpts Network's verified token deployment system. Website owners register their domain, verify ownership, configure their token economics, and launch a fully-functional cryptocurrency with its own market — all within minutes.

Token Lifecycle

  1. Domain Verification — The deployer proves ownership of a domain by placing a verification file or DNS record
  2. Token Configuration — Name, ticker symbol, total supply, logo, description, and subscription tier
  3. Genesis Minting — The full token supply is minted to the creator's wallet
  4. System Handler Seeding — 5% of supply (capped at 1M) is deposited into the liquidity pool with matching USD
  5. Market Activation — The token appears on the Syrpts Terminal with a live chart, order book, and trade panel

Automated Market Making

Every token has a System Handler (liquidity pool) using a constant-product formula:

x × y = k where: x = token reserve in pool y = USD reserve in pool k = constant product (invariant) Price = y / x (USD per token) Buy: User adds USD → removes tokens → price increases Sell: User adds tokens → removes USD → price decreases
Section 11

OpenChain: Permissionless Token Creation

OpenChain is the permissionless counterpart to DelChain. No domain verification is required. Anyone can deploy a token in seconds — ideal for community tokens, meme currencies, experimental projects, and rapid prototyping.

Key Differences from DelChain

FeatureDelChainOpenChain
VerificationDomain requiredNone
Mining SupportYes (SHA-256 PoW)No
Parent NetworkIndependentRuns under a parent FDX token
Fee StructureNetwork fees to systemFees flow to parent token creator
Token LifetimePermanent7-day auto-deletion if inactive
Section 12

Security Model

The Syrpts Network implements a six-layer defense system designed to protect against both human attackers and automated AI probing.

Layer 1: Rate Limiting

Per-IP request throttling with adaptive limits. Requests exceeding thresholds receive progressively delayed responses before eventual blocking.

Layer 2: Anomaly Detection

Statistical analysis of request patterns. Flags non-human behavior: superhuman request speed, impossible timing patterns, systematic endpoint enumeration.

Layer 3: Honeypot Traps

Decoy API endpoints that appear to be vulnerabilities (e.g., /api/admin, /debug/state). Any access triggers immediate lockdown and serves carefully crafted fake data containing tracking payloads.

Layer 4: Automatic Lockdown

If multiple security layers are breached in sequence (indicating AI-driven reconnaissance), the system locks all write operations and switches to read-only mode until manual review.

Layer 5: Cryptographic Key Rotation

Automated key rotation on a scheduled basis with emergency rotation triggered by breach detection. Session tokens are invalidated on rotation.

Layer 6: Transaction Validation

Defense-in-depth at the ledger engine level. Every transaction entering a block is re-validated for: signature authenticity, balance sufficiency, numeric overflow protection (NaN/negative checks), and replay prevention.

Armor Plate 5 — The Vault Door: Even if an attacker bypasses the API layer and injects data directly into memory, the core block engine intercepts and permanently drops any transaction with poisoned numeric values (NaN, negative amounts, Infinity).
Section 13

Governance

Network upgrades follow a structured process:

  1. Proposal — Any team member or community contributor publishes a Syrpts Improvement Proposal (SIP)
  2. Review — The development team reviews the technical feasibility and security implications
  3. Testing — Changes are deployed to a staging environment for validation
  4. Hard Fork — If the change is consensus-breaking, a hard fork block height is announced in advance
  5. Deployment — The change goes live on the primary node; peer nodes update automatically

The Hard Fork Amnesty mechanism allows the network to recover from catastrophic events. If circulating supply drops below the expected threshold (e.g., due to database migration), the system executes a genesis airdrop to restore balances to their expected state.

Section 14

Simplified Payment Verification

It is possible to verify payments without running a full network node. A user only needs to keep a copy of the block headers of the longest proof-of-work chain, which they can get by querying network nodes until they're convinced they have the longest chain, and obtain the Merkle branch linking the transaction to the block it's timestamped in.

In the Syrpts Network, SPV is implemented through the web terminals themselves. The Syrpts Terminal, DelChain Hub, and OpenChain Terminal act as lightweight clients that verify transaction inclusion via the API without downloading the full chain. The DataChain Explorer provides full block inspection for users who want deeper verification.

Section 15

Calculations & Formulas

Attack Probability

An attacker trying to generate an alternative chain faster than the honest chain can be modeled as a Binomial Random Walk. The probability of an attacker catching up from z blocks behind:

P(attacker catches up) = (q/p)^z where: p = probability honest node finds next block q = probability attacker finds next block z = number of blocks the attacker is behind

Given our assumption that p > q, the probability drops exponentially as z increases. With just 6 confirmations and an attacker controlling 10% of hashrate, the probability of a successful double-spend drops below 0.0002%.

Fee Calculation

Trading Fee = trade_amount × fee_rate × (1 + volume_discount) where: fee_rate = 0.15% (base network fee) volume_discount = varies by 24h trading volume tier

Difficulty Target

Target = 2^(256 - difficulty_bits) Valid Block: SHA-256(block_header) < Target A difficulty of 2 requires the hash to start with "00" A difficulty of 3 requires the hash to start with "000" Each +1 difficulty doubles the average work required
Section 16

Graphs & Visualizations

Network Growth Projection

100% 75% 50% 25% Q1 2026 Q3 2026 Q1 2027 Q3 2027

Figure 2 — Projected Network Utilization (% of max capacity)

Attack Success Probability

1 conf
20.6%
2 conf
7.4%
3 conf
2.7%
4 conf
1.0%
5 conf
0.4%
6 conf
<0.1%

Figure 3 — Double-Spend Attack Success Probability (attacker = 30% hashrate)

Section 17

Conclusion

We have proposed a system for electronic transactions that extends the proof-of-work blockchain with a novel economic model for the web. The Syrpts Network transforms website valuation from an abstract measure of user counts into a concrete, market-driven price. Any website owner can create a tokenized currency, list it on a professional trading terminal, and attract investors who believe in the platform's value.

The system achieves this through: SHA-256 proof-of-work mining with an aggressive difficulty adjustment algorithm, Merkle tree-based block validation, ECDSA P-256 cryptographic signatures, a hybrid Primary/Replica network architecture, constant-product automated market making, and a six-layer security defense system.

The network launched on March 27, 2026, with a 12 billion SYR total supply, a 50 SYR block reward halving every 100,000 blocks, and the DataChain as its shared immutable ledger. The ecosystem supports three tiers of tokens (SYR native, DelChain verified, and OpenChain permissionless), two stablecoins (SDX and SDTX), and will expand with the DataChain-Core desktop node for true peer-to-peer network participation.

The Syrpts Thesis: Users define the popularity of a website. Syrpts defines its value.
Section 18

References & Team

Academic References

[1] S. Nakamoto, "Bitcoin: A Peer-to-Peer Electronic Cash System," 2008.
[2] A. Back, "Hashcash — A Denial of Service Counter-Measure," 2002.
[3] R. C. Merkle, "Protocols for public key cryptosystems," IEEE Symposium on Security and Privacy, 1980.
[4] W. Feller, "An introduction to probability theory and its applications," 1957.
[5] H. Massias, X.S. Avila, and J.-J. Quisquater, "Design of a secure timestamping service with minimal trust requirements," 20th Symposium on Information Theory, 1999.

The Scientific Nexus Team

Syrpts was built by a distributed team of 11+ members spanning China, Pakistan, and Russia.

Ming
AI & Software Engineering
Core AI systems, algorithm design, and frontend architecture. Based in China.
Read Thinking →
Sameer
سمیر
Data Management & Backend
Backend architecture, data management, API design, and code quality. Based in Pakistan.
Read Thinking →
Anatoly
Анатолий
Systems Architecture
Consensus mechanism design, P2P networking, systems architecture, and cryptographic protocols. Based in Russia.
Read Thinking →
Elena
Елена
AI Integration & Security
AI-driven security automation, anomaly detection, threat modeling, and defense architecture. Based in Russia.
Read Thinking →
Wei
Interface Design
UI/UX design, visual identity, responsive layouts, and interaction design. Based in China.
Li
Investment & Strategy
Financial modeling, investment strategy, tokenomics advisory, and market analysis. Based in China.
Viktor
Виктор
Cryptography
Cryptographic protocol implementation, key management, and zero-knowledge proof research. Based in Russia.
Dmitri
Дмитрий
Infrastructure
Server infrastructure, Railway deployment, database optimization, and CI/CD pipelines. Based in Russia.
Nadia
Надя
Database Engineering
Decentralized database architecture, PostgreSQL optimization, and state management. Based in Russia.
Hassan
حسن
Quality Assurance
Code testing, bug reporting, regression analysis, and cross-platform compatibility. Based in Pakistan.
Igor
Игорь
Protocol Development
Next-generation protocol research, consensus upgrades, and network evolution planning. Based in Russia.