Block #2,656,530

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2018, 3:40:11 AM · Difficulty 11.6888 · 4,179,813 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4d9c2c29c73a5ae29d8c6575ff630bac01af6510835bd5dfb9370a66f037ace0

Height

#2,656,530

Difficulty

11.688797

Transactions

6

Size

3.88 KB

Version

2

Bits

0bb05501

Nonce

1,192,558,709

Timestamp

5/11/2018, 3:40:11 AM

Confirmations

4,179,813

Merkle Root

7cdc0f23e3c30032a73866e2bddaaa216941325d666a75895205369b17c42918
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.043 × 10⁹⁴(95-digit number)
10435786853039648924…52340901470513891239
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.043 × 10⁹⁴(95-digit number)
10435786853039648924…52340901470513891239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.087 × 10⁹⁴(95-digit number)
20871573706079297849…04681802941027782479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.174 × 10⁹⁴(95-digit number)
41743147412158595698…09363605882055564959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.348 × 10⁹⁴(95-digit number)
83486294824317191396…18727211764111129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.669 × 10⁹⁵(96-digit number)
16697258964863438279…37454423528222259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.339 × 10⁹⁵(96-digit number)
33394517929726876558…74908847056444519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.678 × 10⁹⁵(96-digit number)
66789035859453753117…49817694112889039359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.335 × 10⁹⁶(97-digit number)
13357807171890750623…99635388225778078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.671 × 10⁹⁶(97-digit number)
26715614343781501246…99270776451556157439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.343 × 10⁹⁶(97-digit number)
53431228687563002493…98541552903112314879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.068 × 10⁹⁷(98-digit number)
10686245737512600498…97083105806224629759
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,935,002 XPM·at block #6,836,342 · 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