Block #2,680,985

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2018, 2:31:55 AM · Difficulty 11.6923 · 4,152,225 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c600c33cc70d90fffc93e7610a567274bb265bc3c364034ca28b127b8bf38c89

Height

#2,680,985

Difficulty

11.692288

Transactions

4

Size

1.84 KB

Version

2

Bits

0bb139cf

Nonce

183,444,764

Timestamp

5/28/2018, 2:31:55 AM

Confirmations

4,152,225

Merkle Root

d144497d21bf6f3e728728b8393192afcea1200faa5262f4276e4eab76362e71
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.366 × 10⁹³(94-digit number)
13662015143193667285…10579863602276783759
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.366 × 10⁹³(94-digit number)
13662015143193667285…10579863602276783759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.732 × 10⁹³(94-digit number)
27324030286387334571…21159727204553567519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.464 × 10⁹³(94-digit number)
54648060572774669143…42319454409107135039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.092 × 10⁹⁴(95-digit number)
10929612114554933828…84638908818214270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.185 × 10⁹⁴(95-digit number)
21859224229109867657…69277817636428540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.371 × 10⁹⁴(95-digit number)
43718448458219735314…38555635272857080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.743 × 10⁹⁴(95-digit number)
87436896916439470629…77111270545714160639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.748 × 10⁹⁵(96-digit number)
17487379383287894125…54222541091428321279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.497 × 10⁹⁵(96-digit number)
34974758766575788251…08445082182856642559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.994 × 10⁹⁵(96-digit number)
69949517533151576503…16890164365713285119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.398 × 10⁹⁶(97-digit number)
13989903506630315300…33780328731426570239
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,909,865 XPM·at block #6,833,209 · 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