Block #2,855,605

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/26/2018, 8:45:49 AM · Difficulty 11.6981 · 3,976,120 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61e6ec65a0d0a0bf1d0ff531a306a4e74b55ce73d5c69dd54b6cbcdfeab980cc

Height

#2,855,605

Difficulty

11.698091

Transactions

2

Size

1.14 KB

Version

2

Bits

0bb2b61b

Nonce

2,034,071,270

Timestamp

9/26/2018, 8:45:49 AM

Confirmations

3,976,120

Merkle Root

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

4.120 × 10⁹⁴(95-digit number)
41200380938053620591…65664876911595908801
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
4.120 × 10⁹⁴(95-digit number)
41200380938053620591…65664876911595908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.240 × 10⁹⁴(95-digit number)
82400761876107241183…31329753823191817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.648 × 10⁹⁵(96-digit number)
16480152375221448236…62659507646383635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.296 × 10⁹⁵(96-digit number)
32960304750442896473…25319015292767270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.592 × 10⁹⁵(96-digit number)
65920609500885792947…50638030585534540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.318 × 10⁹⁶(97-digit number)
13184121900177158589…01276061171069081601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.636 × 10⁹⁶(97-digit number)
26368243800354317178…02552122342138163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.273 × 10⁹⁶(97-digit number)
52736487600708634357…05104244684276326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.054 × 10⁹⁷(98-digit number)
10547297520141726871…10208489368552652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.109 × 10⁹⁷(98-digit number)
21094595040283453743…20416978737105305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.218 × 10⁹⁷(98-digit number)
42189190080566907486…40833957474210611201
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,897,903 XPM·at block #6,831,724 · 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