Block #2,567,721

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2018, 9:45:59 PM · Difficulty 10.9938 · 4,275,628 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
856fec2fc41a046dcd9428e7ebf92a318b8ee550df1cdd326a638939e8e70bee

Height

#2,567,721

Difficulty

10.993815

Transactions

10

Size

4.63 KB

Version

2

Bits

0afe6aae

Nonce

11,801,762

Timestamp

3/15/2018, 9:45:59 PM

Confirmations

4,275,628

Merkle Root

d0bb5a60db56656fe213934aef974586949ae31f2767da8ca1427e7024e762b0
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.309 × 10⁹⁵(96-digit number)
13099695627744124519…59577746123960182159
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.309 × 10⁹⁵(96-digit number)
13099695627744124519…59577746123960182159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.619 × 10⁹⁵(96-digit number)
26199391255488249039…19155492247920364319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.239 × 10⁹⁵(96-digit number)
52398782510976498079…38310984495840728639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.047 × 10⁹⁶(97-digit number)
10479756502195299615…76621968991681457279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.095 × 10⁹⁶(97-digit number)
20959513004390599231…53243937983362914559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.191 × 10⁹⁶(97-digit number)
41919026008781198463…06487875966725829119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.383 × 10⁹⁶(97-digit number)
83838052017562396927…12975751933451658239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.676 × 10⁹⁷(98-digit number)
16767610403512479385…25951503866903316479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.353 × 10⁹⁷(98-digit number)
33535220807024958770…51903007733806632959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.707 × 10⁹⁷(98-digit number)
67070441614049917541…03806015467613265919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.341 × 10⁹⁸(99-digit number)
13414088322809983508…07612030935226531839
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,991,153 XPM·at block #6,843,348 · 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