Block #2,642,853

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 9:31:48 PM · Difficulty 11.6657 · 4,188,091 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba95865c8af88b763d9293fa98e5ff30efa59912ffa1a940c98caf3908b0e137

Height

#2,642,853

Difficulty

11.665742

Transactions

34

Size

10.80 KB

Version

2

Bits

0baa6e0e

Nonce

160,821,448

Timestamp

5/1/2018, 9:31:48 PM

Confirmations

4,188,091

Merkle Root

14a949c2e170d72fdc153792fddbe0011f5ee7def3f2c52d62a1ef201f9db184
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.813 × 10⁹⁷(98-digit number)
18130284569046949194…53446782110999920641
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.813 × 10⁹⁷(98-digit number)
18130284569046949194…53446782110999920641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.626 × 10⁹⁷(98-digit number)
36260569138093898388…06893564221999841281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.252 × 10⁹⁷(98-digit number)
72521138276187796777…13787128443999682561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.450 × 10⁹⁸(99-digit number)
14504227655237559355…27574256887999365121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.900 × 10⁹⁸(99-digit number)
29008455310475118710…55148513775998730241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.801 × 10⁹⁸(99-digit number)
58016910620950237421…10297027551997460481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.160 × 10⁹⁹(100-digit number)
11603382124190047484…20594055103994920961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.320 × 10⁹⁹(100-digit number)
23206764248380094968…41188110207989841921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.641 × 10⁹⁹(100-digit number)
46413528496760189937…82376220415979683841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.282 × 10⁹⁹(100-digit number)
92827056993520379874…64752440831959367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.856 × 10¹⁰⁰(101-digit number)
18565411398704075974…29504881663918735361
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,891,687 XPM·at block #6,830,943 · 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