Block #2,559,007

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2018, 5:45:46 PM · Difficulty 10.9917 · 4,258,086 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3eedb75a18656ac1a74b6270213973b5cd0ec4575afe0426650243dd0157d108

Height

#2,559,007

Difficulty

10.991740

Transactions

51

Size

13.84 KB

Version

2

Bits

0afde2aa

Nonce

1,390,778

Timestamp

3/10/2018, 5:45:46 PM

Confirmations

4,258,086

Merkle Root

38781573190e170bb5642b1fa49963cb40411a607f1397a62e97f087892ddcfa
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.096 × 10⁹⁶(97-digit number)
10966840652777327918…82795791800524812159
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.096 × 10⁹⁶(97-digit number)
10966840652777327918…82795791800524812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.193 × 10⁹⁶(97-digit number)
21933681305554655836…65591583601049624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.386 × 10⁹⁶(97-digit number)
43867362611109311672…31183167202099248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.773 × 10⁹⁶(97-digit number)
87734725222218623345…62366334404198497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.754 × 10⁹⁷(98-digit number)
17546945044443724669…24732668808396994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.509 × 10⁹⁷(98-digit number)
35093890088887449338…49465337616793989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.018 × 10⁹⁷(98-digit number)
70187780177774898676…98930675233587978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.403 × 10⁹⁸(99-digit number)
14037556035554979735…97861350467175956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.807 × 10⁹⁸(99-digit number)
28075112071109959470…95722700934351912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.615 × 10⁹⁸(99-digit number)
56150224142219918941…91445401868703825919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.123 × 10⁹⁹(100-digit number)
11230044828443983788…82890803737407651839
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,780,781 XPM·at block #6,817,092 · 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