Block #1,684,202

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/22/2016, 3:58:28 AM · Difficulty 10.7246 · 5,146,441 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
66dce159649466737bc419b6fb06cd5f05803b0409c5c01a3446b4bed1ec0425

Height

#1,684,202

Difficulty

10.724649

Transactions

2

Size

869 B

Version

2

Bits

0ab982a1

Nonce

991,312,830

Timestamp

7/22/2016, 3:58:28 AM

Confirmations

5,146,441

Merkle Root

bfe989fa4ad52ba48dfc5567c8891b220a33918570e4335c0ae0081bc723b4cb
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.

1.281 × 10⁹³(94-digit number)
12813800826470203390…26165162276774836721
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.281 × 10⁹³(94-digit number)
12813800826470203390…26165162276774836721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.562 × 10⁹³(94-digit number)
25627601652940406780…52330324553549673441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.125 × 10⁹³(94-digit number)
51255203305880813560…04660649107099346881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.025 × 10⁹⁴(95-digit number)
10251040661176162712…09321298214198693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.050 × 10⁹⁴(95-digit number)
20502081322352325424…18642596428397387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.100 × 10⁹⁴(95-digit number)
41004162644704650848…37285192856794775041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.200 × 10⁹⁴(95-digit number)
82008325289409301697…74570385713589550081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.640 × 10⁹⁵(96-digit number)
16401665057881860339…49140771427179100161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.280 × 10⁹⁵(96-digit number)
32803330115763720678…98281542854358200321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.560 × 10⁹⁵(96-digit number)
65606660231527441357…96563085708716400641
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,889,269 XPM·at block #6,830,642 · 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