Block #520,477

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2014, 9:01:58 PM · Difficulty 10.8595 · 6,292,223 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
61a3457670859076ddc708da23997024d23767c16be4661a7a42bc199d533888

Height

#520,477

Difficulty

10.859507

Transactions

12

Size

2.78 KB

Version

2

Bits

0adc08ae

Nonce

193,018,501

Timestamp

5/1/2014, 9:01:58 PM

Confirmations

6,292,223

Merkle Root

98cadabe3e3f03daf152bc8e06105d7975d35e4a22fba4bd935f2f78dad02cb1
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.032 × 10⁹⁹(100-digit number)
10320458718605440663…83592464186651774079
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.032 × 10⁹⁹(100-digit number)
10320458718605440663…83592464186651774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.064 × 10⁹⁹(100-digit number)
20640917437210881327…67184928373303548159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.128 × 10⁹⁹(100-digit number)
41281834874421762654…34369856746607096319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.256 × 10⁹⁹(100-digit number)
82563669748843525308…68739713493214192639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.651 × 10¹⁰⁰(101-digit number)
16512733949768705061…37479426986428385279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.302 × 10¹⁰⁰(101-digit number)
33025467899537410123…74958853972856770559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.605 × 10¹⁰⁰(101-digit number)
66050935799074820247…49917707945713541119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.321 × 10¹⁰¹(102-digit number)
13210187159814964049…99835415891427082239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.642 × 10¹⁰¹(102-digit number)
26420374319629928098…99670831782854164479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.284 × 10¹⁰¹(102-digit number)
52840748639259856197…99341663565708328959
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,745,636 XPM·at block #6,812,699 · 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