Block #459,161

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2014, 3:09:31 AM · Difficulty 10.4172 · 6,365,636 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a3d88f8b9976edc3fa9908dfcf849976b6e1f9936f86eb057b071570dad85579

Height

#459,161

Difficulty

10.417200

Transactions

7

Size

1.66 KB

Version

2

Bits

0a6acd99

Nonce

107,251

Timestamp

3/25/2014, 3:09:31 AM

Confirmations

6,365,636

Merkle Root

9bb0d82cd0d6335e04529906085dcc1c1c622dc4ee032f2e9f4f7ca6e8880353
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.

4.282 × 10⁹⁶(97-digit number)
42822295037817462749…35184265741023909549
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
4.282 × 10⁹⁶(97-digit number)
42822295037817462749…35184265741023909549
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.564 × 10⁹⁶(97-digit number)
85644590075634925498…70368531482047819099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.712 × 10⁹⁷(98-digit number)
17128918015126985099…40737062964095638199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.425 × 10⁹⁷(98-digit number)
34257836030253970199…81474125928191276399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.851 × 10⁹⁷(98-digit number)
68515672060507940398…62948251856382552799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.370 × 10⁹⁸(99-digit number)
13703134412101588079…25896503712765105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.740 × 10⁹⁸(99-digit number)
27406268824203176159…51793007425530211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.481 × 10⁹⁸(99-digit number)
54812537648406352318…03586014851060422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.096 × 10⁹⁹(100-digit number)
10962507529681270463…07172029702120844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.192 × 10⁹⁹(100-digit number)
21925015059362540927…14344059404241689599
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,842,452 XPM·at block #6,824,796 · 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