Block #2,783,124

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2018, 9:41:04 AM · Difficulty 11.6615 · 4,061,921 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b1ac2bdc593e16e745a94cb1b7138f79d971e58f8c2302d58997cfcc4769b4a3

Height

#2,783,124

Difficulty

11.661490

Transactions

30

Size

8.13 KB

Version

2

Bits

0ba95763

Nonce

641,968,551

Timestamp

8/7/2018, 9:41:04 AM

Confirmations

4,061,921

Merkle Root

5bd89250edc74beadff4770eca5cfaaef77e38a697817c3f10022b3b0d800a2f
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.163 × 10⁹⁴(95-digit number)
11638229450667913949…17677594217251248001
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.163 × 10⁹⁴(95-digit number)
11638229450667913949…17677594217251248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.327 × 10⁹⁴(95-digit number)
23276458901335827898…35355188434502496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.655 × 10⁹⁴(95-digit number)
46552917802671655797…70710376869004992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.310 × 10⁹⁴(95-digit number)
93105835605343311595…41420753738009984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.862 × 10⁹⁵(96-digit number)
18621167121068662319…82841507476019968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.724 × 10⁹⁵(96-digit number)
37242334242137324638…65683014952039936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.448 × 10⁹⁵(96-digit number)
74484668484274649276…31366029904079872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.489 × 10⁹⁶(97-digit number)
14896933696854929855…62732059808159744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.979 × 10⁹⁶(97-digit number)
29793867393709859710…25464119616319488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.958 × 10⁹⁶(97-digit number)
59587734787419719421…50928239232638976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.191 × 10⁹⁷(98-digit number)
11917546957483943884…01856478465277952001
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:58,004,783 XPM·at block #6,845,044 · 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