Block #565,210

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/28/2014, 4:38:52 AM · Difficulty 10.9648 · 6,230,362 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
8905faf049ddc8cf26aaca2c4d4aadc42d216e91ab80caa7d1fdc0c6c4294e72

Height

#565,210

Difficulty

10.964798

Transactions

9

Size

2.54 KB

Version

2

Bits

0af6fd08

Nonce

9,797,193

Timestamp

5/28/2014, 4:38:52 AM

Confirmations

6,230,362

Merkle Root

4e3a00b6a838256b1eca548b300db0813f0a68ec7ed2f9e648e99ff9db964e6b
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.220 × 10⁹⁹(100-digit number)
12204210257925196925…25256450998695511039
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.220 × 10⁹⁹(100-digit number)
12204210257925196925…25256450998695511039
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.220 × 10⁹⁹(100-digit number)
12204210257925196925…25256450998695511041
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.440 × 10⁹⁹(100-digit number)
24408420515850393850…50512901997391022079
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.440 × 10⁹⁹(100-digit number)
24408420515850393850…50512901997391022081
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.881 × 10⁹⁹(100-digit number)
48816841031700787701…01025803994782044159
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
4.881 × 10⁹⁹(100-digit number)
48816841031700787701…01025803994782044161
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.763 × 10⁹⁹(100-digit number)
97633682063401575402…02051607989564088319
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
9.763 × 10⁹⁹(100-digit number)
97633682063401575402…02051607989564088321
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.952 × 10¹⁰⁰(101-digit number)
19526736412680315080…04103215979128176639
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.952 × 10¹⁰⁰(101-digit number)
19526736412680315080…04103215979128176641
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.905 × 10¹⁰⁰(101-digit number)
39053472825360630161…08206431958256353279
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,636 XPM·at block #6,795,571 · 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.