Block #302,066

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2013, 2:39:15 PM · Difficulty 9.9926 · 6,524,775 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54eb021dd10916434e29d95b5360da23ea3b86756a274abf27e71b876dc720b5

Height

#302,066

Difficulty

9.992610

Transactions

6

Size

16.44 KB

Version

2

Bits

09fe1bad

Nonce

136,918

Timestamp

12/9/2013, 2:39:15 PM

Confirmations

6,524,775

Merkle Root

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

4.984 × 10⁹⁴(95-digit number)
49841491338745466626…44364517913538476159
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
4.984 × 10⁹⁴(95-digit number)
49841491338745466626…44364517913538476159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.968 × 10⁹⁴(95-digit number)
99682982677490933252…88729035827076952319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.993 × 10⁹⁵(96-digit number)
19936596535498186650…77458071654153904639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.987 × 10⁹⁵(96-digit number)
39873193070996373300…54916143308307809279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.974 × 10⁹⁵(96-digit number)
79746386141992746601…09832286616615618559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.594 × 10⁹⁶(97-digit number)
15949277228398549320…19664573233231237119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.189 × 10⁹⁶(97-digit number)
31898554456797098640…39329146466462474239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.379 × 10⁹⁶(97-digit number)
63797108913594197281…78658292932924948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.275 × 10⁹⁷(98-digit number)
12759421782718839456…57316585865849896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.551 × 10⁹⁷(98-digit number)
25518843565437678912…14633171731699793919
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,858,893 XPM·at block #6,826,840 · 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