Block #444,066

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/15/2014, 12:22:31 AM · Difficulty 10.3436 · 6,364,109 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b95dee9c0313c67f763d1c3a869530aa34b3e247507b184bef8f1f59c9898ba3

Height

#444,066

Difficulty

10.343551

Transactions

3

Size

1.08 KB

Version

2

Bits

0a57f2ef

Nonce

2,118

Timestamp

3/15/2014, 12:22:31 AM

Confirmations

6,364,109

Merkle Root

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

7.594 × 10⁹⁷(98-digit number)
75943763365298281448…72054833553012105841
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
7.594 × 10⁹⁷(98-digit number)
75943763365298281448…72054833553012105841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.518 × 10⁹⁸(99-digit number)
15188752673059656289…44109667106024211681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.037 × 10⁹⁸(99-digit number)
30377505346119312579…88219334212048423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.075 × 10⁹⁸(99-digit number)
60755010692238625159…76438668424096846721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.215 × 10⁹⁹(100-digit number)
12151002138447725031…52877336848193693441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.430 × 10⁹⁹(100-digit number)
24302004276895450063…05754673696387386881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.860 × 10⁹⁹(100-digit number)
48604008553790900127…11509347392774773761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.720 × 10⁹⁹(100-digit number)
97208017107581800254…23018694785549547521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.944 × 10¹⁰⁰(101-digit number)
19441603421516360050…46037389571099095041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.888 × 10¹⁰⁰(101-digit number)
38883206843032720101…92074779142198190081
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,709,448 XPM·at block #6,808,174 · 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