Block #379,086

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 7:37:29 AM · Difficulty 10.4145 · 6,433,410 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
77cdb4f898ab4de01daa8c78ddfc0ab2df13cc0df424e0838f4d5e9391c4cdd9

Height

#379,086

Difficulty

10.414477

Transactions

8

Size

2.38 KB

Version

2

Bits

0a6a1b2b

Nonce

28,508

Timestamp

1/28/2014, 7:37:29 AM

Confirmations

6,433,410

Merkle Root

71e42c4ce6eda575cf499db25b59b83f9045526b4779ce2e3e4cee1d4b30302e
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.

9.512 × 10⁹⁹(100-digit number)
95126512334120314869…48228268461381570559
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
9.512 × 10⁹⁹(100-digit number)
95126512334120314869…48228268461381570559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.902 × 10¹⁰⁰(101-digit number)
19025302466824062973…96456536922763141119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.805 × 10¹⁰⁰(101-digit number)
38050604933648125947…92913073845526282239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.610 × 10¹⁰⁰(101-digit number)
76101209867296251895…85826147691052564479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.522 × 10¹⁰¹(102-digit number)
15220241973459250379…71652295382105128959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.044 × 10¹⁰¹(102-digit number)
30440483946918500758…43304590764210257919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.088 × 10¹⁰¹(102-digit number)
60880967893837001516…86609181528420515839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.217 × 10¹⁰²(103-digit number)
12176193578767400303…73218363056841031679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.435 × 10¹⁰²(103-digit number)
24352387157534800606…46436726113682063359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.870 × 10¹⁰²(103-digit number)
48704774315069601213…92873452227364126719
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,743,999 XPM·at block #6,812,495 · 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