Block #1,364,061

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2015, 3:49:01 PM · Difficulty 10.8457 · 5,461,119 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b118dd4276a04c1eb86b4c3f1ddee6228daa02179abcf4e30c2b6310bf459ea3

Height

#1,364,061

Difficulty

10.845710

Transactions

2

Size

2.87 KB

Version

2

Bits

0ad88077

Nonce

1,902,797,819

Timestamp

12/10/2015, 3:49:01 PM

Confirmations

5,461,119

Merkle Root

44df2e54d35357c79fc021c70959087644aff154f4ccde3fc05d6e09887b83ea
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.

9.117 × 10⁹⁶(97-digit number)
91176828018045734088…18716558218699403519
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
9.117 × 10⁹⁶(97-digit number)
91176828018045734088…18716558218699403519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.823 × 10⁹⁷(98-digit number)
18235365603609146817…37433116437398807039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.647 × 10⁹⁷(98-digit number)
36470731207218293635…74866232874797614079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.294 × 10⁹⁷(98-digit number)
72941462414436587270…49732465749595228159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.458 × 10⁹⁸(99-digit number)
14588292482887317454…99464931499190456319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.917 × 10⁹⁸(99-digit number)
29176584965774634908…98929862998380912639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.835 × 10⁹⁸(99-digit number)
58353169931549269816…97859725996761825279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.167 × 10⁹⁹(100-digit number)
11670633986309853963…95719451993523650559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.334 × 10⁹⁹(100-digit number)
23341267972619707926…91438903987047301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.668 × 10⁹⁹(100-digit number)
46682535945239415853…82877807974094602239
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,845,529 XPM·at block #6,825,179 · 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