Block #1,610,583

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/2/2016, 5:50:00 AM · Difficulty 10.6081 · 5,228,768 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
02040cd8a19320537d8bfead1e4163395673d90564308b7f1ab46a5ff6d1a33f

Height

#1,610,583

Difficulty

10.608050

Transactions

2

Size

4.61 KB

Version

2

Bits

0a9ba92f

Nonce

498,021,376

Timestamp

6/2/2016, 5:50:00 AM

Confirmations

5,228,768

Merkle Root

ffd94b4dc6e2876dc4e74af119661e06a1feefe8cbd5f35edbcbef669e372550
Transactions (2)
1 in → 1 out9.0400 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.

1.224 × 10⁹⁴(95-digit number)
12248678619658595995…42649319376273384001
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.224 × 10⁹⁴(95-digit number)
12248678619658595995…42649319376273384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.449 × 10⁹⁴(95-digit number)
24497357239317191991…85298638752546768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.899 × 10⁹⁴(95-digit number)
48994714478634383982…70597277505093536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.798 × 10⁹⁴(95-digit number)
97989428957268767965…41194555010187072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.959 × 10⁹⁵(96-digit number)
19597885791453753593…82389110020374144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.919 × 10⁹⁵(96-digit number)
39195771582907507186…64778220040748288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.839 × 10⁹⁵(96-digit number)
78391543165815014372…29556440081496576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.567 × 10⁹⁶(97-digit number)
15678308633163002874…59112880162993152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.135 × 10⁹⁶(97-digit number)
31356617266326005749…18225760325986304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.271 × 10⁹⁶(97-digit number)
62713234532652011498…36451520651972608001
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