Block #353,901

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 5:24:17 AM · Difficulty 10.3348 · 6,456,237 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e23aa062264057775a2f58f9a93e75771680a892d094751bbc385314cb69096

Height

#353,901

Difficulty

10.334843

Transactions

28

Size

9.04 KB

Version

2

Bits

0a55b845

Nonce

50,854

Timestamp

1/11/2014, 5:24:17 AM

Confirmations

6,456,237

Merkle Root

0e7bc94a80d238473ad0cf3dbdf33a5f2dceb1e6dbd1cc884ed2a5372a3ea92a
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.

4.086 × 10⁹⁹(100-digit number)
40861479169670274087…29480238254524607201
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
4.086 × 10⁹⁹(100-digit number)
40861479169670274087…29480238254524607201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.172 × 10⁹⁹(100-digit number)
81722958339340548174…58960476509049214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.634 × 10¹⁰⁰(101-digit number)
16344591667868109634…17920953018098428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.268 × 10¹⁰⁰(101-digit number)
32689183335736219269…35841906036196857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.537 × 10¹⁰⁰(101-digit number)
65378366671472438539…71683812072393715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.307 × 10¹⁰¹(102-digit number)
13075673334294487707…43367624144787430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.615 × 10¹⁰¹(102-digit number)
26151346668588975415…86735248289574860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.230 × 10¹⁰¹(102-digit number)
52302693337177950831…73470496579149721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.046 × 10¹⁰²(103-digit number)
10460538667435590166…46940993158299443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.092 × 10¹⁰²(103-digit number)
20921077334871180332…93881986316598886401
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,725,172 XPM·at block #6,810,137 · 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