Block #2,825,828

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/5/2018, 12:46:07 PM · Difficulty 11.7101 · 4,011,085 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
98bfa7fe10f549b15bcf7ce8eba63d320699cef14fc89352dca36e70af8a050e

Height

#2,825,828

Difficulty

11.710129

Transactions

3

Size

845 B

Version

2

Bits

0bb5cafe

Nonce

56,277,162

Timestamp

9/5/2018, 12:46:07 PM

Confirmations

4,011,085

Merkle Root

106f39ddfd2a93c8e539e07a67b285d117891ee353900c34505afb4c6e569040
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.

4.214 × 10⁹³(94-digit number)
42143876934423531422…03954241505917202181
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
4.214 × 10⁹³(94-digit number)
42143876934423531422…03954241505917202181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.428 × 10⁹³(94-digit number)
84287753868847062844…07908483011834404361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.685 × 10⁹⁴(95-digit number)
16857550773769412568…15816966023668808721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.371 × 10⁹⁴(95-digit number)
33715101547538825137…31633932047337617441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.743 × 10⁹⁴(95-digit number)
67430203095077650275…63267864094675234881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.348 × 10⁹⁵(96-digit number)
13486040619015530055…26535728189350469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.697 × 10⁹⁵(96-digit number)
26972081238031060110…53071456378700939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.394 × 10⁹⁵(96-digit number)
53944162476062120220…06142912757401879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.078 × 10⁹⁶(97-digit number)
10788832495212424044…12285825514803758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.157 × 10⁹⁶(97-digit number)
21577664990424848088…24571651029607516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.315 × 10⁹⁶(97-digit number)
43155329980849696176…49143302059215032321
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,939,598 XPM·at block #6,836,912 · 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