Block #294,561

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2013, 10:49:01 PM · Difficulty 9.9911 · 6,532,766 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a272d10dba09991830ec5c2994997bdbb81f282e9093eed563ca7c163be98c4d

Height

#294,561

Difficulty

9.991075

Transactions

8

Size

2.30 KB

Version

2

Bits

09fdb719

Nonce

144,648

Timestamp

12/4/2013, 10:49:01 PM

Confirmations

6,532,766

Merkle Root

8c13e2de26fefe8850a7ac2dbaebc0f470e9c03c79ba4a690f06820cb1b48642
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.

9.807 × 10⁹²(93-digit number)
98079882248702122445…08812859768580692721
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
9.807 × 10⁹²(93-digit number)
98079882248702122445…08812859768580692721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.961 × 10⁹³(94-digit number)
19615976449740424489…17625719537161385441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.923 × 10⁹³(94-digit number)
39231952899480848978…35251439074322770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.846 × 10⁹³(94-digit number)
78463905798961697956…70502878148645541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.569 × 10⁹⁴(95-digit number)
15692781159792339591…41005756297291083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.138 × 10⁹⁴(95-digit number)
31385562319584679182…82011512594582167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.277 × 10⁹⁴(95-digit number)
62771124639169358365…64023025189164334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.255 × 10⁹⁵(96-digit number)
12554224927833871673…28046050378328668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.510 × 10⁹⁵(96-digit number)
25108449855667743346…56092100756657336321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.021 × 10⁹⁵(96-digit number)
50216899711335486692…12184201513314672641
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,862,729 XPM·at block #6,827,326 · 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