Block #337,755

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2013, 10:21:44 PM · Difficulty 10.1307 · 6,472,133 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d7c0977a64971c84e6bd49f6db312156e9888b140c18c157fa8320a1b8547bc9

Height

#337,755

Difficulty

10.130725

Transactions

9

Size

2.05 KB

Version

2

Bits

0a21772c

Nonce

673,147

Timestamp

12/31/2013, 10:21:44 PM

Confirmations

6,472,133

Merkle Root

48ce2a7f5a9d7e21a97692a7a75d84d69e26f1aaf4117bc6c316e8bce4e9a27f
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.929 × 10¹⁰²(103-digit number)
29299739984341488503…68164512525349818881
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.929 × 10¹⁰²(103-digit number)
29299739984341488503…68164512525349818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.859 × 10¹⁰²(103-digit number)
58599479968682977007…36329025050699637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.171 × 10¹⁰³(104-digit number)
11719895993736595401…72658050101399275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.343 × 10¹⁰³(104-digit number)
23439791987473190802…45316100202798551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.687 × 10¹⁰³(104-digit number)
46879583974946381605…90632200405597102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.375 × 10¹⁰³(104-digit number)
93759167949892763211…81264400811194204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.875 × 10¹⁰⁴(105-digit number)
18751833589978552642…62528801622388408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.750 × 10¹⁰⁴(105-digit number)
37503667179957105284…25057603244776816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.500 × 10¹⁰⁴(105-digit number)
75007334359914210569…50115206489553633281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.500 × 10¹⁰⁵(106-digit number)
15001466871982842113…00230412979107266561
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,723,192 XPM·at block #6,809,887 · 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