Block #504,321

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 5:07:43 PM · Difficulty 10.8088 · 6,313,081 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
da72d3bd7747a6493cb4a4c848d2b128cda18c67d4f328e0713968be1e1cb78f

Height

#504,321

Difficulty

10.808775

Transactions

2

Size

628 B

Version

2

Bits

0acf0bdd

Nonce

587,685,311

Timestamp

4/21/2014, 5:07:43 PM

Confirmations

6,313,081

Merkle Root

4513d9986092e9d8365741fe1efeab67130886ff9445c3899ddbafa5d043b04f
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.

2.788 × 10⁹⁸(99-digit number)
27885406880038814108…12694145485232007519
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.788 × 10⁹⁸(99-digit number)
27885406880038814108…12694145485232007519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.577 × 10⁹⁸(99-digit number)
55770813760077628216…25388290970464015039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.115 × 10⁹⁹(100-digit number)
11154162752015525643…50776581940928030079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.230 × 10⁹⁹(100-digit number)
22308325504031051286…01553163881856060159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.461 × 10⁹⁹(100-digit number)
44616651008062102573…03106327763712120319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.923 × 10⁹⁹(100-digit number)
89233302016124205146…06212655527424240639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.784 × 10¹⁰⁰(101-digit number)
17846660403224841029…12425311054848481279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.569 × 10¹⁰⁰(101-digit number)
35693320806449682058…24850622109696962559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.138 × 10¹⁰⁰(101-digit number)
71386641612899364117…49701244219393925119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.427 × 10¹⁰¹(102-digit number)
14277328322579872823…99402488438787850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.855 × 10¹⁰¹(102-digit number)
28554656645159745646…98804976877575700479
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,783,259 XPM·at block #6,817,401 · 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