Block #433,666

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2014, 5:41:49 PM · Difficulty 10.3473 · 6,390,965 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fba7b4fc2b398c5ad1772a51ef76ab8fbc031a29324b1ab4269e10116ac2d69f

Height

#433,666

Difficulty

10.347254

Transactions

6

Size

1.73 KB

Version

2

Bits

0a58e5a5

Nonce

468,201,723

Timestamp

3/7/2014, 5:41:49 PM

Confirmations

6,390,965

Merkle Root

054421b11863065cddd1888757bdebf156495cb6cc1e09e6f0dd10bdf5540415
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.

1.178 × 10⁹⁴(95-digit number)
11782735817280650809…04612441630462754449
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
1.178 × 10⁹⁴(95-digit number)
11782735817280650809…04612441630462754449
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.356 × 10⁹⁴(95-digit number)
23565471634561301618…09224883260925508899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.713 × 10⁹⁴(95-digit number)
47130943269122603237…18449766521851017799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.426 × 10⁹⁴(95-digit number)
94261886538245206474…36899533043702035599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.885 × 10⁹⁵(96-digit number)
18852377307649041294…73799066087404071199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.770 × 10⁹⁵(96-digit number)
37704754615298082589…47598132174808142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.540 × 10⁹⁵(96-digit number)
75409509230596165179…95196264349616284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.508 × 10⁹⁶(97-digit number)
15081901846119233035…90392528699232569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.016 × 10⁹⁶(97-digit number)
30163803692238466071…80785057398465139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.032 × 10⁹⁶(97-digit number)
60327607384476932143…61570114796930278399
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,841,111 XPM·at block #6,824,630 · 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