Block #449,681

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/18/2014, 6:16:05 PM · Difficulty 10.3736 · 6,367,973 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7cafb64bb76c0bcdc6bac2405745a5618c314d74c650d2c628b47574e08bb229

Height

#449,681

Difficulty

10.373633

Transactions

9

Size

2.81 KB

Version

2

Bits

0a5fa66c

Nonce

130,635

Timestamp

3/18/2014, 6:16:05 PM

Confirmations

6,367,973

Merkle Root

5a09714c8d6733fb41f6b09486c727685dd695cfa08fe24bb667aec631847fe7
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.639 × 10⁹⁶(97-digit number)
46393344894788179074…12632716208701116001
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.639 × 10⁹⁶(97-digit number)
46393344894788179074…12632716208701116001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.278 × 10⁹⁶(97-digit number)
92786689789576358149…25265432417402232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.855 × 10⁹⁷(98-digit number)
18557337957915271629…50530864834804464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.711 × 10⁹⁷(98-digit number)
37114675915830543259…01061729669608928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.422 × 10⁹⁷(98-digit number)
74229351831661086519…02123459339217856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.484 × 10⁹⁸(99-digit number)
14845870366332217303…04246918678435712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.969 × 10⁹⁸(99-digit number)
29691740732664434607…08493837356871424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.938 × 10⁹⁸(99-digit number)
59383481465328869215…16987674713742848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.187 × 10⁹⁹(100-digit number)
11876696293065773843…33975349427485696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.375 × 10⁹⁹(100-digit number)
23753392586131547686…67950698854971392001
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,785,285 XPM·at block #6,817,653 · 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