Block #2,042,309

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2017, 3:33:42 PM · Difficulty 10.6727 · 4,791,641 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2a84030dc2d31e8c2f8cebabc5dbbf6eb3210f8720be79851340563e42291861

Height

#2,042,309

Difficulty

10.672683

Transactions

2

Size

1.83 KB

Version

2

Bits

0aac34f4

Nonce

1,292,858,094

Timestamp

3/28/2017, 3:33:42 PM

Confirmations

4,791,641

Merkle Root

88c5430a8397bb783565b0e5d8de0d69804921907356972d46bfb867cc065793
Transactions (2)
1 in → 1 out8.7900 XPM110 B
11 in → 1 out29.9986 XPM1.63 KB
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.

6.664 × 10⁹¹(92-digit number)
66644174757168261950…30269839700291813121
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
6.664 × 10⁹¹(92-digit number)
66644174757168261950…30269839700291813121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.332 × 10⁹²(93-digit number)
13328834951433652390…60539679400583626241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.665 × 10⁹²(93-digit number)
26657669902867304780…21079358801167252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.331 × 10⁹²(93-digit number)
53315339805734609560…42158717602334504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.066 × 10⁹³(94-digit number)
10663067961146921912…84317435204669009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.132 × 10⁹³(94-digit number)
21326135922293843824…68634870409338019841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.265 × 10⁹³(94-digit number)
42652271844587687648…37269740818676039681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.530 × 10⁹³(94-digit number)
85304543689175375297…74539481637352079361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.706 × 10⁹⁴(95-digit number)
17060908737835075059…49078963274704158721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.412 × 10⁹⁴(95-digit number)
34121817475670150118…98157926549408317441
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,829 XPM·at block #6,833,949 · 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