Block #444,047

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/14/2014, 11:58:12 PM · Difficulty 10.3443 · 6,383,295 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a5fe42f347441086229cd51321ecd08a7423f599d04bd043354728a8c221c920

Height

#444,047

Difficulty

10.344260

Transactions

9

Size

2.43 KB

Version

2

Bits

0a58216b

Nonce

4,245

Timestamp

3/14/2014, 11:58:12 PM

Confirmations

6,383,295

Merkle Root

26bf26f179050ca7f48c65e0e030dc787783aaec85ad8fda966a02a50a91c29f
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.

3.289 × 10⁹⁹(100-digit number)
32898855626594437766…18256533146443135999
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
3.289 × 10⁹⁹(100-digit number)
32898855626594437766…18256533146443135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.579 × 10⁹⁹(100-digit number)
65797711253188875533…36513066292886271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.315 × 10¹⁰⁰(101-digit number)
13159542250637775106…73026132585772543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.631 × 10¹⁰⁰(101-digit number)
26319084501275550213…46052265171545087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.263 × 10¹⁰⁰(101-digit number)
52638169002551100426…92104530343090175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.052 × 10¹⁰¹(102-digit number)
10527633800510220085…84209060686180351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.105 × 10¹⁰¹(102-digit number)
21055267601020440170…68418121372360703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.211 × 10¹⁰¹(102-digit number)
42110535202040880341…36836242744721407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.422 × 10¹⁰¹(102-digit number)
84221070404081760683…73672485489442815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.684 × 10¹⁰²(103-digit number)
16844214080816352136…47344970978885631999
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,862,844 XPM·at block #6,827,341 · 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