Block #3,009,073

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2019, 9:01:13 AM · Difficulty 11.2036 · 3,829,816 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0a9376b2bbc16748b6787f9cc28b50d63d64e05afb3f9cb4dcca6b5de794ad66

Height

#3,009,073

Difficulty

11.203591

Transactions

3

Size

1.51 KB

Version

2

Bits

0b341e86

Nonce

459,143,319

Timestamp

1/14/2019, 9:01:13 AM

Confirmations

3,829,816

Merkle Root

149cc0c50675173c416bd02711317e6b8e83633432ba23c131f960179053c4b2
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.

5.539 × 10⁹⁴(95-digit number)
55391298174646713005…29891480659840829681
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
5.539 × 10⁹⁴(95-digit number)
55391298174646713005…29891480659840829681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.107 × 10⁹⁵(96-digit number)
11078259634929342601…59782961319681659361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.215 × 10⁹⁵(96-digit number)
22156519269858685202…19565922639363318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.431 × 10⁹⁵(96-digit number)
44313038539717370404…39131845278726637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.862 × 10⁹⁵(96-digit number)
88626077079434740808…78263690557453274881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.772 × 10⁹⁶(97-digit number)
17725215415886948161…56527381114906549761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.545 × 10⁹⁶(97-digit number)
35450430831773896323…13054762229813099521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.090 × 10⁹⁶(97-digit number)
70900861663547792647…26109524459626199041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.418 × 10⁹⁷(98-digit number)
14180172332709558529…52219048919252398081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.836 × 10⁹⁷(98-digit number)
28360344665419117058…04438097838504796161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.672 × 10⁹⁷(98-digit number)
56720689330838234117…08876195677009592321
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,955,382 XPM·at block #6,838,888 · 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