Block #298,630

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 11:12:59 AM · Difficulty 9.9920 · 6,512,516 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8446547679c8c55e59dd47c057594028648c334ed658d30844fcc1b4a874cb91

Height

#298,630

Difficulty

9.991975

Transactions

1

Size

1.05 KB

Version

2

Bits

09fdf21a

Nonce

368,875

Timestamp

12/7/2013, 11:12:59 AM

Confirmations

6,512,516

Merkle Root

4962a4a35edbd7c3e2de6e39d247de4ec42e58f1e9c824cdbf60b4cbaca9c3ac
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.

4.778 × 10⁹³(94-digit number)
47786877301796174826…91170729283632061721
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
4.778 × 10⁹³(94-digit number)
47786877301796174826…91170729283632061721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.557 × 10⁹³(94-digit number)
95573754603592349652…82341458567264123441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.911 × 10⁹⁴(95-digit number)
19114750920718469930…64682917134528246881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.822 × 10⁹⁴(95-digit number)
38229501841436939861…29365834269056493761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.645 × 10⁹⁴(95-digit number)
76459003682873879722…58731668538112987521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.529 × 10⁹⁵(96-digit number)
15291800736574775944…17463337076225975041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.058 × 10⁹⁵(96-digit number)
30583601473149551888…34926674152451950081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.116 × 10⁹⁵(96-digit number)
61167202946299103777…69853348304903900161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.223 × 10⁹⁶(97-digit number)
12233440589259820755…39706696609807800321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.446 × 10⁹⁶(97-digit number)
24466881178519641511…79413393219615600641
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,733,278 XPM·at block #6,811,145 · 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