Block #562,854

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/26/2014, 12:41:30 PM · Difficulty 10.9651 · 6,242,309 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
fb37c8f166be914d0467cf3ea1756d77f28554c80c3fe778f9bc7fe8d23d439a

Height

#562,854

Difficulty

10.965062

Transactions

13

Size

200.22 KB

Version

2

Bits

0af70e4b

Nonce

454,035

Timestamp

5/26/2014, 12:41:30 PM

Confirmations

6,242,309

Merkle Root

a8c10e101baebac0b7306d0af8f016da0ea064f6e8ddda339e83cdd857185f1e
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.

6.839 × 10¹⁰⁴(105-digit number)
68390363796476560864…91150027080691148799
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
6.839 × 10¹⁰⁴(105-digit number)
68390363796476560864…91150027080691148799
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
6.839 × 10¹⁰⁴(105-digit number)
68390363796476560864…91150027080691148801
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.367 × 10¹⁰⁵(106-digit number)
13678072759295312172…82300054161382297599
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.367 × 10¹⁰⁵(106-digit number)
13678072759295312172…82300054161382297601
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
2.735 × 10¹⁰⁵(106-digit number)
27356145518590624345…64600108322764595199
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.735 × 10¹⁰⁵(106-digit number)
27356145518590624345…64600108322764595201
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
5.471 × 10¹⁰⁵(106-digit number)
54712291037181248691…29200216645529190399
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
5.471 × 10¹⁰⁵(106-digit number)
54712291037181248691…29200216645529190401
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.094 × 10¹⁰⁶(107-digit number)
10942458207436249738…58400433291058380799
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.094 × 10¹⁰⁶(107-digit number)
10942458207436249738…58400433291058380801
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)
Level 5 — Twin Prime Pair (2^5 × origin ± 1)
2^5 × origin − 1
2.188 × 10¹⁰⁶(107-digit number)
21884916414872499476…16800866582116761599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,685,371 XPM·at block #6,805,162 · 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.