Block #2,643,400

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 2:27:35 AM · Difficulty 11.6821 · 4,187,266 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0b7f86a8b577b093324d3a57480dfcaa1122ae9fe0a6cff1e09b8aa6ce0d67a

Height

#2,643,400

Difficulty

11.682102

Transactions

7

Size

1.60 KB

Version

2

Bits

0bae9e38

Nonce

67,266,475

Timestamp

5/2/2018, 2:27:35 AM

Confirmations

4,187,266

Merkle Root

8b1a6c2e5b3c8489ea5ee2cb334d3639f3169ea2846cb1533efa90d20d20ab9e
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.300 × 10⁹⁴(95-digit number)
43002611281421187095…34915778582161314881
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.300 × 10⁹⁴(95-digit number)
43002611281421187095…34915778582161314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.600 × 10⁹⁴(95-digit number)
86005222562842374191…69831557164322629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.720 × 10⁹⁵(96-digit number)
17201044512568474838…39663114328645259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.440 × 10⁹⁵(96-digit number)
34402089025136949676…79326228657290519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.880 × 10⁹⁵(96-digit number)
68804178050273899353…58652457314581038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.376 × 10⁹⁶(97-digit number)
13760835610054779870…17304914629162076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.752 × 10⁹⁶(97-digit number)
27521671220109559741…34609829258324152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.504 × 10⁹⁶(97-digit number)
55043342440219119482…69219658516648304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.100 × 10⁹⁷(98-digit number)
11008668488043823896…38439317033296609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.201 × 10⁹⁷(98-digit number)
22017336976087647793…76878634066593218561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.403 × 10⁹⁷(98-digit number)
44034673952175295586…53757268133186437121
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,889,456 XPM·at block #6,830,665 · 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