Block #2,829,080

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/7/2018, 6:39:11 PM · Difficulty 11.7113 · 4,013,117 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f555f0be3e456fe8ccd318582ab385583dce1fcf56a017c10a82678a513b7fa5

Height

#2,829,080

Difficulty

11.711302

Transactions

8

Size

2.92 KB

Version

2

Bits

0bb617dc

Nonce

96,018,361

Timestamp

9/7/2018, 6:39:11 PM

Confirmations

4,013,117

Merkle Root

d935b78be7aa017e701be3c9da664c79ff4bb63d3191005023872a5a811407f7
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.

5.136 × 10⁹⁴(95-digit number)
51363218261754537344…80452891786497715201
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
5.136 × 10⁹⁴(95-digit number)
51363218261754537344…80452891786497715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.027 × 10⁹⁵(96-digit number)
10272643652350907468…60905783572995430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.054 × 10⁹⁵(96-digit number)
20545287304701814937…21811567145990860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.109 × 10⁹⁵(96-digit number)
41090574609403629875…43623134291981721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.218 × 10⁹⁵(96-digit number)
82181149218807259751…87246268583963443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.643 × 10⁹⁶(97-digit number)
16436229843761451950…74492537167926886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.287 × 10⁹⁶(97-digit number)
32872459687522903900…48985074335853772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.574 × 10⁹⁶(97-digit number)
65744919375045807801…97970148671707545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.314 × 10⁹⁷(98-digit number)
13148983875009161560…95940297343415091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.629 × 10⁹⁷(98-digit number)
26297967750018323120…91880594686830182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.259 × 10⁹⁷(98-digit number)
52595935500036646241…83761189373660364801
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,981,970 XPM·at block #6,842,196 · 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