Block #378,757

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 2:05:17 AM · Difficulty 10.4150 · 6,439,247 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cdebe8bab48b377a2eaf20e59973133fe0d2b06662352d837892d038e9afa5a8

Height

#378,757

Difficulty

10.414952

Transactions

4

Size

1.11 KB

Version

2

Bits

0a6a3a50

Nonce

119,623

Timestamp

1/28/2014, 2:05:17 AM

Confirmations

6,439,247

Merkle Root

0215eebe83a5c4fca48a9568776be5cf98d619dd2c62bce5856c9e847b7d3661
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.717 × 10⁹⁷(98-digit number)
17175953359327134723…17966356859019462879
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.717 × 10⁹⁷(98-digit number)
17175953359327134723…17966356859019462879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.435 × 10⁹⁷(98-digit number)
34351906718654269447…35932713718038925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.870 × 10⁹⁷(98-digit number)
68703813437308538894…71865427436077851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.374 × 10⁹⁸(99-digit number)
13740762687461707778…43730854872155703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.748 × 10⁹⁸(99-digit number)
27481525374923415557…87461709744311406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.496 × 10⁹⁸(99-digit number)
54963050749846831115…74923419488622812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.099 × 10⁹⁹(100-digit number)
10992610149969366223…49846838977245624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.198 × 10⁹⁹(100-digit number)
21985220299938732446…99693677954491248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.397 × 10⁹⁹(100-digit number)
43970440599877464892…99387355908982497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.794 × 10⁹⁹(100-digit number)
87940881199754929785…98774711817964994559
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,788,097 XPM·at block #6,818,003 · 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