Block #675,178

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/12/2014, 7:03:42 PM · Difficulty 10.9652 · 6,139,053 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f367e9e4a6e92f60578c8f821377952d39fd86596deb8ec943f039be1da15f52

Height

#675,178

Difficulty

10.965243

Transactions

4

Size

886 B

Version

2

Bits

0af71a26

Nonce

2,462,568,535

Timestamp

8/12/2014, 7:03:42 PM

Confirmations

6,139,053

Merkle Root

9d97577aba801b73a73a952e129f63234f2c0354871a915985e81a2a2e4fe317
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.438 × 10⁹⁶(97-digit number)
14388593197815489998…19986713282314210559
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.438 × 10⁹⁶(97-digit number)
14388593197815489998…19986713282314210559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.877 × 10⁹⁶(97-digit number)
28777186395630979997…39973426564628421119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.755 × 10⁹⁶(97-digit number)
57554372791261959994…79946853129256842239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.151 × 10⁹⁷(98-digit number)
11510874558252391998…59893706258513684479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.302 × 10⁹⁷(98-digit number)
23021749116504783997…19787412517027368959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.604 × 10⁹⁷(98-digit number)
46043498233009567995…39574825034054737919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.208 × 10⁹⁷(98-digit number)
92086996466019135991…79149650068109475839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.841 × 10⁹⁸(99-digit number)
18417399293203827198…58299300136218951679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.683 × 10⁹⁸(99-digit number)
36834798586407654396…16598600272437903359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.366 × 10⁹⁸(99-digit number)
73669597172815308793…33197200544875806719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.473 × 10⁹⁹(100-digit number)
14733919434563061758…66394401089751613439
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,757,919 XPM·at block #6,814,230 · 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