Block #2,487,561

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2018, 6:04:10 AM · Difficulty 10.9693 · 4,352,411 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
689fc2a3b7b0887eb6ff783188fd911e12a25d359eae449314540c65e082c459

Height

#2,487,561

Difficulty

10.969252

Transactions

2

Size

79.77 KB

Version

2

Bits

0af820ee

Nonce

1,589,131,230

Timestamp

1/24/2018, 6:04:10 AM

Confirmations

4,352,411

Merkle Root

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

6.391 × 10⁹⁴(95-digit number)
63913067938950753066…68790337597885043201
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
6.391 × 10⁹⁴(95-digit number)
63913067938950753066…68790337597885043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.278 × 10⁹⁵(96-digit number)
12782613587790150613…37580675195770086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.556 × 10⁹⁵(96-digit number)
25565227175580301226…75161350391540172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.113 × 10⁹⁵(96-digit number)
51130454351160602453…50322700783080345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.022 × 10⁹⁶(97-digit number)
10226090870232120490…00645401566160691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.045 × 10⁹⁶(97-digit number)
20452181740464240981…01290803132321382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.090 × 10⁹⁶(97-digit number)
40904363480928481962…02581606264642764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.180 × 10⁹⁶(97-digit number)
81808726961856963925…05163212529285529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.636 × 10⁹⁷(98-digit number)
16361745392371392785…10326425058571059201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.272 × 10⁹⁷(98-digit number)
32723490784742785570…20652850117142118401
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,964,081 XPM·at block #6,839,971 · 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