Block #335,153

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2013, 12:10:20 AM · Difficulty 10.1582 · 6,475,278 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2cb34306a3ad6d1a8d27783df6e0183a293fe75918753ba5861a630d978f138e

Height

#335,153

Difficulty

10.158236

Transactions

5

Size

2.52 KB

Version

2

Bits

0a28822e

Nonce

97,750

Timestamp

12/30/2013, 12:10:20 AM

Confirmations

6,475,278

Merkle Root

6eea1c1ea9641b74c9ca99b2c1643f4c3a5adb423756cef8992d764381b74544
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.032 × 10⁹⁹(100-digit number)
10327338130848635849…60742682579104245761
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.032 × 10⁹⁹(100-digit number)
10327338130848635849…60742682579104245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.065 × 10⁹⁹(100-digit number)
20654676261697271699…21485365158208491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.130 × 10⁹⁹(100-digit number)
41309352523394543399…42970730316416983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.261 × 10⁹⁹(100-digit number)
82618705046789086799…85941460632833966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.652 × 10¹⁰⁰(101-digit number)
16523741009357817359…71882921265667932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.304 × 10¹⁰⁰(101-digit number)
33047482018715634719…43765842531335864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.609 × 10¹⁰⁰(101-digit number)
66094964037431269439…87531685062671728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.321 × 10¹⁰¹(102-digit number)
13218992807486253887…75063370125343457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.643 × 10¹⁰¹(102-digit number)
26437985614972507775…50126740250686914561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.287 × 10¹⁰¹(102-digit number)
52875971229945015551…00253480501373829121
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,727,531 XPM·at block #6,810,430 · 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