Block #2,632,463

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2018, 8:26:16 PM · Difficulty 11.1730 · 4,200,544 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
533cb2d1f991505583e1c0333377fce926111b3e4ba3f59da98ea6f90cd41243

Height

#2,632,463

Difficulty

11.172961

Transactions

5

Size

1.30 KB

Version

2

Bits

0b2c472a

Nonce

1,245,455,242

Timestamp

4/27/2018, 8:26:16 PM

Confirmations

4,200,544

Merkle Root

4cce16e080545f29f22a27465e2b1d6e5bef9ae913634063e982386c68060fc3
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.

8.304 × 10⁹⁵(96-digit number)
83047126372999294416…28335933331554928319
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
8.304 × 10⁹⁵(96-digit number)
83047126372999294416…28335933331554928319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.660 × 10⁹⁶(97-digit number)
16609425274599858883…56671866663109856639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.321 × 10⁹⁶(97-digit number)
33218850549199717766…13343733326219713279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.643 × 10⁹⁶(97-digit number)
66437701098399435533…26687466652439426559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.328 × 10⁹⁷(98-digit number)
13287540219679887106…53374933304878853119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.657 × 10⁹⁷(98-digit number)
26575080439359774213…06749866609757706239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.315 × 10⁹⁷(98-digit number)
53150160878719548426…13499733219515412479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.063 × 10⁹⁸(99-digit number)
10630032175743909685…26999466439030824959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.126 × 10⁹⁸(99-digit number)
21260064351487819370…53998932878061649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.252 × 10⁹⁸(99-digit number)
42520128702975638741…07997865756123299839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.504 × 10⁹⁸(99-digit number)
85040257405951277482…15995731512246599679
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,908,230 XPM·at block #6,833,006 · 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