Block #495,526

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 4:11:44 PM · Difficulty 10.7391 · 6,321,438 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
99f1ce19c83d827b3111fe62d146484ad0418bfd2f9e12e3cec519b0a22ab12a

Height

#495,526

Difficulty

10.739080

Transactions

2

Size

2.57 KB

Version

2

Bits

0abd3453

Nonce

176,478

Timestamp

4/16/2014, 4:11:44 PM

Confirmations

6,321,438

Merkle Root

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

4.043 × 10⁹⁵(96-digit number)
40435430433747628915…64052053189703054119
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
4.043 × 10⁹⁵(96-digit number)
40435430433747628915…64052053189703054119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.087 × 10⁹⁵(96-digit number)
80870860867495257830…28104106379406108239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.617 × 10⁹⁶(97-digit number)
16174172173499051566…56208212758812216479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.234 × 10⁹⁶(97-digit number)
32348344346998103132…12416425517624432959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.469 × 10⁹⁶(97-digit number)
64696688693996206264…24832851035248865919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.293 × 10⁹⁷(98-digit number)
12939337738799241252…49665702070497731839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.587 × 10⁹⁷(98-digit number)
25878675477598482505…99331404140995463679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.175 × 10⁹⁷(98-digit number)
51757350955196965011…98662808281990927359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.035 × 10⁹⁸(99-digit number)
10351470191039393002…97325616563981854719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.070 × 10⁹⁸(99-digit number)
20702940382078786004…94651233127963709439
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,779,748 XPM·at block #6,816,963 · 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