Block #569,269

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/31/2014, 1:15:11 AM · Difficulty 10.9645 · 6,226,115 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
9254a4da8eb08490951667baa0c0e151fb4dd6246c4fc6f7fafb3a89d190c444

Height

#569,269

Difficulty

10.964547

Transactions

10

Size

8.15 KB

Version

2

Bits

0af6ec92

Nonce

318,418,006

Timestamp

5/31/2014, 1:15:11 AM

Confirmations

6,226,115

Merkle Root

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

2.305 × 10⁹⁸(99-digit number)
23055924449039605906…02057803861316293759
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
2.305 × 10⁹⁸(99-digit number)
23055924449039605906…02057803861316293759
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.305 × 10⁹⁸(99-digit number)
23055924449039605906…02057803861316293761
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
4.611 × 10⁹⁸(99-digit number)
46111848898079211813…04115607722632587519
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
4.611 × 10⁹⁸(99-digit number)
46111848898079211813…04115607722632587521
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
9.222 × 10⁹⁸(99-digit number)
92223697796158423627…08231215445265175039
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
9.222 × 10⁹⁸(99-digit number)
92223697796158423627…08231215445265175041
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.844 × 10⁹⁹(100-digit number)
18444739559231684725…16462430890530350079
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.844 × 10⁹⁹(100-digit number)
18444739559231684725…16462430890530350081
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
3.688 × 10⁹⁹(100-digit number)
36889479118463369451…32924861781060700159
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
3.688 × 10⁹⁹(100-digit number)
36889479118463369451…32924861781060700161
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
7.377 × 10⁹⁹(100-digit number)
73778958236926738902…65849723562121400319
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,607,131 XPM·at block #6,795,383 · 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.