Block #880,652

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/3/2015, 3:17:20 PM · Difficulty 10.9615 · 5,926,489 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
a4908a49badaeeac35e04bffcac194045acfeca4d2e3115da1a99e9c2e225d97

Height

#880,652

Difficulty

10.961459

Transactions

10

Size

3.06 KB

Version

2

Bits

0af62235

Nonce

45,233,403

Timestamp

1/3/2015, 3:17:20 PM

Confirmations

5,926,489

Merkle Root

9627cdba24b47527d90c9e58ce93da6784eacdf1b70868d83917a82773f90190
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.020 × 10⁹⁸(99-digit number)
20205559192990676015…48026801293242204159
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.020 × 10⁹⁸(99-digit number)
20205559192990676015…48026801293242204159
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.020 × 10⁹⁸(99-digit number)
20205559192990676015…48026801293242204161
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.041 × 10⁹⁸(99-digit number)
40411118385981352031…96053602586484408319
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
4.041 × 10⁹⁸(99-digit number)
40411118385981352031…96053602586484408321
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
8.082 × 10⁹⁸(99-digit number)
80822236771962704062…92107205172968816639
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
8.082 × 10⁹⁸(99-digit number)
80822236771962704062…92107205172968816641
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.616 × 10⁹⁹(100-digit number)
16164447354392540812…84214410345937633279
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.616 × 10⁹⁹(100-digit number)
16164447354392540812…84214410345937633281
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.232 × 10⁹⁹(100-digit number)
32328894708785081625…68428820691875266559
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
3.232 × 10⁹⁹(100-digit number)
32328894708785081625…68428820691875266561
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
6.465 × 10⁹⁹(100-digit number)
64657789417570163250…36857641383750533119
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,701,135 XPM·at block #6,807,140 · 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.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy