Block #3,191,458

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2019, 9:28:49 AM · Difficulty 11.2302 · 3,650,877 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ff2454ad1caa8fe10b804c17fbdc6471050c7b040d2980243fddc925c819fd7

Height

#3,191,458

Difficulty

11.230173

Transactions

6

Size

2.91 KB

Version

2

Bits

0b3aec97

Nonce

1,926,364,144

Timestamp

5/21/2019, 9:28:49 AM

Confirmations

3,650,877

Merkle Root

44cf98c5c41d825a9b9e36b9cc3a1ea18f49db2b873a93d466b47008911c8641
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.

7.744 × 10⁹⁵(96-digit number)
77446294110109211520…81718054972780390401
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
7.744 × 10⁹⁵(96-digit number)
77446294110109211520…81718054972780390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.548 × 10⁹⁶(97-digit number)
15489258822021842304…63436109945560780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.097 × 10⁹⁶(97-digit number)
30978517644043684608…26872219891121561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.195 × 10⁹⁶(97-digit number)
61957035288087369216…53744439782243123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.239 × 10⁹⁷(98-digit number)
12391407057617473843…07488879564486246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.478 × 10⁹⁷(98-digit number)
24782814115234947686…14977759128972492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.956 × 10⁹⁷(98-digit number)
49565628230469895373…29955518257944985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.913 × 10⁹⁷(98-digit number)
99131256460939790746…59911036515889971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.982 × 10⁹⁸(99-digit number)
19826251292187958149…19822073031779942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.965 × 10⁹⁸(99-digit number)
39652502584375916298…39644146063559884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.930 × 10⁹⁸(99-digit number)
79305005168751832597…79288292127119769601
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,983,086 XPM·at block #6,842,334 · 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