Block #267,321

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/21/2013, 4:44:37 AM · Difficulty 9.9591 · 6,557,989 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d98feb535d06f256d83abf3dd01c5d409b2d12c5ba2838ab6d21781a568c232

Height

#267,321

Difficulty

9.959125

Transactions

1

Size

1.78 KB

Version

2

Bits

09f58934

Nonce

23,341

Timestamp

11/21/2013, 4:44:37 AM

Confirmations

6,557,989

Merkle Root

5c0b6ecbbd01b0eeaee5e1104744591a8151d2107cc659abf0a2b0d6d4b2f49d
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.303 × 10⁹²(93-digit number)
23039178515867607472…54598483674646745601
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.303 × 10⁹²(93-digit number)
23039178515867607472…54598483674646745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.607 × 10⁹²(93-digit number)
46078357031735214945…09196967349293491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.215 × 10⁹²(93-digit number)
92156714063470429891…18393934698586982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.843 × 10⁹³(94-digit number)
18431342812694085978…36787869397173964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.686 × 10⁹³(94-digit number)
36862685625388171956…73575738794347929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.372 × 10⁹³(94-digit number)
73725371250776343913…47151477588695859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.474 × 10⁹⁴(95-digit number)
14745074250155268782…94302955177391718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.949 × 10⁹⁴(95-digit number)
29490148500310537565…88605910354783436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.898 × 10⁹⁴(95-digit number)
58980297000621075130…77211820709566873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.179 × 10⁹⁵(96-digit number)
11796059400124215026…54423641419133747201
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,846,583 XPM·at block #6,825,309 · 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