Block #2,647,077

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 5:21:43 PM · Difficulty 11.7567 · 4,192,497 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f3020fb0af48b210b20101f7dfd042f4b75f6fe0d6160f0dcd6de98b8eb13b8

Height

#2,647,077

Difficulty

11.756650

Transactions

9

Size

3.36 KB

Version

2

Bits

0bc1b3d6

Nonce

656,968,926

Timestamp

5/3/2018, 5:21:43 PM

Confirmations

4,192,497

Merkle Root

c13a84f11f9cac45c5820318e37147a567c225085b0f5a6db80a4bb36f50b1b1
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.133 × 10⁹⁴(95-digit number)
31333689907209002792…52154714917316433921
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.133 × 10⁹⁴(95-digit number)
31333689907209002792…52154714917316433921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.266 × 10⁹⁴(95-digit number)
62667379814418005584…04309429834632867841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.253 × 10⁹⁵(96-digit number)
12533475962883601116…08618859669265735681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.506 × 10⁹⁵(96-digit number)
25066951925767202233…17237719338531471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.013 × 10⁹⁵(96-digit number)
50133903851534404467…34475438677062942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.002 × 10⁹⁶(97-digit number)
10026780770306880893…68950877354125885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.005 × 10⁹⁶(97-digit number)
20053561540613761787…37901754708251770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.010 × 10⁹⁶(97-digit number)
40107123081227523574…75803509416503541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.021 × 10⁹⁶(97-digit number)
80214246162455047148…51607018833007083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.604 × 10⁹⁷(98-digit number)
16042849232491009429…03214037666014167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.208 × 10⁹⁷(98-digit number)
32085698464982018859…06428075332028334081
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,960,878 XPM·at block #6,839,573 · 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