Block #2,691,316

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/4/2018, 8:59:52 AM · Difficulty 11.6841 · 4,147,252 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6eee57e966ddb69311041c7b65032cfb553c0f850c8f285c40d154e6fb9cca31

Height

#2,691,316

Difficulty

11.684053

Transactions

7

Size

3.09 KB

Version

2

Bits

0baf1e1a

Nonce

103,849,504

Timestamp

6/4/2018, 8:59:52 AM

Confirmations

4,147,252

Merkle Root

971a80f1c47712e54ecbc40dfd82728f97027fac9288a582f2bd91656d6b8aed
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.

4.637 × 10⁹⁵(96-digit number)
46372877893787438056…73189344188559614561
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
4.637 × 10⁹⁵(96-digit number)
46372877893787438056…73189344188559614561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.274 × 10⁹⁵(96-digit number)
92745755787574876112…46378688377119229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.854 × 10⁹⁶(97-digit number)
18549151157514975222…92757376754238458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.709 × 10⁹⁶(97-digit number)
37098302315029950445…85514753508476916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.419 × 10⁹⁶(97-digit number)
74196604630059900890…71029507016953832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.483 × 10⁹⁷(98-digit number)
14839320926011980178…42059014033907665921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.967 × 10⁹⁷(98-digit number)
29678641852023960356…84118028067815331841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.935 × 10⁹⁷(98-digit number)
59357283704047920712…68236056135630663681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.187 × 10⁹⁸(99-digit number)
11871456740809584142…36472112271261327361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.374 × 10⁹⁸(99-digit number)
23742913481619168284…72944224542522654721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.748 × 10⁹⁸(99-digit number)
47485826963238336569…45888449085045309441
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,952,828 XPM·at block #6,838,567 · 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