Block #446,677

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/16/2014, 5:57:07 PM · Difficulty 10.3593 · 6,380,145 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
44ecfde762a4e992ace0c81cf8e780373af24be46699d47be7fe108ecb51ee2f

Height

#446,677

Difficulty

10.359329

Transactions

5

Size

1.23 KB

Version

2

Bits

0a5bfcfd

Nonce

4,950

Timestamp

3/16/2014, 5:57:07 PM

Confirmations

6,380,145

Merkle Root

79555569e018bca2711bf78b871c6fe7ce2da1ea12a2a51532a851bb71df54bb
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.

3.817 × 10¹⁰⁰(101-digit number)
38173609215551509752…81103234596981637119
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
3.817 × 10¹⁰⁰(101-digit number)
38173609215551509752…81103234596981637119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.634 × 10¹⁰⁰(101-digit number)
76347218431103019505…62206469193963274239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.526 × 10¹⁰¹(102-digit number)
15269443686220603901…24412938387926548479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.053 × 10¹⁰¹(102-digit number)
30538887372441207802…48825876775853096959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.107 × 10¹⁰¹(102-digit number)
61077774744882415604…97651753551706193919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.221 × 10¹⁰²(103-digit number)
12215554948976483120…95303507103412387839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.443 × 10¹⁰²(103-digit number)
24431109897952966241…90607014206824775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.886 × 10¹⁰²(103-digit number)
48862219795905932483…81214028413649551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.772 × 10¹⁰²(103-digit number)
97724439591811864967…62428056827299102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.954 × 10¹⁰³(104-digit number)
19544887918362372993…24856113654598205439
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,858,740 XPM·at block #6,826,821 · 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