Block #503,195

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 10:41:01 PM · Difficulty 10.8080 · 6,309,360 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1e6118ffdb0148330c6bc196d552d0934890aa38416c4f2e5e7c9b6921ba3ec

Height

#503,195

Difficulty

10.807979

Transactions

10

Size

3.06 KB

Version

2

Bits

0aced7bc

Nonce

459,243,873

Timestamp

4/20/2014, 10:41:01 PM

Confirmations

6,309,360

Merkle Root

872de970b3cbf14bc88a8b79893cb8a6f28848c973aa5fafdddb3ee313432d64
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.606 × 10⁹⁷(98-digit number)
26067910295561186824…01003726882477595999
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.606 × 10⁹⁷(98-digit number)
26067910295561186824…01003726882477595999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.213 × 10⁹⁷(98-digit number)
52135820591122373649…02007453764955191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.042 × 10⁹⁸(99-digit number)
10427164118224474729…04014907529910383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.085 × 10⁹⁸(99-digit number)
20854328236448949459…08029815059820767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.170 × 10⁹⁸(99-digit number)
41708656472897898919…16059630119641535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.341 × 10⁹⁸(99-digit number)
83417312945795797838…32119260239283071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.668 × 10⁹⁹(100-digit number)
16683462589159159567…64238520478566143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.336 × 10⁹⁹(100-digit number)
33366925178318319135…28477040957132287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.673 × 10⁹⁹(100-digit number)
66733850356636638270…56954081914264575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.334 × 10¹⁰⁰(101-digit number)
13346770071327327654…13908163828529151999
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,744,473 XPM·at block #6,812,554 · 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