Block #439,303

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/11/2014, 2:36:18 PM · Difficulty 10.3587 · 6,377,122 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f8d28823d19dbf8b43b5d50a28c685b46c6bc090fa6d1406d873b02f6d23a000

Height

#439,303

Difficulty

10.358660

Transactions

9

Size

1.96 KB

Version

2

Bits

0a5bd120

Nonce

395,578

Timestamp

3/11/2014, 2:36:18 PM

Confirmations

6,377,122

Merkle Root

01d89952d920bebc20e4a24d30a00c431d77876922d1c4c95017ade6def6924f
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.784 × 10⁹⁵(96-digit number)
77845817364485416383…96305265311562841199
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.784 × 10⁹⁵(96-digit number)
77845817364485416383…96305265311562841199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.556 × 10⁹⁶(97-digit number)
15569163472897083276…92610530623125682399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.113 × 10⁹⁶(97-digit number)
31138326945794166553…85221061246251364799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.227 × 10⁹⁶(97-digit number)
62276653891588333106…70442122492502729599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.245 × 10⁹⁷(98-digit number)
12455330778317666621…40884244985005459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.491 × 10⁹⁷(98-digit number)
24910661556635333242…81768489970010918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.982 × 10⁹⁷(98-digit number)
49821323113270666485…63536979940021836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.964 × 10⁹⁷(98-digit number)
99642646226541332970…27073959880043673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.992 × 10⁹⁸(99-digit number)
19928529245308266594…54147919760087347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.985 × 10⁹⁸(99-digit number)
39857058490616533188…08295839520174694399
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,775,528 XPM·at block #6,816,424 · 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