Block #433,152

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2014, 9:48:41 AM · Difficulty 10.3421 · 6,380,864 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2ef341dc22d9e5481fe1338a57b9757f48a812b879b371a7bf5830ec01fcd24c

Height

#433,152

Difficulty

10.342066

Transactions

3

Size

4.45 KB

Version

2

Bits

0a5791a7

Nonce

1,204,355

Timestamp

3/7/2014, 9:48:41 AM

Confirmations

6,380,864

Merkle Root

cb8acb922bbef10e18214df1feb90f76a97abed8fd0b8a7ea174b70d20aa7647
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.

4.725 × 10⁹⁶(97-digit number)
47250510467974938696…37101950086852311519
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
4.725 × 10⁹⁶(97-digit number)
47250510467974938696…37101950086852311519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.450 × 10⁹⁶(97-digit number)
94501020935949877393…74203900173704623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.890 × 10⁹⁷(98-digit number)
18900204187189975478…48407800347409246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.780 × 10⁹⁷(98-digit number)
37800408374379950957…96815600694818492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.560 × 10⁹⁷(98-digit number)
75600816748759901915…93631201389636984319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.512 × 10⁹⁸(99-digit number)
15120163349751980383…87262402779273968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.024 × 10⁹⁸(99-digit number)
30240326699503960766…74524805558547937279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.048 × 10⁹⁸(99-digit number)
60480653399007921532…49049611117095874559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.209 × 10⁹⁹(100-digit number)
12096130679801584306…98099222234191749119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.419 × 10⁹⁹(100-digit number)
24192261359603168612…96198444468383498239
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,756,212 XPM·at block #6,814,015 · 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