Block #520,687

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2014, 12:16:52 AM · Difficulty 10.8600 · 6,289,986 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1c94ebb520e417dfe2495e19e21b85e3ba1abf150fedba7e4bd79cad73a9167b

Height

#520,687

Difficulty

10.860016

Transactions

10

Size

3.31 KB

Version

2

Bits

0adc29fa

Nonce

123,499

Timestamp

5/2/2014, 12:16:52 AM

Confirmations

6,289,986

Merkle Root

59482457300ab09ca4d9a7f6aca248cd74a68cca3518f3b254b40f8ae61a058a
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.692 × 10⁹⁹(100-digit number)
26921627343841285348…12197557143277951839
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.692 × 10⁹⁹(100-digit number)
26921627343841285348…12197557143277951839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.384 × 10⁹⁹(100-digit number)
53843254687682570696…24395114286555903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.076 × 10¹⁰⁰(101-digit number)
10768650937536514139…48790228573111807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.153 × 10¹⁰⁰(101-digit number)
21537301875073028278…97580457146223614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.307 × 10¹⁰⁰(101-digit number)
43074603750146056556…95160914292447229439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.614 × 10¹⁰⁰(101-digit number)
86149207500292113113…90321828584894458879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.722 × 10¹⁰¹(102-digit number)
17229841500058422622…80643657169788917759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.445 × 10¹⁰¹(102-digit number)
34459683000116845245…61287314339577835519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.891 × 10¹⁰¹(102-digit number)
68919366000233690491…22574628679155671039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.378 × 10¹⁰²(103-digit number)
13783873200046738098…45149257358311342079
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,729,475 XPM·at block #6,810,672 · 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