Block #2,785,369

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2018, 8:49:34 PM · Difficulty 11.6705 · 4,052,688 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dfa9a5f66ac7e9409c87f83ccf146601a8c25cf1cc34bb95b172fa88180fa700

Height

#2,785,369

Difficulty

11.670525

Transactions

2

Size

424 B

Version

2

Bits

0baba786

Nonce

565,039,783

Timestamp

8/8/2018, 8:49:34 PM

Confirmations

4,052,688

Merkle Root

332818fda9ae76e4760e223d86ccae2f81fff9fe6ffcaec3885a69bf25cf00bd
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.

7.981 × 10⁹²(93-digit number)
79819056273486780595…41734884830103581621
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
7.981 × 10⁹²(93-digit number)
79819056273486780595…41734884830103581621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.596 × 10⁹³(94-digit number)
15963811254697356119…83469769660207163241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.192 × 10⁹³(94-digit number)
31927622509394712238…66939539320414326481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.385 × 10⁹³(94-digit number)
63855245018789424476…33879078640828652961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.277 × 10⁹⁴(95-digit number)
12771049003757884895…67758157281657305921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.554 × 10⁹⁴(95-digit number)
25542098007515769790…35516314563314611841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.108 × 10⁹⁴(95-digit number)
51084196015031539580…71032629126629223681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.021 × 10⁹⁵(96-digit number)
10216839203006307916…42065258253258447361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.043 × 10⁹⁵(96-digit number)
20433678406012615832…84130516506516894721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.086 × 10⁹⁵(96-digit number)
40867356812025231664…68261033013033789441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.173 × 10⁹⁵(96-digit number)
81734713624050463329…36522066026067578881
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,948,810 XPM·at block #6,838,056 · 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