Block #327,469

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/24/2013, 1:56:17 PM · Difficulty 10.1765 · 6,488,830 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
86830b54d57ec4419fb44a052736b95b9af6296adb571e402f9f07bd797c1ea5

Height

#327,469

Difficulty

10.176523

Transactions

4

Size

3.15 KB

Version

2

Bits

0a2d309b

Nonce

396,193

Timestamp

12/24/2013, 1:56:17 PM

Confirmations

6,488,830

Merkle Root

2bc521e9b579689a7f3a15578c60f43c10eeae9a1792321876ecc3d3b0eeb814
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.

3.858 × 10⁹⁷(98-digit number)
38587258053653332224…40785234371720780801
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
3.858 × 10⁹⁷(98-digit number)
38587258053653332224…40785234371720780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.717 × 10⁹⁷(98-digit number)
77174516107306664448…81570468743441561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.543 × 10⁹⁸(99-digit number)
15434903221461332889…63140937486883123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.086 × 10⁹⁸(99-digit number)
30869806442922665779…26281874973766246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.173 × 10⁹⁸(99-digit number)
61739612885845331558…52563749947532492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.234 × 10⁹⁹(100-digit number)
12347922577169066311…05127499895064985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.469 × 10⁹⁹(100-digit number)
24695845154338132623…10254999790129971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.939 × 10⁹⁹(100-digit number)
49391690308676265246…20509999580259942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.878 × 10⁹⁹(100-digit number)
98783380617352530493…41019999160519884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.975 × 10¹⁰⁰(101-digit number)
19756676123470506098…82039998321039769601
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,774,511 XPM·at block #6,816,298 · 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