Block #501,082

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2014, 1:48:18 PM · Difficulty 10.8022 · 6,323,889 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2b08165be03f257357546ed29df9be55bf9b8ab4b9bfeddedcd2fcbad8cbbba2

Height

#501,082

Difficulty

10.802204

Transactions

4

Size

1.01 KB

Version

2

Bits

0acd5d3a

Nonce

42,524,193

Timestamp

4/19/2014, 1:48:18 PM

Confirmations

6,323,889

Merkle Root

cd98f192ff3679ae6c228c366291f8e722bf2ddee6a52eb83f2f00fdcbd1071f
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.281 × 10⁹⁹(100-digit number)
12812703520167812312…23747378544229412479
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.281 × 10⁹⁹(100-digit number)
12812703520167812312…23747378544229412479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.562 × 10⁹⁹(100-digit number)
25625407040335624625…47494757088458824959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.125 × 10⁹⁹(100-digit number)
51250814080671249251…94989514176917649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.025 × 10¹⁰⁰(101-digit number)
10250162816134249850…89979028353835299839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.050 × 10¹⁰⁰(101-digit number)
20500325632268499700…79958056707670599679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.100 × 10¹⁰⁰(101-digit number)
41000651264536999400…59916113415341199359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.200 × 10¹⁰⁰(101-digit number)
82001302529073998801…19832226830682398719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.640 × 10¹⁰¹(102-digit number)
16400260505814799760…39664453661364797439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.280 × 10¹⁰¹(102-digit number)
32800521011629599520…79328907322729594879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.560 × 10¹⁰¹(102-digit number)
65601042023259199041…58657814645459189759
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,843,849 XPM·at block #6,824,970 · 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