Block #2,616,958

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2018, 8:06:03 PM · Difficulty 11.2285 · 4,224,874 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f6f04837ee7db2e6af7a3b5005ebad0832efcb99f9f4e2835dcd0da75276f29

Height

#2,616,958

Difficulty

11.228495

Transactions

2

Size

1.13 KB

Version

2

Bits

0b3a7ea1

Nonce

64,778,188

Timestamp

4/16/2018, 8:06:03 PM

Confirmations

4,224,874

Merkle Root

3d47e8f07183b495dc33fb7bde782a04c51dd96a3e7fae1e573f4b6831e3ce22
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.595 × 10⁹⁴(95-digit number)
25950487325465401584…26041699591393287681
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.595 × 10⁹⁴(95-digit number)
25950487325465401584…26041699591393287681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.190 × 10⁹⁴(95-digit number)
51900974650930803168…52083399182786575361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.038 × 10⁹⁵(96-digit number)
10380194930186160633…04166798365573150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.076 × 10⁹⁵(96-digit number)
20760389860372321267…08333596731146301441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.152 × 10⁹⁵(96-digit number)
41520779720744642535…16667193462292602881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.304 × 10⁹⁵(96-digit number)
83041559441489285070…33334386924585205761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.660 × 10⁹⁶(97-digit number)
16608311888297857014…66668773849170411521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.321 × 10⁹⁶(97-digit number)
33216623776595714028…33337547698340823041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.643 × 10⁹⁶(97-digit number)
66433247553191428056…66675095396681646081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.328 × 10⁹⁷(98-digit number)
13286649510638285611…33350190793363292161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.657 × 10⁹⁷(98-digit number)
26573299021276571222…66700381586726584321
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,979,029 XPM·at block #6,841,831 · 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