Block #2,642,271

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 4:09:07 PM · Difficulty 11.6481 · 4,199,849 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c1fa37b4f4a59fd865bffe34c1169dbc604d4bce0c012c6c91a18f9ce6279ab3

Height

#2,642,271

Difficulty

11.648078

Transactions

4

Size

6.17 KB

Version

2

Bits

0ba5e871

Nonce

584,083,613

Timestamp

5/1/2018, 4:09:07 PM

Confirmations

4,199,849

Merkle Root

3869289489c2d7a46fbaebf5ffa9b38e00c601601ea33aa1c7e5956de2c6c1a1
Transactions (4)
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.

3.687 × 10⁹³(94-digit number)
36877429864525495217…19692788341401039971
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
3.687 × 10⁹³(94-digit number)
36877429864525495217…19692788341401039971
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.375 × 10⁹³(94-digit number)
73754859729050990435…39385576682802079941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.475 × 10⁹⁴(95-digit number)
14750971945810198087…78771153365604159881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.950 × 10⁹⁴(95-digit number)
29501943891620396174…57542306731208319761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.900 × 10⁹⁴(95-digit number)
59003887783240792348…15084613462416639521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.180 × 10⁹⁵(96-digit number)
11800777556648158469…30169226924833279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.360 × 10⁹⁵(96-digit number)
23601555113296316939…60338453849666558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.720 × 10⁹⁵(96-digit number)
47203110226592633878…20676907699333116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.440 × 10⁹⁵(96-digit number)
94406220453185267757…41353815398666232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.888 × 10⁹⁶(97-digit number)
18881244090637053551…82707630797332464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.776 × 10⁹⁶(97-digit number)
37762488181274107102…65415261594664929281
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,981,347 XPM·at block #6,842,119 · 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