Block #325,397

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/23/2013, 12:29:00 AM · Difficulty 10.2047 · 6,481,791 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2253e70735746ca72b95a7faf1945d55f8ab853102d4367c6217efdbe8f56f9

Height

#325,397

Difficulty

10.204711

Transactions

4

Size

1.29 KB

Version

2

Bits

0a3467f2

Nonce

165,618

Timestamp

12/23/2013, 12:29:00 AM

Confirmations

6,481,791

Merkle Root

fb93ecd19009a2ccbc32bbbd2f65c9f9bd3043b454b6736d8bea75c512b9b57e
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.

1.285 × 10⁹⁹(100-digit number)
12855096181759483037…22802233755675783679
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
1.285 × 10⁹⁹(100-digit number)
12855096181759483037…22802233755675783679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.571 × 10⁹⁹(100-digit number)
25710192363518966074…45604467511351567359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.142 × 10⁹⁹(100-digit number)
51420384727037932149…91208935022703134719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.028 × 10¹⁰⁰(101-digit number)
10284076945407586429…82417870045406269439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.056 × 10¹⁰⁰(101-digit number)
20568153890815172859…64835740090812538879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.113 × 10¹⁰⁰(101-digit number)
41136307781630345719…29671480181625077759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.227 × 10¹⁰⁰(101-digit number)
82272615563260691439…59342960363250155519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.645 × 10¹⁰¹(102-digit number)
16454523112652138287…18685920726500311039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.290 × 10¹⁰¹(102-digit number)
32909046225304276575…37371841453000622079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.581 × 10¹⁰¹(102-digit number)
65818092450608553151…74743682906001244159
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,701,516 XPM·at block #6,807,187 · 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