Block #2,760,942

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2018, 1:52:17 AM · Difficulty 11.6530 · 4,082,211 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4e4af1a3610d590783fbf32659253b4ab5722ed6b3f2c80ff0d70370f728b498

Height

#2,760,942

Difficulty

11.653000

Transactions

4

Size

1.38 KB

Version

2

Bits

0ba72b09

Nonce

715,348,617

Timestamp

7/23/2018, 1:52:17 AM

Confirmations

4,082,211

Merkle Root

47d94cf75689659923c17fbde099c563df99b158a3aa95a3334f66b6cdb7dcfc
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.788 × 10⁹⁴(95-digit number)
17883070564045853111…29958590594787550721
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.788 × 10⁹⁴(95-digit number)
17883070564045853111…29958590594787550721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.576 × 10⁹⁴(95-digit number)
35766141128091706223…59917181189575101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.153 × 10⁹⁴(95-digit number)
71532282256183412447…19834362379150202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.430 × 10⁹⁵(96-digit number)
14306456451236682489…39668724758300405761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.861 × 10⁹⁵(96-digit number)
28612912902473364979…79337449516600811521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.722 × 10⁹⁵(96-digit number)
57225825804946729958…58674899033201623041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.144 × 10⁹⁶(97-digit number)
11445165160989345991…17349798066403246081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.289 × 10⁹⁶(97-digit number)
22890330321978691983…34699596132806492161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.578 × 10⁹⁶(97-digit number)
45780660643957383966…69399192265612984321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.156 × 10⁹⁶(97-digit number)
91561321287914767933…38798384531225968641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.831 × 10⁹⁷(98-digit number)
18312264257582953586…77596769062451937281
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,989,590 XPM·at block #6,843,152 · 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