Block #566,439

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/28/2014, 10:20:21 PM · Difficulty 10.9660 · 6,232,999 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
1c72460179265c14b274952b071ee3e9bf5ba4cce99a63154e6bc4a0a0866471

Height

#566,439

Difficulty

10.965983

Transactions

10

Size

2.62 KB

Version

2

Bits

0af74aae

Nonce

514,063,294

Timestamp

5/28/2014, 10:20:21 PM

Confirmations

6,232,999

Merkle Root

ac37b01eb2bd90b873ff31b633b6a48e5f35951780270ec6023128e7fde04f89
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.586 × 10⁹⁶(97-digit number)
65869716807635425836…39127068495973785999
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.586 × 10⁹⁶(97-digit number)
65869716807635425836…39127068495973785999
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
6.586 × 10⁹⁶(97-digit number)
65869716807635425836…39127068495973786001
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.317 × 10⁹⁷(98-digit number)
13173943361527085167…78254136991947571999
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.317 × 10⁹⁷(98-digit number)
13173943361527085167…78254136991947572001
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.634 × 10⁹⁷(98-digit number)
26347886723054170334…56508273983895143999
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.634 × 10⁹⁷(98-digit number)
26347886723054170334…56508273983895144001
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.269 × 10⁹⁷(98-digit number)
52695773446108340669…13016547967790287999
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
5.269 × 10⁹⁷(98-digit number)
52695773446108340669…13016547967790288001
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.053 × 10⁹⁸(99-digit number)
10539154689221668133…26033095935580575999
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.053 × 10⁹⁸(99-digit number)
10539154689221668133…26033095935580576001
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.107 × 10⁹⁸(99-digit number)
21078309378443336267…52066191871161151999
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,639,555 XPM·at block #6,799,437 · 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.