Block #290,076

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 12:36:09 PM · Difficulty 9.9890 · 6,527,399 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d6631119dff4c79145801ed0633a10bc27e8f31d54c22971d4d839c873fdb3a5

Height

#290,076

Difficulty

9.988971

Transactions

4

Size

2.06 KB

Version

2

Bits

09fd2d2d

Nonce

81,927

Timestamp

12/2/2013, 12:36:09 PM

Confirmations

6,527,399

Merkle Root

030e48144f90680fe0328977a56c24895b8adf9a660bf76ee3f2765384d81238
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.093 × 10⁹³(94-digit number)
10932203186305286501…26919495666290956801
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.093 × 10⁹³(94-digit number)
10932203186305286501…26919495666290956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.186 × 10⁹³(94-digit number)
21864406372610573003…53838991332581913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.372 × 10⁹³(94-digit number)
43728812745221146006…07677982665163827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.745 × 10⁹³(94-digit number)
87457625490442292012…15355965330327654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.749 × 10⁹⁴(95-digit number)
17491525098088458402…30711930660655308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.498 × 10⁹⁴(95-digit number)
34983050196176916804…61423861321310617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.996 × 10⁹⁴(95-digit number)
69966100392353833609…22847722642621235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.399 × 10⁹⁵(96-digit number)
13993220078470766721…45695445285242470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.798 × 10⁹⁵(96-digit number)
27986440156941533443…91390890570484940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.597 × 10⁹⁵(96-digit number)
55972880313883066887…82781781140969881601
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,783,852 XPM·at block #6,817,474 · 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