Block #422,585

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 8:51:48 PM · Difficulty 10.3729 · 6,385,329 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
87bc2e2071ad3e5d35136da963733a5b6d474645a93a397989f710fc87254784

Height

#422,585

Difficulty

10.372887

Transactions

2

Size

846 B

Version

2

Bits

0a5f7580

Nonce

161,494

Timestamp

2/27/2014, 8:51:48 PM

Confirmations

6,385,329

Merkle Root

5e3664bed1374bcd56b8c7083284cf45b5f2867e696cdbb9b9ee2f6d92e96f6c
Transactions (2)
1 in → 1 out9.2975 XPM116 B
4 in → 1 out12.3600 XPM638 B
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.876 × 10¹⁰⁰(101-digit number)
18763018571073382914…78261556501394785281
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.876 × 10¹⁰⁰(101-digit number)
18763018571073382914…78261556501394785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.752 × 10¹⁰⁰(101-digit number)
37526037142146765828…56523113002789570561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.505 × 10¹⁰⁰(101-digit number)
75052074284293531657…13046226005579141121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.501 × 10¹⁰¹(102-digit number)
15010414856858706331…26092452011158282241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.002 × 10¹⁰¹(102-digit number)
30020829713717412663…52184904022316564481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.004 × 10¹⁰¹(102-digit number)
60041659427434825326…04369808044633128961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.200 × 10¹⁰²(103-digit number)
12008331885486965065…08739616089266257921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.401 × 10¹⁰²(103-digit number)
24016663770973930130…17479232178532515841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.803 × 10¹⁰²(103-digit number)
48033327541947860260…34958464357065031681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.606 × 10¹⁰²(103-digit number)
96066655083895720521…69916928714130063361
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,707,347 XPM·at block #6,807,913 · 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