Block #587,375

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 6/13/2014, 6:40:58 PM · Difficulty 10.9515 · 6,208,158 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
d70e3f8a7c2b8a9c0ba11bc69da5e43f1282da911e786d8a3b7de30b4691a4c9

Height

#587,375

Difficulty

10.951530

Transactions

11

Size

2.99 KB

Version

2

Bits

0af39771

Nonce

109,600,741

Timestamp

6/13/2014, 6:40:58 PM

Confirmations

6,208,158

Merkle Root

42b1d3ff18c48f4e8faff9f35c322149f2c3c76968f5e729c614cd8a7be23763
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.

1.428 × 10¹⁰⁰(101-digit number)
14287688436998254585…80614708993974271999
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
1.428 × 10¹⁰⁰(101-digit number)
14287688436998254585…80614708993974271999
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.428 × 10¹⁰⁰(101-digit number)
14287688436998254585…80614708993974272001
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
2.857 × 10¹⁰⁰(101-digit number)
28575376873996509170…61229417987948543999
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.857 × 10¹⁰⁰(101-digit number)
28575376873996509170…61229417987948544001
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
5.715 × 10¹⁰⁰(101-digit number)
57150753747993018341…22458835975897087999
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
5.715 × 10¹⁰⁰(101-digit number)
57150753747993018341…22458835975897088001
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
1.143 × 10¹⁰¹(102-digit number)
11430150749598603668…44917671951794175999
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.143 × 10¹⁰¹(102-digit number)
11430150749598603668…44917671951794176001
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
2.286 × 10¹⁰¹(102-digit number)
22860301499197207336…89835343903588351999
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.286 × 10¹⁰¹(102-digit number)
22860301499197207336…89835343903588352001
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
4.572 × 10¹⁰¹(102-digit number)
45720602998394414673…79670687807176703999
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,608,327 XPM·at block #6,795,532 · 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.