Block #1,685,449

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2016, 2:04:58 AM · Difficulty 10.7203 · 5,152,740 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
04ea076a86f348978c270264dfd8c197859eecfa055e7713b1bda8b092fe34e7

Height

#1,685,449

Difficulty

10.720266

Transactions

2

Size

13.83 KB

Version

2

Bits

0ab8635d

Nonce

1,628,760,716

Timestamp

7/23/2016, 2:04:58 AM

Confirmations

5,152,740

Merkle Root

d39bf952659a59a9db37e4bf60dc969ed73359f7f4b9136cb14650dd7bb8c306
Transactions (2)
1 in → 1 out8.8300 XPM109 B
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.

5.493 × 10⁹⁴(95-digit number)
54932013267447818962…85142813369153432001
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
5.493 × 10⁹⁴(95-digit number)
54932013267447818962…85142813369153432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.098 × 10⁹⁵(96-digit number)
10986402653489563792…70285626738306864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.197 × 10⁹⁵(96-digit number)
21972805306979127584…40571253476613728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.394 × 10⁹⁵(96-digit number)
43945610613958255169…81142506953227456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.789 × 10⁹⁵(96-digit number)
87891221227916510339…62285013906454912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.757 × 10⁹⁶(97-digit number)
17578244245583302067…24570027812909824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.515 × 10⁹⁶(97-digit number)
35156488491166604135…49140055625819648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.031 × 10⁹⁶(97-digit number)
70312976982333208271…98280111251639296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.406 × 10⁹⁷(98-digit number)
14062595396466641654…96560222503278592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.812 × 10⁹⁷(98-digit number)
28125190792933283308…93120445006557184001
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,949,787 XPM·at block #6,838,188 · 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