Block #2,878,471

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/12/2018, 7:37:37 PM · Difficulty 11.6456 · 3,955,433 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
baed061ad7b83a2c2fc36a51b8f8f29df4af674a8a8b13a8a14e970982e6268f

Height

#2,878,471

Difficulty

11.645553

Transactions

4

Size

1.22 KB

Version

2

Bits

0ba542f3

Nonce

166,929,087

Timestamp

10/12/2018, 7:37:37 PM

Confirmations

3,955,433

Merkle Root

27066bda5281ec3f9487852eafb5a5f3a7eb97fa9d9f893f40f8e1e52fb5ddca
Transactions (4)
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.

9.757 × 10⁹³(94-digit number)
97572523321414135377…09828667239105527041
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
9.757 × 10⁹³(94-digit number)
97572523321414135377…09828667239105527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.951 × 10⁹⁴(95-digit number)
19514504664282827075…19657334478211054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.902 × 10⁹⁴(95-digit number)
39029009328565654151…39314668956422108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.805 × 10⁹⁴(95-digit number)
78058018657131308302…78629337912844216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.561 × 10⁹⁵(96-digit number)
15611603731426261660…57258675825688432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.122 × 10⁹⁵(96-digit number)
31223207462852523320…14517351651376865281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.244 × 10⁹⁵(96-digit number)
62446414925705046641…29034703302753730561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.248 × 10⁹⁶(97-digit number)
12489282985141009328…58069406605507461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.497 × 10⁹⁶(97-digit number)
24978565970282018656…16138813211014922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.995 × 10⁹⁶(97-digit number)
49957131940564037313…32277626422029844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.991 × 10⁹⁶(97-digit number)
99914263881128074626…64555252844059688961
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,915,458 XPM·at block #6,833,903 · 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