Block #2,152,075

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/8/2017, 7:20:15 PM · Difficulty 10.9010 · 4,689,004 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc0da547df89f7ffdde71a487cde173102d5596733217d101a2c281afeda4043

Height

#2,152,075

Difficulty

10.900967

Transactions

5

Size

1.44 KB

Version

2

Bits

0ae6a5c7

Nonce

604,620,611

Timestamp

6/8/2017, 7:20:15 PM

Confirmations

4,689,004

Merkle Root

e811452218cdcf96a759d9c1af2224e9433e3e774a2f7ddffb9571d5d241dc45
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.321 × 10⁹⁶(97-digit number)
23211723217827653518…46643296108509967359
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.321 × 10⁹⁶(97-digit number)
23211723217827653518…46643296108509967359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.642 × 10⁹⁶(97-digit number)
46423446435655307036…93286592217019934719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.284 × 10⁹⁶(97-digit number)
92846892871310614072…86573184434039869439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.856 × 10⁹⁷(98-digit number)
18569378574262122814…73146368868079738879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.713 × 10⁹⁷(98-digit number)
37138757148524245629…46292737736159477759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.427 × 10⁹⁷(98-digit number)
74277514297048491258…92585475472318955519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.485 × 10⁹⁸(99-digit number)
14855502859409698251…85170950944637911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.971 × 10⁹⁸(99-digit number)
29711005718819396503…70341901889275822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.942 × 10⁹⁸(99-digit number)
59422011437638793006…40683803778551644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.188 × 10⁹⁹(100-digit number)
11884402287527758601…81367607557103288319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.376 × 10⁹⁹(100-digit number)
23768804575055517202…62735215114206576639
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,972,995 XPM·at block #6,841,078 · 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