Block #294,830

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 2:34:25 AM · Difficulty 9.9912 · 6,514,600 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd660de589ad03b991101db6b3654f15e1c63ec160b4e0c1a92b46c6034f5b7f

Height

#294,830

Difficulty

9.991160

Transactions

18

Size

13.17 KB

Version

2

Bits

09fdbca5

Nonce

49,789

Timestamp

12/5/2013, 2:34:25 AM

Confirmations

6,514,600

Merkle Root

936948f575e20b183b2bf03da84a34b57cea036b41b3b75974f83a5c31806863
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.

8.609 × 10⁹²(93-digit number)
86093397507156893594…95559578192629317121
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
8.609 × 10⁹²(93-digit number)
86093397507156893594…95559578192629317121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.721 × 10⁹³(94-digit number)
17218679501431378718…91119156385258634241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.443 × 10⁹³(94-digit number)
34437359002862757437…82238312770517268481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.887 × 10⁹³(94-digit number)
68874718005725514875…64476625541034536961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.377 × 10⁹⁴(95-digit number)
13774943601145102975…28953251082069073921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.754 × 10⁹⁴(95-digit number)
27549887202290205950…57906502164138147841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.509 × 10⁹⁴(95-digit number)
55099774404580411900…15813004328276295681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.101 × 10⁹⁵(96-digit number)
11019954880916082380…31626008656552591361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.203 × 10⁹⁵(96-digit number)
22039909761832164760…63252017313105182721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.407 × 10⁹⁵(96-digit number)
44079819523664329520…26504034626210365441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.815 × 10⁹⁵(96-digit number)
88159639047328659040…53008069252420730881
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,719,510 XPM·at block #6,809,429 · 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