Block #96,820

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2013, 9:59:02 AM · Difficulty 9.2807 · 6,730,071 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c495910082dc2097eade16abbd7c5cd5bc022e801d228bc561cbfc85a8ad18c6

Height

#96,820

Difficulty

9.280714

Transactions

2

Size

5.04 KB

Version

2

Bits

0947dce0

Nonce

83,615

Timestamp

8/4/2013, 9:59:02 AM

Confirmations

6,730,071

Merkle Root

9562235859db2f3bf1169c7088c711221ea1f6252dce874874a7451158d0659c
Transactions (2)
1 in → 1 out11.6400 XPM109 B
43 in → 1 out500.0000 XPM4.84 KB
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.887 × 10¹¹²(113-digit number)
48872956278401642817…34296920691718133889
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.887 × 10¹¹²(113-digit number)
48872956278401642817…34296920691718133889
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.774 × 10¹¹²(113-digit number)
97745912556803285635…68593841383436267779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.954 × 10¹¹³(114-digit number)
19549182511360657127…37187682766872535559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.909 × 10¹¹³(114-digit number)
39098365022721314254…74375365533745071119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.819 × 10¹¹³(114-digit number)
78196730045442628508…48750731067490142239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.563 × 10¹¹⁴(115-digit number)
15639346009088525701…97501462134980284479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.127 × 10¹¹⁴(115-digit number)
31278692018177051403…95002924269960568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.255 × 10¹¹⁴(115-digit number)
62557384036354102806…90005848539921137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.251 × 10¹¹⁵(116-digit number)
12511476807270820561…80011697079842275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.502 × 10¹¹⁵(116-digit number)
25022953614541641122…60023394159684551679
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,859,294 XPM·at block #6,826,890 · 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