1. #6,805,7442CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #922,277

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 2/4/2015, 8:34:23 AM · Difficulty 10.9159 · 5,883,468 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
93e107be24a23ef6d02505ffecf35f85be8a11b07e2351b692519be914aa5541

Height

#922,277

Difficulty

10.915855

Transactions

6

Size

116.46 KB

Version

2

Bits

0aea7580

Nonce

56,093,389

Timestamp

2/4/2015, 8:34:23 AM

Confirmations

5,883,468

Merkle Root

0ae620074b74e19a120e479af9336d393d5417369f0decb2b959713292328649
Transactions (6)
1 in → 1 out9.5900 XPM116 B
200 in → 1 out1020.6695 XPM28.97 KB
3 in → 1 out17.0751 XPM487 B
200 in → 1 out1011.4852 XPM28.93 KB
200 in → 1 out962.6201 XPM28.94 KB
200 in → 1 out988.0537 XPM28.94 KB
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.

5.603 × 10⁹⁵(96-digit number)
56039005435068577419…52007033089003350109
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
5.603 × 10⁹⁵(96-digit number)
56039005435068577419…52007033089003350109
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
5.603 × 10⁹⁵(96-digit number)
56039005435068577419…52007033089003350111
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
1.120 × 10⁹⁶(97-digit number)
11207801087013715483…04014066178006700219
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.120 × 10⁹⁶(97-digit number)
11207801087013715483…04014066178006700221
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
2.241 × 10⁹⁶(97-digit number)
22415602174027430967…08028132356013400439
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.241 × 10⁹⁶(97-digit number)
22415602174027430967…08028132356013400441
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
4.483 × 10⁹⁶(97-digit number)
44831204348054861935…16056264712026800879
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
4.483 × 10⁹⁶(97-digit number)
44831204348054861935…16056264712026800881
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
8.966 × 10⁹⁶(97-digit number)
89662408696109723870…32112529424053601759
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
8.966 × 10⁹⁶(97-digit number)
89662408696109723870…32112529424053601761
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
1.793 × 10⁹⁷(98-digit number)
17932481739221944774…64225058848107203519
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,690,032 XPM·at block #6,805,743 · 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.