Block #1,457,817

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2016, 9:03:30 AM · Difficulty 10.7595 · 5,387,530 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
acfbed886798afd829da0a5a8986cd7c98a9c1aceba2ea0f8f4c30fb792c21ac

Height

#1,457,817

Difficulty

10.759493

Transactions

2

Size

970 B

Version

2

Bits

0ac26e1a

Nonce

265,274,650

Timestamp

2/15/2016, 9:03:30 AM

Confirmations

5,387,530

Merkle Root

7aa0438b88521e7bca40e54cdf1a1330b143bfcc65ebf16c708c56465fa524d1
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.530 × 10⁹⁴(95-digit number)
25307068710665345424…61009406837383743999
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.530 × 10⁹⁴(95-digit number)
25307068710665345424…61009406837383743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.061 × 10⁹⁴(95-digit number)
50614137421330690848…22018813674767487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.012 × 10⁹⁵(96-digit number)
10122827484266138169…44037627349534975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.024 × 10⁹⁵(96-digit number)
20245654968532276339…88075254699069951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.049 × 10⁹⁵(96-digit number)
40491309937064552678…76150509398139903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.098 × 10⁹⁵(96-digit number)
80982619874129105357…52301018796279807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.619 × 10⁹⁶(97-digit number)
16196523974825821071…04602037592559615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.239 × 10⁹⁶(97-digit number)
32393047949651642142…09204075185119231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.478 × 10⁹⁶(97-digit number)
64786095899303284285…18408150370238463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.295 × 10⁹⁷(98-digit number)
12957219179860656857…36816300740476927999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,007,218 XPM·at block #6,845,346 · 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