Block #449,267

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/18/2014, 11:44:46 AM · Difficulty 10.3713 · 6,375,384 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
efa0fd7312f2b6c3d1852c1966b77493f59fa8d5acef489ca90913218ad48e58

Height

#449,267

Difficulty

10.371286

Transactions

3

Size

20.70 KB

Version

2

Bits

0a5f0ca0

Nonce

46,653

Timestamp

3/18/2014, 11:44:46 AM

Confirmations

6,375,384

Merkle Root

8911d9549bb8f04ea34a55943b428736c2416ac42f5fbc919a896a6d73855522
Transactions (3)
1 in → 1 out9.5000 XPM110 B
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.

2.478 × 10⁹⁹(100-digit number)
24787580774790728877…67824237155825927601
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
2.478 × 10⁹⁹(100-digit number)
24787580774790728877…67824237155825927601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.957 × 10⁹⁹(100-digit number)
49575161549581457754…35648474311651855201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.915 × 10⁹⁹(100-digit number)
99150323099162915508…71296948623303710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.983 × 10¹⁰⁰(101-digit number)
19830064619832583101…42593897246607420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.966 × 10¹⁰⁰(101-digit number)
39660129239665166203…85187794493214841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.932 × 10¹⁰⁰(101-digit number)
79320258479330332406…70375588986429683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.586 × 10¹⁰¹(102-digit number)
15864051695866066481…40751177972859366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.172 × 10¹⁰¹(102-digit number)
31728103391732132962…81502355945718732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.345 × 10¹⁰¹(102-digit number)
63456206783464265925…63004711891437465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.269 × 10¹⁰²(103-digit number)
12691241356692853185…26009423782874931201
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,841,273 XPM·at block #6,824,650 · 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