Block #466,991

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 12:16:16 PM · Difficulty 10.4311 · 6,358,722 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8c308fc4865fa7c7bc9bca2f709d83da721c334d3be8f15cfab50bfa330a4cc

Height

#466,991

Difficulty

10.431113

Transactions

8

Size

2.42 KB

Version

2

Bits

0a6e5d66

Nonce

257,202

Timestamp

3/30/2014, 12:16:16 PM

Confirmations

6,358,722

Merkle Root

943616ac1ac85c4301b88b77022d6973cbc6e1b648a251e2f93dae153dd4d5d7
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.

9.794 × 10⁹⁴(95-digit number)
97945472673152970915…91568164934184139999
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
9.794 × 10⁹⁴(95-digit number)
97945472673152970915…91568164934184139999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.958 × 10⁹⁵(96-digit number)
19589094534630594183…83136329868368279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.917 × 10⁹⁵(96-digit number)
39178189069261188366…66272659736736559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.835 × 10⁹⁵(96-digit number)
78356378138522376732…32545319473473119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.567 × 10⁹⁶(97-digit number)
15671275627704475346…65090638946946239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.134 × 10⁹⁶(97-digit number)
31342551255408950693…30181277893892479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.268 × 10⁹⁶(97-digit number)
62685102510817901386…60362555787784959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.253 × 10⁹⁷(98-digit number)
12537020502163580277…20725111575569919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.507 × 10⁹⁷(98-digit number)
25074041004327160554…41450223151139839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.014 × 10⁹⁷(98-digit number)
50148082008654321108…82900446302279679999
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,849,809 XPM·at block #6,825,712 · 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