Block #3,076,369

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2019, 7:24:47 AM · Difficulty 11.0161 · 3,768,560 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9350b6ea3eb215ea281047692e0e8022e0d79499baeedfeeed4a86eb06b8e30f

Height

#3,076,369

Difficulty

11.016056

Transactions

11

Size

3.14 KB

Version

2

Bits

0b041c37

Nonce

14,312,604

Timestamp

3/3/2019, 7:24:47 AM

Confirmations

3,768,560

Merkle Root

1501cafd2f43a590179b52f9719c44895b503635e7618be257414d10247d51b1
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.173 × 10⁹⁷(98-digit number)
61738075604701394124…76225288069949890561
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.173 × 10⁹⁷(98-digit number)
61738075604701394124…76225288069949890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.234 × 10⁹⁸(99-digit number)
12347615120940278824…52450576139899781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.469 × 10⁹⁸(99-digit number)
24695230241880557649…04901152279799562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.939 × 10⁹⁸(99-digit number)
49390460483761115299…09802304559599124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.878 × 10⁹⁸(99-digit number)
98780920967522230599…19604609119198248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.975 × 10⁹⁹(100-digit number)
19756184193504446119…39209218238396497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.951 × 10⁹⁹(100-digit number)
39512368387008892239…78418436476792995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.902 × 10⁹⁹(100-digit number)
79024736774017784479…56836872953585991681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.580 × 10¹⁰⁰(101-digit number)
15804947354803556895…13673745907171983361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.160 × 10¹⁰⁰(101-digit number)
31609894709607113791…27347491814343966721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.321 × 10¹⁰⁰(101-digit number)
63219789419214227583…54694983628687933441
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:58,003,849 XPM·at block #6,844,928 · 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