Block #2,751,562

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2018, 3:50:34 PM · Difficulty 11.6429 · 4,092,267 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
53d5a93ea59f7c5b95e8f1a9783adaa2c8cf0199b413515efccd5323d6aedc6c

Height

#2,751,562

Difficulty

11.642908

Transactions

4

Size

1.34 KB

Version

2

Bits

0ba4959e

Nonce

1,078,130,842

Timestamp

7/16/2018, 3:50:34 PM

Confirmations

4,092,267

Merkle Root

f0019922baf5da3b59b3ef6284824b08cce8e9dae092b2c2fffb7459b717ea39
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.675 × 10⁹⁵(96-digit number)
46754848846672917372…70662471938946685601
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.675 × 10⁹⁵(96-digit number)
46754848846672917372…70662471938946685601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.350 × 10⁹⁵(96-digit number)
93509697693345834745…41324943877893371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.870 × 10⁹⁶(97-digit number)
18701939538669166949…82649887755786742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.740 × 10⁹⁶(97-digit number)
37403879077338333898…65299775511573484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.480 × 10⁹⁶(97-digit number)
74807758154676667796…30599551023146969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.496 × 10⁹⁷(98-digit number)
14961551630935333559…61199102046293939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.992 × 10⁹⁷(98-digit number)
29923103261870667118…22398204092587878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.984 × 10⁹⁷(98-digit number)
59846206523741334236…44796408185175756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.196 × 10⁹⁸(99-digit number)
11969241304748266847…89592816370351513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.393 × 10⁹⁸(99-digit number)
23938482609496533694…79185632740703027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.787 × 10⁹⁸(99-digit number)
47876965218993067389…58371265481406054401
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,995,008 XPM·at block #6,843,828 · 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