Block #513,162

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2014, 8:25:31 AM · Difficulty 10.8349 · 6,302,987 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
336e5887d5480545a0df5fd744cd9cb252c465dcf3a5b5f52f9dbe994439a6a0

Height

#513,162

Difficulty

10.834947

Transactions

5

Size

1.08 KB

Version

2

Bits

0ad5bf1a

Nonce

73,155

Timestamp

4/27/2014, 8:25:31 AM

Confirmations

6,302,987

Merkle Root

90853ca018b760f9ffaa8f5e36776d86116c8deeea7d650c52ba2932ff2aa698
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.306 × 10¹⁰⁰(101-digit number)
13064742949226475812…67224307876702851199
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.306 × 10¹⁰⁰(101-digit number)
13064742949226475812…67224307876702851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.612 × 10¹⁰⁰(101-digit number)
26129485898452951625…34448615753405702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.225 × 10¹⁰⁰(101-digit number)
52258971796905903250…68897231506811404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.045 × 10¹⁰¹(102-digit number)
10451794359381180650…37794463013622809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.090 × 10¹⁰¹(102-digit number)
20903588718762361300…75588926027245619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.180 × 10¹⁰¹(102-digit number)
41807177437524722600…51177852054491238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.361 × 10¹⁰¹(102-digit number)
83614354875049445201…02355704108982476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.672 × 10¹⁰²(103-digit number)
16722870975009889040…04711408217964953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.344 × 10¹⁰²(103-digit number)
33445741950019778080…09422816435929907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.689 × 10¹⁰²(103-digit number)
66891483900039556161…18845632871859814399
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,773,313 XPM·at block #6,816,148 · 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