Block #321,423

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 7:52:42 AM · Difficulty 10.1880 · 6,486,546 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e56929de56c5a183fed14202cc7dd54cdb754fab1c09a44660eb30a6446285f

Height

#321,423

Difficulty

10.187991

Transactions

24

Size

12.46 KB

Version

2

Bits

0a302032

Nonce

5,912

Timestamp

12/20/2013, 7:52:42 AM

Confirmations

6,486,546

Merkle Root

72ed7c0eda44c9df7c732d73be2e15a24ab09a3017fc182769cad09376241bc1
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.828 × 10⁹⁷(98-digit number)
48280982739270533654…88536120474470186341
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.828 × 10⁹⁷(98-digit number)
48280982739270533654…88536120474470186341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.656 × 10⁹⁷(98-digit number)
96561965478541067309…77072240948940372681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.931 × 10⁹⁸(99-digit number)
19312393095708213461…54144481897880745361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.862 × 10⁹⁸(99-digit number)
38624786191416426923…08288963795761490721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.724 × 10⁹⁸(99-digit number)
77249572382832853847…16577927591522981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.544 × 10⁹⁹(100-digit number)
15449914476566570769…33155855183045962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.089 × 10⁹⁹(100-digit number)
30899828953133141538…66311710366091925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.179 × 10⁹⁹(100-digit number)
61799657906266283077…32623420732183851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.235 × 10¹⁰⁰(101-digit number)
12359931581253256615…65246841464367703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.471 × 10¹⁰⁰(101-digit number)
24719863162506513231…30493682928735406081
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,707,795 XPM·at block #6,807,968 · 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.

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