Block #444,452

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 6:56:54 AM · Difficulty 10.3430 · 6,364,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1f4f1887a187a75b072d3889703f55a486a8ef7b43474ee0fbb007f59af8a22

Height

#444,452

Difficulty

10.343027

Transactions

3

Size

1.56 KB

Version

2

Bits

0a57d09a

Nonce

285,051

Timestamp

3/15/2014, 6:56:54 AM

Confirmations

6,364,974

Merkle Root

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

8.124 × 10¹⁰¹(102-digit number)
81245751084047582944…64196270362814369919
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
8.124 × 10¹⁰¹(102-digit number)
81245751084047582944…64196270362814369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.624 × 10¹⁰²(103-digit number)
16249150216809516588…28392540725628739839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.249 × 10¹⁰²(103-digit number)
32498300433619033177…56785081451257479679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.499 × 10¹⁰²(103-digit number)
64996600867238066355…13570162902514959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.299 × 10¹⁰³(104-digit number)
12999320173447613271…27140325805029918719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.599 × 10¹⁰³(104-digit number)
25998640346895226542…54280651610059837439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.199 × 10¹⁰³(104-digit number)
51997280693790453084…08561303220119674879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.039 × 10¹⁰⁴(105-digit number)
10399456138758090616…17122606440239349759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.079 × 10¹⁰⁴(105-digit number)
20798912277516181233…34245212880478699519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.159 × 10¹⁰⁴(105-digit number)
41597824555032362467…68490425760957399039
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,719,478 XPM·at block #6,809,425 · 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