Block #422,908

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 3:09:20 AM · Difficulty 10.3661 · 6,386,714 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
237e55fa101189b94b96ec48c82f9c1e6dc40e0218462679ad73653ca8b94a0c

Height

#422,908

Difficulty

10.366122

Transactions

1

Size

801 B

Version

2

Bits

0a5dba34

Nonce

68,890

Timestamp

2/28/2014, 3:09:20 AM

Confirmations

6,386,714

Merkle Root

8a41eba6e26d2f908bbbb1a9fb72bf1d97f47f524196420279e7d91f0476b13b
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.098 × 10⁹⁸(99-digit number)
40983328223781120948…49019330598841319681
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.098 × 10⁹⁸(99-digit number)
40983328223781120948…49019330598841319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.196 × 10⁹⁸(99-digit number)
81966656447562241897…98038661197682639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.639 × 10⁹⁹(100-digit number)
16393331289512448379…96077322395365278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.278 × 10⁹⁹(100-digit number)
32786662579024896759…92154644790730557441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.557 × 10⁹⁹(100-digit number)
65573325158049793518…84309289581461114881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.311 × 10¹⁰⁰(101-digit number)
13114665031609958703…68618579162922229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.622 × 10¹⁰⁰(101-digit number)
26229330063219917407…37237158325844459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.245 × 10¹⁰⁰(101-digit number)
52458660126439834814…74474316651688919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.049 × 10¹⁰¹(102-digit number)
10491732025287966962…48948633303377838081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.098 × 10¹⁰¹(102-digit number)
20983464050575933925…97897266606755676161
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,721,054 XPM·at block #6,809,621 · 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