Block #515,580

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2014, 9:14:18 PM · Difficulty 10.8418 · 6,301,228 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7aeaa3ea3f15e960b0a480d48ac4621b5ab5c79cf6680ba5856b4191fb4e2aa6

Height

#515,580

Difficulty

10.841808

Transactions

7

Size

1.66 KB

Version

2

Bits

0ad780b3

Nonce

291,141

Timestamp

4/28/2014, 9:14:18 PM

Confirmations

6,301,228

Merkle Root

fa99a4395317d3525714fff74b476ccd9910acd77ca51c13ae2546d571ba65b5
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.195 × 10⁹⁷(98-digit number)
11952890334153400141…61873884460943037439
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.195 × 10⁹⁷(98-digit number)
11952890334153400141…61873884460943037439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.390 × 10⁹⁷(98-digit number)
23905780668306800282…23747768921886074879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.781 × 10⁹⁷(98-digit number)
47811561336613600564…47495537843772149759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.562 × 10⁹⁷(98-digit number)
95623122673227201129…94991075687544299519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.912 × 10⁹⁸(99-digit number)
19124624534645440225…89982151375088599039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.824 × 10⁹⁸(99-digit number)
38249249069290880451…79964302750177198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.649 × 10⁹⁸(99-digit number)
76498498138581760903…59928605500354396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.529 × 10⁹⁹(100-digit number)
15299699627716352180…19857211000708792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.059 × 10⁹⁹(100-digit number)
30599399255432704361…39714422001417584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.119 × 10⁹⁹(100-digit number)
61198798510865408723…79428844002835169279
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,778,501 XPM·at block #6,816,807 · 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