Block #662,774

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2014, 9:32:12 PM · Difficulty 10.9569 · 6,145,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71c08397185376d3496fb5767b1498e4820812c310aed8065a3ee77e862269ba

Height

#662,774

Difficulty

10.956887

Transactions

4

Size

1.01 KB

Version

2

Bits

0af4f684

Nonce

2,629,529,691

Timestamp

8/4/2014, 9:32:12 PM

Confirmations

6,145,592

Merkle Root

706b37014d47dfa32bf4883ecbd47e645e2aab40afe5214cb3748d25ec78b1e2
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.656 × 10⁹⁷(98-digit number)
16567532077647700081…21971577482618583041
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.656 × 10⁹⁷(98-digit number)
16567532077647700081…21971577482618583041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.313 × 10⁹⁷(98-digit number)
33135064155295400162…43943154965237166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.627 × 10⁹⁷(98-digit number)
66270128310590800324…87886309930474332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.325 × 10⁹⁸(99-digit number)
13254025662118160064…75772619860948664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.650 × 10⁹⁸(99-digit number)
26508051324236320129…51545239721897328641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.301 × 10⁹⁸(99-digit number)
53016102648472640259…03090479443794657281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.060 × 10⁹⁹(100-digit number)
10603220529694528051…06180958887589314561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.120 × 10⁹⁹(100-digit number)
21206441059389056103…12361917775178629121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.241 × 10⁹⁹(100-digit number)
42412882118778112207…24723835550357258241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.482 × 10⁹⁹(100-digit number)
84825764237556224415…49447671100714516481
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,710,981 XPM·at block #6,808,365 · 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