Block #439,265

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/11/2014, 1:54:31 PM · Difficulty 10.3589 · 6,377,713 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b6d082c4d07f0f6a973d533c39ff20a7a7db41f5522054998036c0609dd51bcc

Height

#439,265

Difficulty

10.358868

Transactions

5

Size

1.48 KB

Version

2

Bits

0a5bdecc

Nonce

83,974

Timestamp

3/11/2014, 1:54:31 PM

Confirmations

6,377,713

Merkle Root

01e09849cb4f8cfe68318745bb187ce88e1745a281d8d932ebeb806481bc5070
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.

2.945 × 10¹⁰⁴(105-digit number)
29453692657415517056…47790851496799242239
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
2.945 × 10¹⁰⁴(105-digit number)
29453692657415517056…47790851496799242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.890 × 10¹⁰⁴(105-digit number)
58907385314831034113…95581702993598484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.178 × 10¹⁰⁵(106-digit number)
11781477062966206822…91163405987196968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.356 × 10¹⁰⁵(106-digit number)
23562954125932413645…82326811974393937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.712 × 10¹⁰⁵(106-digit number)
47125908251864827290…64653623948787875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.425 × 10¹⁰⁵(106-digit number)
94251816503729654581…29307247897575751679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.885 × 10¹⁰⁶(107-digit number)
18850363300745930916…58614495795151503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.770 × 10¹⁰⁶(107-digit number)
37700726601491861832…17228991590303006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.540 × 10¹⁰⁶(107-digit number)
75401453202983723665…34457983180606013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.508 × 10¹⁰⁷(108-digit number)
15080290640596744733…68915966361212026879
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,779,862 XPM·at block #6,816,977 · 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