Block #2,122,386

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/18/2017, 2:22:52 PM · Difficulty 10.9155 · 4,721,039 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d32fb9c5396f094ffa25b8774f3f711e490021eb0c9aa1745a80dfc36953d05e

Height

#2,122,386

Difficulty

10.915497

Transactions

14

Size

4.19 KB

Version

2

Bits

0aea5e00

Nonce

399,683,930

Timestamp

5/18/2017, 2:22:52 PM

Confirmations

4,721,039

Merkle Root

84cb799190e1dd60743f0e1b4b40206a2a864b81db371c13a237cf15678ddf83
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.240 × 10⁹⁴(95-digit number)
12406861638686298809…90515985339207272359
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.240 × 10⁹⁴(95-digit number)
12406861638686298809…90515985339207272359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.481 × 10⁹⁴(95-digit number)
24813723277372597618…81031970678414544719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.962 × 10⁹⁴(95-digit number)
49627446554745195236…62063941356829089439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.925 × 10⁹⁴(95-digit number)
99254893109490390472…24127882713658178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.985 × 10⁹⁵(96-digit number)
19850978621898078094…48255765427316357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.970 × 10⁹⁵(96-digit number)
39701957243796156189…96511530854632715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.940 × 10⁹⁵(96-digit number)
79403914487592312378…93023061709265431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.588 × 10⁹⁶(97-digit number)
15880782897518462475…86046123418530862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.176 × 10⁹⁶(97-digit number)
31761565795036924951…72092246837061724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.352 × 10⁹⁶(97-digit number)
63523131590073849902…44184493674123448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.270 × 10⁹⁷(98-digit number)
12704626318014769980…88368987348246896639
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,991,769 XPM·at block #6,843,424 · 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