Block #324,700

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 1:19:02 PM · Difficulty 10.2071 · 6,492,039 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
788e140a9e818ca27b0305cb1ee41a9b1ae750b012ee87f0e1c8a2a47a36d627

Height

#324,700

Difficulty

10.207065

Transactions

2

Size

392 B

Version

2

Bits

0a350232

Nonce

266,185

Timestamp

12/22/2013, 1:19:02 PM

Confirmations

6,492,039

Merkle Root

5154d70317e258e66e3b0759f2ea2f9f5a4bf99988bd2aa06f5aa1689fefb84d
Transactions (2)
1 in → 1 out9.5992 XPM110 B
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.

2.248 × 10⁹⁵(96-digit number)
22482623991043673770…28228369397516982439
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
2.248 × 10⁹⁵(96-digit number)
22482623991043673770…28228369397516982439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.496 × 10⁹⁵(96-digit number)
44965247982087347541…56456738795033964879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.993 × 10⁹⁵(96-digit number)
89930495964174695082…12913477590067929759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.798 × 10⁹⁶(97-digit number)
17986099192834939016…25826955180135859519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.597 × 10⁹⁶(97-digit number)
35972198385669878032…51653910360271719039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.194 × 10⁹⁶(97-digit number)
71944396771339756065…03307820720543438079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.438 × 10⁹⁷(98-digit number)
14388879354267951213…06615641441086876159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.877 × 10⁹⁷(98-digit number)
28777758708535902426…13231282882173752319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.755 × 10⁹⁷(98-digit number)
57555517417071804852…26462565764347504639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.151 × 10⁹⁸(99-digit number)
11511103483414360970…52925131528695009279
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,777,948 XPM·at block #6,816,738 · 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