Block #2,135,627

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2017, 9:48:43 AM · Difficulty 10.8998 · 4,703,517 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e2d62879522f0b91bc79d04bd2898286d1ea02e43f898f65bf39cd0ce7c28b6

Height

#2,135,627

Difficulty

10.899790

Transactions

3

Size

1.65 KB

Version

2

Bits

0ae658a3

Nonce

475,843,595

Timestamp

5/28/2017, 9:48:43 AM

Confirmations

4,703,517

Merkle Root

a21c4aa1f794e460fa663a98c73046fb45a51c4c2ec9ea4388c12b0bdd7f2547
Transactions (3)
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.

3.753 × 10⁹³(94-digit number)
37532753541912507897…10557500866475633921
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
3.753 × 10⁹³(94-digit number)
37532753541912507897…10557500866475633921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.506 × 10⁹³(94-digit number)
75065507083825015794…21115001732951267841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.501 × 10⁹⁴(95-digit number)
15013101416765003158…42230003465902535681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.002 × 10⁹⁴(95-digit number)
30026202833530006317…84460006931805071361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.005 × 10⁹⁴(95-digit number)
60052405667060012635…68920013863610142721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.201 × 10⁹⁵(96-digit number)
12010481133412002527…37840027727220285441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.402 × 10⁹⁵(96-digit number)
24020962266824005054…75680055454440570881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.804 × 10⁹⁵(96-digit number)
48041924533648010108…51360110908881141761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.608 × 10⁹⁵(96-digit number)
96083849067296020217…02720221817762283521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.921 × 10⁹⁶(97-digit number)
19216769813459204043…05440443635524567041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.843 × 10⁹⁶(97-digit number)
38433539626918408086…10880887271049134081
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,957,432 XPM·at block #6,839,143 · 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