Block #513,549

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2014, 2:28:23 PM · Difficulty 10.8357 · 6,295,175 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5795b5ad535aad4b725e539745e966e4c3c7ca925540fd1f5ac89d5488658001

Height

#513,549

Difficulty

10.835735

Transactions

2

Size

20.05 KB

Version

2

Bits

0ad5f2b8

Nonce

633,263,449

Timestamp

4/27/2014, 2:28:23 PM

Confirmations

6,295,175

Merkle Root

ada631cf2ddc27021f7125113c9be7739042cc67d476412c4acf6c6640f29de5
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.298 × 10⁹⁹(100-digit number)
12984628196637683384…31872567889448828799
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.298 × 10⁹⁹(100-digit number)
12984628196637683384…31872567889448828799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.596 × 10⁹⁹(100-digit number)
25969256393275366768…63745135778897657599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.193 × 10⁹⁹(100-digit number)
51938512786550733536…27490271557795315199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.038 × 10¹⁰⁰(101-digit number)
10387702557310146707…54980543115590630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.077 × 10¹⁰⁰(101-digit number)
20775405114620293414…09961086231181260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.155 × 10¹⁰⁰(101-digit number)
41550810229240586828…19922172462362521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.310 × 10¹⁰⁰(101-digit number)
83101620458481173657…39844344924725043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.662 × 10¹⁰¹(102-digit number)
16620324091696234731…79688689849450086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.324 × 10¹⁰¹(102-digit number)
33240648183392469463…59377379698900172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.648 × 10¹⁰¹(102-digit number)
66481296366784938926…18754759397800345599
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,713,837 XPM·at block #6,808,723 · 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.

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