Block #2,077,842

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2017, 2:29:56 PM · Difficulty 10.8512 · 4,763,846 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f41d2316aa2b0c34a7ce07d9d8b3709870557b42c89809ac549143ecc9982f65

Height

#2,077,842

Difficulty

10.851226

Transactions

2

Size

1.72 KB

Version

2

Bits

0ad9e9f5

Nonce

1,636,830,069

Timestamp

4/19/2017, 2:29:56 PM

Confirmations

4,763,846

Merkle Root

6ad21d4fcf357b3c52cf027912bbe6b654cc8fbf092c767b2985c4f1c357c63a
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.

6.366 × 10⁹⁶(97-digit number)
63664803792899131720…19637061220728483839
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
6.366 × 10⁹⁶(97-digit number)
63664803792899131720…19637061220728483839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.273 × 10⁹⁷(98-digit number)
12732960758579826344…39274122441456967679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.546 × 10⁹⁷(98-digit number)
25465921517159652688…78548244882913935359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.093 × 10⁹⁷(98-digit number)
50931843034319305376…57096489765827870719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.018 × 10⁹⁸(99-digit number)
10186368606863861075…14192979531655741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.037 × 10⁹⁸(99-digit number)
20372737213727722150…28385959063311482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.074 × 10⁹⁸(99-digit number)
40745474427455444301…56771918126622965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.149 × 10⁹⁸(99-digit number)
81490948854910888602…13543836253245931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.629 × 10⁹⁹(100-digit number)
16298189770982177720…27087672506491863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.259 × 10⁹⁹(100-digit number)
32596379541964355440…54175345012983726079
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,977,892 XPM·at block #6,841,687 · 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