Block #272,478

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/25/2013, 6:54:16 AM · Difficulty 9.9529 · 6,540,403 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e6f9e898eb646fb800dfb732c76e087a1a75548b1b013aa1fa329e3cf72ed5b2

Height

#272,478

Difficulty

9.952947

Transactions

4

Size

911 B

Version

2

Bits

09f3f458

Nonce

53,110

Timestamp

11/25/2013, 6:54:16 AM

Confirmations

6,540,403

Merkle Root

a3b5bf903bf4e992e2c51695e272b403b4c2488430077adf409e90c2a639c48a
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.

6.048 × 10¹⁰²(103-digit number)
60482958660166600726…78053174743029036899
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
6.048 × 10¹⁰²(103-digit number)
60482958660166600726…78053174743029036899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.209 × 10¹⁰³(104-digit number)
12096591732033320145…56106349486058073799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.419 × 10¹⁰³(104-digit number)
24193183464066640290…12212698972116147599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.838 × 10¹⁰³(104-digit number)
48386366928133280581…24425397944232295199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.677 × 10¹⁰³(104-digit number)
96772733856266561162…48850795888464590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.935 × 10¹⁰⁴(105-digit number)
19354546771253312232…97701591776929180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.870 × 10¹⁰⁴(105-digit number)
38709093542506624465…95403183553858361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.741 × 10¹⁰⁴(105-digit number)
77418187085013248930…90806367107716723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.548 × 10¹⁰⁵(106-digit number)
15483637417002649786…81612734215433446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.096 × 10¹⁰⁵(106-digit number)
30967274834005299572…63225468430866892799
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,747,079 XPM·at block #6,812,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