Block #2,912,691

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/6/2018, 5:41:55 PM · Difficulty 11.5081 · 3,932,511 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69c866b6868c508e2d33d52e4bb2d5052eefa443f42d9cb86c3dbafea6f76f94

Height

#2,912,691

Difficulty

11.508127

Transactions

29

Size

7.57 KB

Version

2

Bits

0b8214a0

Nonce

329,542,314

Timestamp

11/6/2018, 5:41:55 PM

Confirmations

3,932,511

Merkle Root

38ab527b9523b2f2aeabbda764ae873122dfd1b8a8c6548d9db84cbb5d91b893
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.235 × 10⁹⁷(98-digit number)
12358370734948333989…58509676443146076161
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.235 × 10⁹⁷(98-digit number)
12358370734948333989…58509676443146076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.471 × 10⁹⁷(98-digit number)
24716741469896667979…17019352886292152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.943 × 10⁹⁷(98-digit number)
49433482939793335958…34038705772584304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.886 × 10⁹⁷(98-digit number)
98866965879586671916…68077411545168609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.977 × 10⁹⁸(99-digit number)
19773393175917334383…36154823090337218561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.954 × 10⁹⁸(99-digit number)
39546786351834668766…72309646180674437121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.909 × 10⁹⁸(99-digit number)
79093572703669337532…44619292361348874241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.581 × 10⁹⁹(100-digit number)
15818714540733867506…89238584722697748481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.163 × 10⁹⁹(100-digit number)
31637429081467735013…78477169445395496961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.327 × 10⁹⁹(100-digit number)
63274858162935470026…56954338890790993921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.265 × 10¹⁰⁰(101-digit number)
12654971632587094005…13908677781581987841
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:58,006,049 XPM·at block #6,845,201 · 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