Block #3,072,684

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2019, 7:23:22 PM · Difficulty 10.9961 · 3,772,635 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dc30f48665132fd17f6363d3711bb2f205353280a24001f45570c39d41059844

Height

#3,072,684

Difficulty

10.996077

Transactions

3

Size

2.01 KB

Version

2

Bits

0afefeeb

Nonce

714,377,450

Timestamp

2/28/2019, 7:23:22 PM

Confirmations

3,772,635

Merkle Root

9b0252765cc2a584e0542352e8af3f48d911d3ff826f0aa5efc73b87e4fa586e
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.112 × 10⁹⁶(97-digit number)
11127530709301637633…10469208195070502401
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.112 × 10⁹⁶(97-digit number)
11127530709301637633…10469208195070502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.225 × 10⁹⁶(97-digit number)
22255061418603275267…20938416390141004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.451 × 10⁹⁶(97-digit number)
44510122837206550535…41876832780282009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.902 × 10⁹⁶(97-digit number)
89020245674413101071…83753665560564019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.780 × 10⁹⁷(98-digit number)
17804049134882620214…67507331121128038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.560 × 10⁹⁷(98-digit number)
35608098269765240428…35014662242256076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.121 × 10⁹⁷(98-digit number)
71216196539530480856…70029324484512153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.424 × 10⁹⁸(99-digit number)
14243239307906096171…40058648969024307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.848 × 10⁹⁸(99-digit number)
28486478615812192342…80117297938048614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.697 × 10⁹⁸(99-digit number)
56972957231624384685…60234595876097228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.139 × 10⁹⁹(100-digit number)
11394591446324876937…20469191752194457601
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,006,990 XPM·at block #6,845,318 · 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