Block #2,800,679

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/19/2018, 11:56:23 AM · Difficulty 11.6714 · 4,043,221 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
108ece933fdf9f8df6b735d96298e3c534ab2cd516abf4d069255ccba3e1ba06

Height

#2,800,679

Difficulty

11.671358

Transactions

2

Size

427 B

Version

2

Bits

0babde23

Nonce

53,825,742

Timestamp

8/19/2018, 11:56:23 AM

Confirmations

4,043,221

Merkle Root

92397397d718a8134d4169244f73c2e2537220444409cc5172e902d24f5ffc0d
Transactions (2)
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.

3.571 × 10⁹⁷(98-digit number)
35711164394943863134…86828899408675584001
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
3.571 × 10⁹⁷(98-digit number)
35711164394943863134…86828899408675584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.142 × 10⁹⁷(98-digit number)
71422328789887726268…73657798817351168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.428 × 10⁹⁸(99-digit number)
14284465757977545253…47315597634702336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.856 × 10⁹⁸(99-digit number)
28568931515955090507…94631195269404672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.713 × 10⁹⁸(99-digit number)
57137863031910181014…89262390538809344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.142 × 10⁹⁹(100-digit number)
11427572606382036202…78524781077618688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.285 × 10⁹⁹(100-digit number)
22855145212764072405…57049562155237376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.571 × 10⁹⁹(100-digit number)
45710290425528144811…14099124310474752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.142 × 10⁹⁹(100-digit number)
91420580851056289623…28198248620949504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.828 × 10¹⁰⁰(101-digit number)
18284116170211257924…56396497241899008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.656 × 10¹⁰⁰(101-digit number)
36568232340422515849…12792994483798016001
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,571 XPM·at block #6,843,899 · 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