Block #501,233

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2014, 4:05:06 PM · Difficulty 10.8028 · 6,309,058 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b4254bb2f6efdd35c784ba81de6642523e38810443889c6c8a2458cc11eb26e

Height

#501,233

Difficulty

10.802799

Transactions

1

Size

869 B

Version

2

Bits

0acd8440

Nonce

88,786

Timestamp

4/19/2014, 4:05:06 PM

Confirmations

6,309,058

Merkle Root

fde23bed7b17a8569a421cef70ae8d86e95ed40c7fbd65d9864f4775fd12c0aa
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.

4.504 × 10⁹⁹(100-digit number)
45049982029410149524…14406926033734708479
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
4.504 × 10⁹⁹(100-digit number)
45049982029410149524…14406926033734708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.009 × 10⁹⁹(100-digit number)
90099964058820299048…28813852067469416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.801 × 10¹⁰⁰(101-digit number)
18019992811764059809…57627704134938833919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.603 × 10¹⁰⁰(101-digit number)
36039985623528119619…15255408269877667839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.207 × 10¹⁰⁰(101-digit number)
72079971247056239238…30510816539755335679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.441 × 10¹⁰¹(102-digit number)
14415994249411247847…61021633079510671359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.883 × 10¹⁰¹(102-digit number)
28831988498822495695…22043266159021342719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.766 × 10¹⁰¹(102-digit number)
57663976997644991390…44086532318042685439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.153 × 10¹⁰²(103-digit number)
11532795399528998278…88173064636085370879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.306 × 10¹⁰²(103-digit number)
23065590799057996556…76346129272170741759
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,726,404 XPM·at block #6,810,290 · 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