Block #382,878

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 1:22:15 AM · Difficulty 10.3976 · 6,427,237 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12be0ef6c5af64236d7bba077f786370b8477e0051b91e6cbd26c37be640ded2

Height

#382,878

Difficulty

10.397633

Transactions

11

Size

2.41 KB

Version

2

Bits

0a65cb44

Nonce

32,440

Timestamp

1/31/2014, 1:22:15 AM

Confirmations

6,427,237

Merkle Root

4955f2ae2acbe1b96c9d18e0a9e04b0e214c9af3f780371f7ea83dcc6c823433
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.

1.505 × 10¹⁰³(104-digit number)
15059614195503364013…73764683701032314879
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
1.505 × 10¹⁰³(104-digit number)
15059614195503364013…73764683701032314879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.011 × 10¹⁰³(104-digit number)
30119228391006728027…47529367402064629759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.023 × 10¹⁰³(104-digit number)
60238456782013456055…95058734804129259519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.204 × 10¹⁰⁴(105-digit number)
12047691356402691211…90117469608258519039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.409 × 10¹⁰⁴(105-digit number)
24095382712805382422…80234939216517038079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.819 × 10¹⁰⁴(105-digit number)
48190765425610764844…60469878433034076159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.638 × 10¹⁰⁴(105-digit number)
96381530851221529688…20939756866068152319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.927 × 10¹⁰⁵(106-digit number)
19276306170244305937…41879513732136304639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.855 × 10¹⁰⁵(106-digit number)
38552612340488611875…83759027464272609279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.710 × 10¹⁰⁵(106-digit number)
77105224680977223750…67518054928545218559
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,724,991 XPM·at block #6,810,114 · 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