Block #2,805,950

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/23/2018, 4:11:19 AM · Difficulty 11.6700 · 4,035,072 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
66e35d1d051cdc91e5d2b90a463277dcd23a61be84aef6f26173ac734288bfd2

Height

#2,805,950

Difficulty

11.669978

Transactions

23

Size

6.56 KB

Version

2

Bits

0bab83a8

Nonce

894,848,155

Timestamp

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

Confirmations

4,035,072

Merkle Root

06d0a04a10290285e533f55150ba387f16d06e59070617037d46a9999f079d32
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.027 × 10⁹⁵(96-digit number)
30274020569924321745…15909458898261422721
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.027 × 10⁹⁵(96-digit number)
30274020569924321745…15909458898261422721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.054 × 10⁹⁵(96-digit number)
60548041139848643490…31818917796522845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.210 × 10⁹⁶(97-digit number)
12109608227969728698…63637835593045690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.421 × 10⁹⁶(97-digit number)
24219216455939457396…27275671186091381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.843 × 10⁹⁶(97-digit number)
48438432911878914792…54551342372182763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.687 × 10⁹⁶(97-digit number)
96876865823757829584…09102684744365527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.937 × 10⁹⁷(98-digit number)
19375373164751565916…18205369488731054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.875 × 10⁹⁷(98-digit number)
38750746329503131833…36410738977462108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.750 × 10⁹⁷(98-digit number)
77501492659006263667…72821477954924216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.550 × 10⁹⁸(99-digit number)
15500298531801252733…45642955909848432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.100 × 10⁹⁸(99-digit number)
31000597063602505466…91285911819696865281
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,972,533 XPM·at block #6,841,021 · 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