Block #2,649,477

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2018, 6:52:04 AM · Difficulty 11.7637 · 4,182,194 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c9846af200823d0d0ec140e7571d3f1cddedef6ae79ea20c0dd05b5df4598d63

Height

#2,649,477

Difficulty

11.763696

Transactions

2

Size

1018 B

Version

2

Bits

0bc3819d

Nonce

147,301,077

Timestamp

5/5/2018, 6:52:04 AM

Confirmations

4,182,194

Merkle Root

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

1.455 × 10⁹⁴(95-digit number)
14551623165308033561…21061172101546921121
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
1.455 × 10⁹⁴(95-digit number)
14551623165308033561…21061172101546921121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.910 × 10⁹⁴(95-digit number)
29103246330616067123…42122344203093842241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.820 × 10⁹⁴(95-digit number)
58206492661232134246…84244688406187684481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.164 × 10⁹⁵(96-digit number)
11641298532246426849…68489376812375368961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.328 × 10⁹⁵(96-digit number)
23282597064492853698…36978753624750737921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.656 × 10⁹⁵(96-digit number)
46565194128985707397…73957507249501475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.313 × 10⁹⁵(96-digit number)
93130388257971414794…47915014499002951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.862 × 10⁹⁶(97-digit number)
18626077651594282958…95830028998005903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.725 × 10⁹⁶(97-digit number)
37252155303188565917…91660057996011806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.450 × 10⁹⁶(97-digit number)
74504310606377131835…83320115992023613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.490 × 10⁹⁷(98-digit number)
14900862121275426367…66640231984047226881
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,473 XPM·at block #6,831,670 · 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