Block #245,480

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/5/2013, 12:08:55 PM · Difficulty 9.9639 · 6,587,547 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8dc799e630c75bcc6d3884b0e56e0afc82a0940df5d9e81f38bf8d8b943eaec

Height

#245,480

Difficulty

9.963908

Transactions

1

Size

1.74 KB

Version

2

Bits

09f6c2a9

Nonce

39,188

Timestamp

11/5/2013, 12:08:55 PM

Confirmations

6,587,547

Merkle Root

13f3e57158c81109f0b0a4e51be8927d7961e68c94589b4eeb2bad5015bcc582
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.

7.463 × 10⁸⁸(89-digit number)
74630499078356731664…53324803429031915001
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
7.463 × 10⁸⁸(89-digit number)
74630499078356731664…53324803429031915001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.492 × 10⁸⁹(90-digit number)
14926099815671346332…06649606858063830001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.985 × 10⁸⁹(90-digit number)
29852199631342692665…13299213716127660001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.970 × 10⁸⁹(90-digit number)
59704399262685385331…26598427432255320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.194 × 10⁹⁰(91-digit number)
11940879852537077066…53196854864510640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.388 × 10⁹⁰(91-digit number)
23881759705074154132…06393709729021280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.776 × 10⁹⁰(91-digit number)
47763519410148308265…12787419458042560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.552 × 10⁹⁰(91-digit number)
95527038820296616530…25574838916085120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.910 × 10⁹¹(92-digit number)
19105407764059323306…51149677832170240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.821 × 10⁹¹(92-digit number)
38210815528118646612…02299355664340480001
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,908,392 XPM·at block #6,833,026 · 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