Block #283,259

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 4:23:07 PM · Difficulty 9.9808 · 6,526,622 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aa7067c48e7d88ae38c8eb4aa2c09c60dacddc9b64d887f6d8ecc0a7fe114b00

Height

#283,259

Difficulty

9.980767

Transactions

5

Size

2.42 KB

Version

2

Bits

09fb1389

Nonce

3,387

Timestamp

11/29/2013, 4:23:07 PM

Confirmations

6,526,622

Merkle Root

a75069e466be67e1e1035eb46d0abd717e83941a20e29f9138f8006a2c188d8d
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.725 × 10¹⁰²(103-digit number)
87255372651995124149…89214382225315448881
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.725 × 10¹⁰²(103-digit number)
87255372651995124149…89214382225315448881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.745 × 10¹⁰³(104-digit number)
17451074530399024829…78428764450630897761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.490 × 10¹⁰³(104-digit number)
34902149060798049659…56857528901261795521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.980 × 10¹⁰³(104-digit number)
69804298121596099319…13715057802523591041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.396 × 10¹⁰⁴(105-digit number)
13960859624319219863…27430115605047182081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.792 × 10¹⁰⁴(105-digit number)
27921719248638439727…54860231210094364161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.584 × 10¹⁰⁴(105-digit number)
55843438497276879455…09720462420188728321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.116 × 10¹⁰⁵(106-digit number)
11168687699455375891…19440924840377456641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.233 × 10¹⁰⁵(106-digit number)
22337375398910751782…38881849680754913281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.467 × 10¹⁰⁵(106-digit number)
44674750797821503564…77763699361509826561
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,134 XPM·at block #6,809,880 · 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