Block #3,086,851

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2019, 12:18:01 PM · Difficulty 11.0376 · 3,754,271 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
430697ad398d62d94309987bd447ada7cb902c44b57af3992b8db24a2cb4d2d3

Height

#3,086,851

Difficulty

11.037555

Transactions

9

Size

3.43 KB

Version

2

Bits

0b099d33

Nonce

688,596,933

Timestamp

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

Confirmations

3,754,271

Merkle Root

0f9848b427b8b4fb5210f0239e08fb8e51a09a995ecb93f172df09ca3514b831
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.

3.863 × 10⁹⁴(95-digit number)
38633767993711599749…83718687591135649121
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
3.863 × 10⁹⁴(95-digit number)
38633767993711599749…83718687591135649121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.726 × 10⁹⁴(95-digit number)
77267535987423199498…67437375182271298241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.545 × 10⁹⁵(96-digit number)
15453507197484639899…34874750364542596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.090 × 10⁹⁵(96-digit number)
30907014394969279799…69749500729085192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.181 × 10⁹⁵(96-digit number)
61814028789938559598…39499001458170385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.236 × 10⁹⁶(97-digit number)
12362805757987711919…78998002916340771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.472 × 10⁹⁶(97-digit number)
24725611515975423839…57996005832681543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.945 × 10⁹⁶(97-digit number)
49451223031950847679…15992011665363087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.890 × 10⁹⁶(97-digit number)
98902446063901695358…31984023330726174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.978 × 10⁹⁷(98-digit number)
19780489212780339071…63968046661452349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.956 × 10⁹⁷(98-digit number)
39560978425560678143…27936093322904698881
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,973,345 XPM·at block #6,841,121 · 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