Block #382,823

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 12:15:27 AM · Difficulty 10.3990 · 6,434,269 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f21789c56050ab3dfc88e8c436e4222e71b67348a94e958eda2acf07f951dccd

Height

#382,823

Difficulty

10.398956

Transactions

1

Size

973 B

Version

2

Bits

0a6621f9

Nonce

168,147

Timestamp

1/31/2014, 12:15:27 AM

Confirmations

6,434,269

Merkle Root

f5d4554fdfffad19ca9fe94ad2ceca59175860be2107eeda13935a3b3957ae83
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.871 × 10¹⁰⁴(105-digit number)
18714506051288931402…70629131361366999039
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.871 × 10¹⁰⁴(105-digit number)
18714506051288931402…70629131361366999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.742 × 10¹⁰⁴(105-digit number)
37429012102577862804…41258262722733998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.485 × 10¹⁰⁴(105-digit number)
74858024205155725609…82516525445467996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.497 × 10¹⁰⁵(106-digit number)
14971604841031145121…65033050890935992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.994 × 10¹⁰⁵(106-digit number)
29943209682062290243…30066101781871984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.988 × 10¹⁰⁵(106-digit number)
59886419364124580487…60132203563743969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.197 × 10¹⁰⁶(107-digit number)
11977283872824916097…20264407127487938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.395 × 10¹⁰⁶(107-digit number)
23954567745649832195…40528814254975877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.790 × 10¹⁰⁶(107-digit number)
47909135491299664390…81057628509951754239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.581 × 10¹⁰⁶(107-digit number)
95818270982599328780…62115257019903508479
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,780,773 XPM·at block #6,817,091 · 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