1. #6,810,2011CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #581,296

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 6/8/2014, 2:59:32 PM · Difficulty 10.9627 · 6,228,906 confirmations

TWN
Bi-Twin Chain

Interleaved pairs of primes that differ by 2, forming twin prime pairs at each level.

Block Header
Block Hash
626254c519438d12ff3f7b6b16073c17bf1a91cfe22997995f9d94a7099f7466

Height

#581,296

Difficulty

10.962683

Transactions

6

Size

2.14 KB

Version

2

Bits

0af6726b

Nonce

449,884,470

Timestamp

6/8/2014, 2:59:32 PM

Confirmations

6,228,906

Merkle Root

573704becb0289a2415a0b6bc0d23bc15eb19572fea3d02f7b0547a80ea93ccb
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

9.800 × 10⁹⁷(98-digit number)
98007082992621983044…75566656462896105359
Discovered Prime Numbers
Lower: 2^k × origin − 1 | Upper: 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

Level 0 — Twin Prime Pair (origin ± 1)
origin − 1
9.800 × 10⁹⁷(98-digit number)
98007082992621983044…75566656462896105359
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
9.800 × 10⁹⁷(98-digit number)
98007082992621983044…75566656462896105361
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: origin + 1 − origin − 1 = 2 (twin primes ✓)
Level 1 — Twin Prime Pair (2^1 × origin ± 1)
2^1 × origin − 1
1.960 × 10⁹⁸(99-digit number)
19601416598524396608…51133312925792210719
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.960 × 10⁹⁸(99-digit number)
19601416598524396608…51133312925792210721
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^1 × origin + 1 − 2^1 × origin − 1 = 2 (twin primes ✓)
Level 2 — Twin Prime Pair (2^2 × origin ± 1)
2^2 × origin − 1
3.920 × 10⁹⁸(99-digit number)
39202833197048793217…02266625851584421439
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.920 × 10⁹⁸(99-digit number)
39202833197048793217…02266625851584421441
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^2 × origin + 1 − 2^2 × origin − 1 = 2 (twin primes ✓)
Level 3 — Twin Prime Pair (2^3 × origin ± 1)
2^3 × origin − 1
7.840 × 10⁹⁸(99-digit number)
78405666394097586435…04533251703168842879
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
7.840 × 10⁹⁸(99-digit number)
78405666394097586435…04533251703168842881
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^3 × origin + 1 − 2^3 × origin − 1 = 2 (twin primes ✓)
Level 4 — Twin Prime Pair (2^4 × origin ± 1)
2^4 × origin − 1
1.568 × 10⁹⁹(100-digit number)
15681133278819517287…09066503406337685759
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.568 × 10⁹⁹(100-digit number)
15681133278819517287…09066503406337685761
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Bi-Twin Chain. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the TWN formula:

TWN: twin pairs (p, p+2) where p = origin/primorial − 1 and p+2 = origin/primorial + 1
Circulating Supply:57,725,688 XPM·at block #6,810,201 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy