Block #293,909

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2013, 2:10:34 PM · Difficulty 9.9908 · 6,521,015 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8874d81162f2296ae9a4cd0d245ab5c97ad28277e271f7f0965762a97b71c006

Height

#293,909

Difficulty

9.990812

Transactions

14

Size

3.50 KB

Version

2

Bits

09fda5d6

Nonce

46,192

Timestamp

12/4/2013, 2:10:34 PM

Confirmations

6,521,015

Merkle Root

d055de0a53eb6f048fd46601a8fd1d417faab4716bd87aa24e7e97c1ba3a094f
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.914 × 10⁹⁵(96-digit number)
99148515033016882721…10821961057222080001
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.914 × 10⁹⁵(96-digit number)
99148515033016882721…10821961057222080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.982 × 10⁹⁶(97-digit number)
19829703006603376544…21643922114444160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.965 × 10⁹⁶(97-digit number)
39659406013206753088…43287844228888320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.931 × 10⁹⁶(97-digit number)
79318812026413506176…86575688457776640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.586 × 10⁹⁷(98-digit number)
15863762405282701235…73151376915553280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.172 × 10⁹⁷(98-digit number)
31727524810565402470…46302753831106560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.345 × 10⁹⁷(98-digit number)
63455049621130804941…92605507662213120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.269 × 10⁹⁸(99-digit number)
12691009924226160988…85211015324426240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.538 × 10⁹⁸(99-digit number)
25382019848452321976…70422030648852480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.076 × 10⁹⁸(99-digit number)
50764039696904643953…40844061297704960001
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,763,486 XPM·at block #6,814,923 · 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