Block #2,625,920

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2018, 3:41:12 AM · Difficulty 11.2081 · 4,217,729 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f312645360def1f21007e539991f71bdd3b0e7fd224386881c5da9424d6d679

Height

#2,625,920

Difficulty

11.208081

Transactions

32

Size

7.13 KB

Version

2

Bits

0b3544c7

Nonce

1,492,353,582

Timestamp

4/23/2018, 3:41:12 AM

Confirmations

4,217,729

Merkle Root

f2e47b62afb3c93accea234558c5efacd9824dad8a7de297060220eea2011fc6
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.709 × 10⁹⁴(95-digit number)
27095757619928775814…41231417419657498199
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.709 × 10⁹⁴(95-digit number)
27095757619928775814…41231417419657498199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.419 × 10⁹⁴(95-digit number)
54191515239857551629…82462834839314996399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.083 × 10⁹⁵(96-digit number)
10838303047971510325…64925669678629992799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.167 × 10⁹⁵(96-digit number)
21676606095943020651…29851339357259985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.335 × 10⁹⁵(96-digit number)
43353212191886041303…59702678714519971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.670 × 10⁹⁵(96-digit number)
86706424383772082607…19405357429039942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.734 × 10⁹⁶(97-digit number)
17341284876754416521…38810714858079884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.468 × 10⁹⁶(97-digit number)
34682569753508833043…77621429716159769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.936 × 10⁹⁶(97-digit number)
69365139507017666086…55242859432319539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.387 × 10⁹⁷(98-digit number)
13873027901403533217…10485718864639078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.774 × 10⁹⁷(98-digit number)
27746055802807066434…20971437729278156799
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,993,562 XPM·at block #6,843,648 · 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