Block #2,042,037

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2017, 11:25:33 AM · Difficulty 10.6711 · 4,801,849 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e4bcc305c5e82fd1c59f561dd13153be966bb2e55781c9e4f73b8f1de417e06

Height

#2,042,037

Difficulty

10.671072

Transactions

25

Size

9.68 KB

Version

2

Bits

0aabcb58

Nonce

1,732,860,930

Timestamp

3/28/2017, 11:25:33 AM

Confirmations

4,801,849

Merkle Root

56f9dc220a45211324c01660c277a4cc2d82b50a2d69ee07c179229fe466a7e2
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.613 × 10⁹⁵(96-digit number)
26130015066767430754…82162064474591310081
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.613 × 10⁹⁵(96-digit number)
26130015066767430754…82162064474591310081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.226 × 10⁹⁵(96-digit number)
52260030133534861509…64324128949182620161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.045 × 10⁹⁶(97-digit number)
10452006026706972301…28648257898365240321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.090 × 10⁹⁶(97-digit number)
20904012053413944603…57296515796730480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.180 × 10⁹⁶(97-digit number)
41808024106827889207…14593031593460961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.361 × 10⁹⁶(97-digit number)
83616048213655778414…29186063186921922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.672 × 10⁹⁷(98-digit number)
16723209642731155682…58372126373843845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.344 × 10⁹⁷(98-digit number)
33446419285462311365…16744252747687690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.689 × 10⁹⁷(98-digit number)
66892838570924622731…33488505495375380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.337 × 10⁹⁸(99-digit number)
13378567714184924546…66977010990750760961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,995,457 XPM·at block #6,843,885 · 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