Block #1,317,617

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/7/2015, 11:15:58 PM · Difficulty 10.8623 · 5,507,037 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
819c996d27dfd89d72d127cf4715aa8f8ae3338818197a13def804106eaf0a8e

Height

#1,317,617

Difficulty

10.862291

Transactions

2

Size

574 B

Version

2

Bits

0adcbf1e

Nonce

591,679,045

Timestamp

11/7/2015, 11:15:58 PM

Confirmations

5,507,037

Merkle Root

21fcd0ba43e4ade51b246733478b15a573c6aeb27febd6a4596008298878072a
Transactions (2)
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.246 × 10⁹³(94-digit number)
12462444450858174119…39151455219705137749
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.246 × 10⁹³(94-digit number)
12462444450858174119…39151455219705137749
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.492 × 10⁹³(94-digit number)
24924888901716348238…78302910439410275499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.984 × 10⁹³(94-digit number)
49849777803432696476…56605820878820550999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.969 × 10⁹³(94-digit number)
99699555606865392953…13211641757641101999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.993 × 10⁹⁴(95-digit number)
19939911121373078590…26423283515282203999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.987 × 10⁹⁴(95-digit number)
39879822242746157181…52846567030564407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.975 × 10⁹⁴(95-digit number)
79759644485492314363…05693134061128815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.595 × 10⁹⁵(96-digit number)
15951928897098462872…11386268122257631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.190 × 10⁹⁵(96-digit number)
31903857794196925745…22772536244515263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.380 × 10⁹⁵(96-digit number)
63807715588393851490…45545072489030527999
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,841,296 XPM·at block #6,824,653 · 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