Block #558,843

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/23/2014, 7:56:26 PM · Difficulty 10.9640 · 6,233,741 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
0b3435b6a576a92cb8500efbbc371f7b6aabb83c09ad88d2176702ad825e4530

Height

#558,843

Difficulty

10.964014

Transactions

6

Size

1.77 KB

Version

2

Bits

0af6c9a2

Nonce

103,485,048

Timestamp

5/23/2014, 7:56:26 PM

Confirmations

6,233,741

Merkle Root

8bcb2266b0863e5a68524997e0c6472c4c6f08c079159bc6f88b79336ec0025b
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.235 × 10⁹⁸(99-digit number)
12351683849352267899…71033850216945853599
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.235 × 10⁹⁸(99-digit number)
12351683849352267899…71033850216945853599
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.235 × 10⁹⁸(99-digit number)
12351683849352267899…71033850216945853601
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.470 × 10⁹⁸(99-digit number)
24703367698704535798…42067700433891707199
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.470 × 10⁹⁸(99-digit number)
24703367698704535798…42067700433891707201
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.940 × 10⁹⁸(99-digit number)
49406735397409071597…84135400867783414399
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
4.940 × 10⁹⁸(99-digit number)
49406735397409071597…84135400867783414401
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
9.881 × 10⁹⁸(99-digit number)
98813470794818143195…68270801735566828799
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
9.881 × 10⁹⁸(99-digit number)
98813470794818143195…68270801735566828801
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.976 × 10⁹⁹(100-digit number)
19762694158963628639…36541603471133657599
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.976 × 10⁹⁹(100-digit number)
19762694158963628639…36541603471133657601
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.952 × 10⁹⁹(100-digit number)
39525388317927257278…73083206942267315199
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,584,641 XPM·at block #6,792,583 · 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.