Block #700,466

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 8/31/2014, 12:15:55 AM · Difficulty 10.9589 · 6,101,248 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
1b5a9189ed1cd471711456d47cbc0988b44f1c17bce9641bdb65615a6e7b2b3b

Height

#700,466

Difficulty

10.958902

Transactions

7

Size

1.67 KB

Version

2

Bits

0af57a97

Nonce

250,414,514

Timestamp

8/31/2014, 12:15:55 AM

Confirmations

6,101,248

Merkle Root

39caca245b237ef466c74af660c31a52cb65dca1f36ef440b209e79c4bb94d2e
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.002 × 10⁹⁸(99-digit number)
10029523419259929097…92793723323067043839
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.002 × 10⁹⁸(99-digit number)
10029523419259929097…92793723323067043839
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.002 × 10⁹⁸(99-digit number)
10029523419259929097…92793723323067043841
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.005 × 10⁹⁸(99-digit number)
20059046838519858194…85587446646134087679
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.005 × 10⁹⁸(99-digit number)
20059046838519858194…85587446646134087681
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
4.011 × 10⁹⁸(99-digit number)
40118093677039716388…71174893292268175359
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
4.011 × 10⁹⁸(99-digit number)
40118093677039716388…71174893292268175361
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
8.023 × 10⁹⁸(99-digit number)
80236187354079432777…42349786584536350719
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
8.023 × 10⁹⁸(99-digit number)
80236187354079432777…42349786584536350721
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.604 × 10⁹⁹(100-digit number)
16047237470815886555…84699573169072701439
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.604 × 10⁹⁹(100-digit number)
16047237470815886555…84699573169072701441
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
3.209 × 10⁹⁹(100-digit number)
32094474941631773110…69399146338145402879
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,657,804 XPM·at block #6,801,713 · 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.