Block #422,958

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/28/2014, 3:51:46 AM · Difficulty 10.3671 · 6,385,109 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c32e63b7e4b2a3a099b71e51988b90bdf0fd9a12eddf8c3ceeb6430cb6f4782

Height

#422,958

Difficulty

10.367109

Transactions

9

Size

1.97 KB

Version

2

Bits

0a5dfadd

Nonce

12,841

Timestamp

2/28/2014, 3:51:46 AM

Confirmations

6,385,109

Merkle Root

eee15118771e64acb3b3d431f2016b0d75edf810c4e2bf6a8e958a8441f578f8
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.

3.753 × 10⁹⁹(100-digit number)
37536878811483543015…13730337576837631999
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
3.753 × 10⁹⁹(100-digit number)
37536878811483543015…13730337576837631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.507 × 10⁹⁹(100-digit number)
75073757622967086030…27460675153675263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.501 × 10¹⁰⁰(101-digit number)
15014751524593417206…54921350307350527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.002 × 10¹⁰⁰(101-digit number)
30029503049186834412…09842700614701055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.005 × 10¹⁰⁰(101-digit number)
60059006098373668824…19685401229402111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.201 × 10¹⁰¹(102-digit number)
12011801219674733764…39370802458804223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.402 × 10¹⁰¹(102-digit number)
24023602439349467529…78741604917608447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.804 × 10¹⁰¹(102-digit number)
48047204878698935059…57483209835216895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.609 × 10¹⁰¹(102-digit number)
96094409757397870119…14966419670433791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.921 × 10¹⁰²(103-digit number)
19218881951479574023…29932839340867583999
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,708,581 XPM·at block #6,808,066 · 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