Block #2,238,673

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/5/2017, 11:11:10 PM · Difficulty 10.9461 · 4,600,575 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50cec9d50eab69731174ed6b16f7568e27b57d65f24ad376d105670c00a75115

Height

#2,238,673

Difficulty

10.946063

Transactions

4

Size

2.16 KB

Version

2

Bits

0af23135

Nonce

921,311,657

Timestamp

8/5/2017, 11:11:10 PM

Confirmations

4,600,575

Merkle Root

12624c41a5020dcfc0a92c867a18b4044f97be60ba9c80f71cd6fe9f319d3c6d
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.

1.720 × 10⁹²(93-digit number)
17209933129554244628…81251468887691714081
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
1.720 × 10⁹²(93-digit number)
17209933129554244628…81251468887691714081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.441 × 10⁹²(93-digit number)
34419866259108489257…62502937775383428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.883 × 10⁹²(93-digit number)
68839732518216978515…25005875550766856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.376 × 10⁹³(94-digit number)
13767946503643395703…50011751101533712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.753 × 10⁹³(94-digit number)
27535893007286791406…00023502203067425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.507 × 10⁹³(94-digit number)
55071786014573582812…00047004406134850561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.101 × 10⁹⁴(95-digit number)
11014357202914716562…00094008812269701121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.202 × 10⁹⁴(95-digit number)
22028714405829433124…00188017624539402241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.405 × 10⁹⁴(95-digit number)
44057428811658866249…00376035249078804481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.811 × 10⁹⁴(95-digit number)
88114857623317732499…00752070498157608961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.762 × 10⁹⁵(96-digit number)
17622971524663546499…01504140996315217921
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,958,266 XPM·at block #6,839,247 · 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