Block #2,880,208

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/14/2018, 3:18:26 AM · Difficulty 11.6336 · 3,956,722 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ac7054a76014486d5eca03711f26581740673d6a6e11314bee458a1ec93380e6

Height

#2,880,208

Difficulty

11.633557

Transactions

31

Size

8.35 KB

Version

2

Bits

0ba230c7

Nonce

231,579,048

Timestamp

10/14/2018, 3:18:26 AM

Confirmations

3,956,722

Merkle Root

8f476f135e5c320c298e5ef5772c76b02b8f6d74bfb95d08e5d4baa3a84d679c
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.356 × 10⁹⁴(95-digit number)
43565423826005188984…59574694634240140641
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.356 × 10⁹⁴(95-digit number)
43565423826005188984…59574694634240140641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.713 × 10⁹⁴(95-digit number)
87130847652010377968…19149389268480281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.742 × 10⁹⁵(96-digit number)
17426169530402075593…38298778536960562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.485 × 10⁹⁵(96-digit number)
34852339060804151187…76597557073921125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.970 × 10⁹⁵(96-digit number)
69704678121608302374…53195114147842250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.394 × 10⁹⁶(97-digit number)
13940935624321660474…06390228295684500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.788 × 10⁹⁶(97-digit number)
27881871248643320949…12780456591369000961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.576 × 10⁹⁶(97-digit number)
55763742497286641899…25560913182738001921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.115 × 10⁹⁷(98-digit number)
11152748499457328379…51121826365476003841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.230 × 10⁹⁷(98-digit number)
22305496998914656759…02243652730952007681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.461 × 10⁹⁷(98-digit number)
44610993997829313519…04487305461904015361
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,939,736 XPM·at block #6,836,929 · 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