Block #2,479,150

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2018, 6:06:39 PM · Difficulty 10.9658 · 4,365,449 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f8f46b850061e398486b70ace1163b7b3cbf588bbb34552fce0f0f2f8e4a1dc5

Height

#2,479,150

Difficulty

10.965845

Transactions

6

Size

2.75 KB

Version

2

Bits

0af7419a

Nonce

185,158,917

Timestamp

1/18/2018, 6:06:39 PM

Confirmations

4,365,449

Merkle Root

bd507cb7cccc2ffb5368e3a03e26515be5874a87eb48c732abcd665dff7e4340
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.212 × 10⁹⁵(96-digit number)
12125538826874617099…25389030165195871239
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.212 × 10⁹⁵(96-digit number)
12125538826874617099…25389030165195871239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.425 × 10⁹⁵(96-digit number)
24251077653749234199…50778060330391742479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.850 × 10⁹⁵(96-digit number)
48502155307498468399…01556120660783484959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.700 × 10⁹⁵(96-digit number)
97004310614996936798…03112241321566969919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.940 × 10⁹⁶(97-digit number)
19400862122999387359…06224482643133939839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.880 × 10⁹⁶(97-digit number)
38801724245998774719…12448965286267879679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.760 × 10⁹⁶(97-digit number)
77603448491997549438…24897930572535759359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.552 × 10⁹⁷(98-digit number)
15520689698399509887…49795861145071518719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.104 × 10⁹⁷(98-digit number)
31041379396799019775…99591722290143037439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.208 × 10⁹⁷(98-digit number)
62082758793598039551…99183444580286074879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.241 × 10⁹⁸(99-digit number)
12416551758719607910…98366889160572149759
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:58,001,202 XPM·at block #6,844,598 · 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