Block #639,922

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2014, 6:48:58 PM · Difficulty 10.9591 · 6,185,392 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
56ccc08a4c2832c5b8658a53b065ec2600177309de00b7bb9d2dbae08405c541

Height

#639,922

Difficulty

10.959149

Transactions

8

Size

2.47 KB

Version

2

Bits

0af58ace

Nonce

284,016,690

Timestamp

7/19/2014, 6:48:58 PM

Confirmations

6,185,392

Merkle Root

8faaf5a49d8490cf273d1bdb606262fd5304806f748d752da3a2c326540784c2
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.625 × 10⁹⁷(98-digit number)
16258610552011439199…43155593785752867841
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.625 × 10⁹⁷(98-digit number)
16258610552011439199…43155593785752867841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.251 × 10⁹⁷(98-digit number)
32517221104022878399…86311187571505735681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.503 × 10⁹⁷(98-digit number)
65034442208045756799…72622375143011471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.300 × 10⁹⁸(99-digit number)
13006888441609151359…45244750286022942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.601 × 10⁹⁸(99-digit number)
26013776883218302719…90489500572045885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.202 × 10⁹⁸(99-digit number)
52027553766436605439…80979001144091770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.040 × 10⁹⁹(100-digit number)
10405510753287321087…61958002288183541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.081 × 10⁹⁹(100-digit number)
20811021506574642175…23916004576367083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.162 × 10⁹⁹(100-digit number)
41622043013149284351…47832009152734167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.324 × 10⁹⁹(100-digit number)
83244086026298568703…95664018305468334081
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,846,615 XPM·at block #6,825,313 · 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