Block #457,997

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 7:19:33 AM · Difficulty 10.4195 · 6,359,242 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fb42bc923c69f3892b0772a7b83b26a3ee3de89b112398e7c779fbbcd621744f

Height

#457,997

Difficulty

10.419482

Transactions

8

Size

160.54 KB

Version

2

Bits

0a6b632c

Nonce

703,436

Timestamp

3/24/2014, 7:19:33 AM

Confirmations

6,359,242

Merkle Root

0416dd0025c736b2177fdb86ef81fb79ef2edab649b176c75ad8c7a1382cbcd1
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.227 × 10⁹⁹(100-digit number)
32276831129551907224…17342829108129748799
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.227 × 10⁹⁹(100-digit number)
32276831129551907224…17342829108129748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.455 × 10⁹⁹(100-digit number)
64553662259103814448…34685658216259497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.291 × 10¹⁰⁰(101-digit number)
12910732451820762889…69371316432518995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.582 × 10¹⁰⁰(101-digit number)
25821464903641525779…38742632865037990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.164 × 10¹⁰⁰(101-digit number)
51642929807283051558…77485265730075980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.032 × 10¹⁰¹(102-digit number)
10328585961456610311…54970531460151961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.065 × 10¹⁰¹(102-digit number)
20657171922913220623…09941062920303923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.131 × 10¹⁰¹(102-digit number)
41314343845826441246…19882125840607846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.262 × 10¹⁰¹(102-digit number)
82628687691652882493…39764251681215692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.652 × 10¹⁰²(103-digit number)
16525737538330576498…79528503362431385599
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,781,944 XPM·at block #6,817,238 · 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