Block #467,061

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 1:04:54 PM · Difficulty 10.4335 · 6,349,564 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83040a19f3944dd1cce06d18304267b520dcbc9ef9cd20d270ef82b0697fb2e1

Height

#467,061

Difficulty

10.433519

Transactions

11

Size

3.27 KB

Version

2

Bits

0a6efb18

Nonce

87,074

Timestamp

3/30/2014, 1:04:54 PM

Confirmations

6,349,564

Merkle Root

b0c497f56870099e826481a33e361afe128935af80bd4130bb86862e52d44d64
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.

8.451 × 10⁹⁶(97-digit number)
84514149471339815334…99169668730318030399
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
8.451 × 10⁹⁶(97-digit number)
84514149471339815334…99169668730318030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.690 × 10⁹⁷(98-digit number)
16902829894267963066…98339337460636060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.380 × 10⁹⁷(98-digit number)
33805659788535926133…96678674921272121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.761 × 10⁹⁷(98-digit number)
67611319577071852267…93357349842544243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.352 × 10⁹⁸(99-digit number)
13522263915414370453…86714699685088486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.704 × 10⁹⁸(99-digit number)
27044527830828740906…73429399370176972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.408 × 10⁹⁸(99-digit number)
54089055661657481813…46858798740353945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.081 × 10⁹⁹(100-digit number)
10817811132331496362…93717597480707891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.163 × 10⁹⁹(100-digit number)
21635622264662992725…87435194961415782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.327 × 10⁹⁹(100-digit number)
43271244529325985451…74870389922831564799
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,777,123 XPM·at block #6,816,624 · 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