Block #364,305

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 11:35:30 PM · Difficulty 10.4223 · 6,476,527 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f09cacf0985e78467b9e389707785339454cb7f88b0ab7ebe6cd6c006c63289

Height

#364,305

Difficulty

10.422301

Transactions

9

Size

2.11 KB

Version

2

Bits

0a6c1bee

Nonce

420,794

Timestamp

1/17/2014, 11:35:30 PM

Confirmations

6,476,527

Merkle Root

c674def5aa1e7c2d6c6740b43928eb29567740346635ad7c1b5b58434175ea8f
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.487 × 10⁹⁷(98-digit number)
44879779630911437840…75462495934422776081
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.487 × 10⁹⁷(98-digit number)
44879779630911437840…75462495934422776081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.975 × 10⁹⁷(98-digit number)
89759559261822875680…50924991868845552161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.795 × 10⁹⁸(99-digit number)
17951911852364575136…01849983737691104321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.590 × 10⁹⁸(99-digit number)
35903823704729150272…03699967475382208641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.180 × 10⁹⁸(99-digit number)
71807647409458300544…07399934950764417281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.436 × 10⁹⁹(100-digit number)
14361529481891660108…14799869901528834561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.872 × 10⁹⁹(100-digit number)
28723058963783320217…29599739803057669121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.744 × 10⁹⁹(100-digit number)
57446117927566640435…59199479606115338241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.148 × 10¹⁰⁰(101-digit number)
11489223585513328087…18398959212230676481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.297 × 10¹⁰⁰(101-digit number)
22978447171026656174…36797918424461352961
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,971,002 XPM·at block #6,840,831 · 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