Block #325,017

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 5:47:10 PM · Difficulty 10.2081 · 6,491,657 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2952e34ac63b86aec38ea8276f2083e433571a33539d9803e0c6840b75fa75ad

Height

#325,017

Difficulty

10.208149

Transactions

6

Size

2.01 KB

Version

2

Bits

0a354939

Nonce

346,856

Timestamp

12/22/2013, 5:47:10 PM

Confirmations

6,491,657

Merkle Root

88bd49b8692ae542c175d2e391f1a098891348314cac662bcd2b75f7846a4a6a
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.

7.807 × 10⁹¹(92-digit number)
78074565832734791506…42608739578384891919
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
7.807 × 10⁹¹(92-digit number)
78074565832734791506…42608739578384891919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.561 × 10⁹²(93-digit number)
15614913166546958301…85217479156769783839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.122 × 10⁹²(93-digit number)
31229826333093916602…70434958313539567679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.245 × 10⁹²(93-digit number)
62459652666187833205…40869916627079135359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.249 × 10⁹³(94-digit number)
12491930533237566641…81739833254158270719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.498 × 10⁹³(94-digit number)
24983861066475133282…63479666508316541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.996 × 10⁹³(94-digit number)
49967722132950266564…26959333016633082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.993 × 10⁹³(94-digit number)
99935444265900533128…53918666033266165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.998 × 10⁹⁴(95-digit number)
19987088853180106625…07837332066532331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.997 × 10⁹⁴(95-digit number)
39974177706360213251…15674664133064663039
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,510 XPM·at block #6,816,673 · 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