Block #467,100

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 1:39:59 PM · Difficulty 10.4339 · 6,360,188 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21ad1bf4aef6e00fea7a7f5fdf72c339db569509527bdbb515c5622b8d5a4047

Height

#467,100

Difficulty

10.433855

Transactions

11

Size

2.41 KB

Version

2

Bits

0a6f1124

Nonce

158,599

Timestamp

3/30/2014, 1:39:59 PM

Confirmations

6,360,188

Merkle Root

ba101275bd0daa4d092526b96cebad4c9df8186c8f2df80472eeb94fd9e16411
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.936 × 10⁹⁵(96-digit number)
29361101944492425754…02554051269201787239
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.936 × 10⁹⁵(96-digit number)
29361101944492425754…02554051269201787239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.872 × 10⁹⁵(96-digit number)
58722203888984851509…05108102538403574479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.174 × 10⁹⁶(97-digit number)
11744440777796970301…10216205076807148959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.348 × 10⁹⁶(97-digit number)
23488881555593940603…20432410153614297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.697 × 10⁹⁶(97-digit number)
46977763111187881207…40864820307228595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.395 × 10⁹⁶(97-digit number)
93955526222375762414…81729640614457191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.879 × 10⁹⁷(98-digit number)
18791105244475152482…63459281228914383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.758 × 10⁹⁷(98-digit number)
37582210488950304965…26918562457828766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.516 × 10⁹⁷(98-digit number)
75164420977900609931…53837124915657533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.503 × 10⁹⁸(99-digit number)
15032884195580121986…07674249831315066879
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,862,413 XPM·at block #6,827,287 · 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