Block #2,740,529

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/9/2018, 4:35:47 AM · Difficulty 11.6223 · 4,102,417 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8268dc63ee3f44b7e1abd007bdc9f16742d6c582cd0807f3c0ec90113862975

Height

#2,740,529

Difficulty

11.622346

Transactions

4

Size

843 B

Version

2

Bits

0b9f520f

Nonce

2,104,169,139

Timestamp

7/9/2018, 4:35:47 AM

Confirmations

4,102,417

Merkle Root

abe73dad86b61f70eab1e5e152facc55d094d578d3e7f4c2e38957f62dfc32b5
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.992 × 10⁹²(93-digit number)
39924703246631981077…78654574895421113279
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.992 × 10⁹²(93-digit number)
39924703246631981077…78654574895421113279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.984 × 10⁹²(93-digit number)
79849406493263962155…57309149790842226559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.596 × 10⁹³(94-digit number)
15969881298652792431…14618299581684453119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.193 × 10⁹³(94-digit number)
31939762597305584862…29236599163368906239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.387 × 10⁹³(94-digit number)
63879525194611169724…58473198326737812479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.277 × 10⁹⁴(95-digit number)
12775905038922233944…16946396653475624959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.555 × 10⁹⁴(95-digit number)
25551810077844467889…33892793306951249919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.110 × 10⁹⁴(95-digit number)
51103620155688935779…67785586613902499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.022 × 10⁹⁵(96-digit number)
10220724031137787155…35571173227804999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.044 × 10⁹⁵(96-digit number)
20441448062275574311…71142346455609999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.088 × 10⁹⁵(96-digit number)
40882896124551148623…42284692911219998719
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,987,919 XPM·at block #6,842,945 · 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