Block #366,638

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2014, 12:57:49 PM · Difficulty 10.4336 · 6,460,549 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ef105722573f48b5cc0db58d8edbdd51a538eb40e2a5e081705ee9a0a300ccd5

Height

#366,638

Difficulty

10.433570

Transactions

1

Size

1003 B

Version

2

Bits

0a6efe6d

Nonce

37,565

Timestamp

1/19/2014, 12:57:49 PM

Confirmations

6,460,549

Merkle Root

fe7061f529604fd726ff8f9a1c17dd2143f534f81dd6c169d628525e827f1b2f
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.

4.205 × 10⁹³(94-digit number)
42059400058326403598…36530586615756187799
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
4.205 × 10⁹³(94-digit number)
42059400058326403598…36530586615756187799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.411 × 10⁹³(94-digit number)
84118800116652807196…73061173231512375599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.682 × 10⁹⁴(95-digit number)
16823760023330561439…46122346463024751199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.364 × 10⁹⁴(95-digit number)
33647520046661122878…92244692926049502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.729 × 10⁹⁴(95-digit number)
67295040093322245757…84489385852099004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.345 × 10⁹⁵(96-digit number)
13459008018664449151…68978771704198009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.691 × 10⁹⁵(96-digit number)
26918016037328898303…37957543408396019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.383 × 10⁹⁵(96-digit number)
53836032074657796606…75915086816792038399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.076 × 10⁹⁶(97-digit number)
10767206414931559321…51830173633584076799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.153 × 10⁹⁶(97-digit number)
21534412829863118642…03660347267168153599
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,593 XPM·at block #6,827,186 · 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