Block #429,289

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2014, 4:33:54 PM · Difficulty 10.3474 · 6,381,142 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f242d2cd86074416aaa233011b06a66c0a36534e0a770aee2cbd1aa29b878fee

Height

#429,289

Difficulty

10.347386

Transactions

4

Size

889 B

Version

2

Bits

0a58ee4b

Nonce

2,681

Timestamp

3/4/2014, 4:33:54 PM

Confirmations

6,381,142

Merkle Root

461a614c31d6d4d0cab81d6a3d1ec9eb468736176f577e047dad6a4c3003804a
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.179 × 10¹⁰⁴(105-digit number)
11796508591468810959…08983584380058337279
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.179 × 10¹⁰⁴(105-digit number)
11796508591468810959…08983584380058337279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.359 × 10¹⁰⁴(105-digit number)
23593017182937621919…17967168760116674559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.718 × 10¹⁰⁴(105-digit number)
47186034365875243838…35934337520233349119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.437 × 10¹⁰⁴(105-digit number)
94372068731750487677…71868675040466698239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.887 × 10¹⁰⁵(106-digit number)
18874413746350097535…43737350080933396479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.774 × 10¹⁰⁵(106-digit number)
37748827492700195071…87474700161866792959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.549 × 10¹⁰⁵(106-digit number)
75497654985400390142…74949400323733585919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.509 × 10¹⁰⁶(107-digit number)
15099530997080078028…49898800647467171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.019 × 10¹⁰⁶(107-digit number)
30199061994160156056…99797601294934343679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.039 × 10¹⁰⁶(107-digit number)
60398123988320312113…99595202589868687359
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,727,531 XPM·at block #6,810,430 · 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