Block #427,151

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/3/2014, 4:42:19 AM · Difficulty 10.3463 · 6,399,931 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1ad9d343dbe79f1d93f4d5993283e9040e3c24b01146851739af1e74a6a1425

Height

#427,151

Difficulty

10.346291

Transactions

15

Size

3.29 KB

Version

2

Bits

0a58a688

Nonce

1,946

Timestamp

3/3/2014, 4:42:19 AM

Confirmations

6,399,931

Merkle Root

123cd645c5a1e610dc4cee89f6ab8ffed6ea5ebd5781bde4ce824141c53bfc17
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.

9.594 × 10⁹⁹(100-digit number)
95947271384877284271…72829953167690539519
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
9.594 × 10⁹⁹(100-digit number)
95947271384877284271…72829953167690539519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.918 × 10¹⁰⁰(101-digit number)
19189454276975456854…45659906335381079039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.837 × 10¹⁰⁰(101-digit number)
38378908553950913708…91319812670762158079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.675 × 10¹⁰⁰(101-digit number)
76757817107901827417…82639625341524316159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.535 × 10¹⁰¹(102-digit number)
15351563421580365483…65279250683048632319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.070 × 10¹⁰¹(102-digit number)
30703126843160730966…30558501366097264639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.140 × 10¹⁰¹(102-digit number)
61406253686321461933…61117002732194529279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.228 × 10¹⁰²(103-digit number)
12281250737264292386…22234005464389058559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.456 × 10¹⁰²(103-digit number)
24562501474528584773…44468010928778117119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.912 × 10¹⁰²(103-digit number)
49125002949057169547…88936021857556234239
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,860,841 XPM·at block #6,827,081 · 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