Block #344,290

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 5:22:25 AM · Difficulty 10.1914 · 6,463,057 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8587c5c08c524ff3000584b481d904e82315ba6d39732a13b7e51eea061c1a72

Height

#344,290

Difficulty

10.191434

Transactions

4

Size

1023 B

Version

2

Bits

0a3101ce

Nonce

12,159

Timestamp

1/5/2014, 5:22:25 AM

Confirmations

6,463,057

Merkle Root

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

2.235 × 10¹⁰⁴(105-digit number)
22357749495340784971…62145255170146181119
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
2.235 × 10¹⁰⁴(105-digit number)
22357749495340784971…62145255170146181119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.471 × 10¹⁰⁴(105-digit number)
44715498990681569943…24290510340292362239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.943 × 10¹⁰⁴(105-digit number)
89430997981363139887…48581020680584724479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.788 × 10¹⁰⁵(106-digit number)
17886199596272627977…97162041361169448959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.577 × 10¹⁰⁵(106-digit number)
35772399192545255955…94324082722338897919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.154 × 10¹⁰⁵(106-digit number)
71544798385090511910…88648165444677795839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.430 × 10¹⁰⁶(107-digit number)
14308959677018102382…77296330889355591679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.861 × 10¹⁰⁶(107-digit number)
28617919354036204764…54592661778711183359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.723 × 10¹⁰⁶(107-digit number)
57235838708072409528…09185323557422366719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.144 × 10¹⁰⁷(108-digit number)
11447167741614481905…18370647114844733439
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,702,796 XPM·at block #6,807,346 · 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