Block #336,919

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2013, 7:37:01 AM · Difficulty 10.1387 · 6,478,030 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b45f3794339c267febc3e0914ab678533d0957254683ac7bf5b296286906aa24

Height

#336,919

Difficulty

10.138666

Transactions

4

Size

875 B

Version

2

Bits

0a237fa3

Nonce

160,090

Timestamp

12/31/2013, 7:37:01 AM

Confirmations

6,478,030

Merkle Root

75f2fd2e62c438011ab0413287e942aecce56579a55247a8f0bd553fa2ef75c5
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.

8.165 × 10⁹²(93-digit number)
81659704227942552464…73762519959988484319
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
8.165 × 10⁹²(93-digit number)
81659704227942552464…73762519959988484319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.633 × 10⁹³(94-digit number)
16331940845588510492…47525039919976968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.266 × 10⁹³(94-digit number)
32663881691177020985…95050079839953937279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.532 × 10⁹³(94-digit number)
65327763382354041971…90100159679907874559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.306 × 10⁹⁴(95-digit number)
13065552676470808394…80200319359815749119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.613 × 10⁹⁴(95-digit number)
26131105352941616788…60400638719631498239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.226 × 10⁹⁴(95-digit number)
52262210705883233576…20801277439262996479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.045 × 10⁹⁵(96-digit number)
10452442141176646715…41602554878525992959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.090 × 10⁹⁵(96-digit number)
20904884282353293430…83205109757051985919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.180 × 10⁹⁵(96-digit number)
41809768564706586861…66410219514103971839
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,763,689 XPM·at block #6,814,948 · 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