Block #2,134,301

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2017, 3:39:55 AM · Difficulty 10.9090 · 4,707,279 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6d1dd58d7be6e8fc6b8b2cf290fc690d0a3fe7971a286a7e7128fb20593a39fd

Height

#2,134,301

Difficulty

10.908969

Transactions

3

Size

12.10 KB

Version

2

Bits

0ae8b238

Nonce

1,195,064,015

Timestamp

5/27/2017, 3:39:55 AM

Confirmations

4,707,279

Merkle Root

85e2692176bc873876286bcedd57d2473d9a53fb2755419b331a7c5c1411681e
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.

4.093 × 10⁹⁵(96-digit number)
40935880352620038210…83126288675972200321
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
4.093 × 10⁹⁵(96-digit number)
40935880352620038210…83126288675972200321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.187 × 10⁹⁵(96-digit number)
81871760705240076421…66252577351944400641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.637 × 10⁹⁶(97-digit number)
16374352141048015284…32505154703888801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.274 × 10⁹⁶(97-digit number)
32748704282096030568…65010309407777602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.549 × 10⁹⁶(97-digit number)
65497408564192061137…30020618815555205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.309 × 10⁹⁷(98-digit number)
13099481712838412227…60041237631110410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.619 × 10⁹⁷(98-digit number)
26198963425676824454…20082475262220820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.239 × 10⁹⁷(98-digit number)
52397926851353648909…40164950524441640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.047 × 10⁹⁸(99-digit number)
10479585370270729781…80329901048883281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.095 × 10⁹⁸(99-digit number)
20959170740541459563…60659802097766563841
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,977,026 XPM·at block #6,841,579 · 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