Block #2,808,119

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/24/2018, 3:35:43 PM · Difficulty 11.6729 · 4,034,160 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
878f0662b1d7b3ce2c1c0e5371b0c1a86a9ffef7af1ad4fc2597157b22befbda

Height

#2,808,119

Difficulty

11.672926

Transactions

33

Size

12.38 KB

Version

2

Bits

0bac44e9

Nonce

347,303,694

Timestamp

8/24/2018, 3:35:43 PM

Confirmations

4,034,160

Merkle Root

1a3fa9659818dabff84b8415ee98f2665ef01a74afd88791f5a65b88edf600ff
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.

2.470 × 10⁹⁴(95-digit number)
24707820267980044508…36256651160346107041
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
2.470 × 10⁹⁴(95-digit number)
24707820267980044508…36256651160346107041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.941 × 10⁹⁴(95-digit number)
49415640535960089016…72513302320692214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.883 × 10⁹⁴(95-digit number)
98831281071920178033…45026604641384428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.976 × 10⁹⁵(96-digit number)
19766256214384035606…90053209282768856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.953 × 10⁹⁵(96-digit number)
39532512428768071213…80106418565537712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.906 × 10⁹⁵(96-digit number)
79065024857536142427…60212837131075425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.581 × 10⁹⁶(97-digit number)
15813004971507228485…20425674262150850561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.162 × 10⁹⁶(97-digit number)
31626009943014456970…40851348524301701121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.325 × 10⁹⁶(97-digit number)
63252019886028913941…81702697048603402241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.265 × 10⁹⁷(98-digit number)
12650403977205782788…63405394097206804481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.530 × 10⁹⁷(98-digit number)
25300807954411565576…26810788194413608961
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,982,634 XPM·at block #6,842,278 · 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