Block #2,635,572

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2018, 7:07:17 AM · Difficulty 11.3255 · 4,204,718 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b3484e7274411a4be0cd704060766260b5a0c42e53bbd2571c343182ab275410

Height

#2,635,572

Difficulty

11.325479

Transactions

78

Size

22.56 KB

Version

2

Bits

0b535293

Nonce

814,355,231

Timestamp

4/29/2018, 7:07:17 AM

Confirmations

4,204,718

Merkle Root

eb6b6feaf4894bd37e7a8d79caff2fc7414ea01b2bc472f54bd032754fa02ee4
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.

6.442 × 10⁹³(94-digit number)
64424639144159002243…13785396949137407999
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
6.442 × 10⁹³(94-digit number)
64424639144159002243…13785396949137407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.288 × 10⁹⁴(95-digit number)
12884927828831800448…27570793898274815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.576 × 10⁹⁴(95-digit number)
25769855657663600897…55141587796549631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.153 × 10⁹⁴(95-digit number)
51539711315327201795…10283175593099263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.030 × 10⁹⁵(96-digit number)
10307942263065440359…20566351186198527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.061 × 10⁹⁵(96-digit number)
20615884526130880718…41132702372397055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.123 × 10⁹⁵(96-digit number)
41231769052261761436…82265404744794111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.246 × 10⁹⁵(96-digit number)
82463538104523522872…64530809489588223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.649 × 10⁹⁶(97-digit number)
16492707620904704574…29061618979176447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.298 × 10⁹⁶(97-digit number)
32985415241809409148…58123237958352895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.597 × 10⁹⁶(97-digit number)
65970830483618818297…16246475916705791999
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,966,637 XPM·at block #6,840,289 · 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