Block #424,866

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/1/2014, 12:13:00 PM · Difficulty 10.3640 · 6,392,057 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aadd68e693c3859a0d1eb1aea0d21d16d741820e9767853ae1abc6266a10a1a7

Height

#424,866

Difficulty

10.363982

Transactions

2

Size

2.29 KB

Version

2

Bits

0a5d2df1

Nonce

52,896

Timestamp

3/1/2014, 12:13:00 PM

Confirmations

6,392,057

Merkle Root

4c2419827d291ff13ba21fb36636b2d87211ce7401637f4af37c25eb5aa1029b
Transactions (2)
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.

1.932 × 10⁹⁸(99-digit number)
19327836699480521809…96921358799820503679
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
1.932 × 10⁹⁸(99-digit number)
19327836699480521809…96921358799820503679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.865 × 10⁹⁸(99-digit number)
38655673398961043619…93842717599641007359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.731 × 10⁹⁸(99-digit number)
77311346797922087239…87685435199282014719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.546 × 10⁹⁹(100-digit number)
15462269359584417447…75370870398564029439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.092 × 10⁹⁹(100-digit number)
30924538719168834895…50741740797128058879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.184 × 10⁹⁹(100-digit number)
61849077438337669791…01483481594256117759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.236 × 10¹⁰⁰(101-digit number)
12369815487667533958…02966963188512235519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.473 × 10¹⁰⁰(101-digit number)
24739630975335067916…05933926377024471039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.947 × 10¹⁰⁰(101-digit number)
49479261950670135833…11867852754048942079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.895 × 10¹⁰⁰(101-digit number)
98958523901340271666…23735705508097884159
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,779,425 XPM·at block #6,816,922 · 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