Block #331,060

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 2:57:24 AM · Difficulty 10.1661 · 6,478,042 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
26bc76dfafbbf63d8faccf8a4d325a34a8469906e6108bdd906599e086ecf853

Height

#331,060

Difficulty

10.166146

Transactions

11

Size

4.09 KB

Version

2

Bits

0a2a888a

Nonce

42,331

Timestamp

12/27/2013, 2:57:24 AM

Confirmations

6,478,042

Merkle Root

68f6a0671770e679c051acd7ecfca9cb28af3aae47cf5711683627f187a37487
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.367 × 10¹⁰⁰(101-digit number)
23678850477110883094…35555247982564805119
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.367 × 10¹⁰⁰(101-digit number)
23678850477110883094…35555247982564805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.735 × 10¹⁰⁰(101-digit number)
47357700954221766189…71110495965129610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.471 × 10¹⁰⁰(101-digit number)
94715401908443532379…42220991930259220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.894 × 10¹⁰¹(102-digit number)
18943080381688706475…84441983860518440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.788 × 10¹⁰¹(102-digit number)
37886160763377412951…68883967721036881919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.577 × 10¹⁰¹(102-digit number)
75772321526754825903…37767935442073763839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.515 × 10¹⁰²(103-digit number)
15154464305350965180…75535870884147527679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.030 × 10¹⁰²(103-digit number)
30308928610701930361…51071741768295055359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.061 × 10¹⁰²(103-digit number)
60617857221403860722…02143483536590110719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.212 × 10¹⁰³(104-digit number)
12123571444280772144…04286967073180221439
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,716,871 XPM·at block #6,809,101 · 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.

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