Block #2,846,857

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/19/2018, 9:09:01 PM · Difficulty 11.7312 · 3,998,104 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6f2ead75c41412b956d4a71cdba2d6ff14bf580b7dc7d5aa6fa67ce1821aeccb

Height

#2,846,857

Difficulty

11.731218

Transactions

3

Size

1.40 KB

Version

2

Bits

0bbb3119

Nonce

568,570,422

Timestamp

9/19/2018, 9:09:01 PM

Confirmations

3,998,104

Merkle Root

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

5.309 × 10⁹²(93-digit number)
53097675407082571523…93061073873406269601
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
5.309 × 10⁹²(93-digit number)
53097675407082571523…93061073873406269601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.061 × 10⁹³(94-digit number)
10619535081416514304…86122147746812539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.123 × 10⁹³(94-digit number)
21239070162833028609…72244295493625078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.247 × 10⁹³(94-digit number)
42478140325666057218…44488590987250156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.495 × 10⁹³(94-digit number)
84956280651332114437…88977181974500313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.699 × 10⁹⁴(95-digit number)
16991256130266422887…77954363949000627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.398 × 10⁹⁴(95-digit number)
33982512260532845774…55908727898001254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.796 × 10⁹⁴(95-digit number)
67965024521065691549…11817455796002508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.359 × 10⁹⁵(96-digit number)
13593004904213138309…23634911592005017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.718 × 10⁹⁵(96-digit number)
27186009808426276619…47269823184010035201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.437 × 10⁹⁵(96-digit number)
54372019616852553239…94539646368020070401
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:58,004,106 XPM·at block #6,844,960 · 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