Block #902,267

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2015, 5:24:37 AM · Difficulty 10.9403 · 5,904,327 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
40859646b3cbc03fac4604bcf7251dc4ba9b1063797c43ba4ac9f04e66e47cf0

Height

#902,267

Difficulty

10.940337

Transactions

4

Size

8.95 KB

Version

2

Bits

0af0b9f2

Nonce

902,936,321

Timestamp

1/20/2015, 5:24:37 AM

Confirmations

5,904,327

Merkle Root

69350adbf5043abb51d0515f717cd1869345c58f0ac7c6accee34bda77bab04d
Transactions (4)
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.002 × 10⁹⁷(98-digit number)
20022511341315621457…13733161417018664959
Discovered Prime Numbers
p_k = 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.

1
origin − 1
2.002 × 10⁹⁷(98-digit number)
20022511341315621457…13733161417018664959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.004 × 10⁹⁷(98-digit number)
40045022682631242914…27466322834037329919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.009 × 10⁹⁷(98-digit number)
80090045365262485829…54932645668074659839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.601 × 10⁹⁸(99-digit number)
16018009073052497165…09865291336149319679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.203 × 10⁹⁸(99-digit number)
32036018146104994331…19730582672298639359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.407 × 10⁹⁸(99-digit number)
64072036292209988663…39461165344597278719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.281 × 10⁹⁹(100-digit number)
12814407258441997732…78922330689194557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.562 × 10⁹⁹(100-digit number)
25628814516883995465…57844661378389114879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.125 × 10⁹⁹(100-digit number)
51257629033767990931…15689322756778229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.025 × 10¹⁰⁰(101-digit number)
10251525806753598186…31378645513556459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.050 × 10¹⁰⁰(101-digit number)
20503051613507196372…62757291027112919039
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 Cunningham Chain of the First Kind. 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,696,850 XPM·at block #6,806,593 · 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