Block #2,122,665

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/18/2017, 6:53:55 PM · Difficulty 10.9156 · 4,709,646 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
97da52b5dfe099ffcaea51fe71fec9c9d6ef44f0ee2de861439a03f066d37514

Height

#2,122,665

Difficulty

10.915649

Transactions

2

Size

1.57 KB

Version

2

Bits

0aea67ff

Nonce

954,670,159

Timestamp

5/18/2017, 6:53:55 PM

Confirmations

4,709,646

Merkle Root

698de7c052c94d563baf4c59ae9e18c872c5d8441bac0e7d51acaaddb7486e09
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.

6.106 × 10⁹³(94-digit number)
61063868848785616328…55642837428631162861
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
6.106 × 10⁹³(94-digit number)
61063868848785616328…55642837428631162861
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.221 × 10⁹⁴(95-digit number)
12212773769757123265…11285674857262325721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.442 × 10⁹⁴(95-digit number)
24425547539514246531…22571349714524651441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.885 × 10⁹⁴(95-digit number)
48851095079028493063…45142699429049302881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.770 × 10⁹⁴(95-digit number)
97702190158056986126…90285398858098605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.954 × 10⁹⁵(96-digit number)
19540438031611397225…80570797716197211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.908 × 10⁹⁵(96-digit number)
39080876063222794450…61141595432394423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.816 × 10⁹⁵(96-digit number)
78161752126445588900…22283190864788846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.563 × 10⁹⁶(97-digit number)
15632350425289117780…44566381729577692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.126 × 10⁹⁶(97-digit number)
31264700850578235560…89132763459155384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.252 × 10⁹⁶(97-digit number)
62529401701156471120…78265526918310768641
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 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
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 2CC formula:

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