Block #466,867

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 10:30:28 AM · Difficulty 10.4293 · 6,347,257 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5ae697ab8d5bfa55cac39bd393aba079c04310b29ca42ebe95db93e10f1628c

Height

#466,867

Difficulty

10.429321

Transactions

5

Size

1.52 KB

Version

2

Bits

0a6de803

Nonce

3,027

Timestamp

3/30/2014, 10:30:28 AM

Confirmations

6,347,257

Merkle Root

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

3.413 × 10⁹⁸(99-digit number)
34137607345966903750…64808849894400744879
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
3.413 × 10⁹⁸(99-digit number)
34137607345966903750…64808849894400744879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.827 × 10⁹⁸(99-digit number)
68275214691933807501…29617699788801489759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.365 × 10⁹⁹(100-digit number)
13655042938386761500…59235399577602979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.731 × 10⁹⁹(100-digit number)
27310085876773523000…18470799155205959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.462 × 10⁹⁹(100-digit number)
54620171753547046000…36941598310411918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.092 × 10¹⁰⁰(101-digit number)
10924034350709409200…73883196620823836159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.184 × 10¹⁰⁰(101-digit number)
21848068701418818400…47766393241647672319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.369 × 10¹⁰⁰(101-digit number)
43696137402837636800…95532786483295344639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.739 × 10¹⁰⁰(101-digit number)
87392274805675273601…91065572966590689279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.747 × 10¹⁰¹(102-digit number)
17478454961135054720…82131145933181378559
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,757,076 XPM·at block #6,814,123 · 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