Block #2,556,519

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2018, 5:12:37 AM · Difficulty 10.9912 · 4,259,963 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
623c59a8c38b008bd883eef85ace4c6573ed01999dfb62043599cae7401a6d28

Height

#2,556,519

Difficulty

10.991167

Transactions

30

Size

5.89 KB

Version

2

Bits

0afdbd1c

Nonce

884,294,454

Timestamp

3/9/2018, 5:12:37 AM

Confirmations

4,259,963

Merkle Root

86c425f699ecf22e1394fe27dcf158db8892a021d2b75f248642cb69b8528e0e
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.

2.663 × 10⁹⁴(95-digit number)
26635608178968796870…52778967388979298039
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
2.663 × 10⁹⁴(95-digit number)
26635608178968796870…52778967388979298039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.327 × 10⁹⁴(95-digit number)
53271216357937593741…05557934777958596079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.065 × 10⁹⁵(96-digit number)
10654243271587518748…11115869555917192159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.130 × 10⁹⁵(96-digit number)
21308486543175037496…22231739111834384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.261 × 10⁹⁵(96-digit number)
42616973086350074993…44463478223668768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.523 × 10⁹⁵(96-digit number)
85233946172700149986…88926956447337537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.704 × 10⁹⁶(97-digit number)
17046789234540029997…77853912894675074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.409 × 10⁹⁶(97-digit number)
34093578469080059994…55707825789350149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.818 × 10⁹⁶(97-digit number)
68187156938160119989…11415651578700298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.363 × 10⁹⁷(98-digit number)
13637431387632023997…22831303157400596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.727 × 10⁹⁷(98-digit number)
27274862775264047995…45662606314801192959
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,775,987 XPM·at block #6,816,481 · 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