Block #3,006,519

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2019, 3:01:18 PM · Difficulty 11.1981 · 3,827,379 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
966fec3d81ad25b8da3d20e5871a91164bad0120bb9205e7e5635df31a20d87d

Height

#3,006,519

Difficulty

11.198097

Transactions

6

Size

1.63 KB

Version

2

Bits

0b32b67f

Nonce

1,555,358,066

Timestamp

1/12/2019, 3:01:18 PM

Confirmations

3,827,379

Merkle Root

506b08c4a6ba753b0a8fe6e089425188b9e900c1233cd0dfd027db51551e8862
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.

9.077 × 10⁹⁵(96-digit number)
90774430778779404830…57369851994963005441
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
9.077 × 10⁹⁵(96-digit number)
90774430778779404830…57369851994963005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.815 × 10⁹⁶(97-digit number)
18154886155755880966…14739703989926010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.630 × 10⁹⁶(97-digit number)
36309772311511761932…29479407979852021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.261 × 10⁹⁶(97-digit number)
72619544623023523864…58958815959704043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.452 × 10⁹⁷(98-digit number)
14523908924604704772…17917631919408087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.904 × 10⁹⁷(98-digit number)
29047817849209409545…35835263838816174081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.809 × 10⁹⁷(98-digit number)
58095635698418819091…71670527677632348161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.161 × 10⁹⁸(99-digit number)
11619127139683763818…43341055355264696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.323 × 10⁹⁸(99-digit number)
23238254279367527636…86682110710529392641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.647 × 10⁹⁸(99-digit number)
46476508558735055273…73364221421058785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.295 × 10⁹⁸(99-digit number)
92953017117470110546…46728442842117570561
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,915,409 XPM·at block #6,833,897 · 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