Block #215,119

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/17/2013, 9:25:58 PM · Difficulty 9.9251 · 6,593,629 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
930822d56c84fb26414984714d4d4ca5c93c7e582ff85e6c9a2ad244ae7d85b6

Height

#215,119

Difficulty

9.925061

Transactions

3

Size

1.50 KB

Version

2

Bits

09ecd0d2

Nonce

137,483

Timestamp

10/17/2013, 9:25:58 PM

Confirmations

6,593,629

Merkle Root

397ca35bfc826e0ddf9ed7f46f0879b2df268ee791a9654f313de48d91925c4f
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.

3.054 × 10⁹³(94-digit number)
30548470055910798592…06387143222558440941
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.054 × 10⁹³(94-digit number)
30548470055910798592…06387143222558440941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.109 × 10⁹³(94-digit number)
61096940111821597184…12774286445116881881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.221 × 10⁹⁴(95-digit number)
12219388022364319436…25548572890233763761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.443 × 10⁹⁴(95-digit number)
24438776044728638873…51097145780467527521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.887 × 10⁹⁴(95-digit number)
48877552089457277747…02194291560935055041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.775 × 10⁹⁴(95-digit number)
97755104178914555495…04388583121870110081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.955 × 10⁹⁵(96-digit number)
19551020835782911099…08777166243740220161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.910 × 10⁹⁵(96-digit number)
39102041671565822198…17554332487480440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.820 × 10⁹⁵(96-digit number)
78204083343131644396…35108664974960880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.564 × 10⁹⁶(97-digit number)
15640816668626328879…70217329949921761281
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,032 XPM·at block #6,808,747 · 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