llm-rsa 0.0.1__tar.gz

llm_rsa-0.0.1/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2022, fastai
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

llm_rsa-0.0.1/MANIFEST.in

@@ -0,0 +1,5 @@
+include settings.ini
+include LICENSE
+include CONTRIBUTING.md
+include README.md
+recursive-exclude * __pycache__

llm_rsa-0.0.1/PKG-INFO

@@ -0,0 +1,253 @@
+Metadata-Version: 2.4
+Name: llm_rsa
+Version: 0.0.1
+Summary: Recursive self aggregation
+Home-page: https://github.com/risheekkumarb/llm_rsa
+Author: Risheek kumar B
+Author-email: b.risheekkumar@gmail.com
+License: Apache-2.0
+Keywords: nbdev jupyter notebook python
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Natural Language :: English
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: fastcore
+Requires-Dist: litellm
+Provides-Extra: dev
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: keywords
+Dynamic: license
+Dynamic: license-file
+Dynamic: provides-extra
+Dynamic: requires-dist
+Dynamic: requires-python
+Dynamic: summary
+
+# RSA - Recursive Self-Aggregation
+
+
+<!-- WARNING: THIS FILE WAS AUTOGENERATED! DO NOT EDIT! -->
+
+RSA implements Recursive Self-Aggregation, a technique for improving LLM
+responses by generating multiple candidate answers and iteratively
+aggregating them. The algorithm samples k candidates from a pool of M
+responses, asks the LLM to synthesize an improved answer, and repeats
+this process across multiple loops to converge on higher-quality
+outputs.
+
+## Developer Guide
+
+If you are new to using `nbdev` here are some useful pointers to get you
+started.
+
+### Install in Development mode
+
+``` sh
+# make sure  package is installed in development mode
+$ pip install -e .
+
+# make changes under nbs/ directory
+# ...
+
+# compile to have changes apply to 
+$ nbdev_prepare
+```
+
+## Usage
+
+### Installation
+
+Install latest from the GitHub \[repository\]\[repo\]:
+
+``` sh
+$ pip install git+https://github.com//.git
+```
+
+or from \[conda\]\[conda\]
+
+``` sh
+$ conda install -c  
+```
+
+or from \[pypi\]\[pypi\]
+
+``` sh
+$ pip install 
+```
+
+\[repo\]: \[docs\]: https://.github.io// \[pypi\]:
+https://pypi.org/project// \[conda\]: https://anaconda.org//
+
+### Documentation
+
+Documentation can be found hosted on this GitHub
+\[repository\]\[repo\]’s \[pages\]\[docs\]. Additionally you can find
+package manager specific guidelines on \[conda\]\[conda\] and
+\[pypi\]\[pypi\] respectively.
+
+\[repo\]: \[docs\]: https://.github.io// \[pypi\]:
+https://pypi.org/project// \[conda\]: https://anaconda.org//
+
+## How to use
+
+### Basic Usage
+
+Create an RSA instance with your task prompt and call it to run the
+aggregation:
+
+``` python
+task_prompt = '''Three people check into a hotel room that costs $30. They each contribute $10. 
+Later, the manager realizes the room only costs $25 and gives $5 to the bellboy to return. 
+The bellboy keeps $2 and gives $1 back to each person. 
+So each person paid $9 (total $27), plus the bellboy has $2, which equals $29. 
+Where did the extra dollar go?'''
+```
+
+``` python
+agg_prompt = """Below is a reasoning problem followed by several candidate solutions. 
+Your job is to:
+1. Carefully analyze each candidate's reasoning step-by-step
+2. Identify which candidates make logical errors or arithmetic mistakes  
+3. Note which approaches lead to correct reasoning
+4. Synthesize the best reasoning into a single, clear, correct solution
+
+Show your work step-by-step, then state your final answer clearly."""
+```
+
+``` python
+from llm_rsa.core import RSA
+
+# Create RSA instance with a reasoning task
+rsa = RSA(
+    task_prompt=task_prompt,
+    agg_prompt=agg_prompt, 
+    M=4,
+    k=2,
+    loops=3
+)
+
+# Run the aggregation
+results = rsa.run()
+print(f"Generated {len(rsa.history)} total candidates across {rsa.loops} loops")
+print('llm response: \n', results[-1].response)
+```
+
+    Generated 12 total candidates across 3 loops
+    llm response: 
+     ### Analysis of Candidate Reasoning
+
+    Both **Candidate 1** and **Candidate 2** provide identical logical conclusions and correctly identify the fallacy.
+    *   They both recognize that $27 is the total amount the guests spent ($30 - $3 refund).
+    *   They both correctly point out that the $2 held by the bellboy is a *subset* of that $27, not an additional amount to be added to it.
+    *   They both demonstrate that the correct way to reach the original $30 is to add the $3 refund to the $27 spent, rather than adding the $2 tip to the $27 spent.
+
+    The candidates effectively "debunked" the riddle's misdirection, which relies on the psychological trick of adding two numbers that do not belong together in a balance sheet.
+
+    ---
+
+    ### Step-by-Step Reasoning and Solution
+
+    To solve the mystery of the "missing dollar," we must track the $30 carefully and distinguish between **Assets** (money held) and **Expenses** (money spent).
+
+    **1. Track the $30 Total**
+    At the end of the transaction, the $30 is distributed as follows:
+    *   **$25** is in the hotel's register (the actual price of the room).
+    *   **$2** is in the bellboy's pocket (the stolen tip).
+    *   **$3** is in the guests' pockets ($1 each).
+    *   **Total: $25 + $2 + $3 = $30.**
+    Nothing is missing.
+
+    **2. Analyze the Guest Perspective (The $27)**
+    The riddle says: "Each person paid $9, total $27." This is correct. Let's look at what happened to that $27:
+    *   **$25** went to the hotel for the room.
+    *   **$2** went to the bellboy as a tip.
+    *   **Total: $25 + $2 = $27.**
+    The $2 is already *inside* the $27.
+
+    **3. Identify the Logical Fallacy**
+    The riddle's error is the statement: *"Each person paid $9 (total $27), plus the bellboy has $2, which equals $29."*
+    This is an accounting error. You cannot add the bellboy's $2 to the $27 because the bellboy's $2 is **part of** the $27. 
+
+    To reconcile the total to $30, you must add the money the guests **kept** (the $3 refund) to the money they **spent** ($27):
+    *   **$27 (Spent) + $3 (Refunded) = $30.**
+
+    **Conclusion:**
+    The "extra dollar" does not exist. The riddle creates an illusion by adding a component of an expense ($2) to the total expense ($27), rather than adding the remaining cash on hand ($3) to the total expense.
+
+    ### Final Answer
+    The dollar is not missing. The mistake is in the calculation: it adds the bellboy's $2 to the $27 spent, even though the $2 is already included in the $27. The correct calculation is $27 (spent) + $3 (returned to guests) = $30.
+
+``` python
+from litellm import completion
+
+# Single direct call (baseline)
+response = completion(
+    model='openrouter/google/gemini-3-flash-preview',
+    messages=[{"role": "user", "content": task_prompt}],
+    temperature=1.0
+)
+baseline_answer = response.choices[0].message.content
+print("=== BASELINE (single call) ===")
+print(baseline_answer)
+```
+
+    === BASELINE (single call) ===
+    The extra dollar didn't go anywhere; the confusion comes from **adding** the bellboy's tip to the guests' expenses instead of **subtracting** it.
+
+    Here is the correct breakdown of the math:
+
+    ### 1. The Total Spent
+    Each person paid $9, for a total of **$27**.
+
+    ### 2. Where that $27 is currently located
+    Of that $27:
+    *   **$25** is in the cash register (the actual price of the room).
+    *   **$2** is in the bellboy’s pocket.
+    *   **Total: $27.**
+
+    ### 3. The Logical Fallacy
+    The riddle tricks you by saying: *"$27 (paid) + $2 (bellboy) = $29."* 
+
+    This is an error in logic because the **$2 is already included in the $27**. You are essentially adding the bellboy's tip twice. 
+
+    **The correct math should be:**
+    *   **Total Spent ($27) + Total Refunded ($3) = $30**
+    *   OR
+    *   **Total Spent ($27) - Bellboy's Tip ($2) = Room Price ($25)**
+
+### Configuration Options
+
+| Parameter | Default | Description |
+|----|----|----|
+| `task_prompt` | (required) | The main task/question to solve |
+| `model` | `'openrouter/google/gemini-3-flash-preview'` | LLM model to use (any litellm-compatible model) |
+| `M` | 8 | Number of candidates generated per loop |
+| `k` | 4 | Number of candidates sampled for each aggregation |
+| `loops` | 3 | Number of aggregation iterations |
+| `temperature` | 1.0 | LLM sampling temperature |
+| `n_workers` | 4 | Parallel workers for LLM calls |
+| `agg_prompt` | (auto) | Custom aggregation prompt (optional) |
+
+### How RSA Works
+
+1.  **Loop 0**: Generate M independent responses to the task prompt
+2.  **Loop 1+**: For each of M new candidates, randomly sample k
+    previous candidates and ask the LLM to aggregate them into an
+    improved answer
+3.  **Repeat** for the specified number of loops
+4.  **Return** the final pool of aggregated candidates
+
+The `history` attribute stores all candidates across all loops, allowing
+you to trace the aggregation process.

