Block #495,084

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 11:36:22 AM · Difficulty 10.7303 · 6,311,825 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83f34701b5c59bbbf0e513518d5c13d09f28912157a81214ffd03d63e53f8e1c

Height

#495,084

Difficulty

10.730258

Transactions

4

Size

1.70 KB

Version

2

Bits

0abaf22d

Nonce

11,896,278

Timestamp

4/16/2014, 11:36:22 AM

Confirmations

6,311,825

Merkle Root

90875d7963b445f6fe05b32034476fff5f8fa322a3f23143c10cb952458dcbb2
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.363 × 10⁹⁸(99-digit number)
33634533866013063466…29914365495794362239
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.363 × 10⁹⁸(99-digit number)
33634533866013063466…29914365495794362239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.726 × 10⁹⁸(99-digit number)
67269067732026126932…59828730991588724479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.345 × 10⁹⁹(100-digit number)
13453813546405225386…19657461983177448959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.690 × 10⁹⁹(100-digit number)
26907627092810450773…39314923966354897919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.381 × 10⁹⁹(100-digit number)
53815254185620901546…78629847932709795839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.076 × 10¹⁰⁰(101-digit number)
10763050837124180309…57259695865419591679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.152 × 10¹⁰⁰(101-digit number)
21526101674248360618…14519391730839183359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.305 × 10¹⁰⁰(101-digit number)
43052203348496721236…29038783461678366719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.610 × 10¹⁰⁰(101-digit number)
86104406696993442473…58077566923356733439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.722 × 10¹⁰¹(102-digit number)
17220881339398688494…16155133846713466879
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,699,375 XPM·at block #6,806,908 · 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