Block #367,726

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2014, 7:03:55 AM · Difficulty 10.4340 · 6,462,724 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3a60239a2bf17f315532e6f7f095f7880b80891e26ac168b449cc69afcec4417

Height

#367,726

Difficulty

10.434032

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6f1cb7

Nonce

221,384

Timestamp

1/20/2014, 7:03:55 AM

Confirmations

6,462,724

Merkle Root

545e8a08561ad1ca5c9b37f0dd3b1dcb807b77b703063bf513292c895aa0a672
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.945 × 10⁹⁴(95-digit number)
29459810479499103994…01550301688247053439
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.945 × 10⁹⁴(95-digit number)
29459810479499103994…01550301688247053439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.891 × 10⁹⁴(95-digit number)
58919620958998207989…03100603376494106879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.178 × 10⁹⁵(96-digit number)
11783924191799641597…06201206752988213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.356 × 10⁹⁵(96-digit number)
23567848383599283195…12402413505976427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.713 × 10⁹⁵(96-digit number)
47135696767198566391…24804827011952855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.427 × 10⁹⁵(96-digit number)
94271393534397132782…49609654023905710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.885 × 10⁹⁶(97-digit number)
18854278706879426556…99219308047811420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.770 × 10⁹⁶(97-digit number)
37708557413758853113…98438616095622840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.541 × 10⁹⁶(97-digit number)
75417114827517706226…96877232191245680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.508 × 10⁹⁷(98-digit number)
15083422965503541245…93754464382491361279
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,887,845 XPM·at block #6,830,449 · 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