Block #420,319

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/26/2014, 7:27:42 AM · Difficulty 10.3696 · 6,406,790 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf5382514c8a0e688a16caa195085a0dc24b3ace343ff359db74c06bc25a286a

Height

#420,319

Difficulty

10.369628

Transactions

4

Size

1.49 KB

Version

2

Bits

0a5e9ff8

Nonce

22,385

Timestamp

2/26/2014, 7:27:42 AM

Confirmations

6,406,790

Merkle Root

fe7320610a67160ef44619291e074ee980198a96eacbc8f6cbf96bc41a6cf1a3
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.832 × 10⁹⁷(98-digit number)
88327473138156189821…98079131112886625479
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.832 × 10⁹⁷(98-digit number)
88327473138156189821…98079131112886625479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.766 × 10⁹⁸(99-digit number)
17665494627631237964…96158262225773250959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.533 × 10⁹⁸(99-digit number)
35330989255262475928…92316524451546501919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.066 × 10⁹⁸(99-digit number)
70661978510524951857…84633048903093003839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.413 × 10⁹⁹(100-digit number)
14132395702104990371…69266097806186007679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.826 × 10⁹⁹(100-digit number)
28264791404209980742…38532195612372015359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.652 × 10⁹⁹(100-digit number)
56529582808419961485…77064391224744030719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.130 × 10¹⁰⁰(101-digit number)
11305916561683992297…54128782449488061439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.261 × 10¹⁰⁰(101-digit number)
22611833123367984594…08257564898976122879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.522 × 10¹⁰⁰(101-digit number)
45223666246735969188…16515129797952245759
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,861,051 XPM·at block #6,827,108 · 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