Block #381,512

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 1:30:52 AM · Difficulty 10.4047 · 6,443,601 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bbf30684779dfb9fa3b07be98f34a4aaf7da2e9ba4db45358bec1103d7b24918

Height

#381,512

Difficulty

10.404695

Transactions

11

Size

2.66 KB

Version

2

Bits

0a679a10

Nonce

84,168

Timestamp

1/30/2014, 1:30:52 AM

Confirmations

6,443,601

Merkle Root

d888b396129ef0861c2f95e3b0022780d2750406988fc3f4a7fdf79842b0cb3e
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.534 × 10⁹¹(92-digit number)
55340033412083018485…19780851476785591679
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.534 × 10⁹¹(92-digit number)
55340033412083018485…19780851476785591679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.106 × 10⁹²(93-digit number)
11068006682416603697…39561702953571183359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.213 × 10⁹²(93-digit number)
22136013364833207394…79123405907142366719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.427 × 10⁹²(93-digit number)
44272026729666414788…58246811814284733439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.854 × 10⁹²(93-digit number)
88544053459332829576…16493623628569466879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.770 × 10⁹³(94-digit number)
17708810691866565915…32987247257138933759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.541 × 10⁹³(94-digit number)
35417621383733131830…65974494514277867519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.083 × 10⁹³(94-digit number)
70835242767466263661…31948989028555735039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.416 × 10⁹⁴(95-digit number)
14167048553493252732…63897978057111470079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.833 × 10⁹⁴(95-digit number)
28334097106986505464…27795956114222940159
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,844,986 XPM·at block #6,825,112 · 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