Block #372,633

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/23/2014, 6:05:02 PM · Difficulty 10.4267 · 6,438,489 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
04f8ba5d3efb10aa41b76f0519c3e78cb8dc9b146e504a78a9665b5412eaef14

Height

#372,633

Difficulty

10.426679

Transactions

5

Size

2.68 KB

Version

2

Bits

0a6d3ad4

Nonce

89,018

Timestamp

1/23/2014, 6:05:02 PM

Confirmations

6,438,489

Merkle Root

a9e10f36d76daa456afe85caae04eda6ff383f37244cdae3e79356df7a822363
Transactions (5)
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.545 × 10⁹⁶(97-digit number)
15450212974649991978…79086232617543647359
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.545 × 10⁹⁶(97-digit number)
15450212974649991978…79086232617543647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.090 × 10⁹⁶(97-digit number)
30900425949299983957…58172465235087294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.180 × 10⁹⁶(97-digit number)
61800851898599967915…16344930470174589439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.236 × 10⁹⁷(98-digit number)
12360170379719993583…32689860940349178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.472 × 10⁹⁷(98-digit number)
24720340759439987166…65379721880698357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.944 × 10⁹⁷(98-digit number)
49440681518879974332…30759443761396715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.888 × 10⁹⁷(98-digit number)
98881363037759948665…61518887522793431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.977 × 10⁹⁸(99-digit number)
19776272607551989733…23037775045586862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.955 × 10⁹⁸(99-digit number)
39552545215103979466…46075550091173724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.910 × 10⁹⁸(99-digit number)
79105090430207958932…92151100182347448319
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,733,082 XPM·at block #6,811,121 · 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