Block #499,718

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/18/2014, 6:06:56 PM · Difficulty 10.7946 · 6,308,603 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
855c1365fa4bf00c0044e46c0d9e5d3724a43510419ce0e477bafacc314ec281

Height

#499,718

Difficulty

10.794596

Transactions

5

Size

1.16 KB

Version

2

Bits

0acb6aa8

Nonce

187,738,130

Timestamp

4/18/2014, 6:06:56 PM

Confirmations

6,308,603

Merkle Root

4574c36b69302e8cc8d852e176d8d67d3a96f082e8f4441c6e10a752f49cdc45
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.

2.616 × 10⁹⁸(99-digit number)
26166369753830743393…05782403778700465919
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
2.616 × 10⁹⁸(99-digit number)
26166369753830743393…05782403778700465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.233 × 10⁹⁸(99-digit number)
52332739507661486786…11564807557400931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.046 × 10⁹⁹(100-digit number)
10466547901532297357…23129615114801863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.093 × 10⁹⁹(100-digit number)
20933095803064594714…46259230229603727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.186 × 10⁹⁹(100-digit number)
41866191606129189429…92518460459207454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.373 × 10⁹⁹(100-digit number)
83732383212258378859…85036920918414909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.674 × 10¹⁰⁰(101-digit number)
16746476642451675771…70073841836829818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.349 × 10¹⁰⁰(101-digit number)
33492953284903351543…40147683673659637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.698 × 10¹⁰⁰(101-digit number)
66985906569806703087…80295367347319275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.339 × 10¹⁰¹(102-digit number)
13397181313961340617…60590734694638551039
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,710,622 XPM·at block #6,808,320 · 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