Block #253,869

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/10/2013, 9:43:51 AM · Difficulty 9.9726 · 6,570,898 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2fee99972c6d482325be18f668ba543ac51e469f75822cd37a0190e7d0988a31

Height

#253,869

Difficulty

9.972563

Transactions

14

Size

8.17 KB

Version

2

Bits

09f8f9e9

Nonce

25,153

Timestamp

11/10/2013, 9:43:51 AM

Confirmations

6,570,898

Merkle Root

bae394d6566a6f3e6d77e1990fd636c338c9a503fd9d6ee69097369063cad4f9
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.

2.236 × 10⁹⁴(95-digit number)
22369339062724095898…40769661055996104001
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
2.236 × 10⁹⁴(95-digit number)
22369339062724095898…40769661055996104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.473 × 10⁹⁴(95-digit number)
44738678125448191796…81539322111992208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.947 × 10⁹⁴(95-digit number)
89477356250896383593…63078644223984416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.789 × 10⁹⁵(96-digit number)
17895471250179276718…26157288447968832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.579 × 10⁹⁵(96-digit number)
35790942500358553437…52314576895937664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.158 × 10⁹⁵(96-digit number)
71581885000717106874…04629153791875328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.431 × 10⁹⁶(97-digit number)
14316377000143421374…09258307583750656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.863 × 10⁹⁶(97-digit number)
28632754000286842749…18516615167501312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.726 × 10⁹⁶(97-digit number)
57265508000573685499…37033230335002624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.145 × 10⁹⁷(98-digit number)
11453101600114737099…74066460670005248001
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,842,209 XPM·at block #6,824,766 · 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