Block #2,999,586

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2019, 4:01:42 PM · Difficulty 11.2301 · 3,825,386 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2771b200c4f3bf59ca191409f8fd98d44a3d6e153404c675e296fa04e577c8d0

Height

#2,999,586

Difficulty

11.230074

Transactions

3

Size

1.61 KB

Version

2

Bits

0b3ae622

Nonce

210,057,293

Timestamp

1/7/2019, 4:01:42 PM

Confirmations

3,825,386

Merkle Root

05b3afe49ff9096cacc85d2fdfadb195253015f0f1411a70e814ff544fd868a6
Transactions (3)
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.

1.157 × 10⁹⁷(98-digit number)
11578805987566926811…99661844480405626881
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
1.157 × 10⁹⁷(98-digit number)
11578805987566926811…99661844480405626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.315 × 10⁹⁷(98-digit number)
23157611975133853622…99323688960811253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.631 × 10⁹⁷(98-digit number)
46315223950267707245…98647377921622507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.263 × 10⁹⁷(98-digit number)
92630447900535414490…97294755843245015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.852 × 10⁹⁸(99-digit number)
18526089580107082898…94589511686490030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.705 × 10⁹⁸(99-digit number)
37052179160214165796…89179023372980060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.410 × 10⁹⁸(99-digit number)
74104358320428331592…78358046745960120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.482 × 10⁹⁹(100-digit number)
14820871664085666318…56716093491920240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.964 × 10⁹⁹(100-digit number)
29641743328171332637…13432186983840481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.928 × 10⁹⁹(100-digit number)
59283486656342665274…26864373967680962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.185 × 10¹⁰⁰(101-digit number)
11856697331268533054…53728747935361925121
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,843,857 XPM·at block #6,824,971 · 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