Block #271,021

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/24/2013, 8:57:40 AM · Difficulty 9.9515 · 6,553,551 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee8c890f73abaa5e367b516d8e9dae0716babc414a2db5536da6901abfbc7b75

Height

#271,021

Difficulty

9.951547

Transactions

5

Size

1.54 KB

Version

2

Bits

09f3989d

Nonce

20,022

Timestamp

11/24/2013, 8:57:40 AM

Confirmations

6,553,551

Merkle Root

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

5.663 × 10¹⁰⁴(105-digit number)
56639102076989766173…11206874395131368961
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
5.663 × 10¹⁰⁴(105-digit number)
56639102076989766173…11206874395131368961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.132 × 10¹⁰⁵(106-digit number)
11327820415397953234…22413748790262737921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.265 × 10¹⁰⁵(106-digit number)
22655640830795906469…44827497580525475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.531 × 10¹⁰⁵(106-digit number)
45311281661591812938…89654995161050951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.062 × 10¹⁰⁵(106-digit number)
90622563323183625876…79309990322101903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.812 × 10¹⁰⁶(107-digit number)
18124512664636725175…58619980644203806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.624 × 10¹⁰⁶(107-digit number)
36249025329273450350…17239961288407613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.249 × 10¹⁰⁶(107-digit number)
72498050658546900701…34479922576815226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.449 × 10¹⁰⁷(108-digit number)
14499610131709380140…68959845153630453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.899 × 10¹⁰⁷(108-digit number)
28999220263418760280…37919690307260907521
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,840,642 XPM·at block #6,824,571 · 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