Block #1,618,358

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2016, 8:05:45 PM · Difficulty 10.5859 · 5,198,566 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c62b02a399a90fb1cfe45d745888acff52f081ac8ae33e3db73d3db906c6f088

Height

#1,618,358

Difficulty

10.585928

Transactions

2

Size

31.19 KB

Version

2

Bits

0a95ff69

Nonce

2,106,209,252

Timestamp

6/7/2016, 8:05:45 PM

Confirmations

5,198,566

Merkle Root

7c8c359d0bb034b2a8e9e875cab3e6cd3e870dca164882d259879c1fccdf5742
Transactions (2)
1 in → 1 out9.2500 XPM110 B
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.

1.588 × 10⁹⁴(95-digit number)
15880219463694011974…46477757388564574721
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
1.588 × 10⁹⁴(95-digit number)
15880219463694011974…46477757388564574721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.176 × 10⁹⁴(95-digit number)
31760438927388023949…92955514777129149441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.352 × 10⁹⁴(95-digit number)
63520877854776047899…85911029554258298881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.270 × 10⁹⁵(96-digit number)
12704175570955209579…71822059108516597761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.540 × 10⁹⁵(96-digit number)
25408351141910419159…43644118217033195521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.081 × 10⁹⁵(96-digit number)
50816702283820838319…87288236434066391041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.016 × 10⁹⁶(97-digit number)
10163340456764167663…74576472868132782081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.032 × 10⁹⁶(97-digit number)
20326680913528335327…49152945736265564161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.065 × 10⁹⁶(97-digit number)
40653361827056670655…98305891472531128321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.130 × 10⁹⁶(97-digit number)
81306723654113341311…96611782945062256641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,779,433 XPM·at block #6,816,923 · 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