Block #513,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2014, 12:37:09 PM · Difficulty 10.8351 · 6,320,503 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
277eba4088e65521cfbff09c11e6c7e544f65306ed5b5ab3996bd724d4b19e7a

Height

#513,419

Difficulty

10.835140

Transactions

2

Size

992 B

Version

2

Bits

0ad5cbbd

Nonce

25,857,558

Timestamp

4/27/2014, 12:37:09 PM

Confirmations

6,320,503

Merkle Root

3b397555d3bfbedc18d782037cda65bf886fd8417c3270c96e7b2257ea96a57b
Transactions (2)
1 in → 1 out8.5126 XPM116 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.

1.265 × 10⁹⁸(99-digit number)
12657612181376412328…28866997418503089879
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.265 × 10⁹⁸(99-digit number)
12657612181376412328…28866997418503089879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.531 × 10⁹⁸(99-digit number)
25315224362752824657…57733994837006179759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.063 × 10⁹⁸(99-digit number)
50630448725505649315…15467989674012359519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.012 × 10⁹⁹(100-digit number)
10126089745101129863…30935979348024719039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.025 × 10⁹⁹(100-digit number)
20252179490202259726…61871958696049438079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.050 × 10⁹⁹(100-digit number)
40504358980404519452…23743917392098876159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.100 × 10⁹⁹(100-digit number)
81008717960809038904…47487834784197752319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.620 × 10¹⁰⁰(101-digit number)
16201743592161807780…94975669568395504639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.240 × 10¹⁰⁰(101-digit number)
32403487184323615561…89951339136791009279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.480 × 10¹⁰⁰(101-digit number)
64806974368647231123…79902678273582018559
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,915,603 XPM·at block #6,833,921 · 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