Block #1,286,991

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/18/2015, 4:03:41 AM · Difficulty 10.8416 · 5,529,338 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
612b3886747127fe9753043761292708778a919bc4ff4370dea295205f5e7f1e

Height

#1,286,991

Difficulty

10.841589

Transactions

2

Size

970 B

Version

2

Bits

0ad77268

Nonce

616,439,110

Timestamp

10/18/2015, 4:03:41 AM

Confirmations

5,529,338

Merkle Root

514fcd0239c1bb4a63dab0f8896bf8f4171053ada59e430d8c1d9fb30d0acea9
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.754 × 10⁹⁴(95-digit number)
87542615746460383105…09759546658281839999
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.754 × 10⁹⁴(95-digit number)
87542615746460383105…09759546658281839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.750 × 10⁹⁵(96-digit number)
17508523149292076621…19519093316563679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.501 × 10⁹⁵(96-digit number)
35017046298584153242…39038186633127359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.003 × 10⁹⁵(96-digit number)
70034092597168306484…78076373266254719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.400 × 10⁹⁶(97-digit number)
14006818519433661296…56152746532509439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.801 × 10⁹⁶(97-digit number)
28013637038867322593…12305493065018879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.602 × 10⁹⁶(97-digit number)
56027274077734645187…24610986130037759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.120 × 10⁹⁷(98-digit number)
11205454815546929037…49221972260075519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.241 × 10⁹⁷(98-digit number)
22410909631093858075…98443944520151039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.482 × 10⁹⁷(98-digit number)
44821819262187716150…96887889040302079999
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:57,774,753 XPM·at block #6,816,328 · 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