Block #285,370

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/30/2013, 11:35:02 AM · Difficulty 9.9842 · 6,527,511 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ac225c08c2b8c592618da4e2ceef7c35e79c3d8685576ddd2801420aaa09e53

Height

#285,370

Difficulty

9.984162

Transactions

2

Size

789 B

Version

2

Bits

09fbf207

Nonce

13,356

Timestamp

11/30/2013, 11:35:02 AM

Confirmations

6,527,511

Merkle Root

44dd85b435ab1b381ddacd21e912c891e8ed05ab70fb4765646aef4aed6375c5
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.

7.888 × 10⁹³(94-digit number)
78887948193739218733…47775202933749393001
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
7.888 × 10⁹³(94-digit number)
78887948193739218733…47775202933749393001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.577 × 10⁹⁴(95-digit number)
15777589638747843746…95550405867498786001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.155 × 10⁹⁴(95-digit number)
31555179277495687493…91100811734997572001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.311 × 10⁹⁴(95-digit number)
63110358554991374986…82201623469995144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.262 × 10⁹⁵(96-digit number)
12622071710998274997…64403246939990288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.524 × 10⁹⁵(96-digit number)
25244143421996549994…28806493879980576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.048 × 10⁹⁵(96-digit number)
50488286843993099989…57612987759961152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.009 × 10⁹⁶(97-digit number)
10097657368798619997…15225975519922304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.019 × 10⁹⁶(97-digit number)
20195314737597239995…30451951039844608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.039 × 10⁹⁶(97-digit number)
40390629475194479991…60903902079689216001
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,747,079 XPM·at block #6,812,880 · 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