Block #1,040,433

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2015, 2:34:42 PM · Difficulty 10.7292 · 5,768,945 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b6fad8d7099d04d73d6e697de11d29005f8adfe4f40f8ba66a565debecc6bf13

Height

#1,040,433

Difficulty

10.729191

Transactions

3

Size

3.10 KB

Version

2

Bits

0abaac48

Nonce

7,146,474

Timestamp

5/1/2015, 2:34:42 PM

Confirmations

5,768,945

Merkle Root

1c0f2ad046b23c0b30bcc8c2d9820eb5feb4d080c1cd6d828ef632dd01068eea
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.

1.294 × 10⁹⁵(96-digit number)
12947166630869774672…22442044047645578039
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
1.294 × 10⁹⁵(96-digit number)
12947166630869774672…22442044047645578039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.589 × 10⁹⁵(96-digit number)
25894333261739549345…44884088095291156079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.178 × 10⁹⁵(96-digit number)
51788666523479098691…89768176190582312159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.035 × 10⁹⁶(97-digit number)
10357733304695819738…79536352381164624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.071 × 10⁹⁶(97-digit number)
20715466609391639476…59072704762329248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.143 × 10⁹⁶(97-digit number)
41430933218783278953…18145409524658497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.286 × 10⁹⁶(97-digit number)
82861866437566557906…36290819049316994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.657 × 10⁹⁷(98-digit number)
16572373287513311581…72581638098633989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.314 × 10⁹⁷(98-digit number)
33144746575026623162…45163276197267978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.628 × 10⁹⁷(98-digit number)
66289493150053246325…90326552394535956479
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,719,094 XPM·at block #6,809,377 · 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