Block #302,151

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2013, 3:48:45 PM · Difficulty 9.9926 · 6,523,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62a150af03116202c68f635e05b45f6cb4ad0664719b7575422cc67f7ed97c35

Height

#302,151

Difficulty

9.992631

Transactions

2

Size

838 B

Version

2

Bits

09fe1d12

Nonce

53,448

Timestamp

12/9/2013, 3:48:45 PM

Confirmations

6,523,190

Merkle Root

6d670672d5f88df673f992fdea557779837c67e7f2516a5525e898e2e8155590
Transactions (2)
1 in → 1 out10.0100 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.

4.838 × 10⁹⁶(97-digit number)
48383992974125334207…75630313985479981119
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.838 × 10⁹⁶(97-digit number)
48383992974125334207…75630313985479981119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.676 × 10⁹⁶(97-digit number)
96767985948250668415…51260627970959962239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.935 × 10⁹⁷(98-digit number)
19353597189650133683…02521255941919924479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.870 × 10⁹⁷(98-digit number)
38707194379300267366…05042511883839848959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.741 × 10⁹⁷(98-digit number)
77414388758600534732…10085023767679697919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.548 × 10⁹⁸(99-digit number)
15482877751720106946…20170047535359395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.096 × 10⁹⁸(99-digit number)
30965755503440213892…40340095070718791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.193 × 10⁹⁸(99-digit number)
61931511006880427785…80680190141437583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.238 × 10⁹⁹(100-digit number)
12386302201376085557…61360380282875166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.477 × 10⁹⁹(100-digit number)
24772604402752171114…22720760565750333439
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,846,833 XPM·at block #6,825,340 · 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