Block #452,150

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 9:46:48 AM · Difficulty 10.3881 · 6,354,723 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
61b3f0a49b2f33bb08f4fed2bf498161b6690aa91122172e404f6d34dbb84ff0

Height

#452,150

Difficulty

10.388084

Transactions

6

Size

1.30 KB

Version

2

Bits

0a635977

Nonce

39,147,285

Timestamp

3/20/2014, 9:46:48 AM

Confirmations

6,354,723

Merkle Root

603ef113bef549ae30d676e3f8cb93ab562fdedb861069182104962f23d6b9d2
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.682 × 10⁹⁴(95-digit number)
16825450138902342433…69383869814688742529
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.682 × 10⁹⁴(95-digit number)
16825450138902342433…69383869814688742529
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.365 × 10⁹⁴(95-digit number)
33650900277804684866…38767739629377485059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.730 × 10⁹⁴(95-digit number)
67301800555609369733…77535479258754970119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.346 × 10⁹⁵(96-digit number)
13460360111121873946…55070958517509940239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.692 × 10⁹⁵(96-digit number)
26920720222243747893…10141917035019880479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.384 × 10⁹⁵(96-digit number)
53841440444487495786…20283834070039760959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.076 × 10⁹⁶(97-digit number)
10768288088897499157…40567668140079521919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.153 × 10⁹⁶(97-digit number)
21536576177794998314…81135336280159043839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.307 × 10⁹⁶(97-digit number)
43073152355589996629…62270672560318087679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.614 × 10⁹⁶(97-digit number)
86146304711179993258…24541345120636175359
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,699,091 XPM·at block #6,806,872 · 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.

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