Block #453,050

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 12:03:44 AM · Difficulty 10.3933 · 6,355,079 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
952f2fa0acf145152dcd5d655ca8d32101b4d97abee111d38eb6fabf130a19a3

Height

#453,050

Difficulty

10.393252

Transactions

3

Size

1.65 KB

Version

2

Bits

0a64ac2a

Nonce

32,657

Timestamp

3/21/2014, 12:03:44 AM

Confirmations

6,355,079

Merkle Root

2a94f8db44e2c86f0dd625279d84e149f5cb082351820183d780f7769111bf40
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.074 × 10⁹⁹(100-digit number)
90741367958213077785…68923692992683367779
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.074 × 10⁹⁹(100-digit number)
90741367958213077785…68923692992683367779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.814 × 10¹⁰⁰(101-digit number)
18148273591642615557…37847385985366735559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.629 × 10¹⁰⁰(101-digit number)
36296547183285231114…75694771970733471119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.259 × 10¹⁰⁰(101-digit number)
72593094366570462228…51389543941466942239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.451 × 10¹⁰¹(102-digit number)
14518618873314092445…02779087882933884479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.903 × 10¹⁰¹(102-digit number)
29037237746628184891…05558175765867768959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.807 × 10¹⁰¹(102-digit number)
58074475493256369782…11116351531735537919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.161 × 10¹⁰²(103-digit number)
11614895098651273956…22232703063471075839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.322 × 10¹⁰²(103-digit number)
23229790197302547913…44465406126942151679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.645 × 10¹⁰²(103-digit number)
46459580394605095826…88930812253884303359
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,709,073 XPM·at block #6,808,128 · 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