Block #2,242,315

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2017, 9:59:21 AM · Difficulty 10.9474 · 4,600,443 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4bf6020225c18d3429ba29a42016dc94a644aa889dc6b2c6636f7b23ab1131f7

Height

#2,242,315

Difficulty

10.947383

Transactions

2

Size

868 B

Version

2

Bits

0af287b5

Nonce

822,469,209

Timestamp

8/8/2017, 9:59:21 AM

Confirmations

4,600,443

Merkle Root

462e22129845596f9c109362e2b814110e0f9114e178bb563ffea031ddc06a6e
Transactions (2)
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.

8.018 × 10⁹²(93-digit number)
80180927586434674744…14472738808993270081
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
8.018 × 10⁹²(93-digit number)
80180927586434674744…14472738808993270081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.603 × 10⁹³(94-digit number)
16036185517286934948…28945477617986540161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.207 × 10⁹³(94-digit number)
32072371034573869897…57890955235973080321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.414 × 10⁹³(94-digit number)
64144742069147739795…15781910471946160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.282 × 10⁹⁴(95-digit number)
12828948413829547959…31563820943892321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.565 × 10⁹⁴(95-digit number)
25657896827659095918…63127641887784642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.131 × 10⁹⁴(95-digit number)
51315793655318191836…26255283775569285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.026 × 10⁹⁵(96-digit number)
10263158731063638367…52510567551138570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.052 × 10⁹⁵(96-digit number)
20526317462127276734…05021135102277140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.105 × 10⁹⁵(96-digit number)
41052634924254553469…10042270204554280961
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,986,401 XPM·at block #6,842,757 · 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