Block #1,404,731

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2016, 5:30:56 PM · Difficulty 10.8060 · 5,421,827 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2064743dc89b810cb42f06dde83bff40ada446ae774dbf0593b8d2d90f87491

Height

#1,404,731

Difficulty

10.805982

Transactions

2

Size

1.43 KB

Version

2

Bits

0ace54dc

Nonce

406,762,246

Timestamp

1/8/2016, 5:30:56 PM

Confirmations

5,421,827

Merkle Root

753f564916d3e163354d26cea48889fdbfecadead10919d90b8a129c5dbc8b50
Transactions (2)
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.116 × 10⁹⁷(98-digit number)
11165442726377588373…85784499844020613119
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.116 × 10⁹⁷(98-digit number)
11165442726377588373…85784499844020613119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.233 × 10⁹⁷(98-digit number)
22330885452755176746…71568999688041226239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.466 × 10⁹⁷(98-digit number)
44661770905510353493…43137999376082452479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.932 × 10⁹⁷(98-digit number)
89323541811020706986…86275998752164904959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.786 × 10⁹⁸(99-digit number)
17864708362204141397…72551997504329809919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.572 × 10⁹⁸(99-digit number)
35729416724408282794…45103995008659619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.145 × 10⁹⁸(99-digit number)
71458833448816565589…90207990017319239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.429 × 10⁹⁹(100-digit number)
14291766689763313117…80415980034638479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.858 × 10⁹⁹(100-digit number)
28583533379526626235…60831960069276958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.716 × 10⁹⁹(100-digit number)
57167066759053252471…21663920138553917439
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,856,615 XPM·at block #6,826,557 · 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