Block #291,657

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2013, 7:30:41 AM · Difficulty 9.9900 · 6,519,394 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecdb9dbd3791930d3604783c75eabc568fdae8751fab02965419ee01a6c6768e

Height

#291,657

Difficulty

9.989959

Transactions

1

Size

1.05 KB

Version

2

Bits

09fd6df3

Nonce

2,229

Timestamp

12/3/2013, 7:30:41 AM

Confirmations

6,519,394

Merkle Root

32b5a5aee95cdeaeda6507c322df48ecc150d7e5591351873f9be676d9d27164
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.430 × 10⁹⁵(96-digit number)
24304212089368302037…64440910919558086401
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.430 × 10⁹⁵(96-digit number)
24304212089368302037…64440910919558086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.860 × 10⁹⁵(96-digit number)
48608424178736604074…28881821839116172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.721 × 10⁹⁵(96-digit number)
97216848357473208148…57763643678232345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.944 × 10⁹⁶(97-digit number)
19443369671494641629…15527287356464691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.888 × 10⁹⁶(97-digit number)
38886739342989283259…31054574712929382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.777 × 10⁹⁶(97-digit number)
77773478685978566518…62109149425858764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.555 × 10⁹⁷(98-digit number)
15554695737195713303…24218298851717529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.110 × 10⁹⁷(98-digit number)
31109391474391426607…48436597703435059201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.221 × 10⁹⁷(98-digit number)
62218782948782853215…96873195406870118401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.244 × 10⁹⁸(99-digit number)
12443756589756570643…93746390813740236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.488 × 10⁹⁸(99-digit number)
24887513179513141286…87492781627480473601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,732,520 XPM·at block #6,811,050 · 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