Block #270,000

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/23/2013, 3:10:22 PM · Difficulty 9.9520 · 6,555,710 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0d2c2e68b2aadafa5579515eea7d6867c10dc03c3f55c9f75a81b1e4b104df4d

Height

#270,000

Difficulty

9.951950

Transactions

4

Size

6.71 KB

Version

2

Bits

09f3b303

Nonce

146,010

Timestamp

11/23/2013, 3:10:22 PM

Confirmations

6,555,710

Merkle Root

592f544c6d55038028c32d01fc3c362fcdd3bc8c58ae744c9a8e4e387567469a
Transactions (4)
1 in → 1 out10.1685 XPM109 B
12 in → 1 out1.4003 XPM1.78 KB
28 in → 1 out1.3500 XPM4.08 KB
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.098 × 10⁹⁰(91-digit number)
10985192347107264077…81005223368520239381
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.098 × 10⁹⁰(91-digit number)
10985192347107264077…81005223368520239381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.197 × 10⁹⁰(91-digit number)
21970384694214528154…62010446737040478761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.394 × 10⁹⁰(91-digit number)
43940769388429056309…24020893474080957521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.788 × 10⁹⁰(91-digit number)
87881538776858112618…48041786948161915041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.757 × 10⁹¹(92-digit number)
17576307755371622523…96083573896323830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.515 × 10⁹¹(92-digit number)
35152615510743245047…92167147792647660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.030 × 10⁹¹(92-digit number)
70305231021486490094…84334295585295320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.406 × 10⁹²(93-digit number)
14061046204297298018…68668591170590640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.812 × 10⁹²(93-digit number)
28122092408594596037…37337182341181281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.624 × 10⁹²(93-digit number)
56244184817189192075…74674364682362562561
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,849,784 XPM·at block #6,825,709 · 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.
Privacy Policy·

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