Block #308,624

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 4:57:56 AM · Difficulty 9.9946 · 6,508,803 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9fd2712a309742a52c23f7513979c48e643f23ae60bb40b0f6d2853371a1f92c

Height

#308,624

Difficulty

9.994561

Transactions

8

Size

4.36 KB

Version

2

Bits

09fe9b91

Nonce

158,616

Timestamp

12/13/2013, 4:57:56 AM

Confirmations

6,508,803

Merkle Root

052ecd3d74e54c225922b951d114ae390c284fcf20276c429ee4afd9a6d17582
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.

3.089 × 10⁹³(94-digit number)
30895437306138546625…80909101759262421999
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
3.089 × 10⁹³(94-digit number)
30895437306138546625…80909101759262421999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.179 × 10⁹³(94-digit number)
61790874612277093251…61818203518524843999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.235 × 10⁹⁴(95-digit number)
12358174922455418650…23636407037049687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.471 × 10⁹⁴(95-digit number)
24716349844910837300…47272814074099375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.943 × 10⁹⁴(95-digit number)
49432699689821674601…94545628148198751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.886 × 10⁹⁴(95-digit number)
98865399379643349202…89091256296397503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.977 × 10⁹⁵(96-digit number)
19773079875928669840…78182512592795007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.954 × 10⁹⁵(96-digit number)
39546159751857339680…56365025185590015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.909 × 10⁹⁵(96-digit number)
79092319503714679361…12730050371180031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.581 × 10⁹⁶(97-digit number)
15818463900742935872…25460100742360063999
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,783,462 XPM·at block #6,817,426 · 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