Block #1,317,145

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/7/2015, 3:02:36 PM · Difficulty 10.8629 · 5,497,998 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0ca25bba4545ad81c4013cfb1c4de473d81f88855fa47b1acc77c2212fb200df

Height

#1,317,145

Difficulty

10.862920

Transactions

2

Size

13.14 KB

Version

2

Bits

0adce857

Nonce

194,136,760

Timestamp

11/7/2015, 3:02:36 PM

Confirmations

5,497,998

Merkle Root

9f819e7f70e446e1e4adf095ee56ff83654beb999fbb217b8cc7d9e39d710a5d
Transactions (2)
1 in → 1 out8.6400 XPM110 B
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.120 × 10⁹⁵(96-digit number)
21205900062203808593…76314649344069740799
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.120 × 10⁹⁵(96-digit number)
21205900062203808593…76314649344069740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.241 × 10⁹⁵(96-digit number)
42411800124407617187…52629298688139481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.482 × 10⁹⁵(96-digit number)
84823600248815234374…05258597376278963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.696 × 10⁹⁶(97-digit number)
16964720049763046874…10517194752557926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.392 × 10⁹⁶(97-digit number)
33929440099526093749…21034389505115852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.785 × 10⁹⁶(97-digit number)
67858880199052187499…42068779010231705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.357 × 10⁹⁷(98-digit number)
13571776039810437499…84137558020463411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.714 × 10⁹⁷(98-digit number)
27143552079620874999…68275116040926822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.428 × 10⁹⁷(98-digit number)
54287104159241749999…36550232081853644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.085 × 10⁹⁸(99-digit number)
10857420831848349999…73100464163707289599
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,765,238 XPM·at block #6,815,142 · 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