Block #420,302

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/26/2014, 7:16:07 AM · Difficulty 10.3693 · 6,397,325 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8bd11e4836a1eb3cd848787771cd7673e3552716c1d1cbec4753c190be1ffdfe

Height

#420,302

Difficulty

10.369290

Transactions

12

Size

3.38 KB

Version

2

Bits

0a5e89c9

Nonce

103,452

Timestamp

2/26/2014, 7:16:07 AM

Confirmations

6,397,325

Merkle Root

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

6.816 × 10⁹⁹(100-digit number)
68161938246692950836…43428613017281392639
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
6.816 × 10⁹⁹(100-digit number)
68161938246692950836…43428613017281392639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.363 × 10¹⁰⁰(101-digit number)
13632387649338590167…86857226034562785279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.726 × 10¹⁰⁰(101-digit number)
27264775298677180334…73714452069125570559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.452 × 10¹⁰⁰(101-digit number)
54529550597354360669…47428904138251141119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.090 × 10¹⁰¹(102-digit number)
10905910119470872133…94857808276502282239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.181 × 10¹⁰¹(102-digit number)
21811820238941744267…89715616553004564479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.362 × 10¹⁰¹(102-digit number)
43623640477883488535…79431233106009128959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.724 × 10¹⁰¹(102-digit number)
87247280955766977070…58862466212018257919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.744 × 10¹⁰²(103-digit number)
17449456191153395414…17724932424036515839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.489 × 10¹⁰²(103-digit number)
34898912382306790828…35449864848073031679
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,785,067 XPM·at block #6,817,626 · 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