Block #351,455

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 5:25:59 PM · Difficulty 10.2951 · 6,457,805 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
71510622220c687dc774c4109908567a32993f0c0410db674578af1a28638eef

Height

#351,455

Difficulty

10.295086

Transactions

7

Size

2.13 KB

Version

2

Bits

0a4b8ac2

Nonce

36,548

Timestamp

1/9/2014, 5:25:59 PM

Confirmations

6,457,805

Merkle Root

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

3.189 × 10⁹⁸(99-digit number)
31898812147084223550…35128742806343065599
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
3.189 × 10⁹⁸(99-digit number)
31898812147084223550…35128742806343065599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.379 × 10⁹⁸(99-digit number)
63797624294168447100…70257485612686131199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.275 × 10⁹⁹(100-digit number)
12759524858833689420…40514971225372262399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.551 × 10⁹⁹(100-digit number)
25519049717667378840…81029942450744524799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.103 × 10⁹⁹(100-digit number)
51038099435334757680…62059884901489049599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.020 × 10¹⁰⁰(101-digit number)
10207619887066951536…24119769802978099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.041 × 10¹⁰⁰(101-digit number)
20415239774133903072…48239539605956198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.083 × 10¹⁰⁰(101-digit number)
40830479548267806144…96479079211912396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.166 × 10¹⁰⁰(101-digit number)
81660959096535612288…92958158423824793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.633 × 10¹⁰¹(102-digit number)
16332191819307122457…85916316847649587199
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,718,147 XPM·at block #6,809,259 · 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