Block #1,413,514

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2016, 9:44:50 PM · Difficulty 10.8020 · 5,424,009 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd0e0cb4a228c62216de0a6ce0219ab1a668946703fd803eafd3cb8ce13cec17

Height

#1,413,514

Difficulty

10.802012

Transactions

2

Size

1.05 KB

Version

2

Bits

0acd50ae

Nonce

313,971,779

Timestamp

1/14/2016, 9:44:50 PM

Confirmations

5,424,009

Merkle Root

fff3e35604c9246cab0547c3d9a6e0907aebfd9e7dae9c8cc61e6c2ecf68f945
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.613 × 10⁹⁷(98-digit number)
46134193318540774211…01465245874472796159
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.613 × 10⁹⁷(98-digit number)
46134193318540774211…01465245874472796159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.226 × 10⁹⁷(98-digit number)
92268386637081548423…02930491748945592319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.845 × 10⁹⁸(99-digit number)
18453677327416309684…05860983497891184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.690 × 10⁹⁸(99-digit number)
36907354654832619369…11721966995782369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.381 × 10⁹⁸(99-digit number)
73814709309665238738…23443933991564738559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.476 × 10⁹⁹(100-digit number)
14762941861933047747…46887867983129477119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.952 × 10⁹⁹(100-digit number)
29525883723866095495…93775735966258954239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.905 × 10⁹⁹(100-digit number)
59051767447732190990…87551471932517908479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.181 × 10¹⁰⁰(101-digit number)
11810353489546438198…75102943865035816959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.362 × 10¹⁰⁰(101-digit number)
23620706979092876396…50205887730071633919
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,944,510 XPM·at block #6,837,522 · 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