Block #499,314

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/18/2014, 1:25:19 PM · Difficulty 10.7897 · 6,327,640 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1782eb307f9315f32e9743a1af6e3089b0a031268fb7bbe2dec63abf1bdf520c

Height

#499,314

Difficulty

10.789708

Transactions

6

Size

5.29 KB

Version

2

Bits

0aca2a48

Nonce

42,802

Timestamp

4/18/2014, 1:25:19 PM

Confirmations

6,327,640

Merkle Root

4763b6ff26751bbef1a7632de49a4ecb9f52c0bfb7c56ddaff371acdb018ddb0
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.

1.130 × 10⁹⁵(96-digit number)
11306970457506004187…38112313553844259839
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
1.130 × 10⁹⁵(96-digit number)
11306970457506004187…38112313553844259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.261 × 10⁹⁵(96-digit number)
22613940915012008374…76224627107688519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.522 × 10⁹⁵(96-digit number)
45227881830024016749…52449254215377039359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.045 × 10⁹⁵(96-digit number)
90455763660048033498…04898508430754078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.809 × 10⁹⁶(97-digit number)
18091152732009606699…09797016861508157439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.618 × 10⁹⁶(97-digit number)
36182305464019213399…19594033723016314879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.236 × 10⁹⁶(97-digit number)
72364610928038426798…39188067446032629759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.447 × 10⁹⁷(98-digit number)
14472922185607685359…78376134892065259519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.894 × 10⁹⁷(98-digit number)
28945844371215370719…56752269784130519039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.789 × 10⁹⁷(98-digit number)
57891688742430741438…13504539568261038079
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,859,808 XPM·at block #6,826,953 · 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