Block #323,900

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 11:15:07 PM · Difficulty 10.2082 · 6,493,335 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0cc9c1a40244b87a2bb7ee8db8065f9dec4a71ac81b792ad4170846da9d412dd

Height

#323,900

Difficulty

10.208246

Transactions

1

Size

1004 B

Version

2

Bits

0a354f9e

Nonce

37,350

Timestamp

12/21/2013, 11:15:07 PM

Confirmations

6,493,335

Merkle Root

43a2b74b80abfb8b80b1badf990724a183e8a38a92cbafd900d913afeebb0dba
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.805 × 10⁹⁷(98-digit number)
38053100234728585045…64465390453823180801
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.805 × 10⁹⁷(98-digit number)
38053100234728585045…64465390453823180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.610 × 10⁹⁷(98-digit number)
76106200469457170091…28930780907646361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.522 × 10⁹⁸(99-digit number)
15221240093891434018…57861561815292723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.044 × 10⁹⁸(99-digit number)
30442480187782868036…15723123630585446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.088 × 10⁹⁸(99-digit number)
60884960375565736072…31446247261170892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.217 × 10⁹⁹(100-digit number)
12176992075113147214…62892494522341785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.435 × 10⁹⁹(100-digit number)
24353984150226294429…25784989044683571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.870 × 10⁹⁹(100-digit number)
48707968300452588858…51569978089367142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.741 × 10⁹⁹(100-digit number)
97415936600905177716…03139956178734284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.948 × 10¹⁰⁰(101-digit number)
19483187320181035543…06279912357468569601
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,781,919 XPM·at block #6,817,234 · 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