Block #2,675,075

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2018, 9:51:43 PM · Difficulty 11.6998 · 4,155,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a457571e72d97222fe785ad8cf49d3f5b3ab36c2993f89201b753a9a9dfdbbdb

Height

#2,675,075

Difficulty

11.699816

Transactions

27

Size

8.40 KB

Version

2

Bits

0bb3271d

Nonce

1,699,746,416

Timestamp

5/23/2018, 9:51:43 PM

Confirmations

4,155,919

Merkle Root

49c4791bc5d50be2de27d4e61759a8854aa6f2e670e9c5185efc2c044f488c64
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.691 × 10⁹³(94-digit number)
26916403938892263669…89244351966855172431
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.691 × 10⁹³(94-digit number)
26916403938892263669…89244351966855172431
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.383 × 10⁹³(94-digit number)
53832807877784527339…78488703933710344861
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.076 × 10⁹⁴(95-digit number)
10766561575556905467…56977407867420689721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.153 × 10⁹⁴(95-digit number)
21533123151113810935…13954815734841379441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.306 × 10⁹⁴(95-digit number)
43066246302227621871…27909631469682758881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.613 × 10⁹⁴(95-digit number)
86132492604455243742…55819262939365517761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.722 × 10⁹⁵(96-digit number)
17226498520891048748…11638525878731035521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.445 × 10⁹⁵(96-digit number)
34452997041782097497…23277051757462071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.890 × 10⁹⁵(96-digit number)
68905994083564194994…46554103514924142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.378 × 10⁹⁶(97-digit number)
13781198816712838998…93108207029848284161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.756 × 10⁹⁶(97-digit number)
27562397633425677997…86216414059696568321
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,892,093 XPM·at block #6,830,993 · 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