SHOWING: First 60
"transaction as being a list of satoshis, and the outputs as a list of slots, "
"waiting to receive a satoshi. To assign input satoshis to slots, go through "
"each satoshi in the inputs in order, and assign each to the first available "
"slot in the outputs."
msgstr ""
"Les satoshis sont transférés selon le principe FIFO (First In, First Out). "
"Considérez les entrées d’une transaction comme une liste de satoshis, et les "
"sorties comme une liste d’emplacements, en attente de recevoir un satoshi. "
"Pour attribuer les satoshis des entrées aux emplacements disponibles, "
"parcourez-les dans l’ordre et attribuez chaque satoshi au premier "
"emplacement disponible dans les sorties."
#: src\faq.md:51
msgid ""
"Let's imagine a transaction with three inputs and two outputs. The inputs "
"are on the left of the arrow and the outputs are on the right, all labeled "
"with their values:"
msgstr ""
"Imaginons une transaction avec trois entrées et deux sorties. Les entrées "
"sont à gauche de la flèche et les sorties sont à droite, avec leurs valeurs "
#45,008,479text .index
.get_children_by_inscription_id(parent_inscription_id)
.unwrap(),
vec![child_inscription_id]
);
}
}
#[test]
fn inscriptions_in_same_input_with_pointers_to_same_output() {
for context in Context::configurations() {
context.mine_blocks(1);
let builder = script::Builder::new();
let builder = Inscription {
pointer: Some(100u64.to_le_bytes().to_vec()),
..Default::default()
}
.append_reveal_script_to_builder(builder);
let builder = Inscription {
pointer: Some(300_000u64.to_le_bytes().to_vec()),
..Default::default()
}
.append_reveal_script_to_builder(builder);
let builder = Inscription {
pointer: Some(1_000_000u64.to_le_bytes().to_vec()),
..Default::default()
}
.append_reveal_script_to_builder(builder);
let witness = Witness::from_slice(&[builder.into_bytes(), Vec::new()]);
let txid = context.rpc_server.broadcast_tx(TransactionTemplate {#45,007,996text"Bitcoin."
#: src\faq.md:295
msgid ""
"Unlike many other things in the altcoin space, digital artifacts have merit. "
"There are, of course, a great deal of NFTs that are ugly, stupid, and "
"fraudulent. However, there are many that are fantastically creative, and "
"creating and collecting art has been a part of the human story since its "
"inception, and predates even trade and money, which are also ancient "
"technologies."
msgstr ""
"Contrairement à beaucoup d’autres choses dans l’espace altcoin, les "
"artefacts numériques ont du mérite. Il est vrai que beaucoup de NFTs sont "
"laids, stupides et frauduleux. Cependant, il y en a aussi beaucoup qui se "
"distinguent par leur incroyable créativité. La création et la collection "
"d’œuvres d’art font partie de l’histoire de l’humanité depuis ses débuts, "
"précédant même le commerce et l’argent, qui sont également des technologies "
"anciennes."
#: src\faq.md:302
msgid ""
"Bitcoin provides an amazing platform for creating and collecting digital "
"artifacts in a secure, decentralized way, that protects users and artists in "
#45,007,883text"ng digital artifacts ay bihira at samakatuwid ay mahalaga."
#: src/faq.md:177
msgid ""
"Ethereum NFTs, on the other hand, can be minted in virtually unlimited "
"qualities with a single transaction, making them inherently less scarce, and "
"thus, potentially less valuable."
msgstr ""
"Ang mga Ethereum NFT, sa kabilang banda, ay maaaring ma-mint sa halos walang "
"limitasyong mga katangian sa isang transaksyon, na ginagawa itong likas na "
"hindi gaanong bihira, at samakatuwid ay potensyal na hindi gaanong mahalaga."
#: src/faq.md:181
msgid "_Inscriptions do not pretend to support on-chain royalties._"
msgstr ""
"_Hindi inaangkin ng inscriptions ang pag-suportahan sa mga on-chain royalty "
"ng blockchain._"
#: src/faq.md:183
msgid ""
"On-chain royalties are a good idea in theory but not in practice. Royalty "
"payment cannot be enforced on-chain without complex and invasive "
"restrictions. The Ethereum NFT ecosystem is currently grappling with "
"confusion around royalties, and is collectively coming to grips with the "#45,007,692text"maliliit na changes ay hindi tumatagal ng maraming oras, kaya kung kailangan "
"mong huminto sa paggawa sa isang maliit na changes, hindi ka magsasayang ng "
"maraming oras kumpara sa isang mas malaking changes. Ang mabilis pag-PR ay "
"nakakatulong na mapabuti ang proyekto kaagad, imbes na maghintay ng mahabang "
"panahon para sa mas malaking changes. Ang maliliit na changes ay mas "
"malamang na magdulot kakaunting conflict sa pagme-merge. Gaya ng sinabi ng "
"mga taga-Athenians: _The fast commit what they will, the slow merge what "
"they must._"
#: src/contributing.md:67
msgid "Get help"
msgstr "Humingi ng tulong"
#: src/contributing.md:70
msgid ""
"If you're stuck for more than 15 minutes, ask for help, like a Rust Discord, "
"Stack Exchange, or in a project issue or discussion."
msgstr ""
"Kung natigil ka nang higit sa 15 minuto, humingi ng tulong, halimbawa sa "
"Rust Discord, Stack Exchange, o sa project issue or discussion board."
#: src/contributing.md:73
msgid "Practice hypothesis-driven debugging"
#45,007,679text };
let unsigned_transaction = TransactionBuilder::new(
satpoint,
inscriptions,
unspent_outputs,
locked_outputs,
address.clone(),
change,
self.fee_rate,
postage,
)
.build_transaction()?;
let signed_tx = client
.sign_raw_transaction_with_wallet(&unsigned_transaction, None, None)?
.hex;
let txid = client.send_raw_transaction(&signed_tx)?;
Ok(Box::new(Output { transaction: txid }))
}
fn lock_inscriptions(
client: &Client,
inscriptions: BTreeMap<SatPoint, InscriptionId>,
unspent_outputs: BTreeMap<bitcoin::OutPoint, bitcoin::Amount>,
) -> Result {
let all_inscription_outputs = inscriptions
.keys()
.map(|satpoint| satpoint.outpoint)
.collect::<HashSet<OutPoint>>();
let wallet_inscription_outputs = unspent_outputs
.keys()
.filter(|utxo| all_inscription_outputs.contains(utxo))
.cloned()
.collect::<Vec<OutPoint>>();
if !client.lock_unspent(&wallet_inscription_outputs)? {#45,000,050textuse {super::*, crate::wallet::Wallet};
#[derive(Debug, Parser)]
pub(crate) struct Sats {
#[arg(
long,
help = "Find satoshis listed in first column of tab-separated value file <TSV>."
)]
tsv: Option<PathBuf>,
}
#[derive(Serialize, Deserialize)]
pub struct OutputTsv {
pub sat: String,
pub output: OutPoint,
}
#[derive(Serialize, Deserialize)]
pub struct OutputRare {
pub sat: Sat,
pub output: OutPoint,
pub offset: u64,
pub rarity: Rarity,
}
impl Sats {
pub(crate) fn run(&self, options: Options) -> SubcommandResult {
let index = Index::open(&options)?;
if !index.has_sat_index() {
bail!("sats requires index created with `--index-sats` flag");
}
index.update()?;
let utxos = index.get_unspent_output_ranges(Wallet::load(&options)?)?;
if let Some(path) = &self.tsv {
let mut output = Vec::new();
for (outpoint, sat) in sats_from_tsv(
utxos,
&fs::read_to_string(path)
.with_context(|| format!("I/O error reading `{}`", path.display()))?,#44,996,976text"quantité de nouveaux sats créés dans chaque bloc est réduite de moitié."
#: src\overview.md:72
msgid ""
"_Cycles_: Every six halvings, something magical happens: the halving and the "
"difficulty adjustment coincide. This is called a conjunction, and the time "
"period between conjunctions a cycle. A conjunction occurs roughly every 24 "
"years. The first conjunction should happen sometime in 2032."
msgstr ""
"_Cycles _: Tous les six halvings, un phénomène magique se produit: la "
"réduction de moitié et l’ajustement de la difficulté coïncident. C’est ce "
"qu’on appelle une conjonction, et la période de temps entre les conjonctions "
"représente un cycle. Une conjonction se produit environ tous les 24 ans. La "
"première conjonction devrait se produire en 2032."
#: src\overview.md:77
msgid "This gives us the following rarity levels:"
msgstr "Cela nous donne les niveaux de rareté suivants :"
#: src\overview.md:79
msgid "`common`: Any sat that is not the first sat of its block"
msgstr "`commun`: Tout sat qui n’est pas le premier sat de son bloc"
#44,991,151textchecksum = "bddcadddf5e9015d310179a59bb28c4d4b9920ad0f11e8e14dbadf654890c9a6"
[[package]]
name = "asn1-rs"
version = "0.3.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "30ff05a702273012438132f449575dbc804e27b2f3cbe3069aa237d26c98fa33"
dependencies = [
"asn1-rs-derive",
"asn1-rs-impl",
"displaydoc",
"nom",
"num-traits",
"rusticata-macros",
"thiserror",
"time",
]
[[package]]
name = "asn1-rs-derive"
version = "0.1.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "db8b7511298d5b7784b40b092d9e9dcd3a627a5707e4b5e507931ab0d44eeebf"
dependencies = [
"proc-macro2",
"quote",
"syn 1.0.109",
"synstructure",
]
[[package]]
name = "asn1-rs-impl"
version = "0.1.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "2777730b2039ac0f95f093556e61b6d26cebed5393ca6f152717777cec3a42ed"
dependencies = [
"proc-macro2",
"quote",
"syn 1.0.109",
]
[[package]]
name = "async-channel"
version = "2.1.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
#44,989,642textchecksum = "7b5fac59a5cb5dd637972e5fca70daf0523c9067fcdc4842f053dae04a18f8e9"
dependencies = [
"libc",
"windows-sys 0.48.0",
]
[[package]]
name = "spin"
version = "0.5.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "6e63cff320ae2c57904679ba7cb63280a3dc4613885beafb148ee7bf9aa9042d"
[[package]]
name = "spin"
version = "0.9.8"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "6980e8d7511241f8acf4aebddbb1ff938df5eebe98691418c4468d0b72a96a67"
[[package]]
name = "strsim"
version = "0.10.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "73473c0e59e6d5812c5dfe2a064a6444949f089e20eec9a2e5506596494e4623"
[[package]]
name = "strum"
version = "0.24.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "063e6045c0e62079840579a7e47a355ae92f60eb74daaf156fb1e84ba164e63f"
dependencies = [
"strum_macros",
]
[[package]]
name = "strum_macros"
version = "0.24.3"
source = "registry+https://github.com/rust-lang/crates.io-index"#44,982,837text