Block #3,059,569

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/19/2019, 10:25:15 AM · Difficulty 11.0075 · 3,779,052 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c2f25a4a597262e12bef8fd606ab42e93e3d4d5c0983f801c7e5f38fb16ad4c

Height

#3,059,569

Difficulty

11.007502

Transactions

2

Size

721 B

Version

2

Bits

0b01eba6

Nonce

161,656,953

Timestamp

2/19/2019, 10:25:15 AM

Confirmations

3,779,052

Merkle Root

9539e0a3ef85ee0bc94ffcd9a6c9a731fd94ee2f24baa3e07ac45ba2d3ddd2d8
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.

2.340 × 10⁹⁴(95-digit number)
23409654834830189563…03754873680408830001
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.340 × 10⁹⁴(95-digit number)
23409654834830189563…03754873680408830001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.681 × 10⁹⁴(95-digit number)
46819309669660379126…07509747360817660001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.363 × 10⁹⁴(95-digit number)
93638619339320758252…15019494721635320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.872 × 10⁹⁵(96-digit number)
18727723867864151650…30038989443270640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.745 × 10⁹⁵(96-digit number)
37455447735728303300…60077978886541280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.491 × 10⁹⁵(96-digit number)
74910895471456606601…20155957773082560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.498 × 10⁹⁶(97-digit number)
14982179094291321320…40311915546165120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.996 × 10⁹⁶(97-digit number)
29964358188582642640…80623831092330240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.992 × 10⁹⁶(97-digit number)
59928716377165285281…61247662184660480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.198 × 10⁹⁷(98-digit number)
11985743275433057056…22495324369320960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.397 × 10⁹⁷(98-digit number)
23971486550866114112…44990648738641920001
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,953,256 XPM·at block #6,838,620 · 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