Block #2,207,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/15/2017, 9:38:41 AM · Difficulty 10.9454 · 4,635,276 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5b850b44d6a51df021f2150893c6ee3e91086828eceb6a4ea37c1ed64d5061a2

Height

#2,207,642

Difficulty

10.945371

Transactions

5

Size

1.19 KB

Version

2

Bits

0af203d7

Nonce

35,802,942

Timestamp

7/15/2017, 9:38:41 AM

Confirmations

4,635,276

Merkle Root

3c430b81fe5db88cbada0e34416681d8adaeab02ff3a3ff8e8fddf55d22fe637
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.029 × 10⁹³(94-digit number)
30293773733249600737…86937857027950264321
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.029 × 10⁹³(94-digit number)
30293773733249600737…86937857027950264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.058 × 10⁹³(94-digit number)
60587547466499201475…73875714055900528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.211 × 10⁹⁴(95-digit number)
12117509493299840295…47751428111801057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.423 × 10⁹⁴(95-digit number)
24235018986599680590…95502856223602114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.847 × 10⁹⁴(95-digit number)
48470037973199361180…91005712447204229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.694 × 10⁹⁴(95-digit number)
96940075946398722361…82011424894408458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.938 × 10⁹⁵(96-digit number)
19388015189279744472…64022849788816916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.877 × 10⁹⁵(96-digit number)
38776030378559488944…28045699577633832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.755 × 10⁹⁵(96-digit number)
77552060757118977889…56091399155267665921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.551 × 10⁹⁶(97-digit number)
15510412151423795577…12182798310535331841
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,987,691 XPM·at block #6,842,917 · 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