Block #646,545

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2014, 10:40:24 PM · Difficulty 10.9523 · 6,170,851 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab697da6e5c115b9beceafff51998aaec5886afef1bfaf9cdf78dd68edb6b2af

Height

#646,545

Difficulty

10.952260

Transactions

2

Size

878 B

Version

2

Bits

0af3c755

Nonce

1,520,300,256

Timestamp

7/24/2014, 10:40:24 PM

Confirmations

6,170,851

Merkle Root

7481c1be230738ab9e8e45a60ad504a86e89620101664046cc8ee0603b070569
Transactions (2)
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.686 × 10⁹⁸(99-digit number)
66869805512755753549…56520169882170593281
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.686 × 10⁹⁸(99-digit number)
66869805512755753549…56520169882170593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.337 × 10⁹⁹(100-digit number)
13373961102551150709…13040339764341186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.674 × 10⁹⁹(100-digit number)
26747922205102301419…26080679528682373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.349 × 10⁹⁹(100-digit number)
53495844410204602839…52161359057364746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.069 × 10¹⁰⁰(101-digit number)
10699168882040920567…04322718114729492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.139 × 10¹⁰⁰(101-digit number)
21398337764081841135…08645436229458984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.279 × 10¹⁰⁰(101-digit number)
42796675528163682271…17290872458917969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.559 × 10¹⁰⁰(101-digit number)
85593351056327364543…34581744917835939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.711 × 10¹⁰¹(102-digit number)
17118670211265472908…69163489835671879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.423 × 10¹⁰¹(102-digit number)
34237340422530945817…38326979671343759361
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,783,210 XPM·at block #6,817,395 · 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