Block #1,242,518

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/18/2015, 7:03:39 PM · Difficulty 10.7543 · 5,574,961 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62056201cc7d0bba9f90bbcd1226b59bb37207ebfa56f36f97f61734ef83030a

Height

#1,242,518

Difficulty

10.754277

Transactions

17

Size

6.75 KB

Version

2

Bits

0ac11853

Nonce

89,878,596

Timestamp

9/18/2015, 7:03:39 PM

Confirmations

5,574,961

Merkle Root

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

9.252 × 10⁹⁴(95-digit number)
92526602823151526464…71728183955881415279
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
9.252 × 10⁹⁴(95-digit number)
92526602823151526464…71728183955881415279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.850 × 10⁹⁵(96-digit number)
18505320564630305292…43456367911762830559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.701 × 10⁹⁵(96-digit number)
37010641129260610585…86912735823525661119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.402 × 10⁹⁵(96-digit number)
74021282258521221171…73825471647051322239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.480 × 10⁹⁶(97-digit number)
14804256451704244234…47650943294102644479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.960 × 10⁹⁶(97-digit number)
29608512903408488468…95301886588205288959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.921 × 10⁹⁶(97-digit number)
59217025806816976937…90603773176410577919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.184 × 10⁹⁷(98-digit number)
11843405161363395387…81207546352821155839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.368 × 10⁹⁷(98-digit number)
23686810322726790774…62415092705642311679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.737 × 10⁹⁷(98-digit number)
47373620645453581549…24830185411284623359
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,783,885 XPM·at block #6,817,478 · 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.
Privacy Policy·

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