Block #336,771

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2013, 4:54:17 AM · Difficulty 10.1414 · 6,480,587 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
718289e93920aa3bd94f09829cf313ad0062fe93bde56c5bac3c5dfd759d0871

Height

#336,771

Difficulty

10.141350

Transactions

12

Size

27.89 KB

Version

2

Bits

0a242f84

Nonce

84,616

Timestamp

12/31/2013, 4:54:17 AM

Confirmations

6,480,587

Merkle Root

92e14999baf2d40de78d04f99d28ecd9594c2a68d18feda110dcef187f690ac0
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.

1.231 × 10¹⁰¹(102-digit number)
12318810338422329167…73626423070386708479
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
1.231 × 10¹⁰¹(102-digit number)
12318810338422329167…73626423070386708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.463 × 10¹⁰¹(102-digit number)
24637620676844658335…47252846140773416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.927 × 10¹⁰¹(102-digit number)
49275241353689316670…94505692281546833919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.855 × 10¹⁰¹(102-digit number)
98550482707378633341…89011384563093667839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.971 × 10¹⁰²(103-digit number)
19710096541475726668…78022769126187335679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.942 × 10¹⁰²(103-digit number)
39420193082951453336…56045538252374671359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.884 × 10¹⁰²(103-digit number)
78840386165902906672…12091076504749342719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.576 × 10¹⁰³(104-digit number)
15768077233180581334…24182153009498685439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.153 × 10¹⁰³(104-digit number)
31536154466361162669…48364306018997370879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.307 × 10¹⁰³(104-digit number)
63072308932722325338…96728612037994741759
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,782,912 XPM·at block #6,817,357 · 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