Block #215,614

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/18/2013, 5:09:19 AM · Difficulty 9.9255 · 6,593,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
15b1756969c642a96550c85cbba32bb0d21a5da4380300da6ed23ed75ee6065f

Height

#215,614

Difficulty

9.925471

Transactions

3

Size

917 B

Version

2

Bits

09ecebad

Nonce

28,125

Timestamp

10/18/2013, 5:09:19 AM

Confirmations

6,593,206

Merkle Root

5319b469038ffd22bf1e92a77a8545c42ee4373c758e0feac9c8ac1f2da32183
Transactions (3)
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.

6.384 × 10⁹⁸(99-digit number)
63844676464295970536…95125356611737383681
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
6.384 × 10⁹⁸(99-digit number)
63844676464295970536…95125356611737383681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.276 × 10⁹⁹(100-digit number)
12768935292859194107…90250713223474767361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.553 × 10⁹⁹(100-digit number)
25537870585718388214…80501426446949534721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.107 × 10⁹⁹(100-digit number)
51075741171436776429…61002852893899069441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.021 × 10¹⁰⁰(101-digit number)
10215148234287355285…22005705787798138881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.043 × 10¹⁰⁰(101-digit number)
20430296468574710571…44011411575596277761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.086 × 10¹⁰⁰(101-digit number)
40860592937149421143…88022823151192555521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.172 × 10¹⁰⁰(101-digit number)
81721185874298842286…76045646302385111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.634 × 10¹⁰¹(102-digit number)
16344237174859768457…52091292604770222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.268 × 10¹⁰¹(102-digit number)
32688474349719536914…04182585209540444161
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,714,617 XPM·at block #6,808,819 · 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