Block #2,050,677

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2017, 5:05:58 AM · Difficulty 10.6958 · 4,793,323 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fdbfd9ae2dc0781ca94884510d090cec8adf4cc475b1c0cda26e33d196be1017

Height

#2,050,677

Difficulty

10.695794

Transactions

3

Size

2.37 KB

Version

2

Bits

0ab21f95

Nonce

1,183,111

Timestamp

4/3/2017, 5:05:58 AM

Confirmations

4,793,323

Merkle Root

82740363ca46a9b6f5c2d062fff93e7dc99827bda3927aa32eab6ed3ba2ea2db
Transactions (3)
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.609 × 10⁹⁵(96-digit number)
16094927978488543837…62023243016197018559
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.609 × 10⁹⁵(96-digit number)
16094927978488543837…62023243016197018559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.218 × 10⁹⁵(96-digit number)
32189855956977087675…24046486032394037119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.437 × 10⁹⁵(96-digit number)
64379711913954175351…48092972064788074239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.287 × 10⁹⁶(97-digit number)
12875942382790835070…96185944129576148479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.575 × 10⁹⁶(97-digit number)
25751884765581670140…92371888259152296959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.150 × 10⁹⁶(97-digit number)
51503769531163340281…84743776518304593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.030 × 10⁹⁷(98-digit number)
10300753906232668056…69487553036609187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.060 × 10⁹⁷(98-digit number)
20601507812465336112…38975106073218375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.120 × 10⁹⁷(98-digit number)
41203015624930672225…77950212146436751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.240 × 10⁹⁷(98-digit number)
82406031249861344450…55900424292873502719
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,996,382 XPM·at block #6,843,999 · 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