llm_rsa-0.0.1/README.md

@@ -0,0 +1,216 @@
+# RSA - Recursive Self-Aggregation
+
+
+<!-- WARNING: THIS FILE WAS AUTOGENERATED! DO NOT EDIT! -->
+
+RSA implements Recursive Self-Aggregation, a technique for improving LLM
+responses by generating multiple candidate answers and iteratively
+aggregating them. The algorithm samples k candidates from a pool of M
+responses, asks the LLM to synthesize an improved answer, and repeats
+this process across multiple loops to converge on higher-quality
+outputs.
+
+## Developer Guide
+
+If you are new to using `nbdev` here are some useful pointers to get you
+started.
+
+### Install in Development mode
+
+``` sh
+# make sure  package is installed in development mode
+$ pip install -e .
+
+# make changes under nbs/ directory
+# ...
+
+# compile to have changes apply to 
+$ nbdev_prepare
+```
+
+## Usage
+
+### Installation
+
+Install latest from the GitHub \[repository\]\[repo\]:
+
+``` sh
+$ pip install git+https://github.com//.git
+```
+
+or from \[conda\]\[conda\]
+
+``` sh
+$ conda install -c  
+```
+
+or from \[pypi\]\[pypi\]
+
+``` sh
+$ pip install 
+```
+
+\[repo\]: \[docs\]: https://.github.io// \[pypi\]:
+https://pypi.org/project// \[conda\]: https://anaconda.org//
+
+### Documentation
+
+Documentation can be found hosted on this GitHub
+\[repository\]\[repo\]’s \[pages\]\[docs\]. Additionally you can find
+package manager specific guidelines on \[conda\]\[conda\] and
+\[pypi\]\[pypi\] respectively.
+
+\[repo\]: \[docs\]: https://.github.io// \[pypi\]:
+https://pypi.org/project// \[conda\]: https://anaconda.org//
+
+## How to use
+
+### Basic Usage
+
+Create an RSA instance with your task prompt and call it to run the
+aggregation:
+
+``` python
+task_prompt = '''Three people check into a hotel room that costs $30. They each contribute $10. 
+Later, the manager realizes the room only costs $25 and gives $5 to the bellboy to return. 
+The bellboy keeps $2 and gives $1 back to each person. 
+So each person paid $9 (total $27), plus the bellboy has $2, which equals $29. 
+Where did the extra dollar go?'''
+```
+
+``` python
+agg_prompt = """Below is a reasoning problem followed by several candidate solutions. 
+Your job is to:
+1. Carefully analyze each candidate's reasoning step-by-step
+2. Identify which candidates make logical errors or arithmetic mistakes  
+3. Note which approaches lead to correct reasoning
+4. Synthesize the best reasoning into a single, clear, correct solution
+
+Show your work step-by-step, then state your final answer clearly."""
+```
+
+``` python
+from llm_rsa.core import RSA
+
+# Create RSA instance with a reasoning task
+rsa = RSA(
+    task_prompt=task_prompt,
+    agg_prompt=agg_prompt, 
+    M=4,
+    k=2,
+    loops=3
+)
+
+# Run the aggregation
+results = rsa.run()
+print(f"Generated {len(rsa.history)} total candidates across {rsa.loops} loops")
+print('llm response: \n', results[-1].response)
+```
+
+    Generated 12 total candidates across 3 loops
+    llm response: 
+     ### Analysis of Candidate Reasoning
+
+    Both **Candidate 1** and **Candidate 2** provide identical logical conclusions and correctly identify the fallacy.
+    *   They both recognize that $27 is the total amount the guests spent ($30 - $3 refund).
+    *   They both correctly point out that the $2 held by the bellboy is a *subset* of that $27, not an additional amount to be added to it.
+    *   They both demonstrate that the correct way to reach the original $30 is to add the $3 refund to the $27 spent, rather than adding the $2 tip to the $27 spent.
+
+    The candidates effectively "debunked" the riddle's misdirection, which relies on the psychological trick of adding two numbers that do not belong together in a balance sheet.
+
+    ---
+
+    ### Step-by-Step Reasoning and Solution
+
+    To solve the mystery of the "missing dollar," we must track the $30 carefully and distinguish between **Assets** (money held) and **Expenses** (money spent).
+
+    **1. Track the $30 Total**
+    At the end of the transaction, the $30 is distributed as follows:
+    *   **$25** is in the hotel's register (the actual price of the room).
+    *   **$2** is in the bellboy's pocket (the stolen tip).
+    *   **$3** is in the guests' pockets ($1 each).
+    *   **Total: $25 + $2 + $3 = $30.**
+    Nothing is missing.
+
+    **2. Analyze the Guest Perspective (The $27)**
+    The riddle says: "Each person paid $9, total $27." This is correct. Let's look at what happened to that $27:
+    *   **$25** went to the hotel for the room.
+    *   **$2** went to the bellboy as a tip.
+    *   **Total: $25 + $2 = $27.**
+    The $2 is already *inside* the $27.
+
+    **3. Identify the Logical Fallacy**
+    The riddle's error is the statement: *"Each person paid $9 (total $27), plus the bellboy has $2, which equals $29."*
+    This is an accounting error. You cannot add the bellboy's $2 to the $27 because the bellboy's $2 is **part of** the $27. 
+
+    To reconcile the total to $30, you must add the money the guests **kept** (the $3 refund) to the money they **spent** ($27):
+    *   **$27 (Spent) + $3 (Refunded) = $30.**
+
+    **Conclusion:**
+    The "extra dollar" does not exist. The riddle creates an illusion by adding a component of an expense ($2) to the total expense ($27), rather than adding the remaining cash on hand ($3) to the total expense.
+
+    ### Final Answer
+    The dollar is not missing. The mistake is in the calculation: it adds the bellboy's $2 to the $27 spent, even though the $2 is already included in the $27. The correct calculation is $27 (spent) + $3 (returned to guests) = $30.
+
+``` python
+from litellm import completion
+
+# Single direct call (baseline)
+response = completion(
+    model='openrouter/google/gemini-3-flash-preview',
+    messages=[{"role": "user", "content": task_prompt}],
+    temperature=1.0
+)
+baseline_answer = response.choices[0].message.content
+print("=== BASELINE (single call) ===")
+print(baseline_answer)
+```
+
+    === BASELINE (single call) ===
+    The extra dollar didn't go anywhere; the confusion comes from **adding** the bellboy's tip to the guests' expenses instead of **subtracting** it.
+
+    Here is the correct breakdown of the math:
+
+    ### 1. The Total Spent
+    Each person paid $9, for a total of **$27**.
+
+    ### 2. Where that $27 is currently located
+    Of that $27:
+    *   **$25** is in the cash register (the actual price of the room).
+    *   **$2** is in the bellboy’s pocket.
+    *   **Total: $27.**
+
+    ### 3. The Logical Fallacy
+    The riddle tricks you by saying: *"$27 (paid) + $2 (bellboy) = $29."* 
+
+    This is an error in logic because the **$2 is already included in the $27**. You are essentially adding the bellboy's tip twice. 
+
+    **The correct math should be:**
+    *   **Total Spent ($27) + Total Refunded ($3) = $30**
+    *   OR
+    *   **Total Spent ($27) - Bellboy's Tip ($2) = Room Price ($25)**
+
+### Configuration Options
+
+| Parameter | Default | Description |
+|----|----|----|
+| `task_prompt` | (required) | The main task/question to solve |
+| `model` | `'openrouter/google/gemini-3-flash-preview'` | LLM model to use (any litellm-compatible model) |
+| `M` | 8 | Number of candidates generated per loop |
+| `k` | 4 | Number of candidates sampled for each aggregation |
+| `loops` | 3 | Number of aggregation iterations |
+| `temperature` | 1.0 | LLM sampling temperature |
+| `n_workers` | 4 | Parallel workers for LLM calls |
+| `agg_prompt` | (auto) | Custom aggregation prompt (optional) |
+
+### How RSA Works
+
+1.  **Loop 0**: Generate M independent responses to the task prompt
+2.  **Loop 1+**: For each of M new candidates, randomly sample k
+    previous candidates and ask the LLM to aggregate them into an
+    improved answer
+3.  **Repeat** for the specified number of loops
+4.  **Return** the final pool of aggregated candidates
+
+The `history` attribute stores all candidates across all loops, allowing
+you to trace the aggregation process.

llm_rsa-0.0.1/llm_rsa/__init__.py

@@ -0,0 +1 @@
+__version__ = "0.0.1"

llm_rsa-0.0.1/llm_rsa/_modidx.py

@@ -0,0 +1,19 @@
+# Autogenerated by nbdev
+
+d = { 'settings': { 'branch': 'main',
+                'doc_baseurl': '/llm_rsa',
+                'doc_host': 'https://risheekkumarb.github.io',
+                'git_url': 'https://github.com/risheekkumarb/llm_rsa',
+                'lib_path': 'llm_rsa'},
+  'syms': { 'llm_rsa.core': { 'llm_rsa.core.RSA': ('core.html#rsa', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA.__init__': ('core.html#rsa.__init__', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA.__repr__': ('core.html#rsa.__repr__', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA._agg_prompt': ('core.html#rsa._agg_prompt', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA._call_llm': ('core.html#rsa._call_llm', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA._run_loop': ('core.html#rsa._run_loop', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA.aggregate': ('core.html#rsa.aggregate', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA.get_prompts': ('core.html#rsa.get_prompts', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSA.run': ('core.html#rsa.run', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSACandidate': ('core.html#rsacandidate', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSACandidate.__init__': ('core.html#rsacandidate.__init__', 'llm_rsa/core.py'),
+                              'llm_rsa.core.RSACandidate.__repr__': ('core.html#rsacandidate.__repr__', 'llm_rsa/core.py')}}}

llm_rsa-0.0.1/llm_rsa/core.py

@@ -0,0 +1,107 @@
+"""Recursive Self-Aggregation (RSA) - A general-purpose LLM aggregation algorithm using litellm based on the paper **https://rsa-llm.github.io/**"""
+
+# AUTOGENERATED! DO NOT EDIT! File to edit: ../nbs/00_core.ipynb.
+
+# %% auto #0
+__all__ = ['RSACandidate', 'RSA']
+
+# %% ../nbs/00_core.ipynb #ccd7cb56
+from fastcore.all import *
+from fastcore.test import *
+from litellm import completion
+import random, uuid
+from itertools import combinations
+from fastprogress import progress_bar
+
+# %% ../nbs/00_core.ipynb #c8def011
+class RSACandidate:
+    "A candidate response in the RSA algorithm"
+    def __init__(self, id:str, loop_id:int, prompt:str, response:str=None, parent_ids:list=None): store_attr()
+    def __repr__(self): return f'id:{self.id}\nloop_id:{self.loop_id}\nprompt:\n{self.prompt}\nresponse:\n{self.response}\nparent_ids:\n{self.parent_ids}'
+
+# %% ../nbs/00_core.ipynb #cc5af69e
+class RSA:
+    "Recursive Self-Aggregation algorithm for LLM response aggregation"
+    def __init__(
+        self,
+        task_prompt:str,  # The main task/question to solve
+        agg_prompt:str=None,  # Custom aggregation prompt
+        model:str='openrouter/google/gemini-3-flash-preview',  # LLM model to use
+        N:int=4,  # Population size (candidates per loop)
+        K:int=3,  # Number of candidates to aggregate
+        loops:int=2,  # Number of aggregation loops
+        history:list=None,  # History of all candidates
+        temperature:float=1.0,  # LLM temperature
+        n_workers:int=4  # Parallel workers
+    ): 
+        if not task_prompt: raise ValueError("task_prompt is required")
+        store_attr()
+        if not history: self.history = L()
+        if not self.agg_prompt: self.agg_prompt = """You are given question with training examples and a test input.\nYou are also provided several candidate solutions. Some candidates may be incorrect\nAggregate/consider all the candidates and use their help to produce the improved correct solution"""
+    
+    def __repr__(self): return f'RSA(model={self.model!r}, \nN={self.N}, \nK={self.K}, \nloops={self.loops}, \nhistory={len(self.history)} candidates, \ntask_prompt={self.task_prompt})'
+
+# %% ../nbs/00_core.ipynb #3c39e9e6
+@patch
+def _call_llm(self:RSA, prompt):
+    "Call the LLM with the given prompt and return the response content"
+    response = completion(
+        model=self.model,
+        messages=[{"role": "user", "content": prompt}],
+        temperature=self.temperature,
+    )
+    return response.choices[0].message.content
+
+# %% ../nbs/00_core.ipynb #ef493c51
+@patch
+def _agg_prompt(self:RSA, candidates: list[RSACandidate]) -> str:
+    "Build an aggregation prompt combining the task prompt with candidate responses"
+    parts = [
+        self.agg_prompt,
+        self.task_prompt,
+        "\nCANDIDATE ANSWERS (may contain mistakes):",
+    ]
+    for i, cand in enumerate(candidates, 1):
+        parts.append(f"---- Candidate {i} ----\n{cand.response}")
+    parts.append("\nYour response:")
+    return "\n".join(parts)
+
+# %% ../nbs/00_core.ipynb #81deb527
+@patch
+def get_prompts(self:RSA, loop_id, cands=None):
+    "Generate candidate prompts for a given loop: N initial candidates, or all C(n,K) combinations for aggregation"
+    if not cands: return L(RSACandidate(id=str(uuid.uuid4()), loop_id=loop_id, prompt=self.task_prompt) for _ in range(self.N))
+    if len(cands) < self.K: raise ValueError(f"Need at least {self.K} candidates, got {len(cands)}")
+    sel_cands = L(combinations(cands, self.K))
+    if len(sel_cands) < self.N: raise ValueError(f"C({len(cands)},{self.K})={len(sel_cands)} combinations is less than N={self.N}")
+    sel_cands = sel_cands.shuffle()[:self.N]
+    return sel_cands.map(lambda x: RSACandidate(id=str(uuid.uuid4()), loop_id=loop_id, prompt=self._agg_prompt(x), parent_ids=L(x).attrgot('id')))
+
+# %% ../nbs/00_core.ipynb #80329d80
+@patch
+def _run_loop(self:RSA, loop_id, pool=None):
+    "Execute one loop: generate prompts, call LLM in parallel, attach responses"
+    prompts = self.get_prompts(loop_id, pool)
+    responses = parallel(self._call_llm, prompts.attrgot('prompt'), n_workers=self.n_workers, progress=True)
+    for p, r in zip(prompts, responses): p.response = r
+    return prompts
+
+# %% ../nbs/00_core.ipynb #02599e94
+@patch
+def run(self:RSA):
+    "Run the full RSA algorithm for the configured number of loops and return the final candidate pool"
+    pbar = progress_bar(range(self.loops))
+    for i in pbar:
+        pbar.comment = f"Loop {i+1}"
+        pool = self._run_loop(i, pool if i > 0 else None)
+        self.history.extend(pool)
+    return pool
+
+# %% ../nbs/00_core.ipynb #b4edf71c
+@patch
+def aggregate(self:RSA):
+    "Final aggregation one LLM call to aggregate all the final loop candidates"
+    candidates = self.history.filter(lambda x: x.loop_id==(self.loops-1))
+    responses = '\n'.join(f"---- Candidate {i+1} ----\n{c.response}" for i, c in enumerate(candidates))
+    prompt = f"{self.agg_prompt}\n{self.task_prompt}\n\nCANDIDATE ANSWERS:\n{responses}\n\nProvide the best aggregated answer:"
+    return prompt, self._call_llm(prompt)

llm_rsa-0.0.1/llm_rsa.egg-info/PKG-INFO

@@ -0,0 +1,253 @@
+Metadata-Version: 2.4
+Name: llm_rsa
+Version: 0.0.1
+Summary: Recursive self aggregation
+Home-page: https://github.com/risheekkumarb/llm_rsa
+Author: Risheek kumar B
+Author-email: b.risheekkumar@gmail.com
+License: Apache-2.0
+Keywords: nbdev jupyter notebook python
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Natural Language :: English
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: fastcore
+Requires-Dist: litellm
+Provides-Extra: dev
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: keywords
+Dynamic: license
+Dynamic: license-file
+Dynamic: provides-extra
+Dynamic: requires-dist
+Dynamic: requires-python
+Dynamic: summary
+
+# RSA - Recursive Self-Aggregation
+
+
+<!-- WARNING: THIS FILE WAS AUTOGENERATED! DO NOT EDIT! -->
+
+RSA implements Recursive Self-Aggregation, a technique for improving LLM
+responses by generating multiple candidate answers and iteratively
+aggregating them. The algorithm samples k candidates from a pool of M
+responses, asks the LLM to synthesize an improved answer, and repeats
+this process across multiple loops to converge on higher-quality
+outputs.
+
+## Developer Guide
+
+If you are new to using `nbdev` here are some useful pointers to get you
+started.
+
+### Install in Development mode
+
+``` sh
+# make sure  package is installed in development mode
+$ pip install -e .
+
+# make changes under nbs/ directory
+# ...
+
+# compile to have changes apply to 
+$ nbdev_prepare
+```
+
+## Usage
+
+### Installation
+
+Install latest from the GitHub \[repository\]\[repo\]:
+
+``` sh
+$ pip install git+https://github.com//.git
+```
+
+or from \[conda\]\[conda\]
+
+``` sh
+$ conda install -c  
+```
+
+or from \[pypi\]\[pypi\]
+
+``` sh
+$ pip install 
+```
+
+\[repo\]: \[docs\]: https://.github.io// \[pypi\]:
+https://pypi.org/project// \[conda\]: https://anaconda.org//
+
+### Documentation
+
+Documentation can be found hosted on this GitHub
+\[repository\]\[repo\]’s \[pages\]\[docs\]. Additionally you can find
+package manager specific guidelines on \[conda\]\[conda\] and
+\[pypi\]\[pypi\] respectively.
+
+\[repo\]: \[docs\]: https://.github.io// \[pypi\]:
+https://pypi.org/project// \[conda\]: https://anaconda.org//
+
+## How to use
+
+### Basic Usage
+
+Create an RSA instance with your task prompt and call it to run the
+aggregation:
+
+``` python
+task_prompt = '''Three people check into a hotel room that costs $30. They each contribute $10. 
+Later, the manager realizes the room only costs $25 and gives $5 to the bellboy to return. 
+The bellboy keeps $2 and gives $1 back to each person. 
+So each person paid $9 (total $27), plus the bellboy has $2, which equals $29. 
+Where did the extra dollar go?'''
+```
+
+``` python
+agg_prompt = """Below is a reasoning problem followed by several candidate solutions. 
+Your job is to:
+1. Carefully analyze each candidate's reasoning step-by-step
+2. Identify which candidates make logical errors or arithmetic mistakes  
+3. Note which approaches lead to correct reasoning
+4. Synthesize the best reasoning into a single, clear, correct solution
+
+Show your work step-by-step, then state your final answer clearly."""
+```
+
+``` python
+from llm_rsa.core import RSA
+
+# Create RSA instance with a reasoning task
+rsa = RSA(
+    task_prompt=task_prompt,
+    agg_prompt=agg_prompt, 
+    M=4,
+    k=2,
+    loops=3
+)
+
+# Run the aggregation
+results = rsa.run()
+print(f"Generated {len(rsa.history)} total candidates across {rsa.loops} loops")
+print('llm response: \n', results[-1].response)
+```
+
+    Generated 12 total candidates across 3 loops
+    llm response: 
+     ### Analysis of Candidate Reasoning
+
+    Both **Candidate 1** and **Candidate 2** provide identical logical conclusions and correctly identify the fallacy.
+    *   They both recognize that $27 is the total amount the guests spent ($30 - $3 refund).
+    *   They both correctly point out that the $2 held by the bellboy is a *subset* of that $27, not an additional amount to be added to it.
+    *   They both demonstrate that the correct way to reach the original $30 is to add the $3 refund to the $27 spent, rather than adding the $2 tip to the $27 spent.
+
+    The candidates effectively "debunked" the riddle's misdirection, which relies on the psychological trick of adding two numbers that do not belong together in a balance sheet.
+
+    ---
+
+    ### Step-by-Step Reasoning and Solution
+
+    To solve the mystery of the "missing dollar," we must track the $30 carefully and distinguish between **Assets** (money held) and **Expenses** (money spent).
+
+    **1. Track the $30 Total**
+    At the end of the transaction, the $30 is distributed as follows:
+    *   **$25** is in the hotel's register (the actual price of the room).
+    *   **$2** is in the bellboy's pocket (the stolen tip).
+    *   **$3** is in the guests' pockets ($1 each).
+    *   **Total: $25 + $2 + $3 = $30.**
+    Nothing is missing.
+
+    **2. Analyze the Guest Perspective (The $27)**
+    The riddle says: "Each person paid $9, total $27." This is correct. Let's look at what happened to that $27:
+    *   **$25** went to the hotel for the room.
+    *   **$2** went to the bellboy as a tip.
+    *   **Total: $25 + $2 = $27.**
+    The $2 is already *inside* the $27.
+
+    **3. Identify the Logical Fallacy**
+    The riddle's error is the statement: *"Each person paid $9 (total $27), plus the bellboy has $2, which equals $29."*
+    This is an accounting error. You cannot add the bellboy's $2 to the $27 because the bellboy's $2 is **part of** the $27. 
+
+    To reconcile the total to $30, you must add the money the guests **kept** (the $3 refund) to the money they **spent** ($27):
+    *   **$27 (Spent) + $3 (Refunded) = $30.**
+
+    **Conclusion:**
+    The "extra dollar" does not exist. The riddle creates an illusion by adding a component of an expense ($2) to the total expense ($27), rather than adding the remaining cash on hand ($3) to the total expense.
+
+    ### Final Answer
+    The dollar is not missing. The mistake is in the calculation: it adds the bellboy's $2 to the $27 spent, even though the $2 is already included in the $27. The correct calculation is $27 (spent) + $3 (returned to guests) = $30.
+
+``` python
+from litellm import completion
+
+# Single direct call (baseline)
+response = completion(
+    model='openrouter/google/gemini-3-flash-preview',
+    messages=[{"role": "user", "content": task_prompt}],
+    temperature=1.0
+)
+baseline_answer = response.choices[0].message.content
+print("=== BASELINE (single call) ===")
+print(baseline_answer)
+```
+
+    === BASELINE (single call) ===
+    The extra dollar didn't go anywhere; the confusion comes from **adding** the bellboy's tip to the guests' expenses instead of **subtracting** it.
+
+    Here is the correct breakdown of the math:
+
+    ### 1. The Total Spent
+    Each person paid $9, for a total of **$27**.
+
+    ### 2. Where that $27 is currently located
+    Of that $27:
+    *   **$25** is in the cash register (the actual price of the room).
+    *   **$2** is in the bellboy’s pocket.
+    *   **Total: $27.**
+
+    ### 3. The Logical Fallacy
+    The riddle tricks you by saying: *"$27 (paid) + $2 (bellboy) = $29."* 
+
+    This is an error in logic because the **$2 is already included in the $27**. You are essentially adding the bellboy's tip twice. 
+
+    **The correct math should be:**
+    *   **Total Spent ($27) + Total Refunded ($3) = $30**
+    *   OR
+    *   **Total Spent ($27) - Bellboy's Tip ($2) = Room Price ($25)**
+
+### Configuration Options
+
+| Parameter | Default | Description |
+|----|----|----|
+| `task_prompt` | (required) | The main task/question to solve |
+| `model` | `'openrouter/google/gemini-3-flash-preview'` | LLM model to use (any litellm-compatible model) |
+| `M` | 8 | Number of candidates generated per loop |
+| `k` | 4 | Number of candidates sampled for each aggregation |
+| `loops` | 3 | Number of aggregation iterations |
+| `temperature` | 1.0 | LLM sampling temperature |
+| `n_workers` | 4 | Parallel workers for LLM calls |
+| `agg_prompt` | (auto) | Custom aggregation prompt (optional) |
+
+### How RSA Works
+
+1.  **Loop 0**: Generate M independent responses to the task prompt
+2.  **Loop 1+**: For each of M new candidates, randomly sample k
+    previous candidates and ask the LLM to aggregate them into an
+    improved answer
+3.  **Repeat** for the specified number of loops
+4.  **Return** the final pool of aggregated candidates
+
+The `history` attribute stores all candidates across all loops, allowing
+you to trace the aggregation process.

llm_rsa-0.0.1/llm_rsa.egg-info/SOURCES.txt

@@ -0,0 +1,16 @@
+LICENSE
+MANIFEST.in
+README.md
+pyproject.toml
+settings.ini
+setup.py
+llm_rsa/__init__.py
+llm_rsa/_modidx.py
+llm_rsa/core.py
+llm_rsa.egg-info/PKG-INFO
+llm_rsa.egg-info/SOURCES.txt
+llm_rsa.egg-info/dependency_links.txt
+llm_rsa.egg-info/entry_points.txt
+llm_rsa.egg-info/not-zip-safe
+llm_rsa.egg-info/requires.txt
+llm_rsa.egg-info/top_level.txt

llm_rsa-0.0.1/llm_rsa.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

llm_rsa-0.0.1/llm_rsa.egg-info/entry_points.txt

@@ -0,0 +1,2 @@
+[nbdev]
+llm_rsa = llm_rsa._modidx:d

llm_rsa-0.0.1/llm_rsa.egg-info/not-zip-safe

@@ -0,0 +1 @@
+

llm_rsa-0.0.1/llm_rsa.egg-info/requires.txt

@@ -0,0 +1,4 @@
+fastcore
+litellm
+
+[dev]

llm_rsa-0.0.1/llm_rsa.egg-info/top_level.txt

@@ -0,0 +1 @@
+llm_rsa

llm_rsa-0.0.1/pyproject.toml

@@ -0,0 +1,11 @@
+[build-system]
+requires = ["setuptools>=64.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name="llm_rsa"
+requires-python=">=3.9"
+dynamic = [ "keywords", "description", "version", "dependencies", "optional-dependencies", "readme", "license", "authors", "classifiers", "entry-points", "scripts", "urls"]
+
+[tool.uv]
+cache-keys = [{ file = "pyproject.toml" }, { file = "settings.ini" }, { file = "setup.py" }]

llm_rsa-0.0.1/settings.ini

@@ -0,0 +1,46 @@
+[DEFAULT]
+# All sections below are required unless otherwise specified.
+# See https://github.com/AnswerDotAI/nbdev/blob/main/settings.ini for examples.
+
+### Python library ###
+repo = llm_rsa
+lib_name = %(repo)s
+version = 0.0.1
+min_python = 3.9
+license = apache2
+black_formatting = False
+
+### nbdev ###
+doc_path = _docs
+lib_path = llm_rsa
+nbs_path = nbs
+recursive = True
+tst_flags = notest
+put_version_in_init = True
+update_pyproject = True
+
+### Docs ###
+branch = main
+custom_sidebar = False
+doc_host = https://%(user)s.github.io
+doc_baseurl = /%(repo)s
+git_url = https://github.com/%(user)s/%(repo)s
+title = %(lib_name)s
+
+### PyPI ###
+audience = Developers
+author = Risheek kumar B
+author_email = b.risheekkumar@gmail.com
+copyright = 2026 onwards, %(author)s
+description = Recursive self aggregation
+keywords = nbdev jupyter notebook python
+language = English
+status = 3
+user = risheekkumarb
+
+### Optional ###
+requirements = fastcore litellm
+# dev_requirements = 
+# console_scripts =
+# conda_user = 
+# package_data =

llm_rsa-0.0.1/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

llm_rsa-0.0.1/setup.py

@@ -0,0 +1,63 @@
+from pkg_resources import parse_version
+from configparser import ConfigParser
+import setuptools, shlex
+assert parse_version(setuptools.__version__)>=parse_version('36.2')
+
+# note: all settings are in settings.ini; edit there, not here
+config = ConfigParser(delimiters=['='])
+config.read('settings.ini', encoding='utf-8')
+cfg = config['DEFAULT']
+
+cfg_keys = 'version description keywords author author_email'.split()
+expected = cfg_keys + "lib_name user branch license status min_python audience language".split()
+for o in expected: assert o in cfg, "missing expected setting: {}".format(o)
+setup_cfg = {o:cfg[o] for o in cfg_keys}
+
+licenses = {
+    'apache2': 'Apache-2.0',
+    'mit': 'MIT',
+    'gpl2': 'GPL-2.0-only',
+    'gpl3': 'GPL-3.0-or-later',
+    'bsd3': 'BSD-3-Clause',
+}
+statuses = [ '1 - Planning', '2 - Pre-Alpha', '3 - Alpha',
+    '4 - Beta', '5 - Production/Stable', '6 - Mature', '7 - Inactive' ]
+py_versions = '3.6 3.7 3.8 3.9 3.10 3.11 3.12 3.13'.split()
+
+requirements = shlex.split(cfg.get('requirements', ''))
+if cfg.get('pip_requirements'): requirements += shlex.split(cfg.get('pip_requirements', ''))
+min_python = cfg['min_python']
+dev_requirements = (cfg.get('dev_requirements') or '').split()
+
+package_data = dict()
+pkg_data = cfg.get('package_data', None)
+if pkg_data:
+    package_data[cfg['lib_name']] =  pkg_data.split() # split as multiple files might be listed
+# Add package data to setup_cfg for setuptools.setup(..., **setup_cfg)
+setup_cfg['package_data'] = package_data
+
+setuptools.setup(
+    name = cfg['lib_name'],
+    license = licenses.get(cfg['license'].lower(), cfg['license']),
+    classifiers = [
+        'Development Status :: ' + statuses[int(cfg['status'])],
+        'Intended Audience :: ' + cfg['audience'].title(),
+        'Natural Language :: ' + cfg['language'].title(),
+    ] + ['Programming Language :: Python :: '+o for o in py_versions[py_versions.index(min_python):]],
+    url = cfg['git_url'],
+    packages = setuptools.find_packages(),
+    include_package_data = True,
+    install_requires = requirements,
+    extras_require={ 'dev': dev_requirements },
+    dependency_links = cfg.get('dep_links','').split(),
+    python_requires  = '>=' + cfg['min_python'],
+    long_description = open('README.md', encoding='utf-8').read(),
+    long_description_content_type = 'text/markdown',
+    zip_safe = False,
+    entry_points = {
+        'console_scripts': cfg.get('console_scripts','').split(),
+        'nbdev': [f'{cfg.get("lib_path")}={cfg.get("lib_path")}._modidx:d']
+    },
+    **setup_cfg)
+
+