Block #3,595,687

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2020, 8:54:45 AM · Difficulty 10.9092 · 3,246,222 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e96f9d59960f0a2a0179d005ccc1572bd26ccf81a152f7b9ca8141018c60d5c5

Height

#3,595,687

Difficulty

10.909176

Transactions

11

Size

10.87 KB

Version

2

Bits

0ae8bfc2

Nonce

98,757,572

Timestamp

3/12/2020, 8:54:45 AM

Confirmations

3,246,222

Merkle Root

8857f9a5e05ab8a2f2f8e628fff747078b62e33df5e82c038701954fa640730e
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.275 × 10⁹⁴(95-digit number)
12758249489455357706…64362327600059877761
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.275 × 10⁹⁴(95-digit number)
12758249489455357706…64362327600059877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.551 × 10⁹⁴(95-digit number)
25516498978910715413…28724655200119755521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.103 × 10⁹⁴(95-digit number)
51032997957821430826…57449310400239511041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.020 × 10⁹⁵(96-digit number)
10206599591564286165…14898620800479022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.041 × 10⁹⁵(96-digit number)
20413199183128572330…29797241600958044161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.082 × 10⁹⁵(96-digit number)
40826398366257144661…59594483201916088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.165 × 10⁹⁵(96-digit number)
81652796732514289323…19188966403832176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.633 × 10⁹⁶(97-digit number)
16330559346502857864…38377932807664353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.266 × 10⁹⁶(97-digit number)
32661118693005715729…76755865615328706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.532 × 10⁹⁶(97-digit number)
65322237386011431458…53511731230657413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.306 × 10⁹⁷(98-digit number)
13064447477202286291…07023462461314826241
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,979,647 XPM·at block #6,841,908 · 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