Block #3,092,603

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/14/2019, 10:30:12 AM · Difficulty 11.0565 · 3,741,081 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
db903fb9aa0790d6af7dba466827cf8d3478f40419ba71a1a36f9b2e1bb26be6

Height

#3,092,603

Difficulty

11.056515

Transactions

7

Size

4.82 KB

Version

2

Bits

0b0e77cb

Nonce

1,175,655,979

Timestamp

3/14/2019, 10:30:12 AM

Confirmations

3,741,081

Merkle Root

3711cf243086cb65f2bd63a274da94e3a340e99d02eca18110188c193a705429
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.

2.859 × 10⁹⁶(97-digit number)
28590448340969265803…38323762775718828801
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
2.859 × 10⁹⁶(97-digit number)
28590448340969265803…38323762775718828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.718 × 10⁹⁶(97-digit number)
57180896681938531606…76647525551437657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.143 × 10⁹⁷(98-digit number)
11436179336387706321…53295051102875315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.287 × 10⁹⁷(98-digit number)
22872358672775412642…06590102205750630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.574 × 10⁹⁷(98-digit number)
45744717345550825285…13180204411501260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.148 × 10⁹⁷(98-digit number)
91489434691101650570…26360408823002521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.829 × 10⁹⁸(99-digit number)
18297886938220330114…52720817646005043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.659 × 10⁹⁸(99-digit number)
36595773876440660228…05441635292010086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.319 × 10⁹⁸(99-digit number)
73191547752881320456…10883270584020172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.463 × 10⁹⁹(100-digit number)
14638309550576264091…21766541168040345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.927 × 10⁹⁹(100-digit number)
29276619101152528182…43533082336080691201
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,913,692 XPM·at block #6,833,683 · 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