Block #444,511

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 7:47:41 AM · Difficulty 10.3438 · 6,382,062 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3c59c7aa3e0488051724ed37c682ae745cae06e4cd7ad1d5610c30b2398b67c1

Height

#444,511

Difficulty

10.343838

Transactions

2

Size

1016 B

Version

2

Bits

0a5805be

Nonce

43,475

Timestamp

3/15/2014, 7:47:41 AM

Confirmations

6,382,062

Merkle Root

9f421016643aedca8948ac0cac6562f4c1b3d9e2886e0c4cb5dbe66d4c5a4185
Transactions (2)
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.

1.127 × 10⁹³(94-digit number)
11279376506574391360…79075667702879981999
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
1.127 × 10⁹³(94-digit number)
11279376506574391360…79075667702879981999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.255 × 10⁹³(94-digit number)
22558753013148782721…58151335405759963999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.511 × 10⁹³(94-digit number)
45117506026297565443…16302670811519927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.023 × 10⁹³(94-digit number)
90235012052595130887…32605341623039855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.804 × 10⁹⁴(95-digit number)
18047002410519026177…65210683246079711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.609 × 10⁹⁴(95-digit number)
36094004821038052355…30421366492159423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.218 × 10⁹⁴(95-digit number)
72188009642076104710…60842732984318847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.443 × 10⁹⁵(96-digit number)
14437601928415220942…21685465968637695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.887 × 10⁹⁵(96-digit number)
28875203856830441884…43370931937275391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.775 × 10⁹⁵(96-digit number)
57750407713660883768…86741863874550783999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,856,733 XPM·at block #6,826,572 · 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