Block #2,978,743

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2018, 9:46:13 PM · Difficulty 11.2898 · 3,852,702 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7eb9abe71ae9286f01fc115af28346b602a57e9aa93e3d5fe12f206758738ea1

Height

#2,978,743

Difficulty

11.289792

Transactions

2

Size

1.03 KB

Version

2

Bits

0b4a2fd1

Nonce

1,253,902,211

Timestamp

12/23/2018, 9:46:13 PM

Confirmations

3,852,702

Merkle Root

cff785fab09044d11456d2f33bf4447017ebed850a69237d09174e8ff9c5aa31
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.

7.769 × 10⁹⁴(95-digit number)
77694827578689743506…14698058918306661371
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
7.769 × 10⁹⁴(95-digit number)
77694827578689743506…14698058918306661371
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.553 × 10⁹⁵(96-digit number)
15538965515737948701…29396117836613322741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.107 × 10⁹⁵(96-digit number)
31077931031475897402…58792235673226645481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.215 × 10⁹⁵(96-digit number)
62155862062951794805…17584471346453290961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.243 × 10⁹⁶(97-digit number)
12431172412590358961…35168942692906581921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.486 × 10⁹⁶(97-digit number)
24862344825180717922…70337885385813163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.972 × 10⁹⁶(97-digit number)
49724689650361435844…40675770771626327681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.944 × 10⁹⁶(97-digit number)
99449379300722871688…81351541543252655361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.988 × 10⁹⁷(98-digit number)
19889875860144574337…62703083086505310721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.977 × 10⁹⁷(98-digit number)
39779751720289148675…25406166173010621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.955 × 10⁹⁷(98-digit number)
79559503440578297351…50812332346021242881
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,895,724 XPM·at block #6,831,444 · 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