CryptoMine Math Cracker

jevrohm

[root@mining-node] ~$

CryptoMine::Math::Cracker

Zaawansowany eksplorator i symulator równania wydobycia Proof-of-Work Bitcoina

SHA-256d PoW ECDSA 256-bit

01 // RÓWNANIE WYDOBYCIA

// Bitcoin Proof-of-Work Core Condition


                SHA₂₅₆( SHA₂₅₆( BlockHeader ) ) < Target


                H( H( version || prevHash || merkleRoot || timestamp || bits || nonce ) ) < 2^{(256-difficulty)}

version

4 bytes — Block version (currently 0x20000000 for BIP9)

prevHash

32 bytes — SHA-256d hash of previous block header

merkleRoot

32 bytes — Merkle tree root of all transactions in block

timestamp

4 bytes — Unix epoch time (must be > median of last 11 blocks)

bits

4 bytes — Compact encoding of target threshold (nBits)

nonce

4 bytes — The value miners iterate (0 to 2³²−1)

// BLOCK HEADER LAYOUT (80 bytes)

// TARGET DERIVATION FROM nBits


              target = coefficient × 2^{(8 × (exponent − 3))}


              where: exponent = bits[0], coefficient = bits[1..3]

Example: nBits = 0x1703a30c


              exponent = 0x17 = 23 → coefficient = 0x03a30c → target = 0x03a30c × 2^(8×20)

// SINGLE HASH SUCCESS PROBABILITY


              P(success) = target / 2²⁵⁶ = 1 / difficulty

Expected hashes to find a block:


              E[hashes] = 2²⁵⁶ / target = difficulty × 2³²

Expected time (at hashrate H):


              E[time] = difficulty × 2³² / H  (seconds)

02 // INTERAKTYWNY EKSPLORATOR SHA-256

// Input (hex or ASCII)

// AVALANCHE EFFECT — Flip one bit, see the chaos

// Input text

// Flip bit #0 of input

Original hash:

Modified hash (bit 0 flipped):

03 // SYMULATOR WYDOBYCIA — ITERACJA NONCE NA ŻYWO

// Difficulty Target (leading zero bits)

4 bits 16 bits (16 leading zeros) 32 bits

// Simulated Hashrate

// Luck Multiplier (scales target ×M)

// Block Header Data (80 bytes hex)

// BLOCK HEADER FIELDS

// CURRENT TARGET

Hash must have at least 16 leading zero bits

// NONCE COUNTER

NONCE

HASHES

HASHRATE

0 H/s

ELAPSED

0.0s

// HASHRATE OVER TIME

// LIVE HASH FEED

Waiting to mine...

04 // ANALIZATOR CELU TRUDNOŚCI

// nBits (compact target encoding)

Current mainnet nBits examples: 1703a30c, 1801539e, 1903a30c

EXPONENT

—

Byte length of target

COEFFICIENT

—

Significant 3 bytes

DIFFICULTY

—

Relative to genesis

LEADING ZERO BITS

—

Required prefix

// FULL 256-BIT TARGET

// DIFFICULTY COMPARISON ACROSS ERAS

// PROBABILITY ANALYSIS

// EXPECTED TIME TO FIND BLOCK

05 // HARMONOGRAM PODAŻY BITCOINA I KALKULATOR HALVINGU

// BLOCK REWARD FUNCTION


              R(n) = 50 × 10⁸ / 2^{⌊n / 210000⌋}  (satoshis)


              Total Supply: S = Σ (R(i) × 210000) for i = 0 to 32 = 20999999.9769 BTC

// QUICK HEIGHT SLIDER

// Current Block Height

// Halving Interval (blocks)

CURRENT ERA

—

CURRENT REWARD

—

TOTAL MINED

—

// HALVING SCHEDULE

// SUPPLY CURVE (CUMULATIVE BTC)

// REWARD DECAY & CUMULATIVE SUPPLY