Block #112,269

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2013, 9:53:27 PM · Difficulty 9.7187 · 6,714,782 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f80a7e5441de7462eae8e2211538f2c97643e28ff51787cb8d8c46f3fd9556f4

Height

#112,269

Difficulty

9.718738

Transactions

3

Size

916 B

Version

2

Bits

09b7ff32

Nonce

60,471

Timestamp

8/11/2013, 9:53:27 PM

Confirmations

6,714,782

Merkle Root

ccf67a092001ca3885fe51463bfcf42e1fe74a2e9082948ca7cfcf6490d70baa
Transactions (3)
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.884 × 10¹⁰¹(102-digit number)
48844988518714246780…57984610195390275569
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.884 × 10¹⁰¹(102-digit number)
48844988518714246780…57984610195390275569
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.768 × 10¹⁰¹(102-digit number)
97689977037428493560…15969220390780551139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.953 × 10¹⁰²(103-digit number)
19537995407485698712…31938440781561102279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.907 × 10¹⁰²(103-digit number)
39075990814971397424…63876881563122204559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.815 × 10¹⁰²(103-digit number)
78151981629942794848…27753763126244409119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.563 × 10¹⁰³(104-digit number)
15630396325988558969…55507526252488818239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.126 × 10¹⁰³(104-digit number)
31260792651977117939…11015052504977636479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.252 × 10¹⁰³(104-digit number)
62521585303954235878…22030105009955272959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.250 × 10¹⁰⁴(105-digit number)
12504317060790847175…44060210019910545919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.500 × 10¹⁰⁴(105-digit number)
25008634121581694351…88120420039821091839
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,860,589 XPM·at block #6,827,050 · 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