Block #2,213,042

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2017, 6:07:02 AM · Difficulty 10.9439 · 4,628,986 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c08cb818b42ad3bfba7b8fe2c409b8e9027e0fa7c8703266c7c01ad29e195b3f

Height

#2,213,042

Difficulty

10.943891

Transactions

3

Size

1.22 KB

Version

2

Bits

0af1a2db

Nonce

278,204,915

Timestamp

7/19/2017, 6:07:02 AM

Confirmations

4,628,986

Merkle Root

48d930f146a76cbf8f4dc2f11e74726c695230cf50ed99b3842e3e70d1a045f4
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.241 × 10⁹⁴(95-digit number)
32411834069972104063…51626265965624481281
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.241 × 10⁹⁴(95-digit number)
32411834069972104063…51626265965624481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.482 × 10⁹⁴(95-digit number)
64823668139944208127…03252531931248962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.296 × 10⁹⁵(96-digit number)
12964733627988841625…06505063862497925121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.592 × 10⁹⁵(96-digit number)
25929467255977683251…13010127724995850241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.185 × 10⁹⁵(96-digit number)
51858934511955366502…26020255449991700481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.037 × 10⁹⁶(97-digit number)
10371786902391073300…52040510899983400961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.074 × 10⁹⁶(97-digit number)
20743573804782146600…04081021799966801921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.148 × 10⁹⁶(97-digit number)
41487147609564293201…08162043599933603841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.297 × 10⁹⁶(97-digit number)
82974295219128586403…16324087199867207681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.659 × 10⁹⁷(98-digit number)
16594859043825717280…32648174399734415361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.318 × 10⁹⁷(98-digit number)
33189718087651434561…65296348799468830721
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,980,610 XPM·at block #6,842,027 · 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