Block #2,561,820

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2018, 9:02:07 AM · Difficulty 10.9925 · 4,281,076 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c175f805aba3d82608cb2f672c056886097b553482619cce3433dfe1c381f4e5

Height

#2,561,820

Difficulty

10.992535

Transactions

53

Size

15.50 KB

Version

2

Bits

0afe16c0

Nonce

588,402,781

Timestamp

3/12/2018, 9:02:07 AM

Confirmations

4,281,076

Merkle Root

dd6aba3295bb0a57828d6de53e059f64580a543067944f044a4a18fd2f85f90e
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.

8.182 × 10⁹⁵(96-digit number)
81829381903668289313…82495894646514411521
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
8.182 × 10⁹⁵(96-digit number)
81829381903668289313…82495894646514411521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.636 × 10⁹⁶(97-digit number)
16365876380733657862…64991789293028823041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.273 × 10⁹⁶(97-digit number)
32731752761467315725…29983578586057646081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.546 × 10⁹⁶(97-digit number)
65463505522934631450…59967157172115292161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.309 × 10⁹⁷(98-digit number)
13092701104586926290…19934314344230584321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.618 × 10⁹⁷(98-digit number)
26185402209173852580…39868628688461168641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.237 × 10⁹⁷(98-digit number)
52370804418347705160…79737257376922337281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.047 × 10⁹⁸(99-digit number)
10474160883669541032…59474514753844674561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.094 × 10⁹⁸(99-digit number)
20948321767339082064…18949029507689349121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.189 × 10⁹⁸(99-digit number)
41896643534678164128…37898059015378698241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.379 × 10⁹⁸(99-digit number)
83793287069356328256…75796118030757396481
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,987,516 XPM·at block #6,842,895 · 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