Block #331,777

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 2:18:12 PM · Difficulty 10.1724 · 6,486,185 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48b1c0afae53ff507aad6a24dc64aa3c6a2d009612b8e84ee08d00b515c86705

Height

#331,777

Difficulty

10.172381

Transactions

2

Size

601 B

Version

2

Bits

0a2c2126

Nonce

3,794

Timestamp

12/27/2013, 2:18:12 PM

Confirmations

6,486,185

Merkle Root

fe48ea442c29b6a8ba60220b2799e2f39b2dcd833b2346fa8e4f8f1b4774f3d9
Transactions (2)
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.339 × 10¹⁰¹(102-digit number)
23391734528849744081…94280688563424439679
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.339 × 10¹⁰¹(102-digit number)
23391734528849744081…94280688563424439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.678 × 10¹⁰¹(102-digit number)
46783469057699488162…88561377126848879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.356 × 10¹⁰¹(102-digit number)
93566938115398976324…77122754253697758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.871 × 10¹⁰²(103-digit number)
18713387623079795264…54245508507395517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.742 × 10¹⁰²(103-digit number)
37426775246159590529…08491017014791034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.485 × 10¹⁰²(103-digit number)
74853550492319181059…16982034029582069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.497 × 10¹⁰³(104-digit number)
14970710098463836211…33964068059164139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.994 × 10¹⁰³(104-digit number)
29941420196927672423…67928136118328279039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.988 × 10¹⁰³(104-digit number)
59882840393855344847…35856272236656558079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.197 × 10¹⁰⁴(105-digit number)
11976568078771068969…71712544473313116159
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,787,765 XPM·at block #6,817,961 · 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