Block #427,369

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 8:14:28 AM · Difficulty 10.3472 · 6,388,567 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e4b2306372aecdda924c38ba69dc95fb3cde1fe05a7bd7ba5c13fa8f1fb21cc

Height

#427,369

Difficulty

10.347212

Transactions

5

Size

59.78 KB

Version

2

Bits

0a58e2e0

Nonce

542,180

Timestamp

3/3/2014, 8:14:28 AM

Confirmations

6,388,567

Merkle Root

32e786baea6b0a70863b11f36b609107fff33332f600eea9fd4c93a9b474df7e
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.985 × 10¹⁰²(103-digit number)
49855157446100999668…82389205728142880961
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.985 × 10¹⁰²(103-digit number)
49855157446100999668…82389205728142880961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.971 × 10¹⁰²(103-digit number)
99710314892201999336…64778411456285761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.994 × 10¹⁰³(104-digit number)
19942062978440399867…29556822912571523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.988 × 10¹⁰³(104-digit number)
39884125956880799734…59113645825143047681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.976 × 10¹⁰³(104-digit number)
79768251913761599469…18227291650286095361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.595 × 10¹⁰⁴(105-digit number)
15953650382752319893…36454583300572190721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.190 × 10¹⁰⁴(105-digit number)
31907300765504639787…72909166601144381441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.381 × 10¹⁰⁴(105-digit number)
63814601531009279575…45818333202288762881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.276 × 10¹⁰⁵(106-digit number)
12762920306201855915…91636666404577525761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.552 × 10¹⁰⁵(106-digit number)
25525840612403711830…83273332809155051521
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,771,601 XPM·at block #6,815,935 · 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