Block #298,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 9:19:24 AM · Difficulty 9.9919 · 6,518,627 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
486e1442487e88708c0b4f4033fed3e145f3aa5b93fa7249c5ca0a614b2fcfd4

Height

#298,502

Difficulty

9.991933

Transactions

2

Size

1.40 KB

Version

2

Bits

09fdef55

Nonce

5,173

Timestamp

12/7/2013, 9:19:24 AM

Confirmations

6,518,627

Merkle Root

edfb1d7dfa4abf76eec6c5d6c856a090c676f019ea16d91f91844c4e88acd884
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.

1.016 × 10⁹⁵(96-digit number)
10168299874237384606…71063954506291540881
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
1.016 × 10⁹⁵(96-digit number)
10168299874237384606…71063954506291540881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.033 × 10⁹⁵(96-digit number)
20336599748474769212…42127909012583081761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.067 × 10⁹⁵(96-digit number)
40673199496949538425…84255818025166163521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.134 × 10⁹⁵(96-digit number)
81346398993899076851…68511636050332327041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.626 × 10⁹⁶(97-digit number)
16269279798779815370…37023272100664654081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.253 × 10⁹⁶(97-digit number)
32538559597559630740…74046544201329308161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.507 × 10⁹⁶(97-digit number)
65077119195119261481…48093088402658616321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.301 × 10⁹⁷(98-digit number)
13015423839023852296…96186176805317232641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.603 × 10⁹⁷(98-digit number)
26030847678047704592…92372353610634465281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.206 × 10⁹⁷(98-digit number)
52061695356095409185…84744707221268930561
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,781,066 XPM·at block #6,817,128 · 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