Block #325,192

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 8:41:21 PM · Difficulty 10.2083 · 6,482,911 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2c23688844a60e921ac6a2362330c6ebb24d0eb8fd645be1960524666a3a22b0

Height

#325,192

Difficulty

10.208315

Transactions

7

Size

1.52 KB

Version

2

Bits

0a355425

Nonce

229,397

Timestamp

12/22/2013, 8:41:21 PM

Confirmations

6,482,911

Merkle Root

b5b88ac1085c88e9d5604e6bca22398e57264434813c906feb5c3a183f6d62f7
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.828 × 10¹⁰¹(102-digit number)
18283520479216444278…52670954167267731839
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.828 × 10¹⁰¹(102-digit number)
18283520479216444278…52670954167267731839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.656 × 10¹⁰¹(102-digit number)
36567040958432888557…05341908334535463679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.313 × 10¹⁰¹(102-digit number)
73134081916865777115…10683816669070927359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.462 × 10¹⁰²(103-digit number)
14626816383373155423…21367633338141854719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.925 × 10¹⁰²(103-digit number)
29253632766746310846…42735266676283709439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.850 × 10¹⁰²(103-digit number)
58507265533492621692…85470533352567418879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.170 × 10¹⁰³(104-digit number)
11701453106698524338…70941066705134837759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.340 × 10¹⁰³(104-digit number)
23402906213397048676…41882133410269675519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.680 × 10¹⁰³(104-digit number)
46805812426794097353…83764266820539351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.361 × 10¹⁰³(104-digit number)
93611624853588194707…67528533641078702079
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,708,870 XPM·at block #6,808,102 · 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