Block #1,418,113

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2016, 5:05:18 AM · Difficulty 10.7957 · 5,408,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
f82c1bf55bfbd7d299cbfafbf3a8602ba4c9c7cefbfea2917542b777eaf0e5fd

Height

#1,418,113

Difficulty

10.795718

Transactions

2

Size

732 B

Version

2

Bits

0acbb427

Nonce

1,093,877,055

Timestamp

1/18/2016, 5:05:18 AM

Confirmations

5,408,825

Merkle Root

80e0cd669ad4333b615d41a952678d97577017b4b300afccc4632f2850211245
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.979 × 10⁹⁵(96-digit number)
49797162176812959767…54845716243454760959
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.979 × 10⁹⁵(96-digit number)
49797162176812959767…54845716243454760959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.959 × 10⁹⁵(96-digit number)
99594324353625919534…09691432486909521919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.991 × 10⁹⁶(97-digit number)
19918864870725183906…19382864973819043839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.983 × 10⁹⁶(97-digit number)
39837729741450367813…38765729947638087679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.967 × 10⁹⁶(97-digit number)
79675459482900735627…77531459895276175359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.593 × 10⁹⁷(98-digit number)
15935091896580147125…55062919790552350719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.187 × 10⁹⁷(98-digit number)
31870183793160294250…10125839581104701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.374 × 10⁹⁷(98-digit number)
63740367586320588501…20251679162209402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.274 × 10⁹⁸(99-digit number)
12748073517264117700…40503358324418805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.549 × 10⁹⁸(99-digit number)
25496147034528235400…81006716648837611519
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,677 XPM·at block #6,826,937 · 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