Block #428,800

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2014, 8:53:13 AM · Difficulty 10.3418 · 6,379,425 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a5b2674c2501421dd9f8eb333638158b82d500f39fe17e068344e417a4d3ac6d

Height

#428,800

Difficulty

10.341808

Transactions

6

Size

1.30 KB

Version

2

Bits

0a5780c3

Nonce

17,098

Timestamp

3/4/2014, 8:53:13 AM

Confirmations

6,379,425

Merkle Root

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

9.524 × 10¹⁰⁰(101-digit number)
95244151453025876791…62154752643330397999
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
9.524 × 10¹⁰⁰(101-digit number)
95244151453025876791…62154752643330397999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.904 × 10¹⁰¹(102-digit number)
19048830290605175358…24309505286660795999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.809 × 10¹⁰¹(102-digit number)
38097660581210350716…48619010573321591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.619 × 10¹⁰¹(102-digit number)
76195321162420701433…97238021146643183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.523 × 10¹⁰²(103-digit number)
15239064232484140286…94476042293286367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.047 × 10¹⁰²(103-digit number)
30478128464968280573…88952084586572735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.095 × 10¹⁰²(103-digit number)
60956256929936561146…77904169173145471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.219 × 10¹⁰³(104-digit number)
12191251385987312229…55808338346290943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.438 × 10¹⁰³(104-digit number)
24382502771974624458…11616676692581887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.876 × 10¹⁰³(104-digit number)
48765005543949248917…23233353385163775999
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,709,852 XPM·at block #6,808,224 · 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