Block #506,822

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 8:11:43 AM · Difficulty 10.8150 · 6,311,010 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ae8baedba564a798d12ed7f6db26a2a2216bc19264c6f83a3c95179dd22e8f0b

Height

#506,822

Difficulty

10.814981

Transactions

2

Size

1.73 KB

Version

2

Bits

0ad0a29c

Nonce

82,154,232

Timestamp

4/23/2014, 8:11:43 AM

Confirmations

6,311,010

Merkle Root

5898339af18bb616cacbbd1f535b518a4e11a5b2dc64404bba0eef29151aeb12
Transactions (2)
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.

8.388 × 10⁹⁸(99-digit number)
83882581171534415480…80201108697134026399
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
8.388 × 10⁹⁸(99-digit number)
83882581171534415480…80201108697134026399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.677 × 10⁹⁹(100-digit number)
16776516234306883096…60402217394268052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.355 × 10⁹⁹(100-digit number)
33553032468613766192…20804434788536105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.710 × 10⁹⁹(100-digit number)
67106064937227532384…41608869577072211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.342 × 10¹⁰⁰(101-digit number)
13421212987445506476…83217739154144422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.684 × 10¹⁰⁰(101-digit number)
26842425974891012953…66435478308288844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.368 × 10¹⁰⁰(101-digit number)
53684851949782025907…32870956616577689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.073 × 10¹⁰¹(102-digit number)
10736970389956405181…65741913233155379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.147 × 10¹⁰¹(102-digit number)
21473940779912810362…31483826466310758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.294 × 10¹⁰¹(102-digit number)
42947881559825620725…62967652932621516799
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,786,721 XPM·at block #6,817,831 · 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