Block #382,804

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 11:49:59 PM · Difficulty 10.3998 · 6,424,659 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
32bb3c521a2c52e64e1cf285c380df7c34b1b4d1961183e2385c0eaaf2c0b86d

Height

#382,804

Difficulty

10.399752

Transactions

8

Size

1.75 KB

Version

2

Bits

0a665623

Nonce

663

Timestamp

1/30/2014, 11:49:59 PM

Confirmations

6,424,659

Merkle Root

fce0d5c46d0ca59c4cf4119a7f2b4e24b240d75856c1b825d7a33c1843ac3bc1
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.309 × 10⁹⁸(99-digit number)
23094435191562660434…58248016081694975999
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.309 × 10⁹⁸(99-digit number)
23094435191562660434…58248016081694975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.618 × 10⁹⁸(99-digit number)
46188870383125320869…16496032163389951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.237 × 10⁹⁸(99-digit number)
92377740766250641739…32992064326779903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.847 × 10⁹⁹(100-digit number)
18475548153250128347…65984128653559807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.695 × 10⁹⁹(100-digit number)
36951096306500256695…31968257307119615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.390 × 10⁹⁹(100-digit number)
73902192613000513391…63936514614239231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.478 × 10¹⁰⁰(101-digit number)
14780438522600102678…27873029228478463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.956 × 10¹⁰⁰(101-digit number)
29560877045200205356…55746058456956927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.912 × 10¹⁰⁰(101-digit number)
59121754090400410713…11492116913913855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.182 × 10¹⁰¹(102-digit number)
11824350818080082142…22984233827827711999
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,703,728 XPM·at block #6,807,462 · 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.

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