Block #850,745

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 6:11:07 PM · Difficulty 10.9712 · 5,990,606 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ac0a782dc29ac715dc03dfd782317156dc448ba85e49b555a69c069cc06d8df

Height

#850,745

Difficulty

10.971170

Transactions

11

Size

4.26 KB

Version

2

Bits

0af89ea0

Nonce

168,285,144

Timestamp

12/12/2014, 6:11:07 PM

Confirmations

5,990,606

Merkle Root

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

1.242 × 10⁹⁷(98-digit number)
12428167830940525635…19054349738983265279
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
1.242 × 10⁹⁷(98-digit number)
12428167830940525635…19054349738983265279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.485 × 10⁹⁷(98-digit number)
24856335661881051271…38108699477966530559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.971 × 10⁹⁷(98-digit number)
49712671323762102542…76217398955933061119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.942 × 10⁹⁷(98-digit number)
99425342647524205084…52434797911866122239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.988 × 10⁹⁸(99-digit number)
19885068529504841016…04869595823732244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.977 × 10⁹⁸(99-digit number)
39770137059009682033…09739191647464488959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.954 × 10⁹⁸(99-digit number)
79540274118019364067…19478383294928977919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.590 × 10⁹⁹(100-digit number)
15908054823603872813…38956766589857955839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.181 × 10⁹⁹(100-digit number)
31816109647207745627…77913533179715911679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.363 × 10⁹⁹(100-digit number)
63632219294415491254…55827066359431823359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.272 × 10¹⁰⁰(101-digit number)
12726443858883098250…11654132718863646719
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,975,175 XPM·at block #6,841,350 · 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