Block #294,222

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2013, 6:28:48 PM · Difficulty 9.9909 · 6,532,904 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0da4aaea79a9d951f10d79f65c730ec63dec15fad547b5fd0cb36ccdfd3af34

Height

#294,222

Difficulty

9.990924

Transactions

1

Size

1.11 KB

Version

2

Bits

09fdad2b

Nonce

172,729

Timestamp

12/4/2013, 6:28:48 PM

Confirmations

6,532,904

Merkle Root

26bbcfdfaf11dc2523a4662fd036fac72a78df2c3911d422a2eca847aee0dd28
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.

3.969 × 10⁹⁴(95-digit number)
39698785659139434163…84069363457642414081
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
3.969 × 10⁹⁴(95-digit number)
39698785659139434163…84069363457642414081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.939 × 10⁹⁴(95-digit number)
79397571318278868326…68138726915284828161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.587 × 10⁹⁵(96-digit number)
15879514263655773665…36277453830569656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.175 × 10⁹⁵(96-digit number)
31759028527311547330…72554907661139312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.351 × 10⁹⁵(96-digit number)
63518057054623094661…45109815322278625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.270 × 10⁹⁶(97-digit number)
12703611410924618932…90219630644557250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.540 × 10⁹⁶(97-digit number)
25407222821849237864…80439261289114501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.081 × 10⁹⁶(97-digit number)
50814445643698475728…60878522578229002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.016 × 10⁹⁷(98-digit number)
10162889128739695145…21757045156458004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.032 × 10⁹⁷(98-digit number)
20325778257479390291…43514090312916008961
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,861,190 XPM·at block #6,827,125 · 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