Block #2,799,994

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/18/2018, 11:42:23 PM · Difficulty 11.6744 · 4,043,396 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50f0d35598905f5f30aac492d2dbc8553d5ee00160f860f57bdef1c760729aca

Height

#2,799,994

Difficulty

11.674434

Transactions

7

Size

2.33 KB

Version

2

Bits

0baca7b6

Nonce

547,612,639

Timestamp

8/18/2018, 11:42:23 PM

Confirmations

4,043,396

Merkle Root

1c563eec93be2d29e094097506a8861f5888a221317f66c664d6a78015fd351f
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.209 × 10⁹⁴(95-digit number)
42099064619785016768…49273273930325602161
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.209 × 10⁹⁴(95-digit number)
42099064619785016768…49273273930325602161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.419 × 10⁹⁴(95-digit number)
84198129239570033536…98546547860651204321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.683 × 10⁹⁵(96-digit number)
16839625847914006707…97093095721302408641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.367 × 10⁹⁵(96-digit number)
33679251695828013414…94186191442604817281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.735 × 10⁹⁵(96-digit number)
67358503391656026829…88372382885209634561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.347 × 10⁹⁶(97-digit number)
13471700678331205365…76744765770419269121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.694 × 10⁹⁶(97-digit number)
26943401356662410731…53489531540838538241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.388 × 10⁹⁶(97-digit number)
53886802713324821463…06979063081677076481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.077 × 10⁹⁷(98-digit number)
10777360542664964292…13958126163354152961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.155 × 10⁹⁷(98-digit number)
21554721085329928585…27916252326708305921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.310 × 10⁹⁷(98-digit number)
43109442170659857170…55832504653416611841
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,991,486 XPM·at block #6,843,389 · 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