Block #3,012,480

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2019, 8:21:34 PM · Difficulty 11.1792 · 3,820,787 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71644dbd18e16ff284c4bf51d08115170dc46d2a94324cc73b664cc92ba96392

Height

#3,012,480

Difficulty

11.179205

Transactions

3

Size

880 B

Version

2

Bits

0b2de05d

Nonce

1,473,138,669

Timestamp

1/16/2019, 8:21:34 PM

Confirmations

3,820,787

Merkle Root

ef6b363b081dd22b68b269d8d4506782ae99324b71405e2199a539732b7c2c73
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.969 × 10⁹⁴(95-digit number)
39698995643513170824…67778791420860399121
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.969 × 10⁹⁴(95-digit number)
39698995643513170824…67778791420860399121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.939 × 10⁹⁴(95-digit number)
79397991287026341649…35557582841720798241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.587 × 10⁹⁵(96-digit number)
15879598257405268329…71115165683441596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.175 × 10⁹⁵(96-digit number)
31759196514810536659…42230331366883192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.351 × 10⁹⁵(96-digit number)
63518393029621073319…84460662733766385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.270 × 10⁹⁶(97-digit number)
12703678605924214663…68921325467532771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.540 × 10⁹⁶(97-digit number)
25407357211848429327…37842650935065543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.081 × 10⁹⁶(97-digit number)
50814714423696858655…75685301870131087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.016 × 10⁹⁷(98-digit number)
10162942884739371731…51370603740262174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.032 × 10⁹⁷(98-digit number)
20325885769478743462…02741207480524349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.065 × 10⁹⁷(98-digit number)
40651771538957486924…05482414961048698881
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,910,329 XPM·at block #6,833,266 · 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