Block #488,843

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2014, 10:30:31 PM · Difficulty 10.6604 · 6,327,212 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
520b6828854beb42d8b2acbd6d14bee302ba0514b8293b2707b17348168152eb

Height

#488,843

Difficulty

10.660372

Transactions

7

Size

1.53 KB

Version

2

Bits

0aa90e23

Nonce

345

Timestamp

4/12/2014, 10:30:31 PM

Confirmations

6,327,212

Merkle Root

0d4107975e03efc19583b375b56aa3dc9bb4e35280f226186b6ff8ee95ddfe8f
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.

3.953 × 10⁹⁶(97-digit number)
39530623984068189241…68809378416509783239
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
3.953 × 10⁹⁶(97-digit number)
39530623984068189241…68809378416509783239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.906 × 10⁹⁶(97-digit number)
79061247968136378482…37618756833019566479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.581 × 10⁹⁷(98-digit number)
15812249593627275696…75237513666039132959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.162 × 10⁹⁷(98-digit number)
31624499187254551392…50475027332078265919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.324 × 10⁹⁷(98-digit number)
63248998374509102785…00950054664156531839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.264 × 10⁹⁸(99-digit number)
12649799674901820557…01900109328313063679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.529 × 10⁹⁸(99-digit number)
25299599349803641114…03800218656626127359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.059 × 10⁹⁸(99-digit number)
50599198699607282228…07600437313252254719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.011 × 10⁹⁹(100-digit number)
10119839739921456445…15200874626504509439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.023 × 10⁹⁹(100-digit number)
20239679479842912891…30401749253009018879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.047 × 10⁹⁹(100-digit number)
40479358959685825783…60803498506018037759
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,772,555 XPM·at block #6,816,054 · 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