Block #1,417,359

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2016, 5:05:34 PM · Difficulty 10.7942 · 5,413,934 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b2d4e9d639518aa707257d4a20b3e979539cb38e81407815a2ef4e3fb9cc6271

Height

#1,417,359

Difficulty

10.794211

Transactions

2

Size

1.01 KB

Version

2

Bits

0acb516b

Nonce

657,402,401

Timestamp

1/17/2016, 5:05:34 PM

Confirmations

5,413,934

Merkle Root

2363b3dcc98b1460f74d0b3bde1c6795c15dfc3898c21c23eed16a7448667c2a
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.590 × 10⁹⁵(96-digit number)
15907504894396988681…90301629099824989439
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.590 × 10⁹⁵(96-digit number)
15907504894396988681…90301629099824989439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.181 × 10⁹⁵(96-digit number)
31815009788793977362…80603258199649978879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.363 × 10⁹⁵(96-digit number)
63630019577587954725…61206516399299957759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.272 × 10⁹⁶(97-digit number)
12726003915517590945…22413032798599915519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.545 × 10⁹⁶(97-digit number)
25452007831035181890…44826065597199831039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.090 × 10⁹⁶(97-digit number)
50904015662070363780…89652131194399662079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.018 × 10⁹⁷(98-digit number)
10180803132414072756…79304262388799324159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.036 × 10⁹⁷(98-digit number)
20361606264828145512…58608524777598648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.072 × 10⁹⁷(98-digit number)
40723212529656291024…17217049555197296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.144 × 10⁹⁷(98-digit number)
81446425059312582048…34434099110394593279
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,894,490 XPM·at block #6,831,292 · 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