Block #850,802

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 7:32:44 PM · Difficulty 10.9710 · 5,991,029 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3cb33f633cb9f38893cf4922c186764ab4a03e4ca3d88cc8a72fade929bb2c40

Height

#850,802

Difficulty

10.971036

Transactions

3

Size

623 B

Version

2

Bits

0af895d2

Nonce

2,400,020,217

Timestamp

12/12/2014, 7:32:44 PM

Confirmations

5,991,029

Merkle Root

2bd68c25f9c6922c3907882e3c90387290a0c15fb7b866b79b2f363612718dd2
Transactions (3)
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.038 × 10⁹⁴(95-digit number)
90388847791410004162…26102985098240162079
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.038 × 10⁹⁴(95-digit number)
90388847791410004162…26102985098240162079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.807 × 10⁹⁵(96-digit number)
18077769558282000832…52205970196480324159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.615 × 10⁹⁵(96-digit number)
36155539116564001664…04411940392960648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.231 × 10⁹⁵(96-digit number)
72311078233128003329…08823880785921296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.446 × 10⁹⁶(97-digit number)
14462215646625600665…17647761571842593279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.892 × 10⁹⁶(97-digit number)
28924431293251201331…35295523143685186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.784 × 10⁹⁶(97-digit number)
57848862586502402663…70591046287370373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.156 × 10⁹⁷(98-digit number)
11569772517300480532…41182092574740746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.313 × 10⁹⁷(98-digit number)
23139545034600961065…82364185149481492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.627 × 10⁹⁷(98-digit number)
46279090069201922130…64728370298962984959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.255 × 10⁹⁷(98-digit number)
92558180138403844261…29456740597925969919
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,979,022 XPM·at block #6,841,830 · 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