Block #646,541

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2014, 10:36:12 PM · Difficulty 10.9523 · 6,166,256 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
80e39aefd7bda1883ae37882716a84cb96d9fb4fd5fd3ee5bfbef7f03e6c8a56

Height

#646,541

Difficulty

10.952277

Transactions

5

Size

5.31 KB

Version

2

Bits

0af3c873

Nonce

2,363,423,414

Timestamp

7/24/2014, 10:36:12 PM

Confirmations

6,166,256

Merkle Root

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

4.099 × 10⁹⁷(98-digit number)
40995938781796661018…63470793283927132161
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
4.099 × 10⁹⁷(98-digit number)
40995938781796661018…63470793283927132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.199 × 10⁹⁷(98-digit number)
81991877563593322036…26941586567854264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.639 × 10⁹⁸(99-digit number)
16398375512718664407…53883173135708528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.279 × 10⁹⁸(99-digit number)
32796751025437328814…07766346271417057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.559 × 10⁹⁸(99-digit number)
65593502050874657628…15532692542834114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.311 × 10⁹⁹(100-digit number)
13118700410174931525…31065385085668229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.623 × 10⁹⁹(100-digit number)
26237400820349863051…62130770171336458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.247 × 10⁹⁹(100-digit number)
52474801640699726103…24261540342672916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.049 × 10¹⁰⁰(101-digit number)
10494960328139945220…48523080685345832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.098 × 10¹⁰⁰(101-digit number)
20989920656279890441…97046161370691665921
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,746,419 XPM·at block #6,812,796 · 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.

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