Block #324,150

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 3:13:22 AM · Difficulty 10.2092 · 6,490,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3b75c386f434d14ebfb7ba86cf5c19392f2410bf07531faf4a2e95ceb43ea48a

Height

#324,150

Difficulty

10.209242

Transactions

4

Size

2.16 KB

Version

2

Bits

0a3590da

Nonce

211,282

Timestamp

12/22/2013, 3:13:22 AM

Confirmations

6,490,272

Merkle Root

3e4b7af082e787135398220a2bc06b07d95e5bc3ca6bce1281425cb234d66fcd
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.

5.043 × 10⁹⁵(96-digit number)
50432076585701217112…63589358279595914319
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
5.043 × 10⁹⁵(96-digit number)
50432076585701217112…63589358279595914319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.008 × 10⁹⁶(97-digit number)
10086415317140243422…27178716559191828639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.017 × 10⁹⁶(97-digit number)
20172830634280486845…54357433118383657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.034 × 10⁹⁶(97-digit number)
40345661268560973690…08714866236767314559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.069 × 10⁹⁶(97-digit number)
80691322537121947380…17429732473534629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.613 × 10⁹⁷(98-digit number)
16138264507424389476…34859464947069258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.227 × 10⁹⁷(98-digit number)
32276529014848778952…69718929894138516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.455 × 10⁹⁷(98-digit number)
64553058029697557904…39437859788277032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.291 × 10⁹⁸(99-digit number)
12910611605939511580…78875719576554065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.582 × 10⁹⁸(99-digit number)
25821223211879023161…57751439153108131839
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,759,442 XPM·at block #6,814,421 · 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