Block #378,062

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2014, 1:30:23 PM · Difficulty 10.4217 · 6,449,084 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eae93025569416de464f73c9b5f2358ac48504d4b0ac866040af1ca99bff7cc3

Height

#378,062

Difficulty

10.421701

Transactions

5

Size

1.70 KB

Version

2

Bits

0a6bf497

Nonce

51,982

Timestamp

1/27/2014, 1:30:23 PM

Confirmations

6,449,084

Merkle Root

87538aed1702fc58917df5b00d5cc5b48d9bd32bb05a67b71b489725f15242bb
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.535 × 10⁹⁸(99-digit number)
35354348217162718218…90857487172161623039
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.535 × 10⁹⁸(99-digit number)
35354348217162718218…90857487172161623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.070 × 10⁹⁸(99-digit number)
70708696434325436437…81714974344323246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.414 × 10⁹⁹(100-digit number)
14141739286865087287…63429948688646492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.828 × 10⁹⁹(100-digit number)
28283478573730174574…26859897377292984319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.656 × 10⁹⁹(100-digit number)
56566957147460349149…53719794754585968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.131 × 10¹⁰⁰(101-digit number)
11313391429492069829…07439589509171937279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.262 × 10¹⁰⁰(101-digit number)
22626782858984139659…14879179018343874559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.525 × 10¹⁰⁰(101-digit number)
45253565717968279319…29758358036687749119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.050 × 10¹⁰⁰(101-digit number)
90507131435936558639…59516716073375498239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.810 × 10¹⁰¹(102-digit number)
18101426287187311727…19033432146750996479
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,861,351 XPM·at block #6,827,145 · 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