Block #2,785,136

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2018, 5:07:49 PM · Difficulty 11.6698 · 4,060,255 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab9ff077d8e88a6c302923ae01b5a23f1f455083b32842010e09b4bff34f5fc7

Height

#2,785,136

Difficulty

11.669793

Transactions

10

Size

3.59 KB

Version

2

Bits

0bab778b

Nonce

1,207,687,129

Timestamp

8/8/2018, 5:07:49 PM

Confirmations

4,060,255

Merkle Root

851c89f06f64c12d7439624146a25a32d8fb63457cb3f99244d91ecd0924c218
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.702 × 10⁹⁵(96-digit number)
17022995605562806542…29529513605399070201
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.702 × 10⁹⁵(96-digit number)
17022995605562806542…29529513605399070201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.404 × 10⁹⁵(96-digit number)
34045991211125613084…59059027210798140401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.809 × 10⁹⁵(96-digit number)
68091982422251226168…18118054421596280801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.361 × 10⁹⁶(97-digit number)
13618396484450245233…36236108843192561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.723 × 10⁹⁶(97-digit number)
27236792968900490467…72472217686385123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.447 × 10⁹⁶(97-digit number)
54473585937800980934…44944435372770246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.089 × 10⁹⁷(98-digit number)
10894717187560196186…89888870745540492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.178 × 10⁹⁷(98-digit number)
21789434375120392373…79777741491080985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.357 × 10⁹⁷(98-digit number)
43578868750240784747…59555482982161971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.715 × 10⁹⁷(98-digit number)
87157737500481569495…19110965964323942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.743 × 10⁹⁸(99-digit number)
17431547500096313899…38221931928647884801
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,007,574 XPM·at block #6,845,390 · 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