Block #1,414,821

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2016, 9:06:04 PM · Difficulty 10.7983 · 5,418,228 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
341f95a34b83a12f3a547cfa1445115d130693f532260e64b99e9742ed3757d6

Height

#1,414,821

Difficulty

10.798300

Transactions

2

Size

730 B

Version

2

Bits

0acc5d63

Nonce

108,929,230

Timestamp

1/15/2016, 9:06:04 PM

Confirmations

5,418,228

Merkle Root

22d08cd3cb22a08f991726b58ddf350e38832ab8bf1400b12b94b9e6d14c6e24
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.488 × 10⁹¹(92-digit number)
24880008669741879745…65590930686465121559
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.488 × 10⁹¹(92-digit number)
24880008669741879745…65590930686465121559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.976 × 10⁹¹(92-digit number)
49760017339483759490…31181861372930243119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.952 × 10⁹¹(92-digit number)
99520034678967518981…62363722745860486239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.990 × 10⁹²(93-digit number)
19904006935793503796…24727445491720972479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.980 × 10⁹²(93-digit number)
39808013871587007592…49454890983441944959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.961 × 10⁹²(93-digit number)
79616027743174015185…98909781966883889919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.592 × 10⁹³(94-digit number)
15923205548634803037…97819563933767779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.184 × 10⁹³(94-digit number)
31846411097269606074…95639127867535559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.369 × 10⁹³(94-digit number)
63692822194539212148…91278255735071119359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.273 × 10⁹⁴(95-digit number)
12738564438907842429…82556511470142238719
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,908,572 XPM·at block #6,833,048 · 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