Block #464,450

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/28/2014, 7:08:04 PM · Difficulty 10.4220 · 6,342,390 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3fd27b775d658466cb3ab8dc1d19e66a8d00ccf12643cd3fc2ce79e07bafebca

Height

#464,450

Difficulty

10.422008

Transactions

2

Size

1.59 KB

Version

2

Bits

0a6c08b1

Nonce

184,875

Timestamp

3/28/2014, 7:08:04 PM

Confirmations

6,342,390

Merkle Root

bf1c65018cd83c13a1c66811da3a215ec25cfd439b2792392fb7e9c61abe2503
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.011 × 10⁹⁷(98-digit number)
80119327269716214057…89165503033695027039
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.011 × 10⁹⁷(98-digit number)
80119327269716214057…89165503033695027039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.602 × 10⁹⁸(99-digit number)
16023865453943242811…78331006067390054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.204 × 10⁹⁸(99-digit number)
32047730907886485622…56662012134780108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.409 × 10⁹⁸(99-digit number)
64095461815772971245…13324024269560216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.281 × 10⁹⁹(100-digit number)
12819092363154594249…26648048539120432639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.563 × 10⁹⁹(100-digit number)
25638184726309188498…53296097078240865279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.127 × 10⁹⁹(100-digit number)
51276369452618376996…06592194156481730559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.025 × 10¹⁰⁰(101-digit number)
10255273890523675399…13184388312963461119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.051 × 10¹⁰⁰(101-digit number)
20510547781047350798…26368776625926922239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.102 × 10¹⁰⁰(101-digit number)
41021095562094701597…52737553251853844479
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,698,823 XPM·at block #6,806,839 · 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.

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