Block #437,595

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 10:09:31 AM · Difficulty 10.3578 · 6,377,218 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b96cf4498d698e5338eeb58456e7e90cfeb56f291f2f94ef589cd80bf13a7f2a

Height

#437,595

Difficulty

10.357786

Transactions

8

Size

2.60 KB

Version

2

Bits

0a5b97df

Nonce

733,775

Timestamp

3/10/2014, 10:09:31 AM

Confirmations

6,377,218

Merkle Root

09a447f74747c49ea2d25aed4adb7a87c921c78e31152c8203c81474eb292ba6
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.

2.077 × 10⁹⁵(96-digit number)
20774255842162815347…21586171610674899809
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
2.077 × 10⁹⁵(96-digit number)
20774255842162815347…21586171610674899809
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.154 × 10⁹⁵(96-digit number)
41548511684325630695…43172343221349799619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.309 × 10⁹⁵(96-digit number)
83097023368651261391…86344686442699599239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.661 × 10⁹⁶(97-digit number)
16619404673730252278…72689372885399198479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.323 × 10⁹⁶(97-digit number)
33238809347460504556…45378745770798396959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.647 × 10⁹⁶(97-digit number)
66477618694921009112…90757491541596793919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.329 × 10⁹⁷(98-digit number)
13295523738984201822…81514983083193587839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.659 × 10⁹⁷(98-digit number)
26591047477968403645…63029966166387175679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.318 × 10⁹⁷(98-digit number)
53182094955936807290…26059932332774351359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.063 × 10⁹⁸(99-digit number)
10636418991187361458…52119864665548702719
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,762,590 XPM·at block #6,814,812 · 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