Block #362,980

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2014, 2:25:53 AM · Difficulty 10.4137 · 6,475,716 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee38909949f00a136deb2ff7ff02d0cb1b55d75e354e3bf828ea7fcab9c67c3f

Height

#362,980

Difficulty

10.413742

Transactions

7

Size

2.60 KB

Version

2

Bits

0a69eaf8

Nonce

100,432

Timestamp

1/17/2014, 2:25:53 AM

Confirmations

6,475,716

Merkle Root

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

2.893 × 10¹⁰¹(102-digit number)
28937060127186292483…69716463777044141439
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
2.893 × 10¹⁰¹(102-digit number)
28937060127186292483…69716463777044141439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.787 × 10¹⁰¹(102-digit number)
57874120254372584966…39432927554088282879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.157 × 10¹⁰²(103-digit number)
11574824050874516993…78865855108176565759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.314 × 10¹⁰²(103-digit number)
23149648101749033986…57731710216353131519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.629 × 10¹⁰²(103-digit number)
46299296203498067972…15463420432706263039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.259 × 10¹⁰²(103-digit number)
92598592406996135945…30926840865412526079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.851 × 10¹⁰³(104-digit number)
18519718481399227189…61853681730825052159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.703 × 10¹⁰³(104-digit number)
37039436962798454378…23707363461650104319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.407 × 10¹⁰³(104-digit number)
74078873925596908756…47414726923300208639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.481 × 10¹⁰⁴(105-digit number)
14815774785119381751…94829453846600417279
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,953,832 XPM·at block #6,838,695 · 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