Block #2,553,587

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2018, 12:19:05 PM · Difficulty 10.9902 · 4,288,439 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b012f749a39001680674212bdeea03a3015ef0f9091fcaa36e59a8f7cb49ec8e

Height

#2,553,587

Difficulty

10.990195

Transactions

7

Size

1.52 KB

Version

2

Bits

0afd7d6a

Nonce

370,108,356

Timestamp

3/7/2018, 12:19:05 PM

Confirmations

4,288,439

Merkle Root

072a39b9e2ec405fd92062a1a5acd87a3b494c2d284063f85d504ba1508e7e71
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.317 × 10⁹³(94-digit number)
13175335085491809014…21811975043159834879
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.317 × 10⁹³(94-digit number)
13175335085491809014…21811975043159834879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.635 × 10⁹³(94-digit number)
26350670170983618029…43623950086319669759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.270 × 10⁹³(94-digit number)
52701340341967236059…87247900172639339519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.054 × 10⁹⁴(95-digit number)
10540268068393447211…74495800345278679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.108 × 10⁹⁴(95-digit number)
21080536136786894423…48991600690557358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.216 × 10⁹⁴(95-digit number)
42161072273573788847…97983201381114716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.432 × 10⁹⁴(95-digit number)
84322144547147577694…95966402762229432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.686 × 10⁹⁵(96-digit number)
16864428909429515538…91932805524458864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.372 × 10⁹⁵(96-digit number)
33728857818859031077…83865611048917729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.745 × 10⁹⁵(96-digit number)
67457715637718062155…67731222097835458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.349 × 10⁹⁶(97-digit number)
13491543127543612431…35462444195670917119
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,980,594 XPM·at block #6,842,025 · 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