Block #1,603,872

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2016, 3:58:13 PM · Difficulty 10.5983 · 5,235,479 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b292705e1b584ba1545feb13d2ff3cc72b01819f8b77c3373c1497b2903d040f

Height

#1,603,872

Difficulty

10.598332

Transactions

4

Size

3.75 KB

Version

2

Bits

0a992c44

Nonce

82,461,805

Timestamp

5/28/2016, 3:58:13 PM

Confirmations

5,235,479

Merkle Root

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

9.468 × 10⁹³(94-digit number)
94680298252000226197…37869082583165533501
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
9.468 × 10⁹³(94-digit number)
94680298252000226197…37869082583165533501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.893 × 10⁹⁴(95-digit number)
18936059650400045239…75738165166331067001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.787 × 10⁹⁴(95-digit number)
37872119300800090478…51476330332662134001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.574 × 10⁹⁴(95-digit number)
75744238601600180957…02952660665324268001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.514 × 10⁹⁵(96-digit number)
15148847720320036191…05905321330648536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.029 × 10⁹⁵(96-digit number)
30297695440640072383…11810642661297072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.059 × 10⁹⁵(96-digit number)
60595390881280144766…23621285322594144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.211 × 10⁹⁶(97-digit number)
12119078176256028953…47242570645188288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.423 × 10⁹⁶(97-digit number)
24238156352512057906…94485141290376576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.847 × 10⁹⁶(97-digit number)
48476312705024115812…88970282580753152001
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,959,094 XPM·at block #6,839,350 · 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