Block #3,141,527

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2019, 6:51:23 AM · Difficulty 11.3182 · 3,696,885 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a21b37a1c0f331baa07c1e2059041904ecc1f54309dc6c5c17fc9a2dfd901034

Height

#3,141,527

Difficulty

11.318165

Transactions

2

Size

575 B

Version

2

Bits

0b517343

Nonce

608,273,760

Timestamp

4/16/2019, 6:51:23 AM

Confirmations

3,696,885

Merkle Root

75b84048246e4f281ca3a4874036c4193b4a1b8e51b6099d05dbdffd7253bf1d
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.

1.948 × 10⁹⁶(97-digit number)
19480509178749915945…90076612556615680001
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.948 × 10⁹⁶(97-digit number)
19480509178749915945…90076612556615680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.896 × 10⁹⁶(97-digit number)
38961018357499831891…80153225113231360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.792 × 10⁹⁶(97-digit number)
77922036714999663783…60306450226462720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.558 × 10⁹⁷(98-digit number)
15584407342999932756…20612900452925440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.116 × 10⁹⁷(98-digit number)
31168814685999865513…41225800905850880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.233 × 10⁹⁷(98-digit number)
62337629371999731026…82451601811701760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.246 × 10⁹⁸(99-digit number)
12467525874399946205…64903203623403520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.493 × 10⁹⁸(99-digit number)
24935051748799892410…29806407246807040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.987 × 10⁹⁸(99-digit number)
49870103497599784821…59612814493614080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.974 × 10⁹⁸(99-digit number)
99740206995199569642…19225628987228160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.994 × 10⁹⁹(100-digit number)
19948041399039913928…38451257974456320001
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,951,569 XPM·at block #6,838,411 · 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