Block #424,677

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/1/2014, 9:17:09 AM · Difficulty 10.3620 · 6,402,507 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0bfc002408cb64d9159c014b045ac446fecaf98df5b72d2405d67303f4a69de3

Height

#424,677

Difficulty

10.361985

Transactions

3

Size

1.07 KB

Version

2

Bits

0a5cab12

Nonce

54,218

Timestamp

3/1/2014, 9:17:09 AM

Confirmations

6,402,507

Merkle Root

09c2683cebdf0444dd56a067988bb3a21d004b09842d042f3386f47ef46d89a7
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.333 × 10⁹⁸(99-digit number)
13337926915808623544…25179955291025874799
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.333 × 10⁹⁸(99-digit number)
13337926915808623544…25179955291025874799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.667 × 10⁹⁸(99-digit number)
26675853831617247089…50359910582051749599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.335 × 10⁹⁸(99-digit number)
53351707663234494178…00719821164103499199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.067 × 10⁹⁹(100-digit number)
10670341532646898835…01439642328206998399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.134 × 10⁹⁹(100-digit number)
21340683065293797671…02879284656413996799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.268 × 10⁹⁹(100-digit number)
42681366130587595343…05758569312827993599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.536 × 10⁹⁹(100-digit number)
85362732261175190686…11517138625655987199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.707 × 10¹⁰⁰(101-digit number)
17072546452235038137…23034277251311974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.414 × 10¹⁰⁰(101-digit number)
34145092904470076274…46068554502623948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.829 × 10¹⁰⁰(101-digit number)
68290185808940152548…92137109005247897599
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,861,568 XPM·at block #6,827,183 · 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