Block #2,643,153

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 12:08:21 AM · Difficulty 11.6752 · 4,188,831 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54d3785907bed1d23c1ffa7b46b599311c33ca1d04e737eb7cf64ef91c7d9947

Height

#2,643,153

Difficulty

11.675168

Transactions

7

Size

1.97 KB

Version

2

Bits

0bacd7cf

Nonce

640,515,333

Timestamp

5/2/2018, 12:08:21 AM

Confirmations

4,188,831

Merkle Root

c8056f4053155382a74fa381f5e0ffbde90025c5458d0f6a90bbe79316ae6f85
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.674 × 10⁹³(94-digit number)
26749264380839116054…90556169584167601161
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.674 × 10⁹³(94-digit number)
26749264380839116054…90556169584167601161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.349 × 10⁹³(94-digit number)
53498528761678232108…81112339168335202321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.069 × 10⁹⁴(95-digit number)
10699705752335646421…62224678336670404641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.139 × 10⁹⁴(95-digit number)
21399411504671292843…24449356673340809281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.279 × 10⁹⁴(95-digit number)
42798823009342585687…48898713346681618561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.559 × 10⁹⁴(95-digit number)
85597646018685171374…97797426693363237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.711 × 10⁹⁵(96-digit number)
17119529203737034274…95594853386726474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.423 × 10⁹⁵(96-digit number)
34239058407474068549…91189706773452948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.847 × 10⁹⁵(96-digit number)
68478116814948137099…82379413546905896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.369 × 10⁹⁶(97-digit number)
13695623362989627419…64758827093811793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.739 × 10⁹⁶(97-digit number)
27391246725979254839…29517654187623587841
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,899,996 XPM·at block #6,831,983 · 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