Block #375,730

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 10:14:49 PM · Difficulty 10.4239 · 6,434,235 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
46eb8a22a880b770d9ce6043ae3427d9ab5241f16cf2558e06be0ad93a8f3448

Height

#375,730

Difficulty

10.423855

Transactions

5

Size

16.83 KB

Version

2

Bits

0a6c81c6

Nonce

24,774

Timestamp

1/25/2014, 10:14:49 PM

Confirmations

6,434,235

Merkle Root

e19936a6fff8541cf76fa03d35d723d49fb7c4f4fff99ca4830af01327d858f6
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.

3.072 × 10¹⁰⁴(105-digit number)
30726579397980427705…74864470961883427839
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
3.072 × 10¹⁰⁴(105-digit number)
30726579397980427705…74864470961883427839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.145 × 10¹⁰⁴(105-digit number)
61453158795960855410…49728941923766855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.229 × 10¹⁰⁵(106-digit number)
12290631759192171082…99457883847533711359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.458 × 10¹⁰⁵(106-digit number)
24581263518384342164…98915767695067422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.916 × 10¹⁰⁵(106-digit number)
49162527036768684328…97831535390134845439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.832 × 10¹⁰⁵(106-digit number)
98325054073537368656…95663070780269690879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.966 × 10¹⁰⁶(107-digit number)
19665010814707473731…91326141560539381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.933 × 10¹⁰⁶(107-digit number)
39330021629414947462…82652283121078763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.866 × 10¹⁰⁶(107-digit number)
78660043258829894924…65304566242157527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.573 × 10¹⁰⁷(108-digit number)
15732008651765978984…30609132484315054079
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,723,792 XPM·at block #6,809,964 · 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