Block #2,682,173

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2018, 10:34:59 PM · Difficulty 11.6912 · 4,149,590 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
095a625279a05cf57affbc685faa7b93052636ab922df56a8e3ce44ae96eaefa

Height

#2,682,173

Difficulty

11.691248

Transactions

2

Size

1018 B

Version

2

Bits

0bb0f59f

Nonce

788,316,470

Timestamp

5/28/2018, 10:34:59 PM

Confirmations

4,149,590

Merkle Root

872929f4d11cd91f60d7401b1cb96541f6797d4564c8896cd1ce2b65d38e38e7
Transactions (2)
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.

2.548 × 10⁹⁶(97-digit number)
25489935500735741731…91343441984508538881
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
2.548 × 10⁹⁶(97-digit number)
25489935500735741731…91343441984508538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.097 × 10⁹⁶(97-digit number)
50979871001471483462…82686883969017077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.019 × 10⁹⁷(98-digit number)
10195974200294296692…65373767938034155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.039 × 10⁹⁷(98-digit number)
20391948400588593385…30747535876068311041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.078 × 10⁹⁷(98-digit number)
40783896801177186770…61495071752136622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.156 × 10⁹⁷(98-digit number)
81567793602354373540…22990143504273244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.631 × 10⁹⁸(99-digit number)
16313558720470874708…45980287008546488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.262 × 10⁹⁸(99-digit number)
32627117440941749416…91960574017092976641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.525 × 10⁹⁸(99-digit number)
65254234881883498832…83921148034185953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.305 × 10⁹⁹(100-digit number)
13050846976376699766…67842296068371906561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.610 × 10⁹⁹(100-digit number)
26101693952753399532…35684592136743813121
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,898,214 XPM·at block #6,831,762 · 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