Block #2,006,678

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2017, 10:45:17 AM · Difficulty 10.7107 · 4,830,077 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e2e184a76a7e90f8f8b436e98e62814f2e3b3263dc647b02a3cba0ed2a9e8a89

Height

#2,006,678

Difficulty

10.710703

Transactions

2

Size

4.32 KB

Version

2

Bits

0ab5f09f

Nonce

1,622,825,919

Timestamp

3/3/2017, 10:45:17 AM

Confirmations

4,830,077

Merkle Root

f083b2eb94ec2fb6ac32ac09b7ef0ba553c56a59c110fbf611cd623b9f527c38
Transactions (2)
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.

4.913 × 10⁹⁵(96-digit number)
49131109801025963331…70612315563739069441
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
4.913 × 10⁹⁵(96-digit number)
49131109801025963331…70612315563739069441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.826 × 10⁹⁵(96-digit number)
98262219602051926662…41224631127478138881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.965 × 10⁹⁶(97-digit number)
19652443920410385332…82449262254956277761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.930 × 10⁹⁶(97-digit number)
39304887840820770665…64898524509912555521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.860 × 10⁹⁶(97-digit number)
78609775681641541330…29797049019825111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.572 × 10⁹⁷(98-digit number)
15721955136328308266…59594098039650222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.144 × 10⁹⁷(98-digit number)
31443910272656616532…19188196079300444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.288 × 10⁹⁷(98-digit number)
62887820545313233064…38376392158600888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.257 × 10⁹⁸(99-digit number)
12577564109062646612…76752784317201776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.515 × 10⁹⁸(99-digit number)
25155128218125293225…53505568634403553281
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,938,327 XPM·at block #6,836,754 · 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