Block #2,860,263

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/29/2018, 8:27:47 PM · Difficulty 11.6757 · 3,982,631 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
696fff7160030082d5544d702aa12aaf175d181e54f69815dcdc5f5d6528927d

Height

#2,860,263

Difficulty

11.675719

Transactions

5

Size

1.60 KB

Version

2

Bits

0bacfbec

Nonce

1,603,118,113

Timestamp

9/29/2018, 8:27:47 PM

Confirmations

3,982,631

Merkle Root

8a59af7d8bdc49c763b2a76c17f41873cf065c61d206e7a4e6e33fb21b2ae385
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.

3.435 × 10⁹³(94-digit number)
34350620986399147362…49309192385303472639
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
3.435 × 10⁹³(94-digit number)
34350620986399147362…49309192385303472639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.870 × 10⁹³(94-digit number)
68701241972798294725…98618384770606945279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.374 × 10⁹⁴(95-digit number)
13740248394559658945…97236769541213890559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.748 × 10⁹⁴(95-digit number)
27480496789119317890…94473539082427781119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.496 × 10⁹⁴(95-digit number)
54960993578238635780…88947078164855562239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.099 × 10⁹⁵(96-digit number)
10992198715647727156…77894156329711124479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.198 × 10⁹⁵(96-digit number)
21984397431295454312…55788312659422248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.396 × 10⁹⁵(96-digit number)
43968794862590908624…11576625318844497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.793 × 10⁹⁵(96-digit number)
87937589725181817248…23153250637688995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.758 × 10⁹⁶(97-digit number)
17587517945036363449…46306501275377991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.517 × 10⁹⁶(97-digit number)
35175035890072726899…92613002550755983359
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,987,499 XPM·at block #6,842,893 · 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