Block #2,933,897

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/22/2018, 4:15:19 AM · Difficulty 11.3977 · 3,898,963 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee086b35cad9574766abe95ac550b42691ddf38158ba790f525d29a52618eee2

Height

#2,933,897

Difficulty

11.397739

Transactions

8

Size

2.08 KB

Version

2

Bits

0b65d23d

Nonce

1,538,461,643

Timestamp

11/22/2018, 4:15:19 AM

Confirmations

3,898,963

Merkle Root

c1a70d3b4216aab9b57ed080aab621f108020d3e2098d377063d2284c04a8bf8
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.

7.718 × 10⁹⁷(98-digit number)
77184026060061155184…60694520628397015041
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
7.718 × 10⁹⁷(98-digit number)
77184026060061155184…60694520628397015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.543 × 10⁹⁸(99-digit number)
15436805212012231036…21389041256794030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.087 × 10⁹⁸(99-digit number)
30873610424024462073…42778082513588060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.174 × 10⁹⁸(99-digit number)
61747220848048924147…85556165027176120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.234 × 10⁹⁹(100-digit number)
12349444169609784829…71112330054352240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.469 × 10⁹⁹(100-digit number)
24698888339219569659…42224660108704481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.939 × 10⁹⁹(100-digit number)
49397776678439139318…84449320217408962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.879 × 10⁹⁹(100-digit number)
98795553356878278636…68898640434817925121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.975 × 10¹⁰⁰(101-digit number)
19759110671375655727…37797280869635850241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.951 × 10¹⁰⁰(101-digit number)
39518221342751311454…75594561739271700481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.903 × 10¹⁰⁰(101-digit number)
79036442685502622908…51189123478543400961
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,907,049 XPM·at block #6,832,859 · 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