Block #2,152,057

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/8/2017, 7:05:04 PM · Difficulty 10.9009 · 4,687,620 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e5f4349dbf3eb5f25b0db0a580fa61d4c928821ee84a63cc3daf52419f456a1

Height

#2,152,057

Difficulty

10.900893

Transactions

2

Size

425 B

Version

2

Bits

0ae6a0ef

Nonce

30,223,528

Timestamp

6/8/2017, 7:05:04 PM

Confirmations

4,687,620

Merkle Root

7ca6750abc737f0a43b2646fd5493a519177f05c7833b62d05e3d8f3b4baa275
Transactions (2)
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.741 × 10⁹³(94-digit number)
17415000499061257107…38931439339049555961
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.741 × 10⁹³(94-digit number)
17415000499061257107…38931439339049555961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.483 × 10⁹³(94-digit number)
34830000998122514214…77862878678099111921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.966 × 10⁹³(94-digit number)
69660001996245028428…55725757356198223841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.393 × 10⁹⁴(95-digit number)
13932000399249005685…11451514712396447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.786 × 10⁹⁴(95-digit number)
27864000798498011371…22903029424792895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.572 × 10⁹⁴(95-digit number)
55728001596996022742…45806058849585790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.114 × 10⁹⁵(96-digit number)
11145600319399204548…91612117699171581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.229 × 10⁹⁵(96-digit number)
22291200638798409097…83224235398343162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.458 × 10⁹⁵(96-digit number)
44582401277596818194…66448470796686325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.916 × 10⁹⁵(96-digit number)
89164802555193636388…32896941593372651521
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,961,703 XPM·at block #6,839,676 · 